1387 search results - page 118 / 278 » Convexity in Discrete Space |
143
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. Calculating a reliable similarity measure between pixel features is essential for many computer vision and image processing applications. We propose a similarity measure ...
138
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
We used a data analysis approach for selecting colour components for skin detection. The criterion for this selection was to achieve a reasonable degree of generalisation and reco...
170
click to vote
AAAI
2006
15 years 7 months ago
2006
Embedding algorithms are a method for revealing low dimensional structure in complex data. Most embedding algorithms are designed to handle objects of a single type for which pair...
160
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Maximum Variance Unfolding (MVU) and its variants have been very successful in embedding data-manifolds in lower dimensionality spaces, often revealing the true intrinsic dimensio...
132
click to vote
DAM
1999
15 years 6 months ago
1999
An ordered partition of a set of n points in the d dimensional Euclidean space is called a separable partition if the convex hulls of the parts are pairwise disjoint. For each fix...