Silhouette Area Based Similarity Measure for Template Matching in Constant Time

Abstract. 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 of template silhouettes. With the template hierarchy, the complexity of our matching method for n templates is O(log n).

• Type: Conference
• Year: 2010
• Where: AMDO
• Authors: Daniel Mohr, Gabriel Zachmann
• Keywords: AMDO 2010, Area-based Matching Approach, Computer Graphics, Memory Efficient Representation, Silhouette