New complexity bounds for image matching under rotation and scaling
From MaRDI portal
Publication:533416
DOI10.1016/j.jda.2010.06.002zbMath1216.68231OpenAlexW2004046512MaRDI QIDQ533416
Maciej Liśkiewicz, Christian Hundt
Publication date: 3 May 2011
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2010.06.002
combinatorial pattern matchingdesign and analysis of algorithmsdigital image matchingdiscrete rotations and scalings
Related Items (2)
The generic combinatorial algorithm for image matching with classes of projective transformations ⋮ The exact complexity of projective image matching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Real two dimensional scaled matching
- A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
- Pattern matching in a digitized image
- Two-dimensional pattern matching with rotations
- Approximate formulas for some functions of prime numbers
- Digital Image Analysis
- Two-Dimensional Pattern Matching with Combined Scaling and Rotation
- Low distortion maps between point sets
- On the Complexity of Affine Image Matching
- Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Fast Multiple-Precision Evaluation of Elementary Functions
- Faster Two Dimensional Scaled Matching
- Combinatorial Pattern Matching
This page was built for publication: New complexity bounds for image matching under rotation and scaling
