1492 search results - page 61 / 299 » Geometric Clustering Using the Information Bottleneck Method |
181
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
A new image segmentation method is proposed to combine the edge information with the feature-space method, K-Means clustering. A procedure called seam processing, which is computa...
169
click to vote
SIGIR
2010
ACM
15 years 6 months ago
2010
ACM
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
130
click to vote
DAGM
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we address one of the standard problems of image processing and computer vision: The detection of points of interest (POI). We propose two new approaches for improvin...
169
click to vote
ICML
2005
IEEE
16 years 6 months ago
2005
IEEE
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
157
click to vote
COMPGEOM
1999
ACM
15 years 10 months ago
1999
ACM
We propose a speed-up method for discrete-event simulations, including sweep-line or -plane techniques, requiring the repeated calculation of the times at which certain discrete e...