On image reconstruction algorithms for binary electromagnetic geotomography

DOI10.1016/J.TCS.2008.06.007zbMATH Open1167.68461OpenAlexW2122770638MaRDI QIDQ952472FDOQ952472

Authors: Rafal Zdunek 

Publication date: 12 November 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.007

Recommendations

• Detection of Subsurface Bubbles with Discrete Electromagnetic Geotomography
• scientific article; zbMATH DE number 1551784
• On the construction of the scanning matrix in electromagnetic geotomography
• scientific article; zbMATH DE number 1551779
• A new algorithm for 3D binary tomography

zbMATH Keywords

projected gradientbinary electromagnetic geotomographylimited-data tomographymean-field annealing

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10)

Cites Work

• On the Implementation of a Primal-Dual Interior Point Method
• Discrete tomography. Foundations, algorithms, and applications
• Projected gradient methods for linearly constrained problems
• Title not available (Why is that?)
• Binary vectors partially determined by linear equation systems
• The discrete Radon transform and its approximate inversion via linear programming
• Discrete tomography by convex--concave regularization and D.C. programming
• Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
• Title not available (Why is that?)
• An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
• On the Goldstein-Levitin-Polyak gradient projection method
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Simulated annealing: Practice versus theory
• Projection method for solving a singular system of linear equations and its applications
• Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
• Reconstruction of convex 2D discrete sets in polynomial time
• Combinatorial Image Analysis
• On the convergence properties of the projected gradient method for convex optimization
• Title not available (Why is that?)
• The structure of some matrices arising in tomography
• Title not available (Why is that?)
• A sufficient condition for non-uniqueness in binary tomography with absorption
• Adaptive Reconstruction of Discrete-Valued Objects from few Projections
• Reconstruction of \(hv\)-convex binary matrices from their absorbed projections
• Approximating binary images from discrete X-rays
• A Linear Programming Relaxation for Binary Tomography with Smoothness Priors
• Detection of Subsurface Bubbles with Discrete Electromagnetic Geotomography
• Title not available (Why is that?)
• Title not available (Why is that?)
• Medical applications of discrete tomography
• Reconstruction of discrete sets with absorption

Cited In (6)

• Contrast reconstruction of overfilled cavities by incorporating multi-frequency scattering fields and attention mechanism into two-step learning method
• On the construction of the scanning matrix in electromagnetic geotomography
• Geophysical imaging of subsurface structures with least squares estimates
• Title not available (Why is that?)
• Detection of Subsurface Bubbles with Discrete Electromagnetic Geotomography
• Computational Science - ICCS 2004

This page was built for publication: On image reconstruction algorithms for binary electromagnetic geotomography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952472)