Silhouette Area Based Similarity Measure for Template Matching in Constant Time [chapter]

Daniel Mohr, Gabriel Zachmann
2010 Lecture Notes in Computer Science  
In this paper, we present a novel, fast, resolution-independent silhouette area-based matching approach. We approximate the silhouette area by a small set of axis-aligned rectangles. This yields a very memory efficient representation of templates. In addition, utilizing the integral image, we can thus compare a silhouette with an input image at an arbitrary position in constant time. Furthermore, we present a new method to build a template hierarchy optimized for our rectangular representation
more » ... f template silhouettes. With the template hierarchy, the complexity of our matching method for n templates is O(log n). For example, we can match a hierarchy consisting of 1000 templates in 1.5ms. Overall, our contribution constitutes an important piece in the initialization stage of any tracker of (articulated) objects.
doi:10.1007/978-3-642-14061-7_5 fatcat:hi2nuivymjb3hkejziynvyygsy