পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| Hough Transform× | টেমপ্লেট ম্যাচিং× | |
|---|---|---|
| ক্ষেত্র | কম্পিউটার দৃষ্টি | কম্পিউটার দৃষ্টি |
| পরিবার | 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ডেটাসেট ↗ |
|
|