7,653 research outputs found
Bounds for approximate discrete tomography solutions
In earlier papers we have developed an algebraic theory of discrete
tomography. In those papers the structure of the functions
and having given line sums in certain directions have
been analyzed. Here was a block in with sides parallel to
the axes. In the present paper we assume that there is noise in the
measurements and (only) that is an arbitrary or convex finite set in
. We derive generalizations of earlier results. Furthermore we
apply a method of Beck and Fiala to obtain results of he following type: if the
line sums in directions of a function are known, then
there exists a function such that its line sums differ by at
most from the corresponding line sums of .Comment: 16 page
Bounds for discrete tomography solutions
We consider the reconstruction of a function on a finite subset of
if the line sums in certain directions are prescribed. The real
solutions form a linear manifold, its integer solutions a grid. First we
provide an explicit expression for the projection vector from the origin onto
the linear solution manifold in the case of only row and column sums of a
finite subset of . Next we present a method to estimate the
maximal distance between two binary solutions. Subsequently we deduce an upper
bound for the distance from any given real solution to the nearest integer
solution. This enables us to estimate the stability of solutions. Finally we
generalize the first mentioned result to the torus case and to the continuous
case
MAP inference via Block-Coordinate Frank-Wolfe Algorithm
We present a new proximal bundle method for Maximum-A-Posteriori (MAP)
inference in structured energy minimization problems. The method optimizes a
Lagrangean relaxation of the original energy minimization problem using a multi
plane block-coordinate Frank-Wolfe method that takes advantage of the specific
structure of the Lagrangean decomposition. We show empirically that our method
outperforms state-of-the-art Lagrangean decomposition based algorithms on some
challenging Markov Random Field, multi-label discrete tomography and graph
matching problems
- β¦