Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Преобразование Хафа× | Сопоставление с шаблоном× | |
|---|---|---|
| Область | Компьютерное зрение | Компьютерное зрение |
| Семейство | Machine learning | Machine learning |
| Год появления≠ | 1962 | 1980s |
| Автор метода≠ | Paul Hough | Computer vision community |
| Тип≠ | Feature extraction and pattern recognition | Pattern matching and detection |
| Основополагающий источник≠ | Hough, P. V. C. (1962). Method and means for recognizing complex patterns. U.S. Patent 3,069,654. link ↗ | Lewis, J. P. (2004). Fast normalized cross-correlation. Vision Interface, 120–123. link ↗ |
| Другие названия | Hough Line Detection, Generalized Hough Transform | Correlation-based matching, Similarity matching |
| Связанные | 5 | 5 |
| Сводка≠ | 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. | 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. |
| ScholarGateНабор данных ↗ |
|
|