Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Metoda Lucas-Kanade× | Detekcja narożników metodą Harrisa× | |
|---|---|---|
| Dziedzina | Widzenie komputerowe | Widzenie komputerowe |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 1981 | 1988 |
| Twórca≠ | Bruce Lucas and Takeo Kanade | Chris Harris and Mike Stephens |
| Typ≠ | Optical flow and tracking | Interest point detector |
| Źródło pierwotne≠ | Lucas, B. D., & Kanade, T. (1981). An iterative image registration technique with an application to stereo vision. Proceedings of the Seventh International Joint Conference on Artificial Intelligence (IJCAI), 674–679. link ↗ | Harris, C., & Stephens, M. (1988). A combined corner and edge detector. Alvey Vision Conference, 147–152. link ↗ |
| Inne nazwy≠ | Lucas-Kanade method, Sparse optical flow | Harris Corner Detector, Harris-Stephens Detector, Plessey Operator |
| Pokrewne | 5 | 5 |
| Podsumowanie≠ | The Lucas-Kanade method, introduced by Bruce Lucas and Takeo Kanade in 1981, is a foundational technique for estimating optical flow—the apparent motion of objects in image sequences. By computing pixel-level motion vectors, the Lucas-Kanade algorithm tracks feature displacements between consecutive frames, enabling object tracking, motion estimation, and video analysis. | The Harris corner detector, introduced by Chris Harris and Mike Stephens in 1988, is a foundational method for identifying corners and interest points in digital images. Harris corners are points where two edges meet at a significant angle, making them stable and repeatable features for image analysis, matching, and 3D reconstruction. |
| ScholarGateZbiór danych ↗ |
|
|