An elastic partial shape matching technique |
| |
Authors: | Longin Jan Latecki [Author Vitae] Vasileios Megalooikonomou [Author Vitae]Author Vitae] Deguang Yu [Author Vitae] |
| |
Affiliation: | Computer and Information Sciences Department, Temple University, 1805 North Broad Street, Philadelphia, PA 19122, USA |
| |
Abstract: | We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that best matches a query. In the proposed algorithm we map the problem of the best matching subsequence to the problem of a cheapest path in a directed acyclic graph (DAG). The approach allows us to compute the optimal scale and translation of sequence values, which is a nontrivial problem in the case of subsequence matching. Our experimental results demonstrate that the proposed algorithm outperforms the commonly used techniques in retrieval accuracy. |
| |
Keywords: | Shape similarity Sequences matching DAG Shortest path |
本文献已被 ScienceDirect 等数据库收录! |