2434 search results - page 383 / 487 » Algorithmic Randomness of Closed Sets |
130
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
130
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
Skeletonization algorithms typically decompose an object’s
silhouette into a set of symmetric parts, offering a
powerful representation for shape categorization. However,
havi...
106
Voted
DCC
2006
IEEE
16 years 3 months ago
2006
IEEE
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...
123
click to vote
ICCV
2005
IEEE
15 years 9 months ago
2005
IEEE
Convexity is an important geometric property of many natural and man-made structures. Prior research has shown that it is imperative to many perceptual-organization and imageunder...
128
click to vote
ICCS
2005
Springer
2005
Springer
Towards a Bayesian Approach to Robust Finding Correspondences in Multiple View Geometry Environments
15 years 9 months ago
Abstract. This paper presents a new Bayesian approach to the problem of finding correspondences of moving objects in a multiple calibrated camera environment. Moving objects are d...