Sciweavers

6005 search results - page 167 / 1201
» Graph-Theoretical Methods in Computer Vision
Sort
View
ICCV
2009
IEEE
16 years 4 months ago
Recovering Planar Homographies between 2D Shapes
Images taken from different views of a planar object are related by planar homography. Recovering the parameters of such transformations is a fundamental problem in computer vis...
Jozsef Nemeth, Csaba Domokos, Zoltan Kato
92
Voted
CVPR
2005
IEEE
16 years 2 months ago
Energy Minimization via Graph Cuts: Settling What is Possible
The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions can be minimized via graph cuts? This question was fi...
Daniel Freedman, Petros Drineas
94
Voted
ICPR
2000
IEEE
16 years 1 months ago
Using Temporal Integration for Tracking Regions in Traffic Monitoring Sequences
This paper1 describes a method for tracking regions in image sequences. Regions segmented from each frame by a motion segmentation technique are matched by using a relaxation proc...
Filiberto Pla, Jorge Badenas, José M. Sanch...
110
Voted
CVPR
2010
IEEE
15 years 8 months ago
Fast Matting Using Large Kernel Matting Laplacian Matrices
Image matting is of great importance in both computer vision and graphics applications. Most existing state-of-the-art techniques rely on large sparse matrices such as the matting ...
Kaiming He, Jian Sun, Xiaoou Tang
75
Voted
ICPR
2008
IEEE
15 years 7 months ago
Metal-dielectric object classification by polarization degree map
Material classification of object surfaces from captured image data is an essential problem in computer vision. The present paper proposes a method for stably classifying the mate...
Shoji Tominaga, Tetsuya Yamamoto