Sciweavers

13280 search results - page 506 / 2656
» Bagging in Computer Vision
Sort
View
CVPR
2009
IEEE
17 years 2 months ago
Efficient Reduction of L-infinity Geometry Problems
This paper presents a new method for computing optimal L1 solutions for vision geometry problems, particularly for those problems of fixed-dimension and of large-scale. Our strat...
Hongdong Li (Australian National University)
ICCV
2009
IEEE
16 years 11 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
CVPR
1998
IEEE
16 years 9 months ago
Markov Random Fields with Efficient Approximations
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
Yuri Boykov, Olga Veksler, Ramin Zabih
CVPR
2001
IEEE
16 years 9 months ago
Feature Reduction and Hierarchy of Classifiers for Fast Object Detection in Video Images
We present a two-step method to speed-up object detection systems in computer vision that use Support Vector Machines (SVMs) as classifiers. In a first step we perform feature red...
Bernd Heisele, Thomas Serre, Sayan Mukherjee, Toma...
CVPR
2003
IEEE
16 years 9 months ago
On Region Merging: The Statistical Soundness of Fast Sorting, with Applications
This work explores a statistical basis for a process often described in computer vision: image segmentation by region merging following a particular order in the choice of regions...
Frank Nielsen, Richard Nock