Sciweavers

Share
5 search results - page 1 / 1
» Weighted Graph Cuts without Eigenvectors A Multilevel Approa...
Sort
View
PAMI
2007
202views more  PAMI 2007»
9 years 10 months 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
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
10 years 11 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
ICAPR
2005
Springer
10 years 4 months ago
Weighted Adaptive Neighborhood Hypergraph Partitioning for Image Segmentation
Abstract. The aim of this paper is to present an improvement of a previously published algorithm. The proposed approach is performed in two steps. In the first step, we generate t...
Soufiane Rital, Hocine Cherifi, Serge Miguet
SMI
2006
IEEE
108views Image Analysis» more  SMI 2006»
10 years 4 months ago
Segmenting Point Sets
There is a growing need to extract features from point sets for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sam...
Ichitaro Yamazaki, Vijay Natarajan, Zhaojun Bai, B...
PAMI
2007
169views more  PAMI 2007»
9 years 10 months ago
Estimating Optimal Parameters for MRF Stereo from a Single Image Pair
—This paper presents a novel approach for estimating the parameters for MRF-based stereo algorithms. This approach is based on a new formulation of stereo as a maximum a posterio...
Li Zhang, Steven M. Seitz
books