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

Amnon Krupnik

dblp:25/4220 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none

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

Artificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 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
Segmentation and scene understanding · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing › image segmentation
contour grouping
0.012003
Contour Grouping with Prior Models · IEEE Trans. Pattern Anal. Mach. Intell. 2003
Image and video processing
image segmentation
0.012003
Contour Grouping with Prior Models · IEEE Trans. Pattern Anal. Mach. Intell. 2003
Computer vision › Segmentation and scene understanding › perceptual grouping
contour grouping
0.012001
Contour Grouping with Strong Prior Models · CVPR (2) 2001
Image and video processing
edge detection
0.012001
Contour Grouping with Strong Prior Models · CVPR (2) 2001
Image and video processing
perceptual grouping
0.012001
Contour Grouping with Strong Prior Models · CVPR (2) 2001

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

probabilistic modeling · 0.1constructive search · 0.1
YearPublicationVenuePosition
2003 Contour Grouping with Prior Models
abstract
Conventional approaches to perceptual grouping assume little specific knowledge about the object(s) of interest. However, there are many applications in which such knowledge is available and useful. Here, we address the problem of finding the bounding contour of an object in an image when some prior knowledge about the object is available. We introduce a framework for combining prior probabilistic knowledge of the appearance of the object with probabilistic models for contour grouping. A constructive search technique is used to compute candidate closed object boundaries, which are then evaluated by combining figure, ground, and prior probabilities to compute the maximum a posteriori estimate. A significant advantage of our formulation is that it rigorously combines probabilistic local cues with important global constraints such as simplicity (no self-intersections), closure, completeness, and nontrivial scale priors. We apply this approach to the problem of computing exact lake boundaries from satellite imagery, given approximate prior knowledge from an existing digital database. We quantitatively evaluate the performance of our algorithm and find that it exceeds the performance of human mapping experts and a competing active contour approach, even with relatively weak prior knowledge. While the priors may be task-specific, the approach is general, as we demonstrate by applying it to a completely different problem: the computation of human skin boundaries in natural imagery.
James H. Elder, Amnon Krupnik, Leigh A. Johnston
IEEE Trans. Pattern Anal. Mach. Intell.2
2001 Contour Grouping with Strong Prior Models
abstract
Conventional approaches to perceptual grouping assume little specific knowledge about the object(s) of interest. However, there are many applications in which such knowledge is available and useful. We address the problem of finding the bounding contour of an object in an image when some prior knowledge about the object is available. We introduce a framework for combining prior probabilistic knowledge of the appearance of the object with probabilistic models for contour grouping. While prior probabilistic approaches have employed shortest-path algorithms to compute contours, this approach is limited in that many global properties cannot easily be incorporated in the computation. We propose as an alternative an approximate, constructive search technique, which finds a good (not necessarily optimal) solution, and which can accommodate important global cues and constraints. We apply this approach to the problem of computing exact lake boundaries from satellite imagery, given approximate prior models from an existing digital database. Our algorithm improves the accuracy of the prior GIS lake models by an average of 41%.
James H. Elder, Amnon Krupnik
CVPR (2)2