Sciweavers

517 search results - page 30 / 104
» An Approximate Algorithm for Structural Matching of Images
Sort
View
CVPR
2008
IEEE
14 years 10 months ago
Skeletal graphs for efficient structure from motion
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-...
Noah Snavely, Steven M. Seitz, Richard Szeliski
ICIP
2005
IEEE
14 years 9 months ago
The M-term pursuit for image representation and progressive compression
This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable ...
Adel Rahmoune, Pierre Vandergheynst, Pascal Frossa...
ICRA
2007
IEEE
107views Robotics» more  ICRA 2007»
14 years 2 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
14 years 9 months ago
Curvature-Preserving Regularization of Multi-valued Images Using PDE's
Abstract. We are interested in diffusion PDE's for smoothing multi-valued images in an anisotropic manner. By pointing out the pros and cons of existing tensor-driven regulari...
David Tschumperlé
PVLDB
2010
110views more  PVLDB 2010»
13 years 6 months ago
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...