Sciweavers

214 search results - page 27 / 43
» Note on Sparse Random Graphs and Cover Graphs
Sort
View
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 8 months ago
On the bias of BFS
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
CVIU
2007
113views more  CVIU 2007»
13 years 7 months ago
Primal sketch: Integrating structure and texture
This article proposes a generative image model, which is called ‘‘primal sketch,’’ following Marr’s insight and terminology. This model combines two prominent classes of...
Cheng-en Guo, Song Chun Zhu, Ying Nian Wu
ECCV
2006
Springer
14 years 9 months ago
PoseCut: Simultaneous Segmentation and 3D Pose Estimation of Humans Using Dynamic Graph-Cuts
Abstract. We present a novel algorithm for performing integrated segmentation and 3D pose estimation of a human body from multiple views. Unlike other related state of the art tech...
Matthieu Bray, Pushmeet Kohli, Philip H. S. Torr
CVPR
2011
IEEE
13 years 3 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
PAMI
2010
207views more  PAMI 2010»
13 years 2 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf