New Complexity Bounds for Image Matching under Rotation and Scaling
From MaRDI portal
Recommendations
- New complexity bounds for image matching under rotation and scaling
- Two-Dimensional Pattern Matching with Combined Scaling and Rotation
- 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
Cites work
- A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
- 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
- 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?)
- 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
(9)- Computing upper and lower bounds of rotation angles from digital images
- A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
- The generic combinatorial algorithm for image matching with classes of projective transformations
- Affine image matching is uniform \({\text \textrm{TC}^0}\)-complete
- On the Complexity of Affine Image Matching
- Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
- RASIM: A Novel Rotation and Scale Invariant Matching of Local Image Interest Points
- New complexity bounds for image matching under rotation and scaling
- The exact complexity of projective image matching
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 Q3637109)
