Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Prashant P. Gandhi

dblp:87/10899 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 1994
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Information theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › hypothesis testing
composite hypothesis testing
0.011994
Optimality of the cell averaging CFAR detector · IEEE Trans. Inf. Theory 1994
Information theory › hypothesis testing › robust detection
constant false alarm rate detection
0.011994
Optimality of the cell averaging CFAR detector · IEEE Trans. Inf. Theory 1994
Information theory
hypothesis testing
0.011994
Optimality of the cell averaging CFAR detector · IEEE Trans. Inf. Theory 1994

Methods — techniques the papers use, named apart from their topics

minimum variance unbiased estimation · 0.0least favorable distribution · 0.0
YearPublicationVenuePosition
1994 Optimality of the cell averaging CFAR detector
abstract
The cell averaging constant false alarm rate detector has been assumed to be optimal for detecting Swerling I targets embedded in exponential clutter and noise of unknown power. This is because the detector uses a minimum variance unbiased estimate (which is also a maximum likelihood estimate) of the unknown clutter-plus-noise power to set the threshold. The authors prove, using a result concerning least favorable distributions in composite hypotheses testing, that the cell averaging detector is indeed optimal in that it is a uniformly most powerful detector.>
Prashant P. Gandhi, Saleem A. Kassam
IEEE Trans. Inf. Theory1
1993 Neural detectors for signals in non-Gaussian noise
Viswanath Ramamurti, Sathyanarayan S. Rao, Prashant P. Gandhi
ICASSP (1)3
1992 Quantization of ordered data
abstract
The use of filters and detectors based on amplitude-ordered data has become quite popular in applications such as image and radar signal processing. However, current data quantization schemes do not take into account the amplitude-ordered data and therefore may not perform optimally. The problem of determining optimum quantizers for ordered data is considered. Two different design approaches are presented, and performance characteristics of quantizers obtained using the two approaches are given.>
Prashant P. Gandhi
ICASSP1
1988 Frequency selective signal restoration using nonlinear combination filters
abstract
For restoration of nonstationary signals in impulsive noise the combination or C-filter uses rank-order dependent coefficients in an FIR (finite-impulse response) filter structure. This allows frequency selectivity as well as edge-preservation and impulse rejection. The nonlinear C-filter design is facilitated by the use of an LMS (least-mean-squares) algorithm. This approach is explained and examples are given of C-filter performance for one- and two-dimensional signals.>
Prashant P. Gandhi, Steven R. Peterson, Saleem A. Kassam
ICASSP1