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

Nasser E. Nahi

dblp:31/3964 · DBLP profile ↗
← Back
6ranked-venue papers
6as first author
0since 2021 · last 1978
—ORCID · none

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

Theory of computation · 4 · 4 first-authorSystems, architecture and hardware · 1 · 1 first-authorComputer networks · 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.

Computer graphics and multimedia
2 papers
Image and video processing · 100%
Theoretical computer science
2 papers
Information theory · 100%
Artificial intelligence
1 paper
Learning theory · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing
image restoration
0.021977
Image Boundary Estimation · IEEE Trans. Computers 1977
Recursive Image Enhancement-Vector Processing · IEEE Trans. Commun. 1973
Image and video processing › image segmentation
contour detection
0.011977
Image Boundary Estimation · IEEE Trans. Computers 1977
Image and video processing
image enhancement
0.011973
Recursive Image Enhancement-Vector Processing · IEEE Trans. Commun. 1973
Image and video processing › image filtering
recursive filtering
0.011973
Recursive Image Enhancement-Vector Processing · IEEE Trans. Commun. 1973
Information theory
estimation theory
0.011969
Optimal recursive estimation with uncertain observation · IEEE Trans. Inf. Theory 1969
Information theory › estimation theory
recursive estimation
0.011969
Optimal recursive estimation with uncertain observation · IEEE Trans. Inf. Theory 1969
Machine learning › Learning theory
statistical estimation
0.011977
Image Boundary Estimation · IEEE Trans. Computers 1977
Information theory › hypothesis testing
false alarm probability
0.011969
Optimal recursive estimation with uncertain observation · IEEE Trans. Inf. Theory 1969
Information theory
hypothesis testing
0.011969
Optimal recursive estimation with uncertain observation · IEEE Trans. Inf. Theory 1969

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

statistical modeling · 0.0recursive estimation · 0.0vector linear dynamical model · 0.0kalman filter · 0.0minimum mean-square estimation · 0.0limiters · 0.0
YearPublicationVenuePosition
1978 Bounding Filter: A Simple Solution to Lack of Exact a Priori Statistics
Nasser E. Nahi, I. M. Weiss
Inf. Control.1
1977 Image Boundary Estimation
abstract
In this paper, an object boundary estimator, applicable to a class of noisy images, will be introduced. The images considered will contain an object of interest within the background where the statistics of the object, background, noise, and boundary are given. The procedures developed are recursive and readily implementable on a digital computer. A number of examples are considered to illustrate the performance of the estimator.
Nasser E. Nahi, Mohammad H. Jahanshahi
IEEE Trans. Computers1
1975 Optimum Wiener Bounding Filters in the Presence of Uncertainties
Nasser E. Nahi, I. M. Weiss
Inf. Control.1
1973 Recursive Image Enhancement-Vector Processing
abstract
A new approach to design of a recursive image enhancer is introduced when the image is characterized statistically by its mean and correlation function. A vector linear dynamical model is derived to represent the statistics of the processor output when several lines of the picture are processed simultaneously. Based on the vector model, a Kalman filter is designed and utilized to recursively enhance the image. The vector processing results in a simpler and more accurate image enhancement algorithm in comparison with scalar processing. Two examples, one with very low signal-to-noise ratio, are used to illustrate the effectiveness of the procedure. Finally, the performance of the vector and scalar estimators is compared.
Nasser E. Nahi, C. A. Franco
IEEE Trans. Commun.1
1969 Optimal recursive estimation with uncertain observation
abstract
In classical estimation theory, the observation is always assumed to contain the signal to be estimated. In practice, certain observations, or sequences of observations, may contain noise alone, only the probability of occurrence of such cases being available to the estimator. An example is trajectory tracking where the signal is first detected and then the estimator is allowed to process it for tracking purposes. However, any detection decision is associated with a false-alarm probability, which is the probability that the detected signal contains only noise. Minimum mean-square estimators are derived for two different forms of this problem; 1) when it is possible that the observation at any sample time contains signal or is noise alone, independent of the situation at any other sample, and 2) when the entire sequence of observations contains signal or is only noise. The estimators derived are of recursive form. A simple example is given for illustration.
Nasser E. Nahi
IEEE Trans. Inf. Theory1
1967 Use of limiters for estimating signal to noise ratio (Corresp.)
Nasser E. Nahi, Robert M. Gagliardi
IEEE Trans. Inf. Theory1