This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Uncertainty Propagation and the Matching of Junctions as Feature Groupings
December 2000 (vol. 22 no. 12)
pp. 1381-1395

Abstract—The interpretation of the 3D world from image sequences requires the identification and correspondences of key features in the scene. In this paper, we describe a robust algorithm for matching groupings of features related to the objects in the scene. We consider the propagation of uncertainty from the feature detection stage through the grouping stage to provide a measure of uncertainty at the matching stage. We focus upon indoor scenes and match junctions, which are groupings of line segments that meet at a single point. A model of the uncertainty in junction detection is described, and the junction uncertainty under the epipolar constraint is determined. Junction correspondence is achieved through matching of each line segment associated with the junction. A match likelihood is then derived based upon the detection uncertainties and then combined with information on junction topology to create a similarity measure. A robust matching algorithm is proposed and used to match junctions between pairs of images. The presented experimental results on real images show that the matching algorithm produces sufficiently reliable results for applications such as structure from motion.

[1] N. Ayache and B. Faverjon, “Efficient Registration of Stereo Images by Matching Graph Descriptions of Edge Segments,” Int'l J. Computer Vision, vol. 1, no. 2, pp. 107-131, 1987.
[2] D.J. Beymer, "Finding Junctions Using the Image Gradient," Computer Vision and Pattern Recognition, pp. 720-721,Lahania, Maui, Hawaii, June3-6 1991.
[3] Z.W. Birnbaum, Introduction to Probability and Mathematical Statistics. Harper&Brothers, 1962.
[4] J. Canny, “A Computational Approach to Edge Detection,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 6, pp. 679-698, June 1986.
[5] Y. Chang and J.K. Aggarwal, “Line Correspondences from Cooperating Spatial and Temporal Grouping Processes for a Sequence of Images,” Computer Vision and Image Understanding, vol. 67, no. 2, pp. 186-201, 1997.
[6] L. Dreschler and H.-H. Nagel, “Volumetric Model and 3-D Trajectory of a Moving Car Derived from Monocular TV Frame Sequences of a Street Scene,” Computer Graphics and Image Processing, vol. 20, pp. 199-228, 1982.
[7] O.D. Faugeras, Three-Dimensional Computer Vision: A Geometric Viewpoint.Cambridge, Mass.: MIT Press, 1993.
[8] W. Förstner, "A Framework for Low Level Feature Extraction," Proc. European Conf. Computer Vision '94, Vol. II, Lecture Notes in Computer Science, No. 801, Springer-Verlag, New York, 1994, pp. 383-394.
[9] W. Freeman and E. Adelson, “Junction Detection and Classification,” Proc. Assoc. for Research in Vision and Opthalmology, 1991.
[10] W. Grimson, “Computational Experiments with a Feature Based Stereo Algorithm,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, no. 1, pp. 17-34, Jan. 1985.
[11] F. Harary, Graph Theory. Addison-Wesley, 1969.
[12] R. Hartley, “Lines and Points in Three Views—A Unified Approach,” Proc. ARPA Image Understanding Workshop, 1994.
[13] R. Horaud and T. Skordas, “Stereo Correspondence Through Feature Grouping and Maximal Cliques,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 1,168-1,180, 1989.
[14] X. Hu and N. Ahuja, “Matching Point Features with Ordered Geometric, Rigidity, and Disparity Constraint,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, no. 10, pp. 1,041-1,049, Oct. 1994.
[15] D. Marr and E. Hildreth, “Theory of Edge Detection,” Proc. Royal Soc., London, vol. B207, pp. 187-217, 1980.
[16] J. Mayhew and J. Frisby, “Psychophysical and Computational Studies towards a Theory of Human Stereopsis,” Artificial Intelligence, vol. 17, pp. 349-385, 1981.
[17] G. Medioni and R. Nevatia, “Segment-Based Stereo Matching,” Computer Vision, Graphics, and Image Processing, vol. 31, pp. 2-18, 1985.
[18] H.H. Nagel, “Displacement Vectors Derived from Second Order Intensity Variations in Image Sequences,” Computer Vision, Graphics, and Image Processing, vol. 21, pp. 85-117, 1983.
[19] J.A. Noble, “Finding Corners,” Image and Vision Computing, vol. 6, pp. 121-128, 1988.
[20] P.L. Palmer, J. Kittler, and M. Petrou, “An Optimising Line Finder Using a Hough Transform Algorithm,” Computer Vision, Graphics, and Image Processing: Image Understanding, vol. 67, no. 1, pp. 1-23, 1997.
[21] P.L. Palmer, M. Petrou, and J. Kittler, “A Hough Transform Algorithm with a 2D Hypothesis Testing Kernel,” Computer Vision, Graphics, and Image Processing: Image Understanding, vol. 58, no. 2, pp. 221-234, 1993.
[22] L. Parida, D. Geiger, and R. Hummel, “Junctions: Detection, Classification, and Reconstruction,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 7, pp. 687-698, July 1998.
[23] M. Petrou and J. Kittler, "Optimal Edge Detection for Ramp Edges," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, pp. 483-490, 1991.
[24] F. Pla and J. Marchant, “Matching Feature Points in Image Sequences through a Region-Based Method,” Computer Vision and Image Understanding, vol. 66, no. 3, pp. 271-285, 1997.
[25] I.D Reid and D.W. Murray, “Active Tracking of Foveated Feature Clusters Using Affine Structure,” Int'l J. Computer Vision, vol. 18, no. 1, pp. 1-20, 1996.
[26] C. Schmid and A. Zisserman, “Automatic Line Matching Across Views,” Proc. Conf. Computer Vision and Pattern Recognition, pp. 666-671, 1997.
[27] V. Venkateswar and R. Chellappa, “Hierarchical Stereo and Motion Correspondence Using Feature Groupings,” Int'l J. Computer Vision, vol. 15, pp. 245-269, 1995.
[28] G. Wei, W. Brauer, and G. Hirzinger, “Intensity- and Gradient-Based Stereo Matching Using Hierarchical Gaussian Basis Functions,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 11, pp. 1,143-1,159, Nov. 1998.
[29] J. Weng,T. S. Huang,, and N. Ahuja,Motion and Structure from Image Sequences, Springer Series on Information Sciences. Berlin: Springer-Verlag, 1993.
[30] Z. Zhang, Estimating Motion and Structure from Correspondences of Line Segments between Two Perspective Images Proc. Int'l Conf. Computer Vision, pp. 257-262, June 1995.
[31] Z. Zhang, “Determining the Epipolar Geometry and Its Uncertainty—A Review,” Int'l J. Computer Vision, vol. 27, no. 2, pp. 161-195, 1998.

Index Terms:
Feature tracking, junction, uncertainty propagation, junction matching, junction topology, topological matching, epipolar geometry.
Citation:
Xinquan Shen, Phil Palmer, "Uncertainty Propagation and the Matching of Junctions as Feature Groupings," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 12, pp. 1381-1395, Dec. 2000, doi:10.1109/34.895973
Usage of this product signifies your acceptance of the Terms of Use.