Sciweavers

3641 search results - page 593 / 729
» On Computability of Pattern Recognition Problems
Sort
View
CA
2002
IEEE
14 years 3 months ago
Polyhedral Object Detection and Pose Estimation for Augmented Reality Applications
In augmented reality applications, tracking and registration of both cameras and objects is required because, to combine real and rendered scenes, we must project synthetic models...
Ali Shahrokni, Luca Vacchetti, Vincent Lepetit, Pa...
WSCG
2004
185views more  WSCG 2004»
13 years 11 months ago
Automatic Fitting and Control of Complex Freeform Shapes in 3-D
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
Yu Song, Joris S. M. Vergeest, Chensheng Wang
ECCV
2010
Springer
13 years 10 months ago
Superpixels and Supervoxels in an Energy Optimization Framework
Many methods for object recognition, segmentation, etc., rely on tessellation of an image into "superpixels". A superpixel is an image patch which is better aligned with ...
Olga Veksler, Yuri Boykov, Paria Mehrani
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 10 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
14 years 3 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour