arrow
返回

Shape retrieval with eigen-CSS search

delete2009-05-01
delete13
delete
OA
AI
M
Mark S. Drew *
T
Tim K. Lee
A
Andrew Rova
DOI:10.1016/j.imavis.2008.07.011delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Shape retrieval programs are comprised of two components: shape representation and matching algorithm. Building the representation on scale space filtering and the curvature function of a closed boundary curve, curvature scale space (CSS) has been demonstrated to be a robust 2D shape representation. The adoption of the CSS image as the default in the MPEG-7 standard, using a matching algorithm utilizing maxima of the CSS image contours, makes this feature of interest perforce. In this paper, we propose a framework in two stages for a novel approach to both representing and matching the CSS feature. Our contribution consists of three steps, each of which effects a profound speedup on CSS image matching. Each step is a well-known technique in other domains, but the proposed concatenation of steps leads to a novel approach to this subject which captures shape information more efficiently and decreases distracting noise. First, using experience derived from medical imaging, we define a set of marginal-sum features summarizing the CSS image. Second, the standard algorithm using CSS maxima involves a complicated and time-consuming search, since the zero of arc length is not known in any new contour. Here, we obviate this search via a phase normalization transform in the spatial dimension of the reduced marginal-CSS feature. Remarkably, this step also makes the method rotation- and reflection-invariant. Finally, the resulting feature space is amenable to dimension reduction via subspace projection methods, with a dramatic speedup in time, and as well orders of magnitude reduction in space. The first stage of the resultant program, using a general-purpose eigenspace, has class-categorization accuracy compatible with the original contour maxima program. In a second stage, we generate specialized eigenspaces for each shape category, with little extra runtime complexity because search can still be carried out in reduced dimensionality. In a leave-one-out categorization using the MPEG-7 contour database, a classification success rate of 94.1% over 1400 objects in 70 classes is achieved with very fast matching, and 98.6% in the top-2 classes. A leave-all-in test achieves 99.8% correct categorization. The method is rotation invariant, and is simple, fast, and effective. (C) 2008 Elsevier B.V. All rights reserved.
Keyword:
Shape
2D contour
Scale-space
Matching
Retrieval
Curvature
CSS
Eigen-analysis
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Image and Vision Computing 封面图
Image and Vision Computing
IF:
4.2
论文数:
4.1K
被引数:
6.7K

机构

S
Simon Fraser University
学者数:
1.0W
论文数: 1.0W
被引数: 1.4W
引用论文

引用论文

err分享
err收藏
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
Lysophospholipids prevent binding of a cytolytic protein ostreolysin to cholesterol-enriched membrane domains
err2008-06-01
err0
PREAI
errHelena H. Chowdhury; Katja Rebolj; Marko Kreft; Robert Zorec; Peter Maček; Kristina Sepčić
err分享
err收藏
Tics and Tourette syndrome: clinical evaluation of 44 cases
err2001-09-01
err0
errOAAI
errHélio A.G. Teive; Francisco M.B. Germiniani; Marcus V. Della Coletta; Lineu César Werneck
err分享
err收藏
err分享
err收藏
没有更多内容