Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
From MaRDI portal
Publication:3599144
DOI10.1007/978-3-540-85238-4_32zbMath1173.68787OpenAlexW1511893315MaRDI 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
Related Items (6)
Affine invariants of generalized polygons and matching under affine transformations ⋮ The generic combinatorial algorithm for image matching with classes of projective transformations ⋮ On 2D constrained discrete rigid transformations ⋮ Topology-preserving conditions for 2D digital images under rigid transformations ⋮ New complexity bounds for image matching under rotation and scaling ⋮ The exact complexity of projective image matching
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
This page was built for publication: Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations