Sciweavers

2222 search results - page 397 / 445
» A Segmentation Algorithm for Noisy Images
Sort
View
PAMI
2007
202views more  PAMI 2007»
15 years 4 days ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—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....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
96
Voted
PRL
2007
146views more  PRL 2007»
15 years 3 days ago
Neighbor number, valley seeking and clustering
This paper proposes a novel nonparametric clustering algorithm capable of identifying shape-free clusters. This algorithm is based on a nonparametric estimation of the normalized ...
Chaolin Zhang, Xuegong Zhang, Michael Q. Zhang, Ya...
CVPR
2004
IEEE
16 years 2 months ago
From Fragments to Salient Closed Boundaries: An In-Depth Study
This paper conducts an in-depth study on a classical perceptual-organization problem: finding salient closed boundaries from a set of boundary fragments detected in a noisy image....
Song Wang, Jun Wang, Toshiro Kubota
ICCV
1999
IEEE
16 years 2 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
113
Voted
BMCBI
2008
119views more  BMCBI 2008»
15 years 22 days ago
A new method for 2D gel spot alignment: application to the analysis of large sample sets in clinical proteomics
Background: In current comparative proteomics studies, the large number of images generated by 2D gels is currently compared using spot matching algorithms. Unfortunately, differe...
Sabine Pérès, Laurence Molina, Nicol...