Prior Learning and Convex-Concave Regularization of Binary Tomography
From MaRDI portal
Publication:3439196
DOI10.1016/j.endm.2005.05.071zbMath1179.68192OpenAlexW2082291665MaRDI QIDQ3439196
Stefan Weber, Christoph Schnörr, T. Schüle
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2005.05.071
Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Matrices of integers (15B36)
Related Items (6)
Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model ⋮ A new efficient algorithm based on DC programming and DCA for clustering ⋮ Block Clustering Based on Difference of Convex Functions (DC) Programming and DC Algorithms ⋮ A DC Programming Approach for Finding Communities in Networks ⋮ Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms ⋮ DC programming and DCA: thirty years of developments
Cites Work
- Discrete tomography. Foundations, algorithms, and applications
- Automated estimation of the parameters of Gibbs priors to be used in binary tomography
- Mathematical Methods in Image Reconstruction
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- On the Goldstein-Levitin-Polyak gradient projection method
- Discrete tomography: Determination of finite sets by X-rays
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- State Constraints in Convex Control Problems of Bolza
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Prior Learning and Convex-Concave Regularization of Binary Tomography