Multiple polyline to polygon matching

Authors:
Mirela Tănase;Remco C. Veltkamp;Herman Haverkort
Affiliations:
Department of Computing Science, Utrecht University, The Netherlands;Department of Computing Science, Utrecht University, The Netherlands;Department of Computing Science, TU Eindhoven, The Netherlands
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 9
Cited 7

Partial Shape Recognition: A Landmark-Based Approach

IEEE Transactions on Pattern Analysis and Machine Intelligence
Partial Shape Classification Using Contour Matching in Distance Transformation

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Efficiently Computable Metric for Comparing Polygonal Shapes

IEEE Transactions on Pattern Analysis and Machine Intelligence
Partial matching of planar polylines under similarity transformations

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Shock Graphs and Shape Matching

International Journal of Computer Vision
A guided tour to approximate string matching

ACM Computing Surveys (CSUR)
Geometric Hashing: An Overview

IEEE Computational Science & Engineering
Comparing Images Using the Hausdorff Distance

IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal spanners for axis-aligned rectangles

Computational Geometry: Theory and Applications

Multimedia Retrieval Algorithmics

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Shape Matching by Random Sampling

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Absolute orientation of stereoscopic cameras by aligning contours in pairs of images and reference images

PIA'11 Proceedings of the 2011 ISPRS conference on Photogrammetric image analysis
Shape matching by random sampling

Theoretical Computer Science
The mean boundary curve of anatomical objects

ACIVS'12 Proceedings of the 14th international conference on Advanced Concepts for Intelligent Vision Systems
Alignment and morphing for the boundary curves of anatomical organs

SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Technical note: Puzzhull: Cavity and protrusion hierarchy to fit conformal polygons

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a measure for computing the similarity between multiple polylines and a polygon, that can be computed in O(km2n2) time with a straightforward dynamic programming algorithm. We then present a novel fast algorithm that runs in time O(kmn logmn). Here, m denotes the number of vertices in the polygon, and n is the total number of vertices in the k polylines that are matched against the polygon. The effectiveness of the similarity measure has been demonstrated in a part-based retrieval application with known ground-truth.