6200 search results - page 1209 / 1240 » Color Image Segmentation |
110
click to vote
PAMI
2007
14 years 9 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
PR
2007
14 years 9 months ago
2007
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
PR
2007
14 years 9 months ago
2007
In this paper, a mean shift-based clustering algorithm is proposed. The mean shift is a kernel-type weighted mean procedure. Herein, we first discuss three classes of Gaussian, C...
RAS
2007
14 years 9 months ago
2007
In a moving agent, the different apparent motion of objects located at various distances provides an important source of depth information. While motion parallax is evident for la...
PR
2008
14 years 9 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...