Sciweavers

864 search results - page 16 / 173
» Algorithmic Differentiation: Application to Variational Prob...
Sort
View
JPDC
2006
134views more  JPDC 2006»
14 years 11 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
ICRA
2007
IEEE
107views Robotics» more  ICRA 2007»
15 years 6 months ago
Real-time keypoints matching: application to visual servoing
Abstract— Many computer vision problems such as recognition, image retrieval, and tracking require matching two images. Currently, ones try to find as reliable as possible match...
Thi-Thanh-Hai Tran, Éric Marchand
ECCV
2006
Springer
16 years 1 months ago
Variational Shape and Reflectance Estimation Under Changing Light and Viewpoints
Abstract. Fitting parameterized 3D shape and general reflectance models to 2D image data is challenging due to the high dimensionality of the problem. The proposed method combines ...
Dana Cobzas, Martin Jägersand, Neil Birkbeck,...
ICCV
2007
IEEE
16 years 1 months ago
Efficient Computation of the Inverse Gradient on Irregular Domains
The inverse gradient problem, finding a scalar field f with a gradient near a given vector field g on some bounded and connected domain Rn , can be solved by means of a Poisson ...
Gunnar Farnebäck, Hans Knutsson, Joakim Rydel...
ICIP
2009
IEEE
14 years 9 months ago
Total variation projection with first order schemes
This article proposes a new algorithm to compute the projection on the set of images whose total variation is bounded by a constant. The projection is computed through a dual form...
Mohamed-Jalal Fadili, Gabriel Peyré