Pages that link to "Item:Q4252321"
From MaRDI portal
The following pages link to Geometric matching under noise: Combinatorial bounds and algorithms (Q4252321):
Displaying 17 items.
- New complexity bounds for image matching under rotation and scaling (Q533416) (← links)
- Geometric pattern matching under Euclidean motion (Q676592) (← links)
- Output sensitive algorithms for approximate incidences and their applications (Q827295) (← links)
- A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation (Q1038471) (← links)
- Approximate congruence in nearly linear time (Q1869745) (← links)
- Two-dimensional pattern matching with rotations (Q1884920) (← links)
- Combinatorial and experimental methods for approximate point pattern matching (Q1889585) (← links)
- Point set pattern matching in \(d\)-dimensions (Q1891233) (← links)
- Faster balanced clusterings in high dimension (Q2006774) (← links)
- Learning the truth vector in high dimensions (Q2301361) (← links)
- Constant time approximation scheme for largest well predicted subset (Q2377379) (← links)
- Improved approximation bounds for planar point pattern matching (Q2480906) (← links)
- Constrained Branch-and-Bound algorithm for image registration (Q3367438) (← links)
- Two-Dimensional Pattern Matching with Combined Scaling and Rotation (Q3506938) (← links)
- New Complexity Bounds for Image Matching under Rotation and Scaling (Q3637109) (← links)
- Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms (Q4024310) (← links)
- (Q5111688) (← links)