Sciweavers

53 search results - page 5 / 11
» Approximating Graphic TSP by Matchings
Sort
View
TSP
2010
13 years 2 months ago
Randomized and distributed self-configuration of wireless networks: two-layer Markov random fields and near-optimality
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
Sung-eok Jeon, Chuanyi Ji
ICIP
2006
IEEE
14 years 9 months ago
Invariant Geometric Representation of 3D Point Clouds for Registration and Matching
Though implicit representations of surfaces have often been used for various computer graphics tasks like modeling and morphing of objects, it has rarely been used for registratio...
Soma Biswas, Gaurav Aggarwal, Rama Chellappa
DCC
2004
IEEE
14 years 7 months ago
An Approximation to the Greedy Algorithm for Differential Compression of Very Large Files
We present a new differential compression algorithm that combines the hash value techniques and suffix array techniques of previous work. Differential compression refers to encodi...
Ramesh C. Agarwal, Suchitra Amalapurapu, Shaili Ja...
SIBGRAPI
2008
IEEE
14 years 1 months ago
Matching Photometric Observation Vectors with Shadows and Variable Albedo
We describe a procedure to solve the basic problem of Variable Lighting Photometric Stereo – namely, recovering the normal directions and intrinsic albedos at all visible points...
Helena Cristina da Gama Leitão, Rafael Feli...
CVPR
2012
IEEE
11 years 9 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun