Abstract
Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in many practical applications, some a priori knowledge exists which considerably simplifies the problem. In visual navigation, for example, the motion between successive positions is usually either small or approximately known, but a more precise registration is required for environment modeling. The algorithm described in this paper meets this need. Objects are represented by free-form curves, i.e., arbitrary space curves of the type found in practice. A curve is available in the form of a set of chained points. The proposed algorithm is based on iterativeiy matching points on one curve to the closest points on the other. A least-squares technique is used to estimate 3-D motion from the point correspondences, which reduces the average distance between curves in the two sets. Both synthetic and real data have been used to test the algorithm, and the results show that it is efficient and robust, and yields an accurate motion estimate.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Bolles and R. Cain, “Recognizing and locating partially visible objects, the local-feature-focus method,” Int’l J. Robotics Res. ,vol. 1, no. 3, pp. 57–82, 1982.
D. Walters, “Selection of image primitives for general-purpose visual processing,” Comput. Vision, Graphics Image Process. ,vol. 3T, no. 3, pp. 261–298, 1987.
E. E. Milios, “Shape matching using curvature processes,” Comput. Vision, Graphics Image Process. ,vol. 47, pp. 203–226, 1989.
T. Pavlidis, “Algorithms for shape analysis of contours and waveforms,” IEEE Trans. PAMI ,vol. 2, no. 4, pp. 301–312, 1980.
J. T. Schwartz and M. Sharir, “Identification of partially obscured objects in two and three dimensions by matching noisy characteristic curves,” Int’l J. Robotics Res. ,vol. 6, no. 2, pp. 29–44, 1987.
H. Wolfson, “On curve matching,” IEEE Trans. PAMI ,vol. 12, no. 5, pp. 483–489, 1990.
P. J. Besl and N. D. McKay, “A method for registration of 3-D shapes,” IEEE Trans. PAMI ,vol. 14, pp. 239–256, February 1992.
Z. Zhang, “Iterative point matching for registration of free-form curves,” Research Report 1658, INRIA Sophia-Antipolis, March 1992.
L. Robert and O. Faugeras, “Curve-based stereo: Figural continuity and curvature,” in Proc. IEEE Conf. Comput. Vision Pattern Recog. ,(Maui, Hawaii), pp. 57–62, June 1991.
R. E. Sampson, “3D range sensor-phase shift detection,” Computer ,no. 20, pp. 23–24, 1987.
R. Safaee-Rad, I. Tchoukanov, B. Benhabib, and K. C. Smith, “Accurate parameter estimation of quadratic curves from grey-level images,” CVGIP: Image Understanding ,vol. 54, pp. 259–274, September 1991.
G. Täubin, “Estimation of planar curves, surfaces, and nonplanar space curves defined by implicit equations with applications to edge and range image segmentation,” IEEE Trans. PAMI ,vol. 13, pp. 1115–1138, November 1991.
J. E. W. Mayhew and J. P. Frisby, “Psychophysical and computational studies towards a theory of human stereopsis,” Artif. Intell ,vol. 17, pp. 349–385, 1981.
S. Pollard, J. Mayhew, and J. Frisby, “PMF: A stereo correspondence algorithm using a disparity gradient limit,” Perception ,vol. 14, pp. 449–470, 1985.
Z. Zhang, O. Faugeras, and N. Ayache, “Analysis of a sequence of stereo scenes containing multiple moving objects using rigidity constraints,” in Proc. Second Int’l Conf. Comput. Vision ,(Tampa, FL), pp. 177–186, December 1988.
O. Faugeras and M. Hebert, “The representation, recognition, and locating of 3D shapes from range data,” Int’l J. Robotics Res. ,vol. 5, no. 3, pp. 27–52, 1986.
K. Arun, T. Huang, and S. Blostein, “Least-squares fitting of two 3-D point sets,” IEEE Trans. PAMI ,vol. 9, pp. 698–700, September 1987.
M. W. Walker, L. Shao, and R. A. Volz, “Estimating 3-D location parameters using dual number quaternions,” CVGIP: Image Understanding ,vol. 54, pp. 358–367, November 1991.
F. Preparata and M. Shamos, Computational Geometry, An Introduction. New York: Springer, Berlin, Heidelberg, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag London Limited
About this paper
Cite this paper
Zhang, Z. (1992). On Local Matching of Free-Form Curves. In: Hogg, D., Boyle, R. (eds) BMVC92. Springer, London. https://doi.org/10.1007/978-1-4471-3201-1_36
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3201-1_36
Publisher Name: Springer, London
Print ISBN: 978-3-540-19777-5
Online ISBN: 978-1-4471-3201-1
eBook Packages: Springer Book Archive