Robust multichannel blind deconvolution via fast alternating minimization

Blind multi-Poissonian image deconvolution with sparse log-step gradient prior

Blind image deconvolution plays a very important role in the fields such as astronomical observation and fluorescence microscopy imaging, in which the noise follows Poisson distribution. However, due to the ill-posedness, it is a very challenging task to reach a satisfactory result from a single blurred image especially when the power of the Poisson noise is at a high level. Therefore, in this paper, we try to achieve high-quality restoration results with multi-blurred images which are contaminated by Poisson noise. Firstly, we design a novel sparse log-step gradient prior which adopts a mixture of logarithm and step functions to regularize the image gradients and combine it with the Poisson distribution to formulate the blind multi-image deconvolution problem. Secondly, we incorporate the methods of variable splitting and Lagrange multiplier to convert the original problem into sub-problems, then we alternately solve them to achieve the estimation of all the blur kernels of corresponding blurred images. Besides, we also design a non-blind multi-image deconvolution algorithm which is based on the log-step gradient prior to reach the final restored image. Experimental results on both synthetic and real-world blurred images show that the proposed prior is very capable of suppressing negative artifacts caused by ill-posedness. The algorithm can achieve restored image of very high quality which is competitive with some state-of-the-art methods.

Single-shot blind deconvolution with coded aperture

In this paper, we present a method for single-shot blind deconvolution incorporating a coded aperture (CA). In this method, we utilize the CA, inserted on the pupil plane, as support constraints in blind deconvolution. Not only an object is estimated, but also a point spread function of turbulence from a single captured image by a reconstruction algorithm with CA support. The proposed method is demonstrated by simulation and an experiment in which point sources are recovered under severe turbulence.

Feature Extraction of 3T3 Fibroblast Microtubule Based on Discrete Wavelet Transform and Lucy–Richardson Deconvolution Methods

Accompanied by the increasing requirements of the probing micro/nanoscopic structures of biological samples, various image-processing algorithms have been developed for visualization or to facilitate data analysis. However, it remains challenging to enhance both the signal-to-noise ratio and image resolution using a single algorithm. In this investigation, we propose a composite image processing method by combining discrete wavelet transform (DWT) and the Lucy–Richardson (LR) deconvolution method, termed the DWDC method. Our results demonstrate that the signal-to-noise ratio and resolution of live cells’ microtubule networks are considerably improved, allowing the recognition of features as small as 120 nm. The method shows robustness in processing the high-noise images of filament-like biological structures, e.g., the cytoskeleton networks captured by fluorescent microscopes.

A Deconvolutional Deblurring Algorithm Based on Dual-Channel Images

Aiming at the motion blur restoration of large-scale dual-channel space-variant images, this paper proposes a dual-channel image deblurring method based on the idea of block aggregation, by studying imaging principles and existing algorithms. The study first analyzed the model of dual-channel space-variant imaging, reconstructed the kernel estimation process using the side prior information from the correlation of the two-channel images, and then used a clustering algorithm to classify kernels and restore the images. In the kernel estimation process, the study proposed two kinds of regularization terms. One is based on image correlation, and the other is based on the information from another channel input. In the image restoration process, the mean-shift clustering algorithm was used to calculate the block image kernel weights and reconstruct the final restored image according to the weights. As the experimental section shows, the restoration effect of this algorithm was better than that of the other compared algorithms.

Extended scene deep learning wavefront sensing

We have applied a combination of blind deconvolution and deep learning to the processing of Shack-Hartmann images. By using the intensity information contained in spot positions, and the fine structure of the separate images created by the lenslets, we have increased the sensitivity and resolution of the sensor over the limit defined by standard processing of spot displacements only. We also have demonstrated the applicability of the method to wavefront sensing using extended objects as a reference.

Improved resolution in x-ray tomography by super-resolution

In this paper, super-resolution imaging is described and evaluated for x-ray tomography and is compared with standard tomography and upscaling during reconstruction. Blurring is minimized due to the negligible point spread of photon counting detectors and an electromagnetically movable micro-focus x-ray spot. Scans are acquired in high and low magnification geometry, where the latter is used to minimize penumbral blurring from the x-ray source. Sharpness and level of detail can be significantly increased in reconstructed slices to the point where the source size becomes the limiting factor. The achieved resolution of the different methods is quantified and compared using biological samples via the edge spread function, modulation transfer function, and Fourier ring correlation.

Correcting Higher Order Aberrations Using Image Processing

Higher Order Aberrations (HOAs) are complex refractive errors in the human eye that cannot be corrected by regular lens systems. Researchers have developed numerous approaches to analyze the effect of these refractive errors; the most popular among these approaches use Zernike polynomial approximation to describe the shape of the wavefront of light exiting the pupil after it has been altered by the refractive errors. We use this wavefront shape to create a linear imaging system that simulates how the eye perceives source images at the retina. With phase information from this system, we create a second linear imaging system to modify source images so that they would be perceived by the retina without distortion. By modifying source images, the visual process cascades two optical systems before the light reaches the retina, a technique that counteracts the effect of the refractive errors. While our method effectively compensates for distortions induced by HOAs, it also introduces blurring and loss of contrast; a problem that we address with Total Variation Regularization. With this technique, we optimize source images so that they are perceived at the retina as close as possible to the original source image. To measure the effectiveness of our methods, we compute the Euclidean error between the source images and the images perceived at the retina. When comparing our results with existing corrective methods that use deconvolution and total variation regularization, we achieve an average of 50% reduction in error with lower computational costs.

Blur Removal Via Blurred-Noisy Image Pair

Complex blur such as the mixup of space-variant and space-invariant blur, which is hard to model mathematically, widely exists in real images. In this article, we propose a novel image deblurring method that does not need to estimate blur kernels. We utilize a pair of images that can be easily acquired in low-light situations: (1) a blurred image taken with low shutter speed and low ISO noise; and (2) a noisy image captured with high shutter speed and high ISO noise. Slicing the blurred image into patches, we extend the Gaussian mixture model (GMM) to model the underlying intensity distribution of each patch using the corresponding patches in the noisy image. We compute patch correspondences by analyzing the optical flow between the two images. The Expectation Maximization (EM) algorithm is utilized to estimate the parameters of GMM. To preserve sharp features, we add an additional bilateral term to the objective function in the M-step. We eventually add a detail layer to the deblurred image for refinement. Extensive experiments on both synthetic and real-world data demonstrate that our method outperforms state-of-the-art techniques, in terms of robustness, visual quality, and quantitative metrics.

Blind deconvolution of sources of opportunity in ocean waveguides using bilinear channel models

A general blind deconvolution algorithmic framework is developed for sources of opportunity (e.g., ships at known locations) in an ocean waveguide. Here, both channel impulse responses (CIRs) and unknown source signals need to be simultaneously estimated from only the recorded signals on a receiver array using blind deconvolution, which is generally an ill-posed problem without any a priori information or additional assumptions about the underlying structure of the CIRs. By exploiting the typical ray-like arrival-time structure of the CIRs between a surface source and the elements of a vertical line array (VLA) in ocean waveguides, a principle component analysis technique is applied to build a bilinear parametric model linking the amplitudes and arrival-times of the CIRs across all channels for a variety of admissible ocean environments. The bilinear channel representation further reduces the dimension of the channel parametric model compared to linear models. A truncated power interaction deconvolution algorithm is then developed by applying the bilinear channel model to the traditional subspace deconvolution method. Numerical and experimental results demonstrate the robustness of this blind deconvolution methodology.

A new deep learning method for image deblurring in optical microscopic systems

Deconvolution is the most commonly used image processing method in optical imaging systems to remove the blur caused by the point-spread function (PSF). While this method has been successful in deblurring, it suffers from several disadvantages, such as slow processing time due to multiple iterations required to deblur and suboptimal in cases where the experimental operator chosen to represent PSF is not optimal. In this paper, we present a deep-learning-based deblurring method that is fast and applicable to optical microscopic imaging systems. We tested the robustness of proposed deblurring method on the publicly available data, simulated data and experimental data (including 2D optical microscopic data and 3D photoacoustic microscopic data), which all showed much improved deblurred results compared to deconvolution. We compared our results against several existing deconvolution methods. Our results are better than conventional techniques and do not require multiple iterations or pre-determined experimental operator. Our method has several advantages including simple operation, short time to compute, good deblur results and wide application in all types of optical microscopic imaging systems. The deep learning approach opens up a new path for deblurring and can be applied in various biomedical imaging fields.

Burst ranking for blind multi-image deblurring

We propose a new incremental aggregation algorithm for multi-image deblurring with automatic image selection. The primary motivation is that current burst deblurring methods do not handle well situations in which misalignment or out-of-context frames are present in the burst. These real-life situations result in poor reconstructions or manual selection of the images that are used to deblur. Automatically selecting the best frames within the burst to improve the base reconstruction is challenging because the number of possible images fusions is equal to the power set cardinal. Here, we approach the multi-image deblurring problem as a two steps process. First, we successfully learn a comparison function to rank a burst of images using a deep convolutional neural network. Then, an incremental Fourier burst accumulation with a reconstruction degradation mechanism is applied fusing only less blurred images that are sufficient to maximize the reconstruction quality. Experiments with the proposed algorithm have shown superior results when compared to other similar approaches, outperforming other methods described in the literature in previously described situations. We validate our findings on several synthetic and real datasets.

Convolutional Deblurring for Natural Imaging

In this paper, we propose a novel design of image deblurring in the form of one-shot convolution filtering that can directly convolve with naturally blurred images for restoration. The problem of optical blurring is a common disadvantage to many imaging applications that suffer from optical imperfections. Despite numerous deconvolution methods that blindly estimate blurring in either inclusive or exclusive forms, they are practically challenging due to high computational cost and low image reconstruction quality. Both conditions of high accuracy and high speed are prerequisites for high-throughput imaging platforms in digital archiving. In such platforms, deblurring is required after image acquisition before being stored, previewed, or processed for high-level interpretation. Therefore, on-the-fly correction of such images is important to avoid possible time delays, mitigate computational expenses, and increase image perception quality. We bridge this gap by synthesizing a deconvolution kernel as a linear combination of finite impulse response (FIR) even-derivative filters that can be directly convolved with blurry input images to boost the frequency fall-off of the point spread function (PSF) associated with the optical blur. We employ a Gaussian low-pass filter to decouple the image denoising problem for image edge deblurring. Furthermore, we propose a blind approach to estimate the PSF statistics for two Gaussian and Laplacian models that are common in many imaging pipelines. Thorough experiments are designed to test and validate the efficiency of the proposed method using 2054 naturally blurred images across six imaging applications and seven state-of-the-art deconvolution methods.

A Novel Neural Network-Based Method for Decoding and Detecting of the DS8-PSK Scheme in an OCC System

This paper proposes a novel method of training and applying a neural network to act as an adaptive decoder for a modulation scheme used in optical camera communication (OCC). We present a brief discussion on trending artificial intelligence applications, the contemporary ways of applying them in a wireless communication field, such as visible light communication (VLC), optical wireless communication (OWC) and OCC, and its potential contribution in the development of this research area. Furthermore, we proposed an OCC vehicular system architecture with artificial intelligence (AI) functionalities, where dimmable spatial 8-phase shift keying (DS8-PSK) is employed as one out of two modulation schemes to form a hybrid waveform. Further demonstration of simulating the blurring process on a transmitter image, as well as our proposed method of using a neural network as a decoder for DS8-PSK, is provided in detail. Finally, experimental results are given to prove the effectiveness and efficiency of the proposed method over an investigating channel condition.

Graph-Based Blind Image Deblurring From a Single Photograph

Blind image deblurring, i.e., deblurring without knowledge of the blur kernel, is a highly ill-posed problem. The problem can be solved in two parts: i) estimate a blur kernel from the blurry image, and ii) given an estimated blur kernel, de-convolve the blurry input to restore the target image. In this paper, we propose a graph-based blind image deblurring algorithm by interpreting an image patch as a signal on a weighted graph. Specifically, we first argue that a skeleton image-a proxy that retains the strong gradients of the target but smooths out the details-can be used to accurately estimate the blur kernel and has a unique bi-modal edge weight distribution. Then, we design a reweighted graph total variation (RGTV) prior that can efficiently promote a bi-modal edge weight distribution given a blurry patch. Further, to analyze RGTV in the graph frequency domain, we introduce a new weight function to represent RGTV as a graph l1-Laplacian regularizer. This leads to a graph spectral filtering interpretation of the prior with desirable properties, including robustness to noise and blur, strong piecewise smooth (PWS) filtering and sharpness promotion. Minimizing a blind image deblurring objective with RGTV results in a non-convex non-differentiable optimization problem. Leveraging the new graph spectral interpretation for RGTV, we design an efficient algorithm that solves for the skeleton image and the blur kernel alternately. Specifically for Gaussian blur, we propose a further speedup strategy for blind Gaussian deblurring using accelerated graph spectral filtering. Finally, with the computed blur kernel, recent non-blind image deblurring algorithms can be applied to restore the target image. Experimental results demonstrate that our algorithm successfully restores latent sharp images and outperforms state-of-the-art methods quantitatively and qualitatively.

Iterative Blind Deconvolution Algorithm for Deblurring a Single PSP/TSP Image of Rotating Surfaces

Imaging of pressure-sensitive paint (PSP) for pressure measurement on moving surfaces is problematic due to the movement of the object within the finite exposure time of the imager, resulting in the blurring of the blade edges. The blurring problem is particularly challenging when high-sensitivity PSP with a long lifetime is used, where the long luminescence time constant of exponential light decay following a burst of excitation light energy results in blurred images. One method to ameliorate this effect is image deconvolution using a point spread function (PSF) based on an estimation of the luminescent time constant. Prior implementations of image deconvolution for PSP deblurring have relied upon a spatially invariant time constant in order to reduce computational time. However, the use of an assumed value of time constant leads to errors in the point spread function, particularly when strong pressure gradients (which cause strong spatial gradients in the decay time constant) are involved. This work introduces an iterative method of image deconvolution, where a spatially variant PSF is used. The point-by-point PSF values are found in an iterative manner, since the time constant depends on the local pressure value, which can only be found from the reduced PSP data. The scheme estimates a super-resolved spatially varying blur kernel with sub-pixel resolution without filtering the blurred image, and then restores the image using classical iterative regularization tools. A kernel-free forward model has been used to generate test images with known pressure surface maps and a varying amount of noise to evaluate the applicability of this scheme in different experimental conditions. A spinning disk setup with a grazing nitrogen jet for producing strong pressure gradients has also been used to evaluate the scheme on a real-world problem. Results including the convergence history and the effect of a regularization-iteration count are shown, along with a comparison with the previous PSP deblurring method.

Reconstruction of Single Image from Multiple Blurry Measured Images

The problem of blind image recovery using multiple blurry images of the same scene is addressed in this paper. To perform blind deconvolution, which is also called blind image recovery, the blur kernel and image are represented by groups of sparse domains to exploit the local and nonlocal information such that a novel joint deblurring approach is conceived. In the proposed approach, the group sparse regularization on both the blur kernel and image is provided, where the sparse solution is promoted by -norm. In addition, the reweighted data fidelity is developed to further improve the recovery performance, where the weight is determined by the estimation error. Moreover, to reduce the undesirable noise effects in group sparse representation, distance measures are studied in the block matching process to find similar patches. In such a joint deblurring approach, a more sophisticated two-step interactive process is needed in which each step is solved by means of the well-known split Bregman iteration algorithm, which is generally used to efficiently solve the proposed joint deblurring problem. Finally, numerical studies, including synthetic and real images, demonstrate that the performance of this joint estimation algorithm is superior to the previous state-of-the-art algorithms in terms of both objective and subjective evaluation standards. The recovery results of real captured images using unmanned aerial vehicles are also provided to further validate the effectiveness of the proposed method.

Combining Motion Compensation with Spatiotemporal Constraint for Video Deblurring

We propose a video deblurring method by combining motion compensation with spatiotemporal constraint for restoring blurry video caused by camera shake. The proposed method makes effective full use of the spatiotemporal information not only in the blur kernel estimation, but also in the latent sharp frame restoration. Firstly, we estimate a motion vector between the current and the previous blurred frames, and introduce the estimated motion vector for deriving the motion-compensated frame with the previous restored frame. Secondly, we proposed a blur kernel estimation strategy by applying the derived motion-compensated frame to an improved regularization model for improving the quality of the estimated blur kernel and reducing the processing time. Thirdly, we propose a spatiotemporal constraint algorithm that can not only enhance temporal consistency, but also suppress noise and ringing artifacts of the deblurred video through introducing a temporal regularization term. Finally, we extend Fast Total Variation de-convolution (FTVd) for solving the minimization problem of the proposed spatiotemporal constraint energy function. Extensive experiments demonstrate that the proposed method achieve the state-of-the-art results either in subjective vision or objective evaluation.

Deblurring adaptive optics retinal images using deep convolutional neural networks

The adaptive optics (AO) can be used to compensate for ocular aberrations to achieve near diffraction limited high-resolution retinal images. However, many factors such as the limited aberration measurement and correction accuracy with AO, intraocular scatter, imaging noise and so on will degrade the quality of retinal images. Image post processing is an indispensable and economical method to make up for the limitation of AO retinal imaging procedure. In this paper, we proposed a deep learning method to restore the degraded retinal images for the first time. The method directly learned an end-to-end mapping between the blurred and restored retinal images. The mapping was represented as a deep convolutional neural network that was trained to output high-quality images directly from blurry inputs without any preprocessing. This network was validated on synthetically generated retinal images as well as real AO retinal images. The assessment of the restored retinal images demonstrated that the image quality had been significantly improved.

Temporal Coherence-Based Deblurring Using Non-Uniform Motion Optimization

Non-uniform motion blur due to object movement or camera jitter is a common phenomenon in videos. However, the state-of-the-art video deblurring methods used to deal with this problem can introduce artifacts, and may sometimes fail to handle motion blur due to the movements of the object or the camera. In this paper, we propose a non-uniform motion model to deblur video frames. The proposed method is based on superpixel matching in the video sequence to reconstruct sharp frames from blurry ones. To identify a suitable sharp superpixel to replace a blurry one, we enrich the search space with a non-uniform motion blur kernel, and use a generalized PatchMatch algorithm to handle rotation, scale, and blur differences in the matching step. Instead of using pixel-based or regular patch-based representation, we adopt a superpixel-based representation, and use color and motion to gather similar pixels. Our non-uniform motion blur kernels are estimated from the motion field of these superpixels, and our spatially varying motion model considers spatial and temporal coherence to find sharp superpixels. Experimental results showed that the proposed method can reconstruct sharp video frames from blurred frames caused by complex object and camera movements, and performs better than the state-of-the-art methods.

Blind Super Resolution of Real-Life Video Sequences

Super resolution (SR) for real-life video sequences is a challenging problem due to complex nature of the motion fields. In this paper, a novel blind SR method is proposed to improve the spatial resolution of video sequences, while the overall point spread function of the imaging system, motion fields, and noise statistics are unknown. To estimate the blur(s), first, a nonuniform interpolation SR method is utilized to upsample the frames, and then, the blur(s) is(are) estimated through a multi-scale process. The blur estimation process is initially performed on a few emphasized edges and gradually on more edges as the iterations continue. Also for faster convergence, the blur is estimated in the filter domain rather than the pixel domain. The high-resolution frames are estimated using a cost function that has the fidelity and regularization terms of type Huber-Markov random field to preserve edges and fine details. The fidelity term is adaptively weighted at each iteration using a masking operation to suppress artifacts due to inaccurate motions. Very promising results are obtained for real-life videos containing detailed structures, complex motions, fast-moving objects, deformable regions, or severe brightness changes. The proposed method outperforms the state of the art in all performed experiments through both subjective and objective evaluations. The results are available online at http://lyle.smu.edu/~rajand/Video_SR/.

Removing Camera Shake via Weighted Fourier Burst Accumulation

Numerous recent approaches attempt to remove image blur due to camera shake, either with one or multiple input images, by explicitly solving an inverse and inherently ill-posed deconvolution problem. If the photographer takes a burst of images, a modality available in virtually all modern digital cameras, we show that it is possible to combine them to get a clean sharp version. This is done without explicitly solving any blur estimation and subsequent inverse problem. The proposed algorithm is strikingly simple: it performs a weighted average in the Fourier domain, with weights depending on the Fourier spectrum magnitude. The method can be seen as a generalization of the align and average procedure, with a weighted average, motivated by hand-shake physiology and theoretically supported, taking place in the Fourier domain. The method's rationale is that camera shake has a random nature, and therefore, each image in the burst is generally blurred differently. Experiments with real camera data, and extensive comparisons, show that the proposed Fourier burst accumulation algorithm achieves state-of-the-art results an order of magnitude faster, with simplicity for on-board implementation on camera phones. Finally, we also present experiments in real high dynamic range (HDR) scenes, showing how the method can be straightforwardly extended to HDR photography.

Multispectral Image Out-of-Focus Deblurring Using Interchannel Correlation

Out-of-focus blur occurs frequently in multispectral imaging systems when the camera is well focused at a specific (reference) imaging channel. As the effective focal lengths of the lens are wavelength dependent, the blurriness levels of the images at individual channels are different. This paper proposes a multispectral image deblurring framework to restore out-of-focus spectral images based on the characteristic of interchannel correlation (ICC). The ICC is investigated based on the fact that a high-dimensional color spectrum can be linearly approximated using rather a few number of intrinsic spectra. In the method, the spectral images are classified into an out-of-focus set and a well-focused set via blurriness computation. For each out-of-focus image, a guiding image is derived from the well-focused spectral images and is used as the image prior in the deblurring framework. The out-of-focus blur is modeled as a Gaussian point spread function, which is further employed as the blur kernel prior. The regularization parameters in the image deblurring framework are determined using generalized cross validation, and thus the proposed method does not need any parameter tuning. The experimental results validate that the method performs well on multispectral image deblurring and outperforms the state of the arts.

Direct superresolution for realistic image reconstruction

Traditional superresolution techniques employ optimizers, priors, and regularizers to deliver stable, appealing restorations even though deviating from the real, ground-truth scene. We have developed a non-regularized superresolution algorithm that directly solves a fully-characterized multi-shift imaging reconstruction problem to achieve realistic restorations without being penalized by improper assumptions made in the inverse problem. An adaptive frequency-based filtering scheme is introduced to upper bound the reconstruction errors while still producing more fine details as compared with previous methods when inaccurate shift estimation, noise, and blurring scenarios are considered.

Characterization of Porous Materials by Fluorescence Correlation Spectroscopy Super-resolution Optical Fluctuation Imaging

Porous materials such as cellular cytosol, hydrogels, and block copolymers have nanoscale features that determine macroscale properties. Characterizing the structure of nanopores is difficult with current techniques due to imaging, sample preparation, and computational challenges. We produce a super-resolution optical image that simultaneously characterizes the nanometer dimensions of and diffusion dynamics within porous structures by correlating stochastic fluctuations from diffusing fluorescent probes in the pores of the sample, dubbed here as "fluorescence correlation spectroscopy super-resolution optical fluctuation imaging" or "fcsSOFI". Simulations demonstrate that structural features and diffusion properties can be accurately obtained at sub-diffraction-limited resolution. We apply our technique to image agarose hydrogels and aqueous lyotropic liquid crystal gels. The heterogeneous pore resolution is improved by up to a factor of 2, and diffusion coefficients are accurately obtained through our method compared to diffraction-limited fluorescence imaging and single-particle tracking. Moreover, fcsSOFI allows for rapid and high-throughput characterization of porous materials. fcsSOFI could be applied to soft porous environments such hydrogels, polymers, and membranes in addition to hard materials such as zeolites and mesoporous silica.

High spectral specificity of local chemical components characterization with multichannel shift-excitation Raman spectroscopy

Raman spectroscopy has emerged as a promising tool for its noninvasive and nondestructive characterization of local chemical structures. However, spectrally overlapping components prevent the specific identification of hyperfine molecular information of different substances, because of limitations in the spectral resolving power. The challenge is to find a way of preserving scattered photons and retrieving hidden/buried Raman signatures to take full advantage of its chemical specificity. Here, we demonstrate a multichannel acquisition framework based on shift-excitation and slit-modulation, followed by mathematical post-processing, which enables a significant improvement in the spectral specificity of Raman characterization. The present technique, termed shift-excitation blind super-resolution Raman spectroscopy (SEBSR), uses multiple degraded spectra to beat the dispersion-loss trade-off and facilitate high-resolution applications. It overcomes a fundamental problem that has previously plagued high-resolution Raman spectroscopy: fine spectral resolution requires large dispersion, which is accompanied by extreme optical loss. Applicability is demonstrated by the perfect recovery of fine structure of the C-Cl bending mode as well as the clear discrimination of different polymorphs of mannitol. Due to its enhanced discrimination capability, this method offers a feasible route at encouraging a broader range of applications in analytical chemistry, materials and biomedicine.

Restoration of images degraded by underwater turbulence using structure tensor oriented image quality (STOIQ) metric

Recent advances in image processing for atmospheric propagation have provided a foundation for tackling the similar but perhaps more complex problem of underwater imaging, which is impaired by scattering and optical turbulence. As a result of these impairments underwater imagery suffers from excessive noise, blur, and distortion. Underwater turbulence impact on light propagation becomes critical at longer distances as well as near thermocline and mixing layers. In this work, we demonstrate a method for restoration of underwater images that are severely degraded by underwater turbulence. The key element of the approach is derivation of a structure tensor oriented image quality metric, which is subsequently incorporated into a lucky patch image processing framework. The utility of the proposed image quality measure guided by local edge strength and orientation is emphasized by comparing the restoration results to an unsuccessful restoration obtained with equivalent processing utilizing a standard isotropic metric. Advantages of the proposed approach versus three other state-of-the-art image restoration techniques are demonstrated using the data obtained in the laboratory water tank and in a natural environment underwater experiment. Quantitative comparison of the restoration results is performed via structural similarity index measure and normalized mutual information metric.

Pitfalls and possibilities of radar compressive sensing

In this paper, we consider the application of compressive sensing (CS) to radar remote sensing applications. We survey a suite of practical system-level issues related to the compression of radar measurements, and we advocate the consideration of these issues by researchers exploring potential gains of CS in radar applications. We also give abbreviated examples of decades-old radio-frequency (RF) practices that already embody elements of CS for relevant applications. In addition to the cautionary implications of system-level issues and historical precedents, we identify several promising results that RF practitioners may gain from the recent explosion of CS literature.

A New Study of Blind Deconvolution with Implicit Incorporation of Nonnegativity Constraints

The inverse problem of image restoration to remove noise and blur in an observed image was extensively studied in the last two decades. For the case of a known blurring kernel (or a known blurring type such as out of focus or Gaussian blur), many effective models and efficient solvers exist. However when the underlying blur is unknown, there have been fewer developments for modelling the so-called blind deblurring since the early works of You and Kaveh (1996) and Chan and Wong (1998). A major challenge is how to impose the extra constraints to ensure quality of restoration. This paper proposes a new transform based method to impose the positivity constraints automatically and then two numerical solution algorithms. Test results demonstrate the effectiveness and robustness of the proposed method in restoring blurred images.

Multi-Observation Blind Deconvolution with an Adaptive Sparse Prior

This paper describes a robust algorithm for estimating a single latent sharp image given multiple blurry and/or noisy observations. The underlying multi-image blind deconvolution problem is solved by linking all of the observations together via a Bayesian-inspired penalty function, which couples the unknown latent image along with a separate blur kernel and noise variance associated with each observation, all of which are estimated jointly from the data. This coupled penalty function enjoys a number of desirable properties, including a mechanism whereby the relative-concavity or sparsity is adapted as a function of the intrinsic quality of each corrupted observation. In this way, higher quality observations may automatically contribute more to the final estimate than heavily degraded ones, while troublesome local minima can largely be avoided. The resulting algorithm, which requires no essential tuning parameters, can recover a sharp image from a set of observations containing potentially both blurry and noisy examples, without knowing a priori the degradation type of each observation. Experimental results on both synthetic and real-world test images clearly demonstrate the efficacy of the proposed method.

Estimation method of point spread function based on Kalman filter for accurately evaluating real optical properties of photonic crystal fibers

The evaluation accuracy of real optical properties of photonic crystal fibers (PCFs) is determined by the accurate extraction of air hole edges from microscope images of cross sections of practical PCFs. A novel estimation method of point spread function (PSF) based on Kalman filter is presented to rebuild the micrograph image of the PCF cross-section and thus evaluate real optical properties for practical PCFs. Through tests on both artificially degraded images and microscope images of cross sections of practical PCFs, we prove that the proposed method can achieve more accurate PSF estimation and lower PSF variance than the traditional Bayesian estimation method, and thus also reduce the defocus effect. With this method, we rebuild the microscope images of two kinds of commercial PCFs produced by Crystal Fiber and analyze the real optical properties of these PCFs. Numerical results are in accord with the product parameters.

Unified blind method for multi-image super-resolution and single/multi-image blur deconvolution

This paper presents, for the first time, a unified blind method for multi-image super-resolution (MISR or SR), single-image blur deconvolution (SIBD), and multi-image blur deconvolution (MIBD) of low-resolution (LR) images degraded by linear space-invariant (LSI) blur, aliasing, and additive white Gaussian noise (AWGN). The proposed approach is based on alternating minimization (AM) of a new cost function with respect to the unknown high-resolution (HR) image and blurs. The regularization term for the HR image is based upon the Huber-Markov random field (HMRF) model, which is a type of variational integral that exploits the piecewise smooth nature of the HR image. The blur estimation process is supported by an edge-emphasizing smoothing operation, which improves the quality of blur estimates by enhancing strong soft edges toward step edges, while filtering out weak structures. The parameters are updated gradually so that the number of salient edges used for blur estimation increases at each iteration. For better performance, the blur estimation is done in the filter domain rather than the pixel domain, i.e., using the gradients of the LR and HR images. The regularization term for the blur is Gaussian (L2 norm), which allows for fast noniterative optimization in the frequency domain. We accelerate the processing time of SR reconstruction by separating the upsampling and registration processes from the optimization procedure. Simulation results on both synthetic and real-life images (from a novel computational imager) confirm the robustness and effectiveness of the proposed method.