Nasser Eslahi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Nasser Eslahi has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Ali Aghagolzadeh
Faculty of Electrical and Computer Engineering, Babol Noshirvani University of Technology, Babol, Iran
6 shared publications - Alessandro Foi
Tampere University, Tampere, Finland
4 shared publications Seyed Mehdi Hosseini Andargoli
Faculty of Electrical and Computer Engineering, Babol University of Technology, Babol, Iran
2 shared publicationsHami Mahdavinataj
Department of Electrical and Computer Engineering, Babol University of Technology, Iran
1 shared publication- Hami Mahdavinataj
Department of Electrical and Computer Engineering Babol University of Technology Babol Iran
1 shared publication - Lasse Laurson
Tampere University
1 shared publication
Latest Publications
- 14 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Imaging
- Vol. 8 (25730436) , 945-960
Improved Sparse Signal Recovery via Adaptive Correlated Noise Model
Sparse signal recovery consists of employing a sparsity promoting regularizer to estimate the underlying signal from an incomplete set of measurements. Typical recovery approaches involve an alternating procedure where the estimate of the signal is progressively refined through filtering its degraded observation by a denoiser. The filter acts, implicitly, as a regularizer for the estimate. Hence, the implicit regularization is determined by the signal model underlying the denoising filter, as well as by the model of effective noise (i.e. degradation to be filtered) adopted by the filter. We improve the recovery by an adaptive stationary correlated noise model and the corresponding denoiser in place of the traditional filters for uncorrelated white noise. The effective noise can vary as the recovery progresses and we track these variations by estimating the noise correlation at every iteration. Competitive inverse problems are considered as benchmarks, including compressive spectral/temporal imaging and 2D/3D tomography. Analysis of the effective noise within each application demonstrates that it features various forms of correlation, which if leveraged by a denoiser lead to a better and faster signal recovery.
- 14 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Imaging
- Vol. 8 (25730436) , 945-960
Improved Sparse Signal Recovery via Adaptive Correlated Noise Model
Sparse signal recovery consists of employing a sparsity promoting regularizer to estimate the underlying signal from an incomplete set of measurements. Typical recovery approaches involve an alternating procedure where the estimate of the signal is progressively refined through filtering its degraded observation by a denoiser. The filter acts, implicitly, as a regularizer for the estimate. Hence, the implicit regularization is determined by the signal model underlying the denoising filter, as well as by the model of effective noise (i.e. degradation to be filtered) adopted by the filter. We improve the recovery by an adaptive stationary correlated noise model and the corresponding denoiser in place of the traditional filters for uncorrelated white noise. The effective noise can vary as the recovery progresses and we track these variations by estimating the noise correlation at every iteration. Competitive inverse problems are considered as benchmarks, including compressive spectral/temporal imaging and 2D/3D tomography. Analysis of the effective noise within each application demonstrates that it features various forms of correlation, which if leveraged by a denoiser lead to a better and faster signal recovery.
- Open Access
- 1 December 2021
- Published by Elsevier in Acta Materialia
- Vol. 221
Mimicking Barkhausen noise measurement by in-situ transmission electron microscopy - effect of microstructural steel features on Barkhausen noise
- 1 December 2021
- Published by Elsevier in Acta Materialia
- Vol. 221
Open AccessMimicking Barkhausen noise measurement by in-situ transmission electron microscopy - effect of microstructural steel features on Barkhausen noise
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 111-115
Joint Sparse Recovery of Misaligned Multimodal Images via Adaptive Local and Nonlocal Cross-Modal Regularization
Given few noisy linear measurements of distinct misaligned modalities, we aim at recovering the underlying multimodal image using a sparsity promoting algorithm. Unlike previous multimodal sparse recovery approaches employing side information under the naive assumption of perfect calibration of modalities or of known deformation parameters, we adaptively estimate the deformation parameters from the images separately recovered from the incomplete measurements. We develop a multiscale dense registration method that proceeds alternately by finding block-wise intensity mapping models and a shift vector field which is used to obtain and refine the deformation parameters through a weighted least-squares approximation. The co-registered images are then jointly recovered in a plug-and-play framework where a collaborative filter leverages the local and nonlocal cross-modal correlations inherent to the multimodal image. Our experiments with this fully automatic registration and joint recovery pipeline show a better detection and sharper recovery of fine details which could not be separately recovered.
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 111-115
Joint Sparse Recovery of Misaligned Multimodal Images via Adaptive Local and Nonlocal Cross-Modal Regularization
Given few noisy linear measurements of distinct misaligned modalities, we aim at recovering the underlying multimodal image using a sparsity promoting algorithm. Unlike previous multimodal sparse recovery approaches employing side information under the naive assumption of perfect calibration of modalities or of known deformation parameters, we adaptively estimate the deformation parameters from the images separately recovered from the incomplete measurements. We develop a multiscale dense registration method that proceeds alternately by finding block-wise intensity mapping models and a shift vector field which is used to obtain and refine the deformation parameters through a weighted least-squares approximation. The co-registered images are then jointly recovered in a plug-and-play framework where a collaborative filter leverages the local and nonlocal cross-modal correlations inherent to the multimodal image. Our experiments with this fully automatic registration and joint recovery pipeline show a better detection and sharper recovery of fine details which could not be separately recovered.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Anisotropic Spatiotemporal Regularization in Compressive Video Recovery by Adaptively Modeling the Residual Errors as Correlated Noise
Many approaches to compressive video recovery proceed iteratively, treating the difference between the previous estimate and the ideal video as residual noise to be filtered. We go beyond the common white-noise modeling by adaptively modeling the residual as stationary spatiotemporally correlated noise. This adaptive noise model is updated at each iteration and is highly anisotropic in space and time; we leverage it with respect to the transform spectra of a motion-compensated video denoiser. Experimental results demonstrate that our proposed adaptive correlated noise model outperforms state-of-the-art methods both quantitatively and qualitatively.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Anisotropic Spatiotemporal Regularization in Compressive Video Recovery by Adaptively Modeling the Residual Errors as Correlated Noise
Many approaches to compressive video recovery proceed iteratively, treating the difference between the previous estimate and the ideal video as residual noise to be filtered. We go beyond the common white-noise modeling by adaptively modeling the residual as stationary spatiotemporally correlated noise. This adaptive noise model is updated at each iteration and is highly anisotropic in space and time; we leverage it with respect to the transform spectra of a motion-compensated video denoiser. Experimental results demonstrate that our proposed adaptive correlated noise model outperforms state-of-the-art methods both quantitatively and qualitatively.
- 1 August 2016
- Published by Elsevier in Neurocomputing
- Vol. 200, 88-109
Image/video compressive sensing recovery using joint adaptive sparsity measure
- 1 August 2016
- Published by Elsevier in Neurocomputing
- Vol. 200, 88-109
Image/video compressive sensing recovery using joint adaptive sparsity measure
- 1 July 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 25 (7) , 3126-3140
Compressive Sensing Image Restoration Using Adaptive Curvelet Thresholding and Nonlocal Sparse Regularization
Compressive sensing (CS) is a recently emerging technique and an extensively studied problem in signal and image processing, which suggests a new framework for the simultaneous sampling and compression of sparse or compressible signals at a rate significantly below the Nyquist rate. Maybe, designing an effective regularization term reflecting the image sparse prior information plays a critical role in CS image restoration. Recently, both local smoothness and nonlocal self-similarity have led to superior sparsity prior for CS image restoration. In this paper, first, an adaptive curvelet thresholding criterion is developed, trying to adaptively remove the perturbations appeared in recovered images during CS recovery process, imposing sparsity. Furthermore, a new sparsity measure called joint adaptive sparsity regularization (JASR) is established, which enforces both local sparsity and nonlocal 3-D sparsity in transform domain, simultaneously. Then, a novel technique for high-fidelity CS image recovery via JASR is proposed-CS-JASR. To efficiently solve the proposed corresponding optimization problem, we employ the split Bregman iterations. Extensive experimental results are reported to attest the adequacy and effectiveness of the proposed method comparing with the current state-of-the-art methods in CS image restoration.
- 1 July 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 25 (7) , 3126-3140
Compressive Sensing Image Restoration Using Adaptive Curvelet Thresholding and Nonlocal Sparse Regularization
Compressive sensing (CS) is a recently emerging technique and an extensively studied problem in signal and image processing, which suggests a new framework for the simultaneous sampling and compression of sparse or compressible signals at a rate significantly below the Nyquist rate. Maybe, designing an effective regularization term reflecting the image sparse prior information plays a critical role in CS image restoration. Recently, both local smoothness and nonlocal self-similarity have led to superior sparsity prior for CS image restoration. In this paper, first, an adaptive curvelet thresholding criterion is developed, trying to adaptively remove the perturbations appeared in recovered images during CS recovery process, imposing sparsity. Furthermore, a new sparsity measure called joint adaptive sparsity regularization (JASR) is established, which enforces both local sparsity and nonlocal 3-D sparsity in transform domain, simultaneously. Then, a novel technique for high-fidelity CS image recovery via JASR is proposed-CS-JASR. To efficiently solve the proposed corresponding optimization problem, we employ the split Bregman iterations. Extensive experimental results are reported to attest the adequacy and effectiveness of the proposed method comparing with the current state-of-the-art methods in CS image restoration.
- Open Access
Mixed Gaussian-Impulse Noise Removal from Highly Corrupted Images via Adaptive Local and Nonlocal Statistical Priors
The motivation of this paper is to introduce a novel framework for the restoration of images corrupted by mixed Gaussian-impulse noise. To this aim, first, an adaptive curvelet thresholding criterion is proposed which tries to adaptively remove the perturbations appeared during denoising process. Then, a new statistical regularization term, called joint adaptive statistical prior (JASP), is established which enforces both the local and nonlocal statistical consistencies, simultaneously, in a unified manner. Furthermore, a novel technique for mixed Gaussian plus impulse noise removal using JASP in a variational scheme is developed--we refer to it as De-JASP. To efficiently solve the above variational scheme, an efficient alternating minimization algorithm based on split Bregman iterative framework is developed. Extensive experimental results manifest the effectiveness of the proposed method comparing with the current state-of-the-art methods in mixed Gaussian-impulse noise removal.
Open AccessMixed Gaussian-Impulse Noise Removal from Highly Corrupted Images via Adaptive Local and Nonlocal Statistical Priors
The motivation of this paper is to introduce a novel framework for the restoration of images corrupted by mixed Gaussian-impulse noise. To this aim, first, an adaptive curvelet thresholding criterion is proposed which tries to adaptively remove the perturbations appeared during denoising process. Then, a new statistical regularization term, called joint adaptive statistical prior (JASP), is established which enforces both the local and nonlocal statistical consistencies, simultaneously, in a unified manner. Furthermore, a novel technique for mixed Gaussian plus impulse noise removal using JASP in a variational scheme is developed--we refer to it as De-JASP. To efficiently solve the above variational scheme, an efficient alternating minimization algorithm based on split Bregman iterative framework is developed. Extensive experimental results manifest the effectiveness of the proposed method comparing with the current state-of-the-art methods in mixed Gaussian-impulse noise removal.
- 1 November 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 70-75
Mixed Gaussian-impulse noise removal from highly corrupted images via adaptive local and nonlocal statistical priors
The motivation of this paper is to introduce a novel framework for the restoration of images corrupted by mixed Gaussian-impulse noise. To this aim, first, an adaptive curvelet thresholding criterion is proposed which tries to adaptively remove the perturbations appeared during denoising process. Then, a new statistical regularization term, called joint adaptive statistical prior (JASP), is established which enforces both the local and nonlocal statistical consistencies, simultaneously, in a unified manner. Furthermore, a novel technique for mixed Gaussian plus impulse noise removal using JASP in a variational scheme is developed-we refer to it as De-JASP. To efficiently solve the above variational scheme, an efficient alternating minimization algorithm is developed based on split Bregman iterative framework. Extensive experimental results manifest the effectiveness of the proposed method comparing with the current state-of-the-art methods in mixed Gaussian-impulse noise removal.
- 1 November 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 70-75
Mixed Gaussian-impulse noise removal from highly corrupted images via adaptive local and nonlocal statistical priors
The motivation of this paper is to introduce a novel framework for the restoration of images corrupted by mixed Gaussian-impulse noise. To this aim, first, an adaptive curvelet thresholding criterion is proposed which tries to adaptively remove the perturbations appeared during denoising process. Then, a new statistical regularization term, called joint adaptive statistical prior (JASP), is established which enforces both the local and nonlocal statistical consistencies, simultaneously, in a unified manner. Furthermore, a novel technique for mixed Gaussian plus impulse noise removal using JASP in a variational scheme is developed-we refer to it as De-JASP. To efficiently solve the above variational scheme, an efficient alternating minimization algorithm is developed based on split Bregman iterative framework. Extensive experimental results manifest the effectiveness of the proposed method comparing with the current state-of-the-art methods in mixed Gaussian-impulse noise removal.
- 1 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1569-1574
Block compressed sensing images using accelerated iterative shrinkage thresholding
In this paper, first we present an improved method for conventional block-based compressed sensing (BCS) image recovery algorithm called BCS-SPL that deploys smoothed projected Landweber (SPL) iterations for image recovery. In our proposed method a median filter is applied instead of Wiener filter, specifically in low measurement rates. Also, we employ a strict thresholding criterion as an alternative to the universal threshold criterion. We refer to call our proposed method as BCS-ImSPL. Also, we investigate how the BCS-ImSPL can be improved to a faster recovery algorithm, by considering two accelerated strategies, Beck and Teboulle's fast iterative shrinkage thresholding algorithm (FISTA) and Bioucas-Dias and Figueiredo's two-step iterative shrinkage thresholding (TwIST) algorithm. To compare our experimental results with the other methods, we employ the pick signal to noise ratio (PSNR) and the structural similarity (SSIM) index as the quality assessors. Our vast experiments show good performance of the accelerated BCS-ImSPL method for recovery of images in terms of execution time and image quality.
- 1 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1569-1574
Block compressed sensing images using accelerated iterative shrinkage thresholding
In this paper, first we present an improved method for conventional block-based compressed sensing (BCS) image recovery algorithm called BCS-SPL that deploys smoothed projected Landweber (SPL) iterations for image recovery. In our proposed method a median filter is applied instead of Wiener filter, specifically in low measurement rates. Also, we employ a strict thresholding criterion as an alternative to the universal threshold criterion. We refer to call our proposed method as BCS-ImSPL. Also, we investigate how the BCS-ImSPL can be improved to a faster recovery algorithm, by considering two accelerated strategies, Beck and Teboulle's fast iterative shrinkage thresholding algorithm (FISTA) and Bioucas-Dias and Figueiredo's two-step iterative shrinkage thresholding (TwIST) algorithm. To compare our experimental results with the other methods, we employ the pick signal to noise ratio (PSNR) and the structural similarity (SSIM) index as the quality assessors. Our vast experiments show good performance of the accelerated BCS-ImSPL method for recovery of images in terms of execution time and image quality.
- 1 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21647054,p. 1581-1586
Block compressed sensing images using Curvelet transform
Due to the optimal sparse representation of objects with edges by the multiscale and directional Curvelet Transform, its application have been increasingly interested over the past years. In this paper, we investigate how the block-based compressed sensing (BCS) can be improved to an efficient recovery algorithm, by employing the iterative Curvelet thresholding (ICT). Also, we consider two accelerated iterative shrinkage thresholding (IST) methods, including the following: 1) Beck and Teboulle's fast iterative shrinkage thresholding algorithm (FISTA); 2) Bioucas-Dias and Figueiredo's two-step iterative shrinkage thresholding (TwIST) algorithm, to increase the execution speed of the proposed methods rather than simple ICT. To compare our experimental results with the results of some other methods, we employ pick signal to noise ratio (PSNR) and structural similarity (SSIM) index as the quality assessor. Numerical results show good performance of the new proposed BCS using accelerated ICT methods, in terms of these two quality assessments.
- 1 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21647054,p. 1581-1586
Block compressed sensing images using Curvelet transform
Due to the optimal sparse representation of objects with edges by the multiscale and directional Curvelet Transform, its application have been increasingly interested over the past years. In this paper, we investigate how the block-based compressed sensing (BCS) can be improved to an efficient recovery algorithm, by employing the iterative Curvelet thresholding (ICT). Also, we consider two accelerated iterative shrinkage thresholding (IST) methods, including the following: 1) Beck and Teboulle's fast iterative shrinkage thresholding algorithm (FISTA); 2) Bioucas-Dias and Figueiredo's two-step iterative shrinkage thresholding (TwIST) algorithm, to increase the execution speed of the proposed methods rather than simple ICT. To compare our experimental results with the results of some other methods, we employ pick signal to noise ratio (PSNR) and structural similarity (SSIM) index as the quality assessor. Numerical results show good performance of the new proposed BCS using accelerated ICT methods, in terms of these two quality assessments.