Improved algorithms for robust point pattern matching and applications to image registration

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Improved algorithms for robust point pattern matching and applications to image registration

Full text

Pdf (1.50 MB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the fourteenth annual symposium on Computational geometry table of contents

Minneapolis, Minnesota, United States

Pages: 155 - 164

Year of Publication: 1998

ISBN:0-89791-973-4

Authors

David M. Mount	Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, Maryland
Nathan S. Netanyahu	Center for Automation Research, University of Maryland, Collego Park and Center of Excellence in Space Data and Information Sciences (CESDIS), Code 930.5, Space Data and Computing Division, NASA Goddard Space Flight Center, Greenbelt, Maryland
Jacqueline Le Moigne	Universities Space Research Association/CESDIS, Code 930.5, Space Data and Computing Division, NASA/GSFC, Greenbelt, Maryland

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 64, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/276884.276902 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AAR94	Helmut Alt , Oswin Aichholzer , Günter Rote, Matching shapes with a reference point, Proceedings of the tenth annual symposium on Computational geometry, p.85-92, June 06-08, 1994, Stony Brook, New York, United States [doi>10.1145/177424.177555]
	AG96	H. Aft and L. J. Guibas. Discrete geometric shapes: Matching, interpolation, and approximation. Technical Report 96-11, Institut ffir Informatik, Freie Unversit#t Berlin, Berlin, Germany, 1996.
	AM93	S. Arya and D. M. Mount. Algorithms for fast vector quantization. In J. A. Storer and M. Cohn, editors, Proc. of DCC '93: Data Compression Conference, pages 381-390. IEEE Press, 1993.
	AM95	Sunil Arya , David M. Mount, Approximate range searching, Proceedings of the eleventh annual symposium on Computational geometry, p.172-181, June 05-07, 1995, Vancouver, British Columbia, Canada [doi>10.1145/220279.220298]
	AMN+94	Sunil Arya , David M. Mount , Nathan S. Netanyahu , Ruth Silverman , Angela Wu, An optimal algorithm for approximate nearest neighbor searching, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.573-582, January 23-25, 1994, Arlington, Virginia, United States
	AMWW88	Helmut Alt , Kurt Mehlhorn , Hubert Wagener , Emo Welzl, Congruence, similarity and symmetries of geometric objects, Discrete & Computational Geometry, v.3 n.3, p.237-256, Jan., 1988 [doi>10.1007/BF02187910]
	Bro92	Lisa Gottesfeld Brown, A survey of image registration techniques, ACM Computing Surveys (CSUR), v.24 n.4, p.325-376, Dec. 1992 [doi>10.1145/146370.146374]
	CGH+97	L. Paul Chew , Michael T. Goodrich , Daniel P. Huttenlocher , Klara Kedem , Jon M. Kleinberg , Dina Kravets, Geometric pattern matching under Euclidean motion, Computational Geometry: Theory and Applications, v.7 n.1-2, p.113-124, Jan. 1997 [doi>10.1016/0925-7721(95)00047-X]
	dRL95	P.J. de Rezende and D. T. Lee. Point set pattern matching in d-dimensions. Algori#hmica, 13:387-404, 1995.
	FBF77	Jerome H. Freidman , Jon Louis Bentley , Raphael Ari Finkel, An Algorithm for Finding Best Matches in Logarithmic Expected Time, ACM Transactions on Mathematical Software (TOMS), v.3 n.3, p.209-226, Sept. 1977 [doi>10.1145/355744.355745]
	GMO94	Michael T. Goodrich , Joseph S. B. Mitchell , Mark W. Orletsky, Practical methods for approximate geometric pattern matching under rigid motions: (preliminary version), Proceedings of the tenth annual symposium on Computational geometry, p.103-112, June 06-08, 1994, Stony Brook, New York, United States [doi>10.1145/177424.177572]
	GS85	A. Goshtasby and G. C. Stockman. Point pattern matching using convex hull edges. IEEE Transactions on Systems, Man, and Cybernetics, 15:631-637, 1985.
	GSP86	A. Goshtasby, G. C. Stockman, and C. V. Page. A region-based approach to digital image re#stration with subpLxel accuracy. IEEE Transactions on Geoscience and Remote Sensing, 24:390-399, 1986.
	HKR93	D. P. Huttenlocher , G. A. Klanderman , W. A. Rucklidge, Comparing Images Using the Hausdorff Distance, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.15 n.9, p.850-863, September 1993 [doi>10.1109/34.232073]
	HKS93	D.P. Huttenlocher, K. Kedem, and M. Sharir. The upper era, elope of Voronoi surfaces and its applications. Discrete Comput. Geom., 9:267- 291, 1993.
	HR92	D.P. Huttenlocher and W. J. Rucklidge. A multi-resolution tectmique for comparing images using the Hausdorff distance. Technical Report 1321, Dept. of Computer Science, Cotnell University, Ithaca, 1Ti', 1992.
	HR93	D.P. Huttenlocher and W. J. Rucklidge. A multi-resolution technique for comparing images using the Hausdorff distance. In Proc. IEEE Conf. Comput. Vision Pattern. Rccogu., pages 705-706. IEEE, 1993.
	HS94	Paul J. Heffernan , Stefan Schirra, Approximate decision algorithms for point set congruence, Computational Geometry: Theory and Applications, v.4 n.3, p.137-156, July 1994 [doi>10.1016/0925-7721(94)90004-3]
	HV97	M. Hagedoorn and R. C. Veltl#amp. Reliable and efficient pattern matching using aa aitine invariant metric. Technical Report RUU-CS- 97-33, Dept. of Computing Science, Utrecht University, The Netherlands, 1997.
	IR96	Sandy Irani , Prabhakar Raghavan, Combinatorial and experimental results for randomized point matching algorithms, Proceedings of the twelfth annual symposium on Computational geometry, p.68-77, May 24-26, 1996, Philadelphia, Pennsylvania, United States [doi>10.1145/237218.237240]
	LW88	Y. Lamdan and H. J. Wolfson. Geometric hashing: A general and efficient model-based recognition scheme. In 2nd Inter. Conf. on Comput. Vision, pages 238-249, 1988.
	MA97	D.M. Mount and S. Arya. Ann: A library for approximate nearest neighbor searching. CGC 2nd Annum Fall Workship on Computational Geometry, URL: http://www, cs. umd. edu/'mount/hN#l., 1997.
	MNM98	D.M. Mount, N. S. Netanyahu, and J. Le Moigne. Improved algorithms for robust point pattern matching and applications to image registration. Full paper version, in preparation, 1998.
	OH97	C.F. Olson and D. P. Huttenlocher. Automatic target recognition by matching oriented edge pLxels. IEEE Transactions on Image Pro. cessing, 6:103-113, 1997.
	RR80	S. Ranade and A. Rosenfeld. Point pattern matching by relaxation. Pattern Recognition, 12:269-275, 1980.
	Ruc95	W. J. Rucklidge, Locating objects using the Hausdorff distance, Proceedings of the Fifth International Conference on Computer Vision, p.457, June 20-23, 1995
	SKB82	G.C. Stockman, S. Kopstein, and S. Benett. Matching images to models for registration and object detection via clustering. IEEE Tcauaac. tions on pattern Analysis and Machine lntelli. gence, 4:229-241, 1982.
	TJ89	J. Ton and A. K. Jain. Registering landsat images by point matching. IEEE Transactions on Geoscience and Remote Sensing, 27:642-651, 1989.
	XMT+97	W. Xia, J. Le Moigne, J. C. Tilton, B-T. Lerner, E. Kaymaz, J. Pierce, S. Ragh#van, S. Chettri, T. Ei-Ghazawi, M. Manohar, N. S. Netanyahu, W. J. Campbell, and R. F. Cromp. A registration toolbox for multi-source remote sensing applications. In Proc. Int'l C'onf. on Earth Observation and Environmental Information, 1997.

CITED BY 4

	Piotr Indyk , Rajeev Motwani , Suresh Venkatasubramanian, Geometric matching under noise: combinatorial bounds and algorithms, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.457-465, January 17-19, 1999, Baltimore, Maryland, United States
	Piotr Indyk , Suresh Venkatasubramanian, Approximate congruence in nearly linear time, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.354-360, January 09-11, 2000, San Francisco, California, United States
	Martin Gavrilov , Piotr Indyk , Rajeev Motwani , Suresh Venkatasubramanian, Geometric pattern matching: a performance study, Proceedings of the fifteenth annual symposium on Computational geometry, p.79-85, June 13-16, 1999, Miami Beach, Florida, United States
	Partha Bhowmick , Bhargab B. Bhattacharya, Real Polygonal Covers of Digital Discs - Some Theories and Experiments, Fundamenta Informaticae, v.91 n.3-4, p.487-505, August 2009