Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations

DOI10.1007/978-3-540-85238-4_32zbMath1173.68787MaRDI QIDQ3599144

Christian Hundt, Maciej Liśkiewicz

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85238-4_32

Mathematics Subject Classification ID

68U10: Computing methodologies for image processing

Related Items

Affine invariants of generalized polygons and matching under affine transformations, On 2D constrained discrete rigid transformations, New complexity bounds for image matching under rotation and scaling, The exact complexity of projective image matching, The generic combinatorial algorithm for image matching with classes of projective transformations, Topology-preserving conditions for 2D digital images under rigid transformations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pattern matching in a digitized image
• Two-dimensional pattern matching with rotations
• Digital Image Analysis
• Two-Dimensional Pattern Matching with Combined Scaling and Rotation
• On the Complexity of Affine Image Matching
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Elastic image matching is NP-complete
• Faster Two Dimensional Scaled Matching
• Combinatorial Pattern Matching