کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
531837 | 869876 | 2016 | 15 صفحه PDF | دانلود رایگان |
• New segment-based representation that we call OPS.
• Used to achieve high flexibility that is required to account for intra-class variations.
• OPS representation is fed to a dynamic programming algorithm for robust detection.
• Very competitive localization results under extensive noise and clutter.
• The ability to accurately localize detailed object boundaries.
We introduce a simple and effective concept for localizing objects in densely cluttered edge images based on shape information. The shape information is characterized by a binary template of the object's contour, provided to search for object instances in the image. We adopt a segment-based search strategy, in which the template is divided into a set of segments. In this work, we propose our own segment representation that we call one-pixel segment (OPS), in which each pixel in the template is treated as a separate segment. This is done to achieve high flexibility that is required to account for intra-class variations. OPS representation can also handle scale changes effectively. A dynamic programming algorithm uses the OPS representation to realize the search process, enabling a detailed localization of the object boundaries in the image. The concept's simplicity is reflected in the ease of implementation, as the paper's title suggests. The algorithm works directly with very noisy edge images extracted using the Canny edge detector, without the need for any preprocessing or learning steps. We present our experiments and show that our results outperform those of very powerful, state-of-the-art algorithms.
Journal: Pattern Recognition - Volume 60, December 2016, Pages 458–472