| Item type |
学術雑誌論文 / Journal Article(1) |
| 公開日 |
2023-03-07 |
| タイトル |
|
|
タイトル |
An Extended Scheme for Shape Matching with Local Descriptors |
| 言語 |
|
|
言語 |
eng |
| キーワード |
|
|
主題 |
shape matching |
| キーワード |
|
|
主題 |
local shape descriptor |
| キーワード |
|
|
主題 |
probability density estimator |
| キーワード |
|
|
主題 |
branch-and-bound algorithm |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_6501 |
|
資源タイプ |
journal article |
| 著者 |
IWATA, Kazunori
YAMAMOTO, Hiroki
MIMURA, Kazushi
岩田, 一貴
山本, 大貴
三村, 和史
|
| 抄録 |
|
|
内容記述タイプ |
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. |
| 書誌情報 |
IEICE Transactions on Information and Systems
巻 E104-D,
号 2,
p. 285-293,
発行日 2021-02-01
|
| 出版者 |
|
|
出版者 |
電子情報通信学会 |
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
09168532|17451361 |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AA10826272|AA11226532|AA11510321 |
| DOI |
|
|
関連タイプ |
isIdenticalTo |
|
|
識別子タイプ |
DOI |
|
|
関連識別子 |
info:doi/https://doi.org/10.1587/transinf.2020EDP7134 |
| 権利 |
|
|
権利情報 |
Copyright © 2021 The Institute of Electronics, Information and Communication Engineers |
| 関連サイト |
|
|
|
識別子タイプ |
URI |
|
|
関連識別子 |
https://search.ieice.org/ |
|
|
関連名称 |
https://search.ieice.org/ |
| 他の資源との関係 |
|
|
|
関連名称 |
https://search.ieice.org/bin/pdf_link.php?category=D&lang=E&year=2021&fname=e104-d_2_285&abst= |
| フォーマット |
|
|
内容記述タイプ |
Other |
|
内容記述 |
application/pdf |
| 著者版フラグ |
|
|
出版タイプ |
VoR |
|
出版タイプResource |
http://purl.org/coar/version/c_970fb48d4fbd8a85 |
e104-d_2_285.pdf (424.9 kB)
