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

Bruce A. Eisenstein

dblp:86/154 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
0since 2021 · last 1983
—ORCID · none

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

Human-computer interaction and ubiquitous computing · 3 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorTheory of computation · 2Systems, architecture and hardware · 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 networks
2 papers
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
signal detection
0.021983
Suboptimum detection of weak signals in non-Gaussian noise · IEEE Trans. Inf. Theory 1983
Detection of weak signals in non-Gaussian noise · IEEE Trans. Inf. Theory 1981
Physical-layer communications › signal detection
adaptive detection
0.011983
Suboptimum detection of weak signals in non-Gaussian noise · IEEE Trans. Inf. Theory 1983
Physical-layer communications › signal detection
matched filter
0.011981
Detection of weak signals in non-Gaussian noise · IEEE Trans. Inf. Theory 1981

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

robustness analysis · 0.0limiter detector · 0.0zero-memory nonlinearity · 0.0asymptotic performance analysis · 0.0
YearPublicationVenuePosition
1983 Suboptimum detection of weak signals in non-Gaussian noise
abstract
A suboptimum detector structure is developed for the detection of weak signals in non-Gaussian noise. In contrast to locally optimum detectors, the suboptimum detector structure is relatively easy to implement and is shown to perform well for a wide range of underlying noise distributions. The robustness of simple limiter detectors is discussed. The extension of the concept of a suboptimum detector to an adaptive detector for operating in an unknown noise environment is also discussed.
Ning Hsing Lu, Bruce A. Eisenstein
IEEE Trans. Inf. Theory2
1982 Feature Extraction by System Identification
abstract
A method for the extraction of features for pattern recognition by system identification is presented. A test waveform is associated with a parameterized process model (PM) which is an inverse filter. The structure of the PM corresponds to the redundant information in a waveform, and the parameter values correspond to the discriminatory information. The PM used in this research is a linear predictive system whose parameters are the linear predictive coefficients (LPC's). This technique is applied to feature extraction of electrocardiograms (ECG's) for differential diagnosis. The LPC's are calculated for each ECG and used as a feature vector in a hypergeometric affine N-space spanned by the LPC's. The efficacy of this feature extraction technique is tested by three different perturbation methods, namely noise, matrix distortion, and a newly developed method called directed distortion. Both the Euclidean and Itakura distances between feature vectors in N-space are shown in increase with increasing perturbation of the template waveform. The monotonic behavior of a distance measure is a necessary attribute of a valid feature space. Thus the perturbation analyses done in this research verify the viability of using the parameters of a process model as a feature vector in a pattern recognition scheme.
Bruce A. Eisenstein, Richard J. Vaccaro
IEEE Trans. Syst. Man Cybern.1
1981 Detection of weak signals in non-Gaussian noise
abstract
A locally optimum detector structure is derived for the detection of weak signals in non-Gaussian environments. Optimum performance is obtained by employing a zero-memory nonlinearity prior to the matched filter that would be optimum for detecting the signal were the noise Gaussian. The asymptotic detection performance of the locally optimum detector under non-Gaussian conditions is derived and compared with that for the corresponding detector optimized for operations in Gaussian noise. Numerical results for the asymptotic detection performance are shown for signal detection in noise environments of practical interest.
Ning Hsing Lu, Bruce A. Eisenstein
IEEE Trans. Inf. Theory2
1978 A Declustering Criterion for Feature Extraction in Pattern Recognition
abstract
A feature extraction technique based on a new criterion for "declustering" is presented. Declustering occurs when sample vectors from one pattern class form a densely packed point constellation, or cluster, in feature space while vectors from another class do not form a cluster but instead array themselves as outliers. Features chosen to optimize the declustering criterion enhance class separation and are robust over a wide range of measurement statistics.
John Fehlauer, Bruce A. Eisenstein
IEEE Trans. Computers2
1978 Structural Editing by a Point Density Function
abstract
A new algorithm is presented for pattern recognition by clustering. The algorithm is called structural editing by a point density function, or STEP. STEP uses a minimum spanning tree to retain the interpoint structure among the elements of an unclassified training set. The tree is pruned or edited to form clusters based on information provided by a point density function (PDF) estimate. STEP has the capability of detecting clusters of arbitrary shape in the presence of intercluster stray points or outliers. A cluster is not required to correspond to a unimodal PDF estimate. Monte Carlo simulations indicate that STEP performs as well as, or better than, a nearest neighbor classifier which requires a classified training set. A new algorithm for recursively constructing the minimum spanning tree is presented which is computationally simpler than conventional algorithms in many practical applications. Results from applying STEP to the mass screening of breast thermograms are discussed.
John Fehlauer, Bruce A. Eisenstein
IEEE Trans. Syst. Man Cybern.2
1976 Crossfrequency estimation for deconvolution
abstract
To reduce distortion, a technique is presented for deconvolving the effect of the distorting system on a desired signal. The technique does not require any prior assumptions about the distorting system other than that it is linear and time-invariant. However, we must assume that the desired signal is a sample function from a cyelostationary (CS) random process with known statistics. Many signals of practical importance can be modelled as CS including PAM, FSK, PWM, etc. The technique utilizes inverse filtering with an estimate of the distorting system function which is obtained exclusively from the observed signal and the known and computed properties of CS processes.
Bruce A. Eisenstein, Louis R. Cerrato
ICASSP1
1976 Signal processing for feature extraction and pattern recognition
abstract
A new feature extraction technique designed specifically for the mass screening problem is presented. It is based on the hypothesis that feature values from the normal class tend to form a cluster while those from the abnormal class fall outside this cluster, or decluster. While some feature extraction techniques attempt to retain the fidelity of the data from which the features arose, the new technique is designed to enhance the discrimination between the normal and abnormal classes. Results from applying the new algorithm to the mass screening of breast thermograms to detect breast cancer are discussed.
Bruce A. Eisenstein, John Fehlauer
ICASSP1
1976 Heuristic Estimation/Detection of Repetitive Signals
abstract
A heuristic technique is presented for detecting the presence of an unknown signal in noise and estimating its waveshape. The heuristic utilizes the most recent estimate of the waveshape as a template against which new observations are matched. If the match is "good," the observation is used to update the estimate, and the procedure is repeated. If the match is "poor," the observation is discarded. It is the decisions of the detector which direct the evolution of the estimate while simultaneously the current estimate directs the detector's performance. The mutual interactions of the estimator/detector are conducted without external supervision and without the benefit of training samples, and thus the system falls into the category of a self-learning decision directed adaptive system.
Bruce A. Eisenstein
IEEE Trans. Syst. Man Cybern.1