11,021 research outputs found
Shapes From Pixels
Continuous-domain visual signals are usually captured as discrete (digital)
images. This operation is not invertible in general, in the sense that the
continuous-domain signal cannot be exactly reconstructed based on the discrete
image, unless it satisfies certain constraints (\emph{e.g.}, bandlimitedness).
In this paper, we study the problem of recovering shape images with smooth
boundaries from a set of samples. Thus, the reconstructed image is constrained
to regenerate the same samples (consistency), as well as forming a shape
(bilevel) image. We initially formulate the reconstruction technique by
minimizing the shape perimeter over the set of consistent binary shapes. Next,
we relax the non-convex shape constraint to transform the problem into
minimizing the total variation over consistent non-negative-valued images. We
also introduce a requirement (called reducibility) that guarantees equivalence
between the two problems. We illustrate that the reducibility property
effectively sets a requirement on the minimum sampling density. One can draw
analogy between the reducibility property and the so-called restricted isometry
property (RIP) in compressed sensing which establishes the equivalence of the
minimization with the relaxed minimization. We also evaluate
the performance of the relaxed alternative in various numerical experiments.Comment: 13 pages, 14 figure
An Efficient Algorithm for Video Super-Resolution Based On a Sequential Model
In this work, we propose a novel procedure for video super-resolution, that
is the recovery of a sequence of high-resolution images from its low-resolution
counterpart. Our approach is based on a "sequential" model (i.e., each
high-resolution frame is supposed to be a displaced version of the preceding
one) and considers the use of sparsity-enforcing priors. Both the recovery of
the high-resolution images and the motion fields relating them is tackled. This
leads to a large-dimensional, non-convex and non-smooth problem. We propose an
algorithmic framework to address the latter. Our approach relies on fast
gradient evaluation methods and modern optimization techniques for
non-differentiable/non-convex problems. Unlike some other previous works, we
show that there exists a provably-convergent method with a complexity linear in
the problem dimensions. We assess the proposed optimization method on {several
video benchmarks and emphasize its good performance with respect to the state
of the art.}Comment: 37 pages, SIAM Journal on Imaging Sciences, 201
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
The affine rank minimization problem consists of finding a matrix of minimum
rank that satisfies a given system of linear equality constraints. Such
problems have appeared in the literature of a diverse set of fields including
system identification and control, Euclidean embedding, and collaborative
filtering. Although specific instances can often be solved with specialized
algorithms, the general affine rank minimization problem is NP-hard. In this
paper, we show that if a certain restricted isometry property holds for the
linear transformation defining the constraints, the minimum rank solution can
be recovered by solving a convex optimization problem, namely the minimization
of the nuclear norm over the given affine space. We present several random
ensembles of equations where the restricted isometry property holds with
overwhelming probability. The techniques used in our analysis have strong
parallels in the compressed sensing framework. We discuss how affine rank
minimization generalizes this pre-existing concept and outline a dictionary
relating concepts from cardinality minimization to those of rank minimization
- …