Sciweavers

4343 search results - page 786 / 869
» Segmentation from a Box
Sort
View
PAMI
2007
202views more  PAMI 2007»
13 years 8 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
PR
2007
293views more  PR 2007»
13 years 8 months ago
Mean shift-based clustering
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...
Kuo-Lung Wu, Miin-Shen Yang
PR
2008
170views more  PR 2008»
13 years 8 months ago
Annealing and the normalized N-cut
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...
Tomás Gedeon, Albert E. Parker, Collette Ca...
HVEI
2010
13 years 7 months ago
Quantifying the relationship between visual salience and visual importance
This paper presents the results of two psychophysical experiments and an associated computational analysis designed to quantify the relationship between visual salience and visual...
Junle Wang, Damon M. Chandler, Patrick Le Callet
IOR
2010
99views more  IOR 2010»
13 years 7 months ago
Dynamic Pricing with a Prior on Market Response
We study a problem of dynamic pricing faced by a vendor with limited inventory, uncertain about demand, aiming to maximize expected discounted revenue over an infinite time horiz...
Vivek F. Farias, Benjamin Van Roy