IS-Match: Partial Shape Matching by Efficiently Solving an Order Preserving Assignment Problem
نویسندگان
چکیده
منابع مشابه
IS-Match: Partial Shape Matching by Efficiently Solving an Order Preserving Assignment Problem
This paper introduces a novel efficient partial shape matching method named IS-Match. We use sampled points from the silhouette as a shape representation. The sampled points can be ordered which in turn allows to formulate the matching step as an order-preserving assignment problem. We propose an angle descriptor between shape chords combining the advantages of global and local shape descriptio...
متن کاملPartial shape-preserving splines
A complex geometric shape is often a composition of a set of simple ones, which may differ from each other in terms of their mathematical representations and the ways in which they are constructed. One of the necessary requirements in combining these simple shapes is that their original shapes can be preserved as much as possible. In this paper, a set of partial shape-preserving (PSP) spline ba...
متن کاملEfficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenics
A general weapon-target assignment (WTA) problem is to find a proper assignment of weapons to targets with the objective of minimizing the expected damage of own-force asset. Genetic algorithms (GAs) are widely used for solving complicated optimization problems, such as WTA problems. In this paper, a novel GA with greedy eugenics is proposed. Eugenics is a process of improving the quality of of...
متن کاملAn Encoding for Order-Preserving Matching
Encoding data structures store enough information to answer the queries they are meant to support but not enough to recover their underlying datasets. In this paper we give the first encoding data structure for the challenging problem of order-preserving pattern matching. This problem was introduced only a few years ago but has already attracted significant attention because of its applications...
متن کاملOrder-preserving matching
We introduce a new string matching problem called order-preserving matching on numeric strings where a pattern matches a text if the text contains a substring whose relative orders coincide with those of the pattern. Order-preserving matching is applicable to many scenarios such as stock price analysis and musical melody matching in which the order relations should be matched instead of the str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IPSJ Transactions on Computer Vision and Applications
سال: 2010
ISSN: 1882-6695
DOI: 10.2197/ipsjtcva.2.224