Sciweavers

3110 search results - page 403 / 622
» On the initialization of the DNMF algorithm
Sort
View
AAAI
2010
15 years 8 months ago
Efficient Lifting for Online Probabilistic Inference
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
Aniruddh Nath, Pedro Domingos
COMAD
2009
15 years 7 months ago
Graph Clustering for Keyword Search
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Rose Catherine K., S. Sudarshan
ICCV
2009
IEEE
16 years 11 months ago
Globally Optimal Affine Epipolar Geometry from Apparent Contours
We study the problem of estimating the epipolar geometry from apparent contours of smooth curved surfaces with affine camera models. Since apparent contours are viewpoint depend...
Gang Li, Yanghai Tsin
ICCV
2009
IEEE
16 years 11 months ago
Learning a dense multi-view representation for detection, viewpoint classification and synthesis of object categories
Recognizing object classes and their 3D viewpoints is an important problem in computer vision. Based on a partbased probabilistic representation [31], we propose a new 3D object...
Hao Su, Min Sun, Li Fei-Fei, Silvio Savarese
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
16 years 11 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer