Sciweavers

446 search results - page 59 / 90
» A fast algorithm for computing steiner edge connectivity
Sort
View
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
13 years 7 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
CVPR
2010
IEEE
13 years 5 months ago
Common visual pattern discovery via spatially coherent correspondences
We investigate how to discover all common visual patterns within two sets of feature points. Common visual patterns generally share similar local features as well as similar spati...
Hairong Liu, Shuicheng Yan
ICCV
2009
IEEE
14 years 10 months ago
Image Saliency by Isocentric Curvedness and Color
In this paper we propose a novel computational method to infer visual saliency in images. The method is based on the idea that salient objects should have local characteristics tha...
Roberto Valenti
ICIP
2002
IEEE
14 years 14 days ago
Wavelet-domain reconstruction of lost blocks in wireless image transmission and packet-switched networks
— A fast scheme for wavelet-domain interpolation of lost image blocks in wireless image transmission is presented in this paper. The algorithm is designed to be compatible with t...
Shantanu Rane, Jeremiah Remus, Guillermo Sapiro
ICIP
2003
IEEE
14 years 9 months ago
An adaptive multigrid algorithm for region of interest diffuse optical tomography
Dueto diffuse nature of lightphotons, Diffuse Optical Tomography (DOT) image reconstruction is a challenging 3D problem with a relatively large number of unknowns and limited meas...
Murat Guven, Birsen Yazici, Xavier Intes, Britton ...