The exact complexity of projective image matching
From MaRDI portal
Publication:736619
DOI10.1016/j.jcss.2016.06.002zbMath1348.68286OpenAlexW2468223594MaRDI QIDQ736619
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
projective transformationscomputational geometrydigital 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)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- New complexity bounds for image matching under rotation and scaling
- Faster two dimensional scaled matching
- Faster two-dimensional pattern matching with rotations
- 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
- Topology-preserving conditions for 2D digital images under rigid transformations
- On uniformity within \(NC^ 1\)
- Constant Depth Reducibility
- Two-Dimensional Pattern Matching with Combined Scaling and Rotation
- Affine Image Matching Is Uniform ${\text{\rm TC}^0}$ -Complete
- Low Distortion Maps Between Point Sets
- Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
- New Complexity Bounds for Image Matching under Rotation and Scaling
- Arithmetic, first-order logic, and counting quantifiers
- Biomedical Image Registration
This page was built for publication: The exact complexity of projective image matching
