Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Преобразование Хафа× | Детектор границ Канни× | |
|---|---|---|
| Область | Компьютерное зрение | Компьютерное зрение |
| Семейство | Machine learning | Machine learning |
| Год появления≠ | 1962 | 1986 |
| Автор метода≠ | Paul Hough | John Canny |
| Тип≠ | Feature extraction and pattern recognition | Image gradient analysis |
| Основополагающий источник≠ | Hough, P. V. C. (1962). Method and means for recognizing complex patterns. U.S. Patent 3,069,654. link ↗ | Canny, J. (1986). A computational approach to edge detection. IEEE Transactions on Pattern Analysis and Machine Intelligence, 8(6), 679–698. DOI ↗ |
| Другие названия | Hough Line Detection, Generalized Hough Transform | Canny operator, Canny edge detector |
| Связанные | 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. | The Canny edge detector, introduced by John Canny in 1986, is a multi-stage algorithm for identifying edges in digital images where significant intensity changes occur. Canny's method is optimal for step edges in additive Gaussian noise and remains the gold standard for edge detection in computer vision due to its mathematical elegance and practical effectiveness. |
| ScholarGateНабор данных ↗ |
|
|