Sciweavers

1021 search results - page 128 / 205
» Fast Approximate PCPs
Sort
View
TIP
1998
114views more  TIP 1998»
15 years 2 months ago
An optimal polygonal boundary encoding scheme in the rate distortion sense
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
Guido M. Schuster, Aggelos K. Katsaggelos
BMVC
2010
15 years 1 months ago
Generalized RBF feature maps for Efficient Detection
Kernel methods yield state-of-the-art performance in certain applications such as image classification and object detection. However, large scale problems require machine learning...
Sreekanth Vempati, Andrea Vedaldi, Andrew Zisserma...
FAST
2011
14 years 6 months ago
Just-in-Time Analytics on Large File Systems
As file systems reach the petabytes scale, users and administrators are increasingly interested in acquiring highlevel analytical information for file management and analysis. T...
H. Howie Huang, Nan Zhang 0004, Wei Wang, Gautam D...
ICCV
2009
IEEE
16 years 8 months ago
Sparse Representation of Cast Shadows via L1-Regularized Least Squares
Scenes with cast shadows can produce complex sets of images. These images cannot be well approximated by lowdimensional linear subspaces. However, in this paper we show that the...
Xue Mei, Haibin Ling, David W. Jacobs
CVPR
2004
IEEE
16 years 5 months ago
Segment-Based Stereo Matching Using Graph Cuts
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
Li Hong, George Chen