Learning prototypical shapes for object categories

Computer Vision and Pattern Recognition Workshops(2010)

引用 11|浏览22
暂无评分
摘要
We describe a method to compute the prototypical shapes for object categories using the shock graph representation. Given a set of category exemplars, we determine a prototypical shape for this category by estimating the Karcher mean of the shock graphs of the exemplar shapes. The method is described in three steps. First, we derive an iterative method to average N points in an abstract continuous metric space with well-defined geodesics and well-defined mid-point of geodesics. Second, we show how two shapes can be averaged by finding the mid-point of the geodesic induced by the edit-distance shock graph matching. Third, the above two steps are combined with a gradient descent step to compute the average of a set of N exemplar shapes. We evaluate each of the three steps with experiments using standard shape datasets.
更多
查看译文
关键词
computational geometry,differential geometry,graph theory,image matching,image segmentation,iterative methods,matrix algebra,karcher mean estimation,abstract continuous metric space,exemplar shape,geodesics,iterative method,object category,prototypical shape,shock graph matching,shock graph representation,shape,gradient descent,convergence,edit distance,metric space,topology,active shape model,graph representation,euclidean distance,graph matching,iteration method,prototypes
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要