Lucio Azzari
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lucio Azzari has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Alessandro Foi
Tampere University, Tampere, Finland
8 shared publications - Atanas Gotchev
Tampere University
3 shared publications - Federica Battisti
Department of Information Engineering, University of Padova, Padua, Italy
2 shared publications - Andrew Douglas Arnold Maidment
University of Pennsylvania, Department of Radiology, Philadelphia, Pennsylvania, United States
1 shared publication - Elina Mäntylä
BioMediTech, Faculty of Medicine and Health Technology, Tampere University, Tampere, Finland
1 shared publication - Jari Hyttinen
Computational Biophysics and Imaging Group, Faculty of Medicine and Health Technology, Tampere University, Tampere, Finland
1 shared publication
Latest Publications
- Open Access
Iterative immunostaining combined with expansion microscopy and image processing reveals nanoscopic network organization of nuclear lamina
Investigation of nuclear lamina architecture relies on super-resolved microscopy. However, epitope accessibility, labeling density, and detection precision of individual molecules pose challenges within the molecularly crowded nucleus. We developed iterative indirect immunofluorescence (IT–IF) staining approach combined with expansion microscopy (ExM) and structured illumination microscopy to improve super-resolution microscopy of subnuclear nanostructures like lamins. We prove that ExM is applicable in analyzing highly compacted nuclear multiprotein complexes such as viral capsids and provide technical improvements to ExM method including 3D-printed gel casting equipment. We show that in comparison to conventional immunostaining, IT-IF results in a higher signal-to-background –ratio and a mean fluorescence intensity by improving the labeling density. Moreover, we present a signal processing pipeline for noise estimation, denoising, and deblurring to aid in quantitative image analyses and provide this platform for the microscopy imaging community. Finally, we show the potential of signal-resolved IT–IF in quantitative super-resolution ExM imaging of nuclear lamina and reveal nanoscopic details of the lamin network organization - a prerequisite for studying intranuclear structural co-regulation of cell function and fate. (Words: 175)
Open AccessIterative immunostaining combined with expansion microscopy and image processing reveals nanoscopic network organization of nuclear lamina
Investigation of nuclear lamina architecture relies on super-resolved microscopy. However, epitope accessibility, labeling density, and detection precision of individual molecules pose challenges within the molecularly crowded nucleus. We developed iterative indirect immunofluorescence (IT–IF) staining approach combined with expansion microscopy (ExM) and structured illumination microscopy to improve super-resolution microscopy of subnuclear nanostructures like lamins. We prove that ExM is applicable in analyzing highly compacted nuclear multiprotein complexes such as viral capsids and provide technical improvements to ExM method including 3D-printed gel casting equipment. We show that in comparison to conventional immunostaining, IT-IF results in a higher signal-to-background –ratio and a mean fluorescence intensity by improving the labeling density. Moreover, we present a signal processing pipeline for noise estimation, denoising, and deblurring to aid in quantitative image analyses and provide this platform for the microscopy imaging community. Finally, we show the potential of signal-resolved IT–IF in quantitative super-resolution ExM imaging of nuclear lamina and reveal nanoscopic details of the lamin network organization - a prerequisite for studying intranuclear structural co-regulation of cell function and fate. (Words: 175)
- 12 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 29 (10577149) , 8339-8354
Collaborative Filtering of Correlated Noise: Exact Transform-Domain Variance for Improved Shrinkage and Patch Matching
Collaborative filters perform denoising through transform-domain shrinkage of a group of similar patches extracted from an image. Existing collaborative filters of stationary correlated noise have all used simple approximations of the transform noise power spectrum adopted from methods which do not employ patch grouping and instead operate on a single patch. We note the inaccuracies of these approximations and introduce a method for the exact computation of the noise power spectrum. Unlike earlier methods, the calculated noise variances are exact even when noise in one patch is correlated with noise in any of the other patches. We discuss the adoption of the exact noise power spectrum within shrinkage, in similarity testing (patch matching), and in aggregation. We also introduce effective approximations of the spectrum for faster computation. Extensive experiments support the proposed method over earlier crude approximations used by image denoising filters such as Block-Matching and 3D-filtering (BM3D), demonstrating dramatic improvement in many challenging conditions.
- 12 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 29 (10577149) , 8339-8354
Collaborative Filtering of Correlated Noise: Exact Transform-Domain Variance for Improved Shrinkage and Patch Matching
Collaborative filters perform denoising through transform-domain shrinkage of a group of similar patches extracted from an image. Existing collaborative filters of stationary correlated noise have all used simple approximations of the transform noise power spectrum adopted from methods which do not employ patch grouping and instead operate on a single patch. We note the inaccuracies of these approximations and introduce a method for the exact computation of the noise power spectrum. Unlike earlier methods, the calculated noise variances are exact even when noise in one patch is correlated with noise in any of the other patches. We discuss the adoption of the exact noise power spectrum within shrinkage, in similarity testing (patch matching), and in aggregation. We also introduce effective approximations of the spectrum for faster computation. Extensive experiments support the proposed method over earlier crude approximations used by image denoising filters such as Block-Matching and 3D-filtering (BM3D), demonstrating dramatic improvement in many challenging conditions.
- 19 April 2018
- Published by IOP Publishing in Measurement Science and Technology
- Vol. 29 (6) , 064003
Restoration of low-dose digital breast tomosynthesis
In breast cancer screening, the radiation dose must be kept to the minimum necessary to achieve the desired diagnostic objective, thus minimizing risks associated with cancer induction. However, decreasing the radiation dose also degrades the image quality. In this work we restore digital breast tomosynthesis (DBT) projections acquired at low radiation doses with the goal of achieving a quality comparable to that obtained from current standard full-dose imaging protocols. A multiframe denoising algorithm was applied to low-dose projections, which are filtered jointly. Furthermore, a weighted average was used to inject a varying portion of the noisy signal back into the denoised one, in order to attain a signal-to-noise ratio comparable to that of standard full-dose projections. The entire restoration framework leverages a signal-dependent noise model with quantum gain which varies both upon the projection angle and on the pixel position. A clinical DBT system and a 3D anthropomorphic breast phantom were used to validate the proposed method, both on DBT projections and slices from the 3D reconstructed volume. The framework is shown to attain the standard full-dose image quality from data acquired at 50% lower radiation dose, whereas progressive loss of relevant details compromises the image quality if the dosage is further decreased.
- 19 April 2018
- Published by IOP Publishing in Measurement Science and Technology
- Vol. 29 (6) , 064003
Restoration of low-dose digital breast tomosynthesis
In breast cancer screening, the radiation dose must be kept to the minimum necessary to achieve the desired diagnostic objective, thus minimizing risks associated with cancer induction. However, decreasing the radiation dose also degrades the image quality. In this work we restore digital breast tomosynthesis (DBT) projections acquired at low radiation doses with the goal of achieving a quality comparable to that obtained from current standard full-dose imaging protocols. A multiframe denoising algorithm was applied to low-dose projections, which are filtered jointly. Furthermore, a weighted average was used to inject a varying portion of the noisy signal back into the denoised one, in order to attain a signal-to-noise ratio comparable to that of standard full-dose projections. The entire restoration framework leverages a signal-dependent noise model with quantum gain which varies both upon the projection angle and on the pixel position. A clinical DBT system and a 3D anthropomorphic breast phantom were used to validate the proposed method, both on DBT projections and slices from the 3D reconstructed volume. The framework is shown to attain the standard full-dose image quality from data acquired at 50% lower radiation dose, whereas progressive loss of relevant details compromises the image quality if the dosage is further decreased.
- 1 April 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 728-731
Variance stabilization in Poisson image deblurring
We consider the restoration of blurred images corrupted by Poisson noise using variance-stabilizing transformations (VST). Although VST are an established tool used extensively for denoising, their adoption in deconvolution problems is problematic because VST are necessarily nonlinear operators, and thus break the linear image-formation model typically adopted in deconvolution. We propose a deblurring framework where the image is 1) deconvolved by a linear regularized inverse filter, 2) transformed by VST into an image which can be treated as corrupted by strong spatially correlated noise with constant variance and known power spectrum, 3) denoised by a filter for additive colored Gaussian noise, 4) returned to the original range via inverse VST. We particularly analyze the stabilization of Poisson variates after linear filtering and characterize the noise power spectrum before and after application of VST. We present an efficient implementation of this original deblurring framework using the BM3D denoising filter, demonstrating state-of-the-art results which are especially appealing in low SNR imaging conditions.
- 1 April 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 728-731
Variance stabilization in Poisson image deblurring
We consider the restoration of blurred images corrupted by Poisson noise using variance-stabilizing transformations (VST). Although VST are an established tool used extensively for denoising, their adoption in deconvolution problems is problematic because VST are necessarily nonlinear operators, and thus break the linear image-formation model typically adopted in deconvolution. We propose a deblurring framework where the image is 1) deconvolved by a linear regularized inverse filter, 2) transformed by VST into an image which can be treated as corrupted by strong spatially correlated noise with constant variance and known power spectrum, 3) denoised by a filter for additive colored Gaussian noise, 4) returned to the original range via inverse VST. We particularly analyze the stabilization of Poisson variates after linear filtering and characterize the noise power spectrum before and after application of VST. We present an efficient implementation of this original deblurring framework using the BM3D denoising filter, demonstrating state-of-the-art results which are especially appealing in low SNR imaging conditions.
- 14 June 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 23 (8) , 1086-1090
Variance Stabilization for Noisy+Estimate Combination in Iterative Poisson Denoising
We denoise Poisson images with an iterative algorithm that progressively improves the effectiveness of variance-stabilizing transformations (VST) for Gaussian denoising filters. At each iteration, a combination of the Poisson observations with the denoised estimate from the previous iteration is treated as scaled Poisson data and filtered through a VST scheme. Due to the slight mismatch between a true scaled Poisson distribution and this combination, a special exact unbiased inverse is designed. We present an implementation of this approach based on the BM3D Gaussian denoising filter. With a computational cost at worst twice that of the noniterative scheme, the proposed algorithm provides significantly better quality, particularly at low signal-to-noise ratio, outperforming much costlier state-of-the-art alternatives.
- 14 June 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 23 (8) , 1086-1090
Variance Stabilization for Noisy+Estimate Combination in Iterative Poisson Denoising
We denoise Poisson images with an iterative algorithm that progressively improves the effectiveness of variance-stabilizing transformations (VST) for Gaussian denoising filters. At each iteration, a combination of the Poisson observations with the denoised estimate from the previous iteration is treated as scaled Poisson data and filtered through a VST scheme. Due to the slight mismatch between a true scaled Poisson distribution and this combination, a special exact unbiased inverse is designed. We present an implementation of this approach based on the BM3D Gaussian denoising filter. With a computational cost at worst twice that of the noniterative scheme, the proposed algorithm provides significantly better quality, particularly at low signal-to-noise ratio, outperforming much costlier state-of-the-art alternatives.
- 1 April 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1573-1577
Collaborative filtering based on group coordinates for smoothing and directional sharpening
Groups of mutually similar image blocks are the key element in nonlocal image processing. In this work, the spatial coordinates of grouped blocks are leveraged in two distinct parts of the transform-domain collaborative filtering within the BM3D algorithm. First, we introduce an adaptive 1-D transform for 3-D collaborative filtering based on sampling 2-D smooth functions at the positions of grouped blocks. This adaptive transform is applied for improved decorrelation of the 2-D spectra of the grouped blocks. Second, we propose a directional sharpening procedure whose strength varies adaptively according to the relative orientation of the transform basis functions with respect to the group coordinates. Experiments confirm the efficacy of the proposed adaptations, for denoising as well as for sharpening of noisy images.
- 1 April 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1573-1577
Collaborative filtering based on group coordinates for smoothing and directional sharpening
Groups of mutually similar image blocks are the key element in nonlocal image processing. In this work, the spatial coordinates of grouped blocks are leveraged in two distinct parts of the transform-domain collaborative filtering within the BM3D algorithm. First, we introduce an adaptive 1-D transform for 3-D collaborative filtering based on sampling 2-D smooth functions at the positions of grouped blocks. This adaptive transform is applied for improved decorrelation of the 2-D spectra of the grouped blocks. Second, we propose a directional sharpening procedure whose strength varies adaptively according to the relative orientation of the transform basis functions with respect to the group coordinates. Experiments confirm the efficacy of the proposed adaptations, for denoising as well as for sharpening of noisy images.
- 2 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 23 (8) , 3459-3467
Indirect Estimation of Signal-Dependent Noise With Nonadaptive Heterogeneous Samples
We consider the estimation of signal-dependent noise from a single image. Unlike conventional algorithms that build a scatterplot of local mean-variance pairs from either small or adaptively selected homogeneous data samples, our proposed approach relies on arbitrarily large patches of heterogeneous data extracted at random from the image. We demonstrate the feasibility of our approach through an extensive theoretical analysis based on mixture of Gaussian distributions. A prototype algorithm is also developed in order to validate the approach on simulated data as well as on real camera raw images.
- 2 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 23 (8) , 3459-3467
Indirect Estimation of Signal-Dependent Noise With Nonadaptive Heterogeneous Samples
We consider the estimation of signal-dependent noise from a single image. Unlike conventional algorithms that build a scatterplot of local mean-variance pairs from either small or adaptively selected homogeneous data samples, our proposed approach relies on arbitrarily large patches of heterogeneous data extracted at random from the image. We demonstrate the feasibility of our approach through an extensive theoretical analysis based on mixture of Gaussian distributions. A prototype algorithm is also developed in order to validate the approach on simulated data as well as on real camera raw images.
- 1 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15206149,p. 5357-5361
Gaussian-Cauchy mixture modeling for robust signal-dependent noise estimation
We introduce an adaptive Gaussian-Cauchy mixture modeling for the likelihood of pairwise mean/standard-deviation scatter points found when estimating signal-dependent noise. The maximization of the likelihood is used to identify the noise-model parameters, following an adaptive mixture parameter that controls the balance between the Gaussian and the heavy-tailed Cauchy. This renders the estimation robust with respect to outliers, typically present in large quantities among the scatter points from images dominated by texture. The modeling is directly suited to describing also observations subject to clipping, i.e. under- or over-exposure. Experiments on a dataset of badly exposed and highly textured images demonstrate the effectiveness of the adaptive Gaussian-Cauchy mixture likelihood for the accurate estimation of the noise standard-deviation curve.
- 1 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15206149,p. 5357-5361
Gaussian-Cauchy mixture modeling for robust signal-dependent noise estimation
We introduce an adaptive Gaussian-Cauchy mixture modeling for the likelihood of pairwise mean/standard-deviation scatter points found when estimating signal-dependent noise. The maximization of the likelihood is used to identify the noise-model parameters, following an adaptive mixture parameter that controls the balance between the Gaussian and the heavy-tailed Cauchy. This renders the estimation robust with respect to outliers, typically present in large quantities among the scatter points from images dominated by texture. The modeling is directly suited to describing also observations subject to clipping, i.e. under- or over-exposure. Experiments on a dataset of badly exposed and highly textured images demonstrate the effectiveness of the adaptive Gaussian-Cauchy mixture likelihood for the accurate estimation of the noise standard-deviation curve.
- 1 February 2012
- Published by SPIE-Intl Soc Optical Eng
- Vol. 8304, 830408
Deblocking of mobile stereo video
Most of candidate methods for compression of mobile stereo video apply block-transform based compression based on the H-264 standard with quantization of transform coefficients driven by quantization parameter (QP). The compression ratio and the resulting bit rate are directly determined by the QP level and high compression is achieved for the price of visually noticeable blocking artifacts. Previous studies on perceived quality of mobile stereo video have revealed that blocking artifacts are the most annoying and most influential in the acceptance/rejection of mobile stereo video and can even completely cancel the 3D effect and the corresponding quality added value. In this work, we address the problem of deblocking of mobile stereo video. We modify a powerful non-local transform-domain collaborative filtering method originally developed for denoising of images and video. The method employs grouping of similar block patches residing in spatial and temporal vicinity of a reference block in filtering them collaboratively in a suitable transform domain. We study the most suitable way of finding similar patches in both channels of stereo video and suggest a hybrid four-dimensional transform to process the collected synchronized (stereo) volumes of grouped blocks. The results benefit from the additional correlation available between the left and right channel of the stereo video. Furthermore, addition sharpening is applied through an embedded alpha-rooting in transform domain, which improve the visual appearance of the deblocked frames.
- 1 February 2012
- Published by SPIE-Intl Soc Optical Eng
- Vol. 8304, 830408
Deblocking of mobile stereo video
Most of candidate methods for compression of mobile stereo video apply block-transform based compression based on the H-264 standard with quantization of transform coefficients driven by quantization parameter (QP). The compression ratio and the resulting bit rate are directly determined by the QP level and high compression is achieved for the price of visually noticeable blocking artifacts. Previous studies on perceived quality of mobile stereo video have revealed that blocking artifacts are the most annoying and most influential in the acceptance/rejection of mobile stereo video and can even completely cancel the 3D effect and the corresponding quality added value. In this work, we address the problem of deblocking of mobile stereo video. We modify a powerful non-local transform-domain collaborative filtering method originally developed for denoising of images and video. The method employs grouping of similar block patches residing in spatial and temporal vicinity of a reference block in filtering them collaboratively in a suitable transform domain. We study the most suitable way of finding similar patches in both channels of stereo video and suggest a hybrid four-dimensional transform to process the collected synchronized (stereo) volumes of grouped blocks. The results benefit from the additional correlation available between the left and right channel of the stereo video. Furthermore, addition sharpening is applied through an embedded alpha-rooting in transform domain, which improve the visual appearance of the deblocked frames.
- 10 February 2011
- Published by SPIE-Intl Soc Optical Eng
- Vol. 7863, 78631C
A modified non-local mean inpainting technique for occlusion filling in depth-image-based rendering
'View plus depth' is an attractive compact representation format for 3D video compression and transmission. It combines 2D video with depth map sequence aligned in a per-pixel manner to represent the moving 3D scene in interest. Any different-perspective view can be synthesized out if this representation through Depth-Image Based Rendering (DIBR). However, such rendering is prone to disocclusion errors: regions originally covered by foreground objects become visible in the synthesized view and have to be filled with perceptually-meaningful data. In this work, a technique for reducing the perceived artifacts by inpainting the disoccluded areas is proposed. Based on Criminisi's exemplar-based inpainting algorithm, the developed technique recovers the disoccluded areas by using pixels of similar blocks surrounding it. In the original work, a moving window is centered on the boundaries between known and unknown parts ('target window'). The known pixels are used to select windows which are most similar to the target one. When this process is completed, the unknown region of the target patch is filled with a weighted combination of pixels from the selected windows. In the proposed scheme, the priority map, which defines the rule for selecting the order of pixels to be filled, has been modified to meet the requirement for disocclusion hole filling and a better non-local mean estimate has been suggested accordingly. Furthermore, the search for similar patches has also been extended to previous and following frames of the video under processing, thus improving both computational efficiency and resulting quality.
- 10 February 2011
- Published by SPIE-Intl Soc Optical Eng
- Vol. 7863, 78631C
A modified non-local mean inpainting technique for occlusion filling in depth-image-based rendering
'View plus depth' is an attractive compact representation format for 3D video compression and transmission. It combines 2D video with depth map sequence aligned in a per-pixel manner to represent the moving 3D scene in interest. Any different-perspective view can be synthesized out if this representation through Depth-Image Based Rendering (DIBR). However, such rendering is prone to disocclusion errors: regions originally covered by foreground objects become visible in the synthesized view and have to be filled with perceptually-meaningful data. In this work, a technique for reducing the perceived artifacts by inpainting the disoccluded areas is proposed. Based on Criminisi's exemplar-based inpainting algorithm, the developed technique recovers the disoccluded areas by using pixels of similar blocks surrounding it. In the original work, a moving window is centered on the boundaries between known and unknown parts ('target window'). The known pixels are used to select windows which are most similar to the target one. When this process is completed, the unknown region of the target patch is filled with a weighted combination of pixels from the selected windows. In the proposed scheme, the priority map, which defines the rule for selecting the order of pixels to be filled, has been modified to meet the requirement for disocclusion hole filling and a better non-local mean estimate has been suggested accordingly. Furthermore, the search for similar patches has also been extended to previous and following frames of the video under processing, thus improving both computational efficiency and resulting quality.