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

Mehdi Khosravi

dblp:80/4497 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1996
0000-0002-4852-5733ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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
1 paper
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing › mathematical morphology
morphological image processing
0.011996
Template matching based on a grayscale hit-or-miss transform · IEEE Trans. Image Process. 1996
Image and video processing › image filtering
rank-order filters
0.011996
Template matching based on a grayscale hit-or-miss transform · IEEE Trans. Image Process. 1996
Image and video processing › image matching
template matching
0.011996
Template matching based on a grayscale hit-or-miss transform · IEEE Trans. Image Process. 1996

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

rank-order filtering · 0.0grayscale morphology · 0.0
YearPublicationVenuePosition
1996 Template matching based on a grayscale hit-or-miss transform
abstract
This paper introduces a class of rank-order-based template matching criteria that are multiplier-free and independent of the dc variations of the image. The core component of these criteria is a grayscale morphological hit-or-miss transform (GHMT). Experimental results show that the GHMT features sharp and robust indications in the presence of Gaussian noise. The idea of the GHMT is used to develop more general forms of matching criteria that are robust to both Gaussian and impulsive noises.
Mehdi Khosravi, Ronald W. Schafer
IEEE Trans. Image Process.1
1994 Low Complexity Matching Criteria for Image/Video Applications
abstract
The paper extends Kosravi and Schafer (1994) which introduced the notion of normalized min correlation (NMC) as a new criterion for template matching applications. The NMC features low complexity and robustness with respect to Gaussian noise. It is also independent of the local average of the image, which is a desired property in many template matching applications. However, its sensitivity to impulsive noise increases with the size of the template. The paper introduces two different modifications of the NMC which are robust with respect to both Gaussian and impulsive noise. The performance of the new modifications are examined in motion estimation applications. As a different way of looking at the NMC, the notion of grayscale hit-or-miss transform is introduced. This is an extension of the binary hit-or-miss transform to grayscale.>
Mehdi Khosravi, Ronald W. Schafer
ICIP (3)1