Optimized Anisotropic Rotational Invariant Diffusion Scheme on Cone-Beam CT

Cone-beam computed tomography (CBCT) is an important image modality for dental surgery planning, with high resolution images at a relative low radiation dose. In these scans the mandibular canal is hardly visible, this is a problem for implant surgery planning. We use anisotropic diffusion filtering to remove noise and enhance the mandibular canal in CBCT scans. For the diffusion tensor we use hybrid diffusion with a continuous switch (HDCS), suitable for filtering both tubular as planar image structures. We focus in this paper on the diffusion discretization schemes. The standard scheme shows good isotropic filtering behavior but is not rotational invariant, the diffusion scheme of Weickert is rotational invariant but suffers from checkerboard artifacts. We introduce a new scheme, in which we numerically optimize the image derivatives. This scheme is rotational invariant and shows good isotropic filtering properties on both synthetic as real CBCT data

Image Denoising using Optimally Weighted Bilateral Filters: A Sure and Fast Approach

The bilateral filter is known to be quite effective in denoising images corrupted with small dosages of additive Gaussian noise. The denoising performance of the filter, however, is known to degrade quickly with the increase in noise level. Several adaptations of the filter have been proposed in the literature to address this shortcoming, but often at a substantial computational overhead. In this paper, we report a simple pre-processing step that can substantially improve the denoising performance of the bilateral filter, at almost no additional cost. The modified filter is designed to be robust at large noise levels, and often tends to perform poorly below a certain noise threshold. To get the best of the original and the modified filter, we propose to combine them in a weighted fashion, where the weights are chosen to minimize (a surrogate of) the oracle mean-squared-error (MSE). The optimally-weighted filter is thus guaranteed to perform better than either of the component filters in terms of the MSE, at all noise levels. We also provide a fast algorithm for the weighted filtering. Visual and quantitative denoising results on standard test images are reported which demonstrate that the improvement over the original filter is significant both visually and in terms of PSNR. Moreover, the denoising performance of the optimally-weighted bilateral filter is competitive with the computation-intensive non-local means filter.Comment: To appear in the IEEE International Conference on Image Processing (ICIP 2015). Link to the Matlab code added in the revisio

Image denoising using optimally weighted bilateral filters: A sure and fast approach

The bilateral filter is known to be quite effective in denoising images corrupted with small dosages of additive Gaussian noise. The denoising performance of the filter, however, is known to degrade quickly with the increase in noise level. Several adaptations of the filter have been proposed in the literature to address this shortcoming, but often at a substantial computational overhead. In this paper, we report a simple pre-processing step that can substantially improve the denoising performance of the bilateral filter, at almost no additional cost. The modified filter is designed to be robust at large noise levels, and often tends to perform poorly below a certain noise threshold. To get the best of the original and the modified filter, we propose to combine them in a weighted fashion, where the weights are chosen to minimize (a surrogate of) the oracle mean-squared-error (MSE). The optimally-weighted filter is thus guaranteed to perform better than either of the component filters in terms of the MSE, at all noise levels. We also provide a fast algorithm for the weighted filtering. Visual and quantitative denoising results on standard test images are reported which demonstrate that the improvement over the original filter is significant both visually and in terms of PSNR. Moreover, the denoising performance of the optimally-weighted bilateral filter is competitive with the computation-intensive non-local means filter

Denoising magnetic resonance images using collaborative non-local means

Noise artifacts in magnetic resonance (MR) images increase the complexity of image processing workflows and decrease the reliability of inferences drawn from the images. It is thus often desirable to remove such artifacts beforehand for more robust and effective quantitative analysis. It is important to preserve the integrity of relevant image information while removing noise in MR images. A variety of approaches have been developed for this purpose, and the non-local means (NLM) filter has been shown to be able to achieve state-of-the-art denoising performance. For effective denoising, NLM relies heavily on the existence of repeating structural patterns, which however might not always be present within a single image. This is especially true when one considers the fact that the human brain is complex and contains a lot of unique structures. In this paper we propose to leverage the repeating structures from multiple images to collaboratively denoise an image. The underlying assumption is that it is more likely to find repeating structures from multiple scans than from a single scan. Specifically, to denoise a target image, multiple images, which may be acquired from different subjects, are spatially aligned to the target image, and an NLM-like block matching is performed on these aligned images with the target image as the reference. This will significantly increase the number of matching structures and thus boost the denoising performance. Experiments on both synthetic and real data show that the proposed approach, collaborative non-local means (CNLM), outperforms the classic NLM and yields results with markedly improved structural details

Patch-Based Markov Models for Event Detection in Fluorescence Bioimaging

International audienceThe study of protein dynamics is essential for understanding the multi-molecular complexes at subcellular levels. Fluorescent Protein (XFP)-tagging and time-lapse fluorescence microscopy enable to observe molecular dynamics and interactions in live cells, unraveling the live states of the matter. Original image analysis methods are then required to process challenging 2D or 3D image sequences. Recently, tracking methods that estimate the whole trajectories of moving objects have been successfully developed. In this paper, we address rather the detection of meaningful events in spatio-temporal fluorescence image sequences, such as apparent stable "stocking areas" involved in membrane transport. We propose an original patch-based Markov modeling to detect spatial irregularities in fluorescence images with low false alarm rates. This approach has been developed for real image sequences of cells expressing XFP-tagged Rab proteins, known to regulate membrane trafficking

Progressive multi-atlas label fusion by dictionary evolution

AbstractAccurate segmentation of anatomical structures in medical images is important in recent imaging based studies. In the past years, multi-atlas patch-based label fusion methods have achieved a great success in medical image segmentation. In these methods, the appearance of each input image patch is first represented by an atlas patch dictionary (in the image domain), and then the latent label of the input image patch is predicted by applying the estimated representation coefficients to the corresponding anatomical labels of the atlas patches in the atlas label dictionary (in the label domain). However, due to the generally large gap between the patch appearance in the image domain and the patch structure in the label domain, the estimated (patch) representation coefficients from the image domain may not be optimal for the final label fusion, thus reducing the labeling accuracy. To address this issue, we propose a novel label fusion framework to seek for the suitable label fusion weights by progressively constructing a dynamic dictionary in a layer-by-layer manner, where the intermediate dictionaries act as a sequence of guidance to steer the transition of (patch) representation coefficients from the image domain to the label domain. Our proposed multi-layer label fusion framework is flexible enough to be applied to the existing labeling methods for improving their label fusion performance, i.e., by extending their single-layer static dictionary to the multi-layer dynamic dictionary. The experimental results show that our proposed progressive label fusion method achieves more accurate hippocampal segmentation results for the ADNI dataset, compared to the counterpart methods using only the single-layer static dictionary