scispace - formally typeset
P

Pingping Zhu

Researcher at Cornell University

Publications -  39
Citations -  1304

Pingping Zhu is an academic researcher from Cornell University. The author has contributed to research in topics: Variable kernel density estimation & Optimal control. The author has an hindex of 15, co-authored 39 publications receiving 1072 citations. Previous affiliations of Pingping Zhu include Marshall University & University of Florida.

Papers
More filters
Journal ArticleDOI

Quantized Kernel Least Mean Square Algorithm

TL;DR: A quantized kernel least mean square (QKLMS) algorithm is developed, which is based on a simple online vector quantization method, and a lower and upper bound on the theoretical value of the steady-state excess mean square error is established.
Journal ArticleDOI

Quantized Kernel Recursive Least Squares Algorithm

TL;DR: By incorporating a simple online vector quantization method, a recursive algorithm is derived to update the solution, namely the quantized kernel recursive least squares algorithm.
Proceedings ArticleDOI

Deep learning feature extraction for target recognition and classification in underwater sonar images

TL;DR: This paper presents an automatic target recognition (ATR) approach for sonar onboard unmanned underwater vehicles (UUVs) that can be combined with onboard planning and control systems to develop autonomous UUVs able to search for underwater targets without human intervention.
Journal ArticleDOI

A Mobile Sensing Approach for Regional Surveillance of Fugitive Methane Emissions in Oil and Gas Production

TL;DR: An information-theoretic approach to plan the paths of the sensor-equipped vehicle, where the path is chosen so as to maximize expected reduction in integrated target source rate uncertainty in the region, subject to given starting and ending positions and prevailing meteorological conditions.
Journal ArticleDOI

Fixed budget quantized kernel least-mean-square algorithm

TL;DR: Experiments show that the proposed algorithm successfully prunes the least ''significant'' centers and preserves the important ones, resulting in a compact KLMS model with little loss in accuracy.