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

Ronald E. Boucher

dblp:04/10290 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1984
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorTheory of computation · 1

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.

Computer graphics and multimedia
2 papers
Image and video processing · 100%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian classification
bayes classifier
0.011982
Adaptive Detection and Removal of Non-Gaussian Spikes from Gaussian Data · IEEE Trans. Pattern Anal. Mach. Intell. 1982
Image and video processing
image restoration
0.011982
Adaptive Detection and Removal of Non-Gaussian Spikes from Gaussian Data · IEEE Trans. Pattern Anal. Mach. Intell. 1982
Image and video processing › spectral analysis
cepstral analysis
0.011976
A probabilistic analysis of time delay extraction by the cepstrum in stationary Gaussian noise · IEEE Trans. Inf. Theory 1976

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

unsupervised learning · 0.0MMSE linear filter · 0.0probabilistic analysis · 0.0
YearPublicationVenuePosition
1984 A quantitative comparison of generalized correlator window functions in presence of strong spectral peak for spatially separated sources
abstract
Simulation results are presented to compare the effectiveness of various windowing functions for the generalized correlator when a strong spectral peak or sinusoid is present. In this case, the time delay of the desired source and of the interfering sinusoid are allowed to be different. The results show that all windows except HBII and SCOT deteriorate markedly. These two windows remain robust to the ambiguity problems presented by the sinusoid, independent of whether the spectral peak is included in the signal spectrum or in the noise spectrum. Also, window HBII performs better than SCOT in terms of probability of correct detection, variance of time delay, and SNR threshold.
Ronald E. Boucher, Joseph C. Hassab
ICASSP1
1982 Adaptive Detection and Removal of Non-Gaussian Spikes from Gaussian Data
abstract
A nonlinear adaptive method is presented for filtering a signal which is corrupted by spikes which take discrete values Mi with probability Pi at random points in time. An unsupervised learning technique is used to estimate the unknown parameters Mi, Pi, and oi. The spikes are then removed using a Bayes classifier. A theoretical and experimental comparison with the MMSE linear filter is presented.
Ronald E. Boucher, Joseph P. Noonan
IEEE Trans. Pattern Anal. Mach. Intell.1
1979 A quantitative study of optimum and sub-optimum filters in the generalized correlator
abstract
Various optimum and sub-optimum filters have been added to the basic cross-correlator in order to enhance its time delay estimation capability in the presence of noise. These pre-detection filters include the Hannan-Thomson, the Eckart, the Smoothed Coherence Transform, some least-squares, and two optimum filters recently derived by the authors. Here, a quantitative comparison of all six filters has been conducted by extensive simulation for various input signal and noise ratio and signal and noise bandwidths. The results define the actual enhancement in time delay detection when using the optimum filters and the amount of performance degradation from the optimum for the other filters. The rank ordering of the filters is carried out. Histograms of the time delay estimates, their mean and variance are presented. Confirmation of analytical predictions is noted.
Joseph C. Hassab, Ronald E. Boucher
ICASSP2
1976 A probabilistic analysis of time delay extraction by the cepstrum in stationary Gaussian noise
abstract
Often, the cepstrum has been used when estimating the time delay r between elements of a composite signal embedded in noise,n(t). Here a probabilistic analysis is conducted dealing with the effect of stationary Gaussian noise on the characteristics of such a nonlinear processor. The input noise,n(t)is reflected at the cepstrum's output as: 1) modulationM_{1}(\omega)of sinusoidal information carrier with subsequent reduction in the height of echo peak at\tau; and 2) generation of background noises\hat{phi}(\omega)and\hat{psi}(\omega)with tendency to obscure that echo peak. The resulting probabilities of these terms are derived. The expected mean and standard deviation of reduction in the peak level at\taudue to noise are analytically described. Similar statistical measures on the background noise are also obtained. The results point out the dependence of the-statistical measures upon the pointwise variation of input signal to noise spectra. Thus the total signal power to total noise power(S/N)alone is an insufficient measure for setting the cepstrum performance, and relative bandwidths of signal and noise are also needed. The detection probabilityP_{D}of a peak corresponding to\tauis calculated for exponential spectra with equal bandwidths in signal and noise and with echo strengtha = 0.4; P_{D}is found to be close to one for anSINgreater than -4 dB; deterioration in detection is found to be rapid with thresholding near anS/N \sim -6db whereP_{D}falls to 0.3.
Joseph C. Hassab, Ronald E. Boucher
IEEE Trans. Inf. Theory2