Parameter Settings for Reconstructing Binary Matrices from Fan-beam Projections

Nagy, Antal; Kuba, Attila
June 2006
Journal of Computing & Information Technology;Jun2006, Vol. 14 Issue 2, p101
Academic Journal
The problem of reconstruction of binary matrices from their fan-beam projections is studied. A fan-beam projection model is implemented and used in systematic experiments in order to determine the optimal parameter values for data acquisition and reconstruction algorithm. The fan-beam model, the reconstruction algorithm, the simulation experiments, and the results are discussed in the paper.


Related Articles

  • STABLE EXTENSIVE GAME FORMS. Ichiishi, Tatsuro // Mathematics of Operations Research;Nov87, Vol. 12 Issue 4, p626 

    Peleg established a fundamental theorem which says that convex effectivity functions are stable. He also proved its partial converse: Within the class of maximal effectivity functions, stability implies convexity. The present paper provides another partial converse: Within the class of...

  • A geometric characterization of �optimality-equivalent� relaxations. Ameur, Walid; Neto, Jos� // Journal of Global Optimization;Dec2008, Vol. 42 Issue 4, p533 

    An optimization problem is defined by an objective function to be maximized with respect to a set of constraints. To overcome some theoretical and practical difficulties, the constraint-set is sometimes relaxed and �easier� problems are solved. This led us to study relaxations...

  • Quantum tomography with wavelet transform in Banach space on homogeneous space. Mirzaee, M.; Rezaei, M.; Jafarizadeh, M. A. // European Physical Journal B -- Condensed Matter;Nov2007, Vol. 60 Issue 2, p193 

    In this study the intimate connection is established between the Banach space wavelet reconstruction method on homogeneous spaces with both singular and nonsingular vacuum vectors, and some of the well known quantum tomographies, such as: Moyal-representation for a spin, discrete phase space...

  • Vector and matrix apportionment problems and separable convex integer optimization. Gaffke, N.; Pukelsheim, F. // Mathematical Methods of Operations Research;2008, Vol. 67 Issue 1, p133 

    The problems of (bi-)proportional rounding of a nonnegative vector or matrix, resp., are written as particular separable convex integer minimization problems. Allowing any convex (separable) objective function we use the notions of vector and matrix apportionment problems. As a broader class of...

  • Exact Matrix Completion via Convex Optimization. Cand�s, Emmanuel; Recht, Benjamin // Foundations of Computational Mathematics;Dec2009, Vol. 9 Issue 6, p717 

    We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can...

  • The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions. Gong Lin Yuan; Zeng Zin Wei // Acta Mathematica Sinica;Jan2008, Vol. 24 Issue 1, p35 

    We prove the superlinear convergence of a nonmonotone BFGS algorithm on convex objective functions under suitable conditions.

  • 3D Gravity Inversion by Growing Bodies and Shaping Layers at Mt. Vesuvius (Southern Italy). Berrino, Giovanna; Camacho, Antonio // Pure & Applied Geophysics;Jun2008, Vol. 165 Issue 6, p1095 

    To improve our knowledge of the structural pattern of Mt. Vesuvius and its magmatic system, which represents one of the three volcanoes located in the Neapolitan area (together with Campi Flegrei and Ischia; southern Italy), we analyze here the Bouguer gravity map that is already available...

  • Vague matrices in linear programming. Nedoma, Josef // Annals of Operations Research;1993, Vol. 46/47 Issue 1-4, p483 

    This paper deals with so-called vague matrices, the columns of which are convex sets. A special ‘square’ problem of the vague optimization is analysed. The results form a base for the subsequent outline of an algorithm for solving the LP-problem with a vague matrix. The paper is...

  • Higher-Order Quasiconvexity Reduces to Quasiconvexity. Dal Maso, Gianni; Fonseca, Irene; Leoni, Giovanni; Morini, Massimiliano // Archive for Rational Mechanics & Analysis;Jan2004, Vol. 171 Issue 1, p55 

    In this paper it is shown that higher-order quasiconvex functions suitable in the variational treatment of problems involving second derivatives may be extended to the space of all matrices as classical quasiconvex functions. Precisely, it is proved that a smooth strictly 2-quasiconvex function...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics