Shape matching by random sampling
From MaRDI portal
Publication:441886
DOI10.1016/j.tcs.2010.03.023zbMath1280.68265OpenAlexW2149949867MaRDI QIDQ441886
Publication date: 8 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.023
Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic matching of planar regions
- Invariant characterisation of the Hough transform for pose estimation of arbitrary shapes
- On computing a set of points meeting every cell defined by a family of polynomials on a variety
- Approximate matching of polygonal shapes
- Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Matching planar maps
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Probability and Computing
- Algorithms and Computation
This page was built for publication: Shape matching by random sampling