IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v115y2002i1d10.1023_a1019624913077.html
   My bibliography  Save this article

Global Optimal Image Reconstruction from Blurred Noisy Data by a Bayesian Approach

Author

Listed:
  • C. Bruni

    (Università di Roma La Sapienza)

  • R. Bruni

    (Università di Roma La Sapienza)

  • A. De Santis

    (Università di Roma La Sapienza)

  • D. Iacoviello

    (Università di Roma La Sapienza)

  • G. Koch

    (Università di Roma La Sapienza)

Abstract

In this paper, a procedure is presented which allows the optimal reconstruction of images from blurred noisy data. The procedure relies on a general Bayesian approach, which makes proper use of all the available information. Special attention is devoted to the informative content of the edges; thus, a preprocessing phase is included, with the aim of estimating the jump sizes in the gray level. The optimization phase follows; existence and uniqueness of the solution is secured. The procedure is tested against simple simulated data and real data.

Suggested Citation

  • C. Bruni & R. Bruni & A. De Santis & D. Iacoviello & G. Koch, 2002. "Global Optimal Image Reconstruction from Blurred Noisy Data by a Bayesian Approach," Journal of Optimization Theory and Applications, Springer, vol. 115(1), pages 67-96, October.
    • Handle: RePEc:spr:joptap:v:115:y:2002:i:1:d:10.1023_a:1019624913077
    DOI: 10.1023/A:1019624913077
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1019624913077
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1019624913077?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. C. Bruni & A. De Santis & G. Koch, 2000. "Optimization over Spaces of Discontinuous 2D Functions," Journal of Optimization Theory and Applications, Springer, vol. 105(2), pages 277-283, May.
    2. Irvin J. Lustig & Roy E. Marsten & David F. Shanno, 1994. "Rejoinder—The Last Word on Interior Point Methods for Linear Programming—For Now," INFORMS Journal on Computing, INFORMS, vol. 6(1), pages 35-36, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Renato Bruni & Fabio Celani, 2017. "A Robust Optimization Approach for Magnetic Spacecraft Attitude Stabilization," Journal of Optimization Theory and Applications, Springer, vol. 173(3), pages 994-1012, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jeffery L. Kennington & Karen R. Lewis, 2004. "Generalized Networks: The Theory of Preprocessing and an Empirical Analysis," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 162-173, May.
    2. M. Xiong & J. Wang & P. Wang, 2002. "Differential-Algebraic Approach to Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 114(2), pages 443-470, August.
    3. Alexandra M. Newman & Martin Weiss, 2013. "A Survey of Linear and Mixed-Integer Optimization Tutorials," INFORMS Transactions on Education, INFORMS, vol. 14(1), pages 26-38, September.
    4. Erling D. Andersen, 1999. "On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 95-103, February.
    5. Yiran Cui & Keiichi Morikuni & Takashi Tsuchiya & Ken Hayami, 2019. "Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning," Computational Optimization and Applications, Springer, vol. 74(1), pages 143-176, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:115:y:2002:i:1:d:10.1023_a:1019624913077. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.