Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Виявлення країв за Канним× | Перетворення Гафа× | |
|---|---|---|
| Галузь | Комп'ютерний зір | Комп'ютерний зір |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 1986 | 1962 |
| Автор методу≠ | John Canny | Paul Hough |
| Тип≠ | Image gradient analysis | Feature extraction and pattern recognition |
| Основоположне джерело≠ | Canny, J. (1986). A computational approach to edge detection. IEEE Transactions on Pattern Analysis and Machine Intelligence, 8(6), 679–698. DOI ↗ | Hough, P. V. C. (1962). Method and means for recognizing complex patterns. U.S. Patent 3,069,654. link ↗ |
| Інші назви | Canny operator, Canny edge detector | Hough Line Detection, Generalized Hough Transform |
| Пов'язані | 5 | 5 |
| Підсумок≠ | 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. | 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. |
| ScholarGateНабір даних ↗ |
|
|