Sciweavers

21 search results - page 2 / 5
» A Fast Leading Eigenvector Approximation for Segmentation an...
Sort
View
CVPR
2011
IEEE
13 years 1 months ago
Nonparametric Density Estimation on A Graph: Learning Framework, Fast Approximation and Application in Image Segmentation
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...
Zhiding Yu, Oscar Au, Ketan Tang
EMMCVPR
2001
Springer
13 years 9 months ago
Grouping with Directed Relationships
Abstract. Grouping is a global partitioning process that integrates local cues distributed over the entire image. We identify four types of pairwise relationships, attraction and r...
Stella X. Yu, Jianbo Shi
CVPR
2005
IEEE
14 years 7 months ago
A Tensor Decomposition for Geometric Grouping and Segmentation
While spectral clustering has been applied successfully to problems in computer vision, their applicability is limited to pairwise similarity measures that form a probability matr...
Venu Madhav Govindu
ICCV
2009
IEEE
14 years 10 months ago
Multiscale Symmetric Part Detection and Grouping
Skeletonization algorithms typically decompose an object’s silhouette into a set of symmetric parts, offering a powerful representation for shape categorization. However, havi...
Alex Levinshtein, Sven Dickinson, Cristian Sminchi...
CVPR
2009
IEEE
1696views Computer Vision» more  CVPR 2009»
15 years 14 days ago
Fast Normalized Cut with Linear Constraints
Normalized Cut is a widely used technique for solving a variety of problems. Although finding the optimal normalized cut has proven to be NP-hard, spectral relaxations can be ap...
Linli Xu (University of Alberta), Wenye Li (Univer...