An Extended Scheme for Shape Matching with Local Descriptors

URI http://harp.lib.hiroshima-u.ac.jp/hiroshima-cu/metadata/12594
File
Title
An Extended Scheme for Shape Matching with Local Descriptors
Author
氏名 IWATA Kazunori
ヨミ イワタ カズノリ
別名 岩田 一貴
氏名 YAMAMOTO Hiroki
ヨミ ヤマモト ヒロキ
別名 山本 大貴
氏名 MIMURA Kazushi
ヨミ ミムラ カズシ
別名 三村 和史
Subject
shape matching
local shape descriptor
probability density estimator
branch-and-bound algorithm
Abstract

Shape matching with local descriptors is an underlyingscheme in shape analysis. We can visually confirm the matching results andalso assess them for shape classification. Generally, shape matching is im-plemented by determining the correspondence between shapes that are rep-resented by their respective sets of sampled points. Some matching meth-ods have already been proposed; the main difference between them lies intheir choice of matching cost function. This function measures the dissim-ilarity between the local distribution of sampled points around a focusingpoint of one shape and the local distribution of sampled points around areferring point of another shape. A local descriptor is used to describe thedistribution of sampled points around the point of the shape. In this paper,we propose an extended scheme for shape matching that can compensatefor errors in existing local descriptors. It is convenient for local descriptorsto adopt our scheme because it does not require the local descriptors to bemodified. The main idea of our scheme is to consider the correspondenceof neighboring sampled points to a focusing point when determining thecorrespondence of the focusing point. This is useful because it increasesthe chance of finding a suitable correspondence. However, considering thecorrespondence of neighboring points causes a problem regarding compu-tational feasibility, because there is a substantial increase in the numberof possible correspondences that need to be considered in shape match-ing. We solve this problem using a branch-and-bound algorithm, for effi-cient approximation. Using several shape datasets, we demonstrate that ourscheme yields a more suitable matching than the conventional scheme thatdoes not consider the correspondence of neighboring sampled points, eventhough our scheme requires only a small increase in execution time.

Description Peer Reviewed
Journal Title
IEICE Transactions on Information and Systems
Volume
E104-D
Issue
2
Spage
285
Epage
293
Published Date
2021-2-1
Publisher
電子情報通信学会
ISSN
09168532
17451361
NCID
AA10826272
AA11226532
AA11510321
DOI
Language
eng
NIIType
Journal Article
Text Version
出版社版
Rights
Copyright © 2021 The Institute of Electronics, Information and Communication Engineers
Relation URL(IsVersionOf)
Relation URL
Set
hiroshima-cu