New complexity bounds for image matching under rotation and scaling

DOI10.1016/J.JDA.2010.06.002MaRDI QIDQ533416zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

combinatorial pattern matchingdesign and analysis of algorithmsdigital image matchingdiscrete rotations and scalings

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Analysis of algorithms (68W40)

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

Cites work

• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 1305437 (Why is no real title available?)
• scientific article; zbMATH DE number 2021122 (Why is no real title available?)
• scientific article; zbMATH DE number 1465025 (Why is no real title available?)
• scientific article; zbMATH DE number 2087057 (Why is no real title available?)
• scientific article; zbMATH DE number 3092634 (Why is no real title available?)
• A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
• Approximate formulas for some functions of prime numbers
• Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
• Combinatorial Pattern Matching
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Digital Image Analysis
• Fast Multiple-Precision Evaluation of Elementary Functions
• Faster Two Dimensional Scaled Matching
• Low distortion maps between point sets
• On the Complexity of Affine Image Matching
• Pattern matching in a digitized image
• Real two dimensional scaled matching
• The complexity of low-distortion embeddings between point sets
• Two-Dimensional Pattern Matching with Combined Scaling and Rotation
• Two-dimensional pattern matching with rotations

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)