2004 · 40 citations · 12 references
ComputingComputer ScienceComputer VisionData MiningMachine LearningNearest Neighbor SearchObject RecognitionPattern RecognitionShape AnalysisShape RepresentationShape DetectionShape MatchingShape Recognition
Shape recognition systems usually order a fixed number of best matches to each query, but do not address or answer the two following questions: Is a query shape in a given database? How can we be sure that a match is correct? This communication deals with these two key points. A database being given, with each shape S and each distance /spl delta/, we associate its number of false alarms NFA(S, /spl delta/), namely the expectation of the number of shapes at distance /spl delta/ in the database. Assume that NFA(S, /spl delta/) is very small with respect to 1, and that a shape S' is found at distance /spl delta/ from S in the database. This match could not occur just by chance and is therefore a meaningful detection. Its explanation is usually the common origin of both shapes. Experimental evidence will show that NFA(S, /spl delta/) can be predicted accurately.
12
Generalizing the Hough transform to detect arbitrary shapes
D.H. Ballard · Pattern Recognition · 1981 · 4.4K citations
Guillermo Sapiro, Allen Tannenbaum · International Journal of Computer Vision · 1993 · 329 citations