Fast Split Bregman Algorithm Research Articles

Fast Split Bregman Based Deconvolution Algorithm for Airborne Radar Imaging

Deconvolution methods can be used to improve the azimuth resolution in airborne radar imaging. Due to the sparsity of targets in airborne radar imaging, an L 1 regularization problem usually needs to be solved. Recently, the Split Bregman algorithm (SBA) has been widely used to solve L 1 regularization problems. However, due to the high computational complexity of matrix inversion, the efficiency of the traditional SBA is low, which seriously restricts its real-time performance in airborne radar imaging. To overcome this disadvantage, a fast split Bregman algorithm (FSBA) is proposed in this paper to achieve real-time imaging with an airborne radar. Firstly, under the regularization framework, the problem of azimuth resolution improvement can be converted into an L 1 regularization problem. Then, the L 1 regularization problem can be solved with the proposed FSBA. By utilizing the low displacement rank features of Toeplitz matrix, the proposed FSBA is able to realize fast matrix inversion by using a Gohberg–Semencul (GS) representation. Through simulated and real data processing experiments, we prove that the proposed FSBA significantly improves the resolution, compared with the Wiener filtering (WF), truncated singular value decomposition (TSVD), Tikhonov regularization (REGU), Richardson–Lucy (RL), iterative adaptive approach (IAA) algorithms. The computational advantage of FSBA increases with the increase of echo dimension. Its computational efficiency is 51 times and 77 times of the traditional SBA, respectively, for echoes with dimensions of 218 × 400 and 400 × 400 , optimizing both the image quality and computing time. In addition, for a specific hardware platform, the proposed FSBA can process echo of greater dimensions than traditional SBA. Furthermore, the proposed FSBA causes little performance degradation, when compared with the traditional SBA.

Projection Data Smoothing for Low-Dose CT Based on $$\ell _p$$ℓp Regularization

Projection data smoothing is a traditional technique for low-dose computed tomography. The projection data can be modeled as a piecewise smooth function. It’s well known that $$\ell _1$$ regularization of the image gradients tries to recover piecewise constant functions, while $$\ell _2$$ regularization recovers smooth functions. This motivates us to propose the $$\ell _p$$ regularization with $$1<p<2$$ for low-dose projection data smoothing. Besides, the non-stationary Gaussian noise model for the projection data is built into the regularization term. The resulting model is then linearized such that the fast split-Bregman algorithm can be applied. Experiments on simulated projection data as well as real data show that $$\ell _p$$ regularization with $$1<p<2$$ could achieve better reconstruction compared to $$\ell _{1}$$ regularization.

Novel Methods for Microglia Segmentation, Feature Extraction, and Classification.

Segmentation and analysis of histological images provides a valuable tool to gain insight into the biology and function of microglial cells in health and disease. Common image segmentation methods are not suitable for inhomogeneous histology image analysis and accurate classification of microglial activation states has remained a challenge. In this paper, we introduce an automated image analysis framework capable of efficiently segmenting microglial cells from histology images and analyzing their morphology. The framework makes use of variational methods and the fast-split Bregman algorithm for image denoising and segmentation, and of multifractal analysis for feature extraction to classify microglia by their activation states. Experiments show that the proposed framework is accurate and scalable to large datasets and provides a useful tool for the study of microglial biology.

Retinex theory based active contour model for segmentation of inhomogeneous images

Intensity inhomogeneity in images makes automated segmentation of these images difficult. As intensity inhomogeneity is often caused by inhomogeneous light reflection, the Retinex theory can be used to reduce inhomogeneity. We introduce the Retinex theory into the active contour model, which is commonly used for image segmentation. The segmentation procedure is then guided by the image intensity and light reflection. In order to solve the proposed model efficiently, we develop a new fast Split Bregman algorithm. Experimental results on a variety of real images with inhomogeneity validate the performance of the proposed methods.

An edge-weighted second order variational model for image decomposition

Decomposing an image into structure and texture is an important procedure for image understanding and analysis. Structure retains object hues and sharp edges whilst texture contains oscillating patterns of an observed image. The classical Vese–Osher model has been used for image decomposition, but its resulting structure image tends to show the undesirable staircase effect. Second order variational models that use a bounded Hessian regulariser have been proposed to remedy this side effect, but they tend to blur edges of objects in structure components. In this paper, we propose an edge-weighted second order variational model for image decomposition, which is able to eliminate staircase effects and preserve object edges. To avoid directly calculating the high order nonlinear partial differential equations of the proposed model, a fast split Bregman algorithm is developed, which uses the fast Fourier transform and analytical generalised soft thresholding equations. Extensive experiments demonstrate that the proposed variational image decomposition model outperforms state-of-the-art first and second order image decomposition models. By removing the texture component from the original noisy image, the effectiveness of the proposed model for image denoising has also been validated.

Active contour model coupling with higher order diffusion for medical image segmentation.

Active contour models are very popular in image segmentation. Different features such as mean gray and variance are selected for different purpose. But for image with intensity inhomogeneities, there are no features for segmentation using the active contour model. The images with intensity inhomogeneities often occurred in real world especially in medical images. To deal with the difficulties raised in image segmentation with intensity inhomogeneities, a new active contour model with higher-order diffusion method is proposed. With the addition of gradient and Laplace information, the active contour model can converge to the edge of the image even with the intensity inhomogeneities. Because of the introduction of Laplace information, the difference scheme becomes more difficult. To enhance the efficiency of the segmentation, the fast Split Bregman algorithm is designed for the segmentation implementation. The performance of our method is demonstrated through numerical experiments of some medical image segmentations with intensity inhomogeneities.

Unsupervised Texture Segmentation Using Active Contour Model and Oscillating Information

Textures often occur in real-world images and may cause considerable difficulties in image segmentation. In order to segment texture images, we propose a new segmentation model that combines image decomposition model and active contour model. The former model is capable of decomposing structural and oscillating components separately from texture image, and the latter model can be used to provide smooth segmentation contour. In detail, we just replace the data term of piecewise constant/smooth approximation in CCV (convex Chan-Vese) model with that of image decomposition model-VO (Vese-Osher). Therefore, our proposed model can estimate both structural and oscillating components of texture images as well as segment textures simultaneously. In addition, we design fast Split-Bregman algorithm for our proposed model. Finally, the performance of our method is demonstrated by segmenting some synthetic and real texture images.

Color Texture Image Inpainting Using the Non Local CTV Model

The classical TV (Total Variation) model has been applied to gray texture image denoising and inpainting previously based on the non local operators, but such model can not be directly used to color texture image inpainting due to coupling of different image layers in color images. In order to solve the inpainting problem for color texture images effectively, we propose a non local CTV (Color Total Variation) model. Technically, the proposed model is an extension of local TV model for gray images but we take account of the coupling of different layers in color images and make use of concepts of the non-local operators. As the coupling of different layers for color images in the proposed model will in-crease computational complexity, we also design a fast Split Bregman algorithm. Finally, some numerical experiments are conducted to validate the performance of the proposed model and its algorithm.