1391 search results - page 76 / 279 » Optimally Sparse Frames |
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper addresses the problem of video inpainting, that is seamlessly reconstructing missing portions in a set of video frames. We propose to solve this problem proceeding as f...
ICIP
1999
IEEE
16 years 1 months ago
1999
IEEE
We address in this paper the problem of optimal coding in the framework of region-based video coding systems, with a special stress on content-based functionalities. We present a ...
111
click to vote
ICIP
2010
IEEE
14 years 9 months ago
2010
IEEE
We propose a motion deblurring algorithm that exploits sparsity constraints of image patches using one single frame. In our formulation, each image patch is encoded with sparse co...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Image data are often composed of two or more geometrically distinct constituents; in galaxy catalogs, for instance, one sees a mixture of pointlike structures (galaxy supercluster...
123
click to vote
IPCO
2008
15 years 1 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...