Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Amit, Y.
Right arrow Articles by Geman, D.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Amit, Y.
Right arrow Articles by Geman, D.
(Neural Computation. 1999;11:1691-1715.)
© 1999 The MIT Press


Letter

A Computational Model for Visual Selection

Yali Amit

Department of Statistics, University of Chicago, Chicago, IL 60637, U.S.A.

Donald Geman

Department of Mathematics and Statistics, University of Massachusetts, Amherst, MA 01003, U.S.A.

We propose a computational model for detecting and localizing instances from an object class in static gray-level images. We divide detection into visual selection and final classification, concentrating on the former: drastically reducing the number of candidate regions that require further, usually more intensive, processing, but with a minimum of computation and missed detections. Bottom-up processing is based on local groupings of edge fragments constrained by loose geometrical relationships. They have no a priori semantic or geometric interpretation. The role of training is to select special groupings that are moderately likely at certain places on the object but rare in the back ground. We show that the statistics in both populations are stable. The candidate regions are those that contain global arrangements of several local groupings. Whereas our model was not conceived to explain brain functions, it does cohere with evidence about the functions of neurons in V1 and V2, such as responses to coarse or incomplete patterns (e.g., illusory contours) and to scale and translation invariance in IT. Finally, the algorithm is applied to face and symbol detection.




This article has been cited by other articles:


Home page
Neural Comput.Home page
Z. Chi, P. L. Rauske, and D. Margoliash
Pattern Filtering for Detection of Neural Activity, with Examples from HVc Activity During Sleep in Zebra Finches
Neural Comput., October 1, 2003; 15(10): 2307 - 2337.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
D. Roth, M.-H. Yang, and N. Ahuja
Learning to Recognize Three-Dimensional Objects
Neural Comput., May 1, 2002; 14(5): 1071 - 1103.
[Abstract] [Full Text]


Home page
Neural Comput.Home page
Y. Amit and M. Mascaro
Attractor Networks for Shape Recognition
Neural Comput., June 1, 2001; 13(6): 1415 - 1442.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
Y. Amit
A Neural Network Architecture for Visual Selection
Neural Comput., May 1, 2000; 12(5): 1141 - 1164.
[Abstract] [Full Text]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 1999 by The MIT Press.