The exact complexity of projective image matching

DOI10.1016/J.JCSS.2016.06.002MaRDI QIDQ736619zbMATH OpenOpenAlexFDO

Authors Christian Rosenke

Publication date 4 August 2016

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2016.06.002

zbMATH Keywords

computational geometryprojective transformationsdigital image matchingdesign and analysis of parallel algorithmsdiscretization of function spaces

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• Affine image matching is uniform \({\text \textrm{TC}^0}\)-complete
• Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
• On the Complexity of Affine Image Matching
• The generic combinatorial algorithm for image matching with classes of projective transformations
• New complexity bounds for image matching under rotation and scaling

Cites work

• scientific article; zbMATH DE number 2087057 (Why is no real title available?)
• A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
• Affine image matching is uniform \({\text \textrm{TC}^0}\)-complete
• Arithmetic, first-order logic, and counting quantifiers
• Biomedical Image Registration
• Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
• Constant Depth Reducibility
• Faster two dimensional scaled matching
• Faster two-dimensional pattern matching with rotations
• Low Distortion Maps Between Point Sets
• New Complexity Bounds for Image Matching under Rotation and Scaling
• New complexity bounds for image matching under rotation and scaling
• On uniformity within \(NC^ 1\)
• Pattern matching in a digitized image
• Real two dimensional scaled matching
• The complexity of low-distortion embeddings between point sets
• Topology-preserving conditions for 2D digital images under rigid transformations
• Two-Dimensional Pattern Matching with Combined Scaling and Rotation
• Two-dimensional pattern matching with rotations

Cited in

(4)

• The generic combinatorial algorithm for image matching with classes of projective transformations
• The Augmented Homogeneous Coordinates Matrix-Based Projective Mismatch Removal for Partial-Duplicate Image Search
• Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
• Affine image matching is uniform \({\text \textrm{TC}^0}\)-complete

This page was built for publication: The exact complexity of projective image matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q736619)