New complexity bounds for image matching under rotation and scaling
From MaRDI portal
Publication:533416
DOI10.1016/J.JDA.2010.06.002zbMATH Open1216.68231OpenAlexW2004046512MaRDI QIDQ533416FDOQ533416
Authors: Christian Hundt, Maciej Liśkiewicz
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
Recommendations
- New Complexity Bounds for Image Matching under Rotation and Scaling
- Two-Dimensional Pattern Matching with Combined Scaling and Rotation
- A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
- Efficient Two-Dimensional Pattern Matching with Scaling and Rotation and Higher-Order Interpolation
- Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
combinatorial pattern matchingdesign and analysis of algorithmsdigital image matchingdiscrete rotations and scalings
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate formulas for some functions of prime numbers
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Title not available (Why is that?)
- Real two dimensional scaled matching
- The complexity of low-distortion embeddings between point sets
- Fast Multiple-Precision Evaluation of Elementary Functions
- Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
- A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
- On the Complexity of Affine Image Matching
- Pattern matching in a digitized image
- Two-dimensional pattern matching with rotations
- Digital Image Analysis
- Two-Dimensional Pattern Matching with Combined Scaling and Rotation
- Low distortion maps between point sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Faster Two Dimensional Scaled Matching
- Combinatorial Pattern Matching
Cited In (7)
- New Complexity Bounds for Image Matching under Rotation and Scaling
- The generic combinatorial algorithm for image matching with classes of projective transformations
- Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
- The exact complexity of projective image matching
- Affine image matching is uniform \({\text \textrm{TC}^0}\)-complete
- Computing upper and lower bounds of rotation angles from digital images
- RASIM: A Novel Rotation and Scale Invariant Matching of Local Image Interest Points
This page was built for publication: New complexity bounds for image matching under rotation and scaling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533416)