1991
DOI: 10.1109/34.99239
|View full text |Cite
|
Sign up to set email alerts
|

BONSAI: 3D object recognition using constrained search

Abstract: Computer vision systems that identify and localize instances of predefined 3-D models in images offer many potential benefits to industrial and other environments. In many of these areas, solid models of the parts to be recognized already exist, and redesign of the part geometry for vision tasks should be avoided. This paper describes BONSAI, which is a model-based 3-D object recognition system, which identifies and localizes 3-D objects in range images of one or more parts that have been designed on a compute… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
24
0

Year Published

1995
1995
1999
1999

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 113 publications
(24 citation statements)
references
References 28 publications
0
24
0
Order By: Relevance
“…We formulate the correspondence problem as a layered constraint satisfaction network (CSN) and implement it on a dynamic network with analog neurons. The main advantages of this approach over previous work (Oshima and Shirai, 1983;Bolles and Horaud, 1986;Fan et al, 1989;Faugeras and Hebert, 1986;Grimson and Lozano-Perez, 1987;Flynn and Jain, 1991) is that the search tree for graph matching can be modeled as an optimization problem. As a resuit, parallelism is made explicit for concurrent implementation, and the worst case time complexity for the solution can be bounded by a low order polynomial.…”
Section: Correspondence Problemmentioning
confidence: 95%
See 4 more Smart Citations
“…We formulate the correspondence problem as a layered constraint satisfaction network (CSN) and implement it on a dynamic network with analog neurons. The main advantages of this approach over previous work (Oshima and Shirai, 1983;Bolles and Horaud, 1986;Fan et al, 1989;Faugeras and Hebert, 1986;Grimson and Lozano-Perez, 1987;Flynn and Jain, 1991) is that the search tree for graph matching can be modeled as an optimization problem. As a resuit, parallelism is made explicit for concurrent implementation, and the worst case time complexity for the solution can be bounded by a low order polynomial.…”
Section: Correspondence Problemmentioning
confidence: 95%
“…Object description is in terms of an attributed graph (Oshima and Shirai, 1983;Fan et al, 1989;Flynn and Jain, 1991), where the nodes in the graph correspond to surfaces (vertices) and the links in the graph correspond to the relations between adjacent surfaces. Conceptually, there is little new here, and it is presented here for the sake of completeness.…”
Section: Shape Descriptionmentioning
confidence: 99%
See 3 more Smart Citations