Sciweavers

26 search results - page 3 / 6
» Graph commute times for image representation
Sort
View
JEI
2007
144views more  JEI 2007»
13 years 7 months ago
Cost-based closed-contour representations
This paper presents an efficient technique for linking edge points in order to generate a closed-contour representation. It is based on the consecutive use of global and local sch...
Angel Domingo Sappa, Boris Xavier Vintimilla
EMMCVPR
2007
Springer
14 years 1 months ago
Bayesian Inference for Layer Representation with Mixed Markov Random Field
Abstract. This paper presents a Bayesian inference algorithm for image layer representation [26], 2.1D sketch [6], with mixed Markov random field. 2.1D sketch is an very important...
Ru-Xin Gao, Tianfu Wu, Song Chun Zhu, Nong Sang
PVLDB
2010
129views more  PVLDB 2010»
13 years 5 months ago
iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques
Graphs are of growing importance in modeling complex structures such as chemical compounds, proteins, images, and program dependence. Given a query graph Q, the subgraph isomorphi...
Wook-Shin Han, Jinsoo Lee, Minh-Duc Pham, Jeffrey ...
CVPR
2009
IEEE
15 years 2 months ago
Multiplicative Nonnegative Graph Embedding
In this paper, we study the problem of nonnegative graph embedding, originally investigated in [14] for reaping the benefits from both nonnegative data factorization and the spe...
Changhu Wang (University of Science and Technology...
CVPR
2005
IEEE
14 years 9 months ago
Particle Filtering for Geometric Active Contours with Application to Tracking Moving and Deforming Objects
Geometric active contours are formulated in a manner which is parametrization independent. As such, they are amenable to representation as the zero level set of the graph of a hig...
Yogesh Rathi, Namrata Vaswani, Allen Tannenbaum, A...