This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Geometric Probing of Dense Range Data
April 2002 (vol. 24 no. 4)
pp. 495-508

A new method is presented for the efficient and reliable pose determination of 3D objects in dense range image data. The method is based upon a minimalistic Geometric Probing strategy that hypothesizes the intersection of the object with some selected image point, and searches for additional surface data at locations relative to that point. The strategy is implemented in the discrete domain as a binary decision tree classifier. The tree leaf nodes represent individual voxel templates of the model, with one template per distinct model pose. The internal nodes represent the union of the templates of their descendant leaf nodes. The union of all leaf node templates is the complete template set of the model over its discrete pose space. Each internal node also encodes a single voxel which is the most common element of its child node templates. Traversing the tree is equivalent to efficiently matching the large set of templates at a selected image seed location. The method was implemented and extensive experiments were conducted for a variety of combinations of tree designs and traversals under isolated, cluttered, and occluded scene conditions. The results demonstrated a trade-off between efficiency and reliability. It was concluded that there exist combinations of tree design and traversal which are both highly efficient and reliable.

[1] Y. Shirai, “Recognition of Polyhedrons with a Range Finder,” Pattern Recognition, vol. 4, pp. 243-250, 1972.
[2] O.D. Faugeras and M. Hebert,“The representation, recognition, and locating of 3D objects,” Int’l J. of Robotics Research, vol. 5, no. 3, pp. 27-52, Fall 1986.
[3] T. Fan, G. Medioni, and R. Nevatia, “Recognizing 3-D Objects Using Surface Descriptions,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 11, pp. 1140-1157, Nov. 1989.
[4] W. Kim and A.C. Kak, "3-D Object Recognition Using Bi-Partite Graph Matching Embedded in Discrete Relaxation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, pp. 224-251, 1991.
[5] C. Chen and A. Kak, "A Robot Vision System for Recognizing 3D Objects in Low-Order Polynomial Time," IEEE Trans. On Systems, Man, and Cybernetics," vol. 19 no. 6, pp. 1,535-1,563, Nov./Dec. 1989.
[6] C. Hanson and T. Henderson, "Gagd-Based Computer Vision," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 1,181-1,193, 1989.
[7] W.E.L. Grimson and T. Lozano-Perez, “Localizing Overlapping Parts by Searching the Interpretation Tree,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 9, no. 4, pp. 469-482, Apr. 1987.
[8] P. Flynn and A. Jain, "BONSAI: 3D object recognition using constrained search," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, pp. 1066-1075, 1991.
[9] R.C. Bolles and P. Haraud, "3DPO: A Three Dimensional Part Orientation System," Int'l J. Robotics Research, vol. 5, no. 3, pp. 3-26, 1986.
[10] K. Ikeichi, “Generating an Interpretation Tree from a Cad Model for 3D-Object Recognition in Bin-Picking Tasks,” Int'l J. Computer Vision, vol. 1, pp. 145-165, 1987.
[11] D.P. Huttenlocher and S. Ullman, “Recognizing Solid Objects by Alignment with an Image,” Int'l J. Computer Vision, vol. 5, no. 2, pp. 195-212, 1990.
[12] Y. Muller and R. Mohr, “Planes and Quadrics Detection Using Hough Transform,” Proc. Seventh Int'l Conf. Pattern Recognition, pp. 1101-1103, 1984.
[13] T.C. Henderson and W.S. Fai, “The 3-D Hough Shape Transform,” Pattern Recognition Letters, vol. 2, no. 4, pp. 235-238, 1984.
[14] R. Krishnapuram and D. Casasent, “Determination of Three-Dimensional Object Location and Orientation from Range Images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 11, pp. 1158-1167, Nov. 1989.
[15] E. Cohen and H.J. Wolfson, “Partial Matching of 3-D Objects in Cad/Cam Systems,” Proc. 12th Int'l Conf. Pattern Recognition (IAPR), pp. 483-487, 1994.
[16] G. Barequet and M. Sharir, “Partial Surface and Volume Matching in Three Dimensions,” Proc. 12th Int'l Conf. Pattern Recognition (IAPR), pp. 610-614, 1994.
[17] P.J. Besl and R. Jain,“Three-dimensional object recognition,” ACM Computing Surveys, vol. 17, pp. 75-145, Mar. 1985.
[18] A.E. Johnson and M. Hebert, “Surface Registration by Matching Oriented Points,” Proc. Int'l Conf. Recent Advances in 3-D Digital Imaging and Modeling (IM '97), pp. 121-128, May 1997.
[19] A.E. Johnson and M. Hebert, “Recognizing Objects by Matching Oriented Points,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 684-689, 1997.
[20] C.S. Chua and R. Jarvis, “Point Signatures: A New Representation for 3D Object Recognition,” Int'l J. Computer Vision, vol. 25, no. 1, pp. 63–85, 1997.
[21] R. Cole and C.K. Yap, “Shape from Probing,” J. Algorithms, vol. 8, pp. 19-38, 1987.
[22] S. Skiena, Interactive Reconstruction via Geometric Probing Proc. IEEE, vol. 80, no. 9, pp. 1364-1383, 1992.
[23] M. Greenspan, “The Sample Tree: A Sequential Hypothesis Testing Approach to 3D Object Recognition,” Proc. IEEE Computer Soc. Conf. Computer Vision and Pattern Recognition, pp. 772-779, 1998.
[24] M. Greenspan, “A Decision Tree Classifier for Object Recognition in Range Imagery,” Proc. Conf. Vision Interface '98, pp. 181-188, 1998.
[25] M. Greenspan and P. Boulanger, “Efficient and Reliable Template Set Matching for 3D Object Recognition,” 3DIM99: 3D Imaging and Modelling, pp. 230-239, 1999.
[26] M. Greenspan, “Geometric Probing for 3D Object Recognition in Dense Range Data,” PhD thesis, Carleton Univ., 1999.
[27] E.M. Arkin, J.S.B. Mitchell, H. Meijer, D. Rappaport, and S.S. Skiena, “Decision Trees for Geometric Models,” Int'l J. Computational Geometry and Applications, vol. 8, no. 3, pp. 343-363, 1998.
[28] P.J. Besl and N.D. McKay, "A Method for Registration of 3D Shapes," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, no. 2, pp. 239-256, Feb. 1992.
[29] H.K. Ramapriyan, “A Multilevel Approach to Sequential Detection of Pictorial Features,” IEEE Trans. Computers, vol. 1, pp. 66-78, Jan. 1976.
[30] K.W. Bowyer and C.R. Dyer, “Aspect Graphs: An Introduction and Survey of Recent Results,” Proc. SPIE: Conf. Close-Range Photogrammetry Meets Machine Vision, vol. 1395, pp. 200-208, 1990.
[31] P. Brou, “Using the Gaussian Image to Find the Orientation of Objects,” Int'l J. Robotics Research, vol. 3, no. 4, pp. 89-125, Winter 1984.
[32] B.M.E. Moret,“Decision trees and diagrams,” Computing Surveys, vol. 14, no. 4, pp. 593-623, 1982.
[33] B.M.E. Moret, “The Representation of Discrete Functions by Decision Trees: Aspects of Complexity and Problems of Testing,” PhD thesis, Univ. of Tennessee, 1980.
[34] M.R. Garey and R.L. Graham, “Performance Bounds on the Splitting Algorithm for Binary Testing,” Acta Informatica, vol. 3, pp. 347-355, 1974.
[35] G. Roth and E. Wibowo, “A Fast Algorithm for Making Mesh Models from Multi-View Range Data,” Proc. DND/CSA Robotics and Knowledge Based Systems Workshop, pp. 349-355, Oct. 1995.

Index Terms:
pose determination, object recognition, geometric probing, decision tree, template matching, range image
Citation:
M. Greenspan, "Geometric Probing of Dense Range Data," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 4, pp. 495-508, April 2002, doi:10.1109/34.993557
Usage of this product signifies your acceptance of the Terms of Use.