Sciweavers

35 search results - page 6 / 7
» Colorings and Orientations of Matrices and Graphs
Sort
View
CVPR
1997
IEEE
13 years 10 months ago
FOCUS: Searching for Multi-colored Objects in a Diverse Image Database
We describe a new multi-phase, color-based image retrieval system, FOCUS Fast Object Color-based qUery System, with an online user interface which is capable of identifying mult...
Madirakshi Das, Edward M. Riseman, Bruce A. Draper
DAM
2011
13 years 1 months ago
A study of 3-arc graphs
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph ...
Martin Knor, Guangjun Xu, Sanming Zhou
DAM
2010
137views more  DAM 2010»
13 years 6 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
CIMAGING
2009
274views Hardware» more  CIMAGING 2009»
13 years 7 months ago
Image zooming with contour stencils
We introduce "contour stencils" as a simple method for detecting the local orientation of image contours and apply this detection to image zooming. Our approach is motiv...
Pascal Getreuer
ICMCS
2007
IEEE
203views Multimedia» more  ICMCS 2007»
14 years 18 days ago
Efficient Video Object Segmentation by Graph-Cut
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
Jinjun Wang, Wei Xu, Shenghuo Zhu, Yihong Gong