1
|
Zeng GL. A fast method to emulate an iterative POCS image reconstruction algorithm. Med Phys 2018; 44:e353-e359. [PMID: 29027236 DOI: 10.1002/mp.12169] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/06/2016] [Revised: 01/10/2017] [Accepted: 02/10/2017] [Indexed: 11/10/2022] Open
Abstract
PURPOSE Iterative image reconstruction algorithms are commonly used to optimize an objective function, especially when the objective function is nonquadratic. Generally speaking, the iterative algorithms are computationally inefficient. This paper presents a fast algorithm that has one backprojection and no forward projection. METHODS This paper derives a new method to solve an optimization problem. The nonquadratic constraint, for example, an edge-preserving denoising constraint is implemented as a nonlinear filter. The algorithm is derived based on the POCS (projections onto projections onto convex sets) approach. A windowed FBP (filtered backprojection) algorithm enforces the data fidelity. An iterative procedure, divided into segments, enforces edge-enhancement denoising. Each segment performs nonlinear filtering. RESULTS The derived iterative algorithm is computationally efficient. It contains only one backprojection and no forward projection. Low-dose CT data are used for algorithm feasibility studies. The nonlinearity is implemented as an edge-enhancing noise-smoothing filter. CONCLUSIONS The patient studies results demonstrate its effectiveness in processing low-dose x ray CT data. This fast algorithm can be used to replace many iterative algorithms.
Collapse
Affiliation(s)
- Gengsheng L Zeng
- Department of Engineering, Weber State University, Ogden, UT, 84408, USA.,Department of Radiology and Imaging Sciences, University of Utah, Salt Lake City, UT, 84108, USA
| |
Collapse
|
2
|
Zibetti MV, Bazán FS, Mayer J. Estimation of the parameters in regularized simultaneous super-resolution. Pattern Recognit Lett 2011. [DOI: 10.1016/j.patrec.2009.12.009] [Citation(s) in RCA: 9] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/20/2022]
|
3
|
|
4
|
Robini MC, Lachal A, Magnin IE. A stochastic continuation approach to piecewise constant reconstruction. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2007; 16:2576-2589. [PMID: 17926938 DOI: 10.1109/tip.2007.904975] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/25/2023]
Abstract
We address the problem of reconstructing a piecewise constant 3-D object from a few noisy 2-D line-integral projections. More generally, the theory developed here readily applies to the recovery of an ideal n-D signal (n > or =1) from indirect measurements corrupted by noise. Stabilization of this ill-conditioned inverse problem is achieved with the Potts prior model, which leads to a challenging optimization task. To overcome this difficulty, we introduce a new class of hybrid algorithms that combines simulated annealing with deterministic continuation. We call this class of algorithms stochastic continuation (SC). We first prove that, under mild assumptions, SC inherits the finite-time convergence properties of generalized simulated annealing. Then, we show that SC can be successfully applied to our reconstruction problem. In addition, we look into the concave distortion acceleration method introduced for standard simulated annealing and we derive an explicit formula for choosing the free parameter of the cost function. Numerical experiments using both synthetic data and real radiographic testing data show that SC outperforms standard simulated annealing.
Collapse
Affiliation(s)
- Marc C Robini
- Center for Research and Applications in Image and Signal Processing, CNRS Research Unit UMR5520 and INSERM Research Unit U630, INSA Lyon, 69621 Villeurbanne Cedex, France.
| | | | | |
Collapse
|
5
|
|
6
|
Pan R, Reeves SJ. Efficient Huber-Markov edge-preserving image restoration. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2006; 15:3728-35. [PMID: 17153946 DOI: 10.1109/tip.2006.881971] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/12/2023]
Abstract
The regularization of the least-squares criterion is an effective approach in image restoration to reduce noise amplification. To avoid the smoothing of edges, edge-preserving regularization using a Gaussian Markov random field (GMRF) model is often used to allow realistic edge modeling and provide stable maximum a posteriori (MAP) solutions. However, this approach is computationally demanding because the introduction of a non-Gaussian image prior makes the restoration problem shift-variant. In this case, a direct solution using fast Fourier transforms (FFTs) is not possible, even when the blurring is shift-invariant. We consider a class of edge-preserving GMRF functions that are convex and have nonquadratic regions that impose less smoothing on edges. We propose a decomposition-enabled edge-preserving image restoration algorithm for maximizing the likelihood function. By decomposing the problem into two subproblems, with one shift-invariant and the other shift-variant, our algorithm exploits the sparsity of edges to define an FFT-based iteration that requires few iterations and is guaranteed to converge to the MAP estimate.
Collapse
Affiliation(s)
- Ruimin Pan
- Department of Electrical and Computer engineering, Auburn University, Auburn, AL 36849, USA.
| | | |
Collapse
|
7
|
Akgun T, Altunbasak Y, Mersereau RM. Super-resolution reconstruction of hyperspectral images. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2005; 14:1860-75. [PMID: 16279185 DOI: 10.1109/tip.2005.854479] [Citation(s) in RCA: 16] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/05/2023]
Abstract
Hyperspectral images are used for aerial and space imagery applications, including target detection, tracking, agricultural, and natural resource exploration. Unfortunately, atmospheric scattering, secondary illumination, changing viewing angles, and sensor noise degrade the quality of these images. Improving their resolution has a high payoff, but applying super-resolution techniques separately to every spectral band is problematic for two main reasons. First, the number of spectral bands can be in the hundreds, which increases the computational load excessively. Second, considering the bands separately does not make use of the information that is present across them. Furthermore, separate band super-resolution does not make use of the inherent low dimensionality of the spectral data, which can effectively be used to improve the robustness against noise. In this paper, we introduce a novel super-resolution method for hyperspectral images. An integral part of our work is to model the hyperspectral image acquisition process. We propose a model that enables us to represent the hyperspectral observations from different wavelengths as weighted linear combinations of a small number of basis image planes. Then, a method for applying super resolution to hyperspectral images using this model is presented. The method fuses information from multiple observations and spectral bands to improve spatial resolution and reconstruct the spectrum of the observed scene as a combination of a small number of spectral basis functions.
Collapse
Affiliation(s)
- Toygar Akgun
- Center for Signal and Image Processing, Georgia Institute of Technology, Atlanta 30332-0250, USA.
| | | | | |
Collapse
|
8
|
Robini MC, Magnin IE. Stochastic nonlinear image restoration using the wavelet transform. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2003; 12:890-905. [PMID: 18237963 DOI: 10.1109/tip.2003.812330] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/25/2023]
Abstract
The dominant methodology for image restoration is to stabilize the problem by including a roughness penalty in addition to faithfulness to the data. Among various choices, concave stabilizers stand out for their boundary detection capabilities, but the resulting cost function to be minimized is generally multimodal. Although simulated annealing is theoretically optimal to take up this challenge, standard stochastic algorithms suffer from two drawbacks: i) practical convergence difficulties are encountered with second-order prior models and ii) it remains computationally demanding to favor the formation of smooth contour lines by taking the discontinuity field explicitly into account. This work shows that both weaknesses can be overcome in a multiresolution framework by means of the 2-D discrete wavelet transform (DWT). We first propose to improve convergence toward global minima by single-site updating on the wavelet domain. For this purpose, a new restricted DWT space is introduced and a theoretically sound updating mechanism is constructed on this subspace. Next, we suggest to incorporate the smoothness of the discontinuity field via an additional penalty term defined on the high frequency subbands. The resulting increase in complexity is small and the approach requires the specification of a unique extra parameter for which an explicit selection formula is derived.
Collapse
Affiliation(s)
- Marc C Robini
- CREATIS, Inst. Nat. des Sci. Appliquees de Lyon, Villeurbanne, France.
| | | |
Collapse
|
9
|
|
10
|
A One-Dimensional Analog VLSI Implementation for Nonlinear Real-Time Signal Preprocessing. ACTA ACUST UNITED AC 2001. [DOI: 10.1006/rtim.1999.0218] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/06/2023]
|
11
|
Patti AJ, Altunbasak Y. Artifact reduction for set theoretic super resolution image reconstruction with edge adaptive constraints and higher-order interpolants. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2001; 10:179-186. [PMID: 18249610 DOI: 10.1109/83.892456] [Citation(s) in RCA: 12] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/25/2023]
Abstract
In this paper, we propose to improve the POCS-based super-resolution reconstruction (SRR) methods in two ways. First, the discretization of the continuous image formation model is improved to explicitly allow for higher order interpolation methods to be used. Second, the constraint sets are modified to reduce the amount of edge ringing present in the high resolution image estimate. This effectively regularizes the inversion process.
Collapse
Affiliation(s)
- A J Patti
- Liberate Technologies, San Carlos, CA 94070, USA.
| | | |
Collapse
|
12
|
Li SZ. Roof-edge preserving image smoothing based on MRFs. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2000; 9:1134-1138. [PMID: 18255483 DOI: 10.1109/83.846255] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/25/2023]
Abstract
A novel Markov random field (MRF) model is proposed for roof-edge (as well as step-edge) preserving image smoothing. Image surfaces containing roof-edges are represented by piecewise continuous polynomial functions governed by a few parameters. Piecewise smoothness constraint is imposed on these parameters rather than on the surface heights as is in traditional models for step-edges. In this way, roof edges are preserved without the necessity to deal with unstable higher order derivatives.
Collapse
|
13
|
Robini MC, Rastello T, Magnin IE. Simulated annealing, acceleration techniques, and image restoration. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 1999; 8:1374-1387. [PMID: 18267409 DOI: 10.1109/83.791963] [Citation(s) in RCA: 8] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/25/2023]
Abstract
Typically, the linear image restoration problem is an ill-conditioned, underdetermined inverse problem. Here, stabilization is achieved via the introduction of a first-order smoothness constraint which allows the preservation of edges and leads to the minimization of a nonconvex functional. In order to carry through this optimization task, we use stochastic relaxation with annealing. We prefer the Metropolis dynamics to the popular, but computationally much more expensive, Gibbs sampler. Still, Metropolis-type annealing algorithms are also widely reported to exhibit a low convergence rate. Their finite-time behavior is outlined and we investigate some inexpensive acceleration techniques that do not alter their theoretical convergence properties; namely, restriction of the state space to a locally bounded image space and increasing concave transform of the cost functional. Successful experiments about space-variant restoration of simulated synthetic aperture imaging data illustrate the performance of the resulting class of algorithms and show significant benefits in terms of convergence speed.
Collapse
|
14
|
Stevenson RL. Inverse halftoning via MAP estimation. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 1997; 6:574-583. [PMID: 18282950 DOI: 10.1109/83.563322] [Citation(s) in RCA: 9] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/25/2023]
Abstract
There has been a tremendous amount of research in the area of image halftoning, where the goal has been to find the most visually accurate representation given a limited palette of gray levels (often just two, black and white). This paper focuses on the inverse problem, that of finding efficient techniques for reconstructing high-quality continuous-tone images from their halftoned versions. The proposed algorithms are based on a maximum a posteriori (MAP) estimation criteria using a Markov random field (MRF) model for the prior image distribution. Image estimates obtained with the proposed model accurately reconstruct both the smooth regions of the image and the discontinuities along image edges. Algorithms are developed and example gray-level reconstructions are presented generated from both dithered and error-diffused halftone originals. Application of the technique to the problems of rescreening and the processing of halftone images are shown.
Collapse
|
15
|
Schmitz BE, Stevenson RL. The enhancement of images containing subsampled chrominance information. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 1997; 6:1052-1056. [PMID: 18282996 DOI: 10.1109/83.597281] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/25/2023]
Abstract
In image communication systems, subsampling, can be used to decrease the transmission rate of images. One common technique is to subsample the chrominance information. This process, however, introduces visible color artifacts. This paper develops an algorithm for enhancing the subsampled image data, thereby eliminating the artifacts.
Collapse
Affiliation(s)
- B E Schmitz
- Dept. of Electr. Eng. and Comput. Sci., Loyola Marymount Univ., Los Angeles, CA
| | | |
Collapse
|
16
|
Schultz RR, Stevenson RL. Extraction of high-resolution frames from video sequences. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 1996; 5:996-1011. [PMID: 18285187 DOI: 10.1109/83.503915] [Citation(s) in RCA: 87] [Impact Index Per Article: 3.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/25/2023]
Abstract
The human visual system appears to be capable of temporally integrating information in a video sequence in such a way that the perceived spatial resolution of a sequence appears much higher than the spatial resolution of an individual frame. While the mechanisms in the human visual system that do this are unknown, the effect is not too surprising given that temporally adjacent frames in a video sequence contain slightly different, but unique, information. This paper addresses the use of both the spatial and temporal information present in a short image sequence to create a single high-resolution video frame. A novel observation model based on motion compensated subsampling is proposed for a video sequence. Since the reconstruction problem is ill-posed, Bayesian restoration with a discontinuity-preserving prior image model is used to extract a high-resolution video still given a short low-resolution sequence. Estimates computed from a low-resolution image sequence containing a subpixel camera pan show dramatic visual and quantitative improvements over bilinear, cubic B-spline, and Bayesian single frame interpolations. Visual and quantitative improvements are also shown for an image sequence containing objects moving with independent trajectories. Finally, the video frame extraction algorithm is used for the motion-compensated scan conversion of interlaced video data, with a visual comparison to the resolution enhancement obtained from progressively scanned frames.
Collapse
Affiliation(s)
- R R Schultz
- Dept. of Electr. Eng., North Dakota Univ., Grand Forks, ND
| | | |
Collapse
|
17
|
Schultz RR, Stevenson RL. Stochastic modeling and estimation of multispectral image data. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 1995; 4:1109-1119. [PMID: 18292004 DOI: 10.1109/83.403416] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/25/2023]
Abstract
Multispectral images consist of multiple channels, each containing data acquired from a different band within the frequency spectrum. Since most objects emit or reflect energy over a large spectral bandwidth, there usually exists a significant correlation between channels. Due to often harsh imaging environments, the acquired data may be degraded by both blur and noise. Simply applying a monochromatic restoration algorithm to each frequency band ignores the cross-channel correlation present within a multispectral image. A Gibbs prior is proposed for multispectral data modeled as a Markov random field, containing both spatial and spectral cliques. Spatial components of the model use a nonlinear operator to preserve discontinuities within each frequency band, while spectral components incorporate nonstationary cross-channel correlations. The multispectral model is used in a Bayesian algorithm for the restoration of color images, in which the resulting nonlinear estimates are shown to be quantitatively and visually superior to linear estimates generated by multichannel Wiener and least squares restoration.
Collapse
Affiliation(s)
- R R Schultz
- Lab. for Image and Signal Anal., Notre Dame Univ., IN
| | | |
Collapse
|
18
|
Schultz RR, Stevenson RL. A Bayesian approach to image expansion for improved definition. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 1994; 3:233-242. [PMID: 18291922 DOI: 10.1109/83.287017] [Citation(s) in RCA: 55] [Impact Index Per Article: 1.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/25/2023]
Abstract
Accurate image expansion is important in many areas of image analysis. Common methods of expansion, such as linear and spline techniques, tend to smooth the image data at edge regions. This paper introduces a method for nonlinear image expansion which preserves the discontinuities of the original image, producing an expanded image with improved definition. The maximum a posteriori (MAP) estimation techniques that are proposed for noise-free and noisy images result in the optimization of convex functionals. The expanded images produced from these methods will be shown to be aesthetically and quantitatively superior to images expanded by the standard methods of replication, linear interpolation, and cubic B-spline expansion.
Collapse
|