The exact complexity of projective image matching
DOI10.1016/J.JCSS.2016.06.002zbMATH Open1348.68286OpenAlexW2468223594MaRDI QIDQ736619FDOQ736619
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
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
computational geometryprojective transformationsdigital image matchingdesign and analysis of parallel algorithmsdiscretization of function spaces
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Cites Work
- Biomedical Image Registration
- On uniformity within \(NC^ 1\)
- Real two dimensional scaled matching
- Faster two dimensional scaled matching
- The complexity of low-distortion embeddings between point sets
- 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
- Faster two-dimensional pattern matching with rotations
- Topology-preserving conditions for 2D digital images under rigid transformations
- Pattern matching in a digitized image
- Two-dimensional pattern matching with rotations
- Constant Depth Reducibility
- Two-Dimensional Pattern Matching with Combined Scaling and Rotation
- Title not available (Why is that?)
- New complexity bounds for image matching under rotation and scaling
- Arithmetic, first-order logic, and counting quantifiers
- Affine image matching is uniform \({\text \textrm{TC}^0}\)-complete
- Low Distortion Maps Between Point Sets
- New Complexity Bounds for Image Matching under Rotation and Scaling
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)
