5019 search results - page 71 / 1004 » On the Reflexivity of Point Sets |
132
click to vote
ICPR
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper we introduce a robust matching technique that allows to operate a very accurate selection of corresponding feature points from multiple views. Robustness is achieved...
168
click to vote
SIAMDM
2011
15 years 1 months ago
2011
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...
180
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
We introduce a shape descriptor that is based on the Symmetry Set. This set represents pairwise symmetric points and consists of several branches. The begin and end points of the ...
174
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
—The problem we address in the paper is how to learn a joint representation from data lying on multiple manifolds. We are given multiple data sets and there is an underlying comm...
156
click to vote
DCG
2010
15 years 6 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...