539 search results - page 53 / 108 » Linear complexity of transformed sequences |
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
We present a multiscale method for motion segmentation. Our method begins with local, ambiguous optical flow measurements. It uses a process of aggregation to resolve the ambiguit...
CVPR
2000
IEEE
15 years 2 months ago
2000
IEEE
We have assembled a standalone, movable system that can capture long sequences of omnidirectional images (up to 1,500 images at 6.7 Hz and a resolution of 1140 × 1030). The goal ...
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
—Permutations of order N are generated using polynomials in a Galois field GF(q) where q > N+1, which can be written as a linear transformation on a vector of polynomial coeff...
TCOM
2011
14 years 4 months ago
2011
—Minimizing the sum of mean squared errors using linear transceivers under a sum power constraint in the multiuser downlink is a non-convex problem. Existing algorithms exploit a...
103
click to vote
CVPR
1998
IEEE
15 years 11 months ago
1998
IEEE
The Euclidean skeleton is essential for general shape representation. This paper provides an e cient method to extract a well-connected Euclidean skeleton by a neighbor bisector d...