Sciweavers

1133 search results - page 9 / 227
» Basics of Graph Cuts
Sort
View
CVGIP
2008
108views more  CVGIP 2008»
13 years 7 months ago
Efficient texture synthesis using strict Wang Tiles
Wang Tiles are constructed from four texture samples, arranged so they can always match a choice of other tiles at two edges. Because they are precomputed, Wang Tiles are a very e...
Xinyu Zhang, Young J. Kim
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 11 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
ICPR
2008
IEEE
14 years 2 months ago
Graph cut based deformable model with statistical shape priors
This paper presents a novel graph cut based segmentation approach with shape priors. The model incorporates statistical shape prior information with the active contour without edg...
Noha Youssry El-Zehiry, Adel Elmaghraby
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 9 months ago
Clustering by weighted cuts in directed graphs
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...
Marina Meila, William Pentney
WWW
2008
ACM
14 years 8 months ago
SPARQL basic graph pattern optimization using selectivity estimation
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
Markus Stocker, Andy Seaborne, Abraham Bernstein, ...