Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Mallmatchning× | Hough-transformen× | |
|---|---|---|
| Ämnesområde | Datorseende | Datorseende |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 1980s | 1962 |
| Upphovsperson≠ | Computer vision community | Paul Hough |
| Typ≠ | Pattern matching and detection | Feature extraction and pattern recognition |
| Ursprungskälla≠ | Lewis, J. P. (2004). Fast normalized cross-correlation. Vision Interface, 120–123. link ↗ | Hough, P. V. C. (1962). Method and means for recognizing complex patterns. U.S. Patent 3,069,654. link ↗ |
| Alias | Correlation-based matching, Similarity matching | Hough Line Detection, Generalized Hough Transform |
| Närliggande | 5 | 5 |
| Sammanfattning≠ | Template matching is a straightforward technique for locating a known pattern (template) within a larger image. By sliding a template image across the target image and computing a similarity measure at each position, template matching identifies locations where the template appears. It is effective for simple object detection when templates are well-defined and appearance variation is limited. | The Hough Transform is a technique for detecting lines, circles, and other geometric shapes in digital images. Originally patented by Paul Hough in 1962 and popularized in computer vision by Duda and Hart in 1972, the Hough Transform converts edge points in image space to curves in a parameter space (accumulator space), where collinear or co-circular points cluster and become easily identifiable. |
| ScholarGateDatamängd ↗ |
|
|