Karen Egiazarian
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Karen Egiazarian has a total of 53 co-authors. Here are the top co-authors by number of shared publications:
- Vladimir Katkovnik
Tampere University, Tampere, Finland
13 shared publications - Atanas Gotchev
Tampere University
10 shared publications - Jaakko Astola
Department of Signal Processing, Tampere University of Technology, Finland
9 shared publications - Vladimir Vasilyevich Lukin
Department of Information-Communication Technologies, National Aerospace University “KhAI”, 61070 Kharkiv, Ukraine
7 shared publications Jaakko Astola
Tampere Univ. of Technology
6 shared publications- Nikolay N. Ponomarenko
National Aerospace University
6 shared publications
Latest Publications
- Open Access
- 7 November 2018
- Published by MDPI AG in Journal of Imaging
- Vol. 4 (11) , 131
Two-Dimensional Orthonormal Tree-Structured Haar Transform for Fast Block Matching
The goal of block matching (BM) is to locate small patches of an image that are similar to a given patch or template. This can be done either in the spatial domain or, more efficiently, in a transform domain. Full search (FS) BM is an accurate, but computationally expensive procedure. Recently introduced orthogonal Haar transform (OHT)-based BM method significantly reduces the computational complexity of FS method. However, it cannot be used in applications where the patch size is not a power of two. In this paper, we generalize OHT-based BM to an arbitrary patch size, introducing a new BM algorithm based on a 2D orthonormal tree-structured Haar transform (OTSHT). Basis images of OHT are uniquely determined from the full balanced binary tree, whereas various OTSHTs can be constructed from any binary tree. Computational complexity of BM depends on a specific design of OTSHT. We compare BM based on OTSHTs to FS and OHT (for restricted patch sizes) within the framework of image denoising, using WNNM as a denoiser. Experimental results on eight grayscale test images corrupted by additive white Gaussian noise with five noise levels demonstrate that WNNM with OTSHT-based BM outperforms other methods both computationally and qualitatively.
- 7 November 2018
- Published by MDPI AG in Journal of Imaging
- Vol. 4 (11) , 131
Open AccessTwo-Dimensional Orthonormal Tree-Structured Haar Transform for Fast Block Matching
The goal of block matching (BM) is to locate small patches of an image that are similar to a given patch or template. This can be done either in the spatial domain or, more efficiently, in a transform domain. Full search (FS) BM is an accurate, but computationally expensive procedure. Recently introduced orthogonal Haar transform (OHT)-based BM method significantly reduces the computational complexity of FS method. However, it cannot be used in applications where the patch size is not a power of two. In this paper, we generalize OHT-based BM to an arbitrary patch size, introducing a new BM algorithm based on a 2D orthonormal tree-structured Haar transform (OTSHT). Basis images of OHT are uniquely determined from the full balanced binary tree, whereas various OTSHTs can be constructed from any binary tree. Computational complexity of BM depends on a specific design of OTSHT. We compare BM based on OTSHTs to FS and OHT (for restricted patch sizes) within the framework of image denoising, using WNNM as a denoiser. Experimental results on eight grayscale test images corrupted by additive white Gaussian noise with five noise levels demonstrate that WNNM with OTSHT-based BM outperforms other methods both computationally and qualitatively.
- 25 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 25 (8) , 1216-1220
Nonlocality-Reinforced Convolutional Neural Networks for Image Denoising
We introduce a paradigm for nonlocal sparsity reinforced deep convolutional neural network denoising. It is a combination of a local multiscale denoising by a convolutional neural network (CNN) based denoiser and a nonlocal denoising based on a nonlocal filter (NLF) exploiting the mutual similarities between groups of patches. CNN models are leveraged with noise levels that progressively decrease at every iteration of our framework, while their output is regularized by a nonlocal prior implicit within the NLF. Unlike complicated neural networks that embed the nonlocality prior within the layers of the network, our framework is modular, it uses standard pre-trained CNNs together with standard nonlocal filters. An instance of the proposed framework, called NN3D, is evaluated over large grayscale image datasets showing state-of-the-art performance.
- 25 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 25 (8) , 1216-1220
Nonlocality-Reinforced Convolutional Neural Networks for Image Denoising
We introduce a paradigm for nonlocal sparsity reinforced deep convolutional neural network denoising. It is a combination of a local multiscale denoising by a convolutional neural network (CNN) based denoiser and a nonlocal denoising based on a nonlocal filter (NLF) exploiting the mutual similarities between groups of patches. CNN models are leveraged with noise levels that progressively decrease at every iteration of our framework, while their output is regularized by a nonlocal prior implicit within the NLF. Unlike complicated neural networks that embed the nonlocality prior within the layers of the network, our framework is modular, it uses standard pre-trained CNNs together with standard nonlocal filters. An instance of the proposed framework, called NN3D, is evaluated over large grayscale image datasets showing state-of-the-art performance.
- Open Access
Multi-frequency phase retrieval from noisy data
The phase retrieval from multi-frequency intensity (power) observations is considered. The object to be reconstructed is complex-valued. A novel algorithm is presented that accomplishes both the object phase (absolute phase) retrieval and denoising for Poissonian and Gaussian measurements. The algorithm is derived from the maximum likelihood formulation with Block Matching 3D (BM3D) sparsity priors. These priors result in two filtering: one is in the complex domain for complex-valued multi-frequency object images and another one in the real domain for the object phase. The algorithm is iterative with alternating projections between the object and measurement variables. The simulation experiments are produced for Fourier transform image formation and random phase modulations of the object, then the observations are random object diffraction patterns. The results demonstrate the success of the algorithm for reconstruction of the complex phase objects with the high-accuracy performance even for very noisy data.
Open AccessMulti-frequency phase retrieval from noisy data
The phase retrieval from multi-frequency intensity (power) observations is considered. The object to be reconstructed is complex-valued. A novel algorithm is presented that accomplishes both the object phase (absolute phase) retrieval and denoising for Poissonian and Gaussian measurements. The algorithm is derived from the maximum likelihood formulation with Block Matching 3D (BM3D) sparsity priors. These priors result in two filtering: one is in the complex domain for complex-valued multi-frequency object images and another one in the real domain for the object phase. The algorithm is iterative with alternating projections between the object and measurement variables. The simulation experiments are produced for Fourier transform image formation and random phase modulations of the object, then the observations are random object diffraction patterns. The results demonstrate the success of the algorithm for reconstruction of the complex phase objects with the high-accuracy performance even for very noisy data.
- 28 January 2018
- Published by Society for Imaging Science & Technology in Electronic Imaging
- Vol. 30 (13) , 260-1
Robust linearized combined metrics of image visual quality
Existing full-reference metrics still do not provide a desirable degree of adequacy to a human visual perception, for evaluation of images with different types and levels of distortions. One reason for this is that it is difficult to incorporate the peculiarities of human visual system in the metrics design. In this paper, a robust approach to full-reference metrics' design is proposed, based on a combination of several existing full-reference metrics. A preliminary linearization (fitting) of the dependence of MOS with respect to the components metrics is performed in order to compensate shortcomings of each component. The proposed method is tested on several known databases, and demonstrate better performance than existing metrics.
- 28 January 2018
- Published by Society for Imaging Science & Technology in Electronic Imaging
- Vol. 30 (13) , 260-1
Robust linearized combined metrics of image visual quality
Existing full-reference metrics still do not provide a desirable degree of adequacy to a human visual perception, for evaluation of images with different types and levels of distortions. One reason for this is that it is difficult to incorporate the peculiarities of human visual system in the metrics design. In this paper, a robust approach to full-reference metrics' design is proposed, based on a combination of several existing full-reference metrics. A preliminary linearization (fitting) of the dependence of MOS with respect to the components metrics is performed in order to compensate shortcomings of each component. The proposed method is tested on several known databases, and demonstrate better performance than existing metrics.
- 27 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
- Vol. 11 (1) , 257-270
Prediction of Compression Ratio for DCT-Based Coders With Application to Remote Sensing Images
A problem of predicting compression ratio (CR) for lossy image compression methods based on discrete cosine transform (DCT) is considered for remote sensing imaging as a main target application. We demonstrate that the noise presence in images leads to specific requirements to lossy image compression as well as to criteria used, and ways to meet these requirements. In particular, it is often desired to compress images in the neighborhood of optimal operation point (OOP) where a compressed image might be closer to the corresponding noise-free one compared to noisy (original, uncompressed) counterpart. In this paper, first, we consider a problem of predicting CR for compressing noisy images in OOP neighborhood. Several statistical parameters calculated in DCT domain in 8 × 8 pixel blocks are used for this. The factors that influence a prediction accuracy and the ways to improve this accuracy are discussed. Next, we show that there is a statistical parameter that does not require any a priori information on noise properties, and that can be used to predict CR with a high accuracy without any necessity to apply multiple image compression/decompression procedures. The proposed methods are thoroughly tested for two DCT-based image coders applied to component-wise lossy compression of hyperspectral data. Finally, a modification of the prediction approach for 3-D compression of multichannel images is proposed.
- 27 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
- Vol. 11 (1) , 257-270
Prediction of Compression Ratio for DCT-Based Coders With Application to Remote Sensing Images
A problem of predicting compression ratio (CR) for lossy image compression methods based on discrete cosine transform (DCT) is considered for remote sensing imaging as a main target application. We demonstrate that the noise presence in images leads to specific requirements to lossy image compression as well as to criteria used, and ways to meet these requirements. In particular, it is often desired to compress images in the neighborhood of optimal operation point (OOP) where a compressed image might be closer to the corresponding noise-free one compared to noisy (original, uncompressed) counterpart. In this paper, first, we consider a problem of predicting CR for compressing noisy images in OOP neighborhood. Several statistical parameters calculated in DCT domain in 8 × 8 pixel blocks are used for this. The factors that influence a prediction accuracy and the ways to improve this accuracy are discussed. Next, we show that there is a statistical parameter that does not require any a priori information on noise properties, and that can be used to predict CR with a high accuracy without any necessity to apply multiple image compression/decompression procedures. The proposed methods are thoroughly tested for two DCT-based image coders applied to component-wise lossy compression of hyperspectral data. Finally, a modification of the prediction approach for 3-D compression of multichannel images is proposed.
- Open Access
Single Image Super-Resolution based on Wiener Filter in Similarity Domain
Single image super resolution (SISR) is an ill-posed problem aiming at estimating a plausible high resolution (HR) image from a single low resolution (LR) image. Current state-of-the-art SISR methods are patch-based. They use either external data or internal self-similarity to learn a prior for a HR image. External data based methods utilize large number of patches from the training data, while self-similarity based approaches leverage one or more similar patches from the input image. In this paper we propose a self-similarity based approach that is able to use large groups of similar patches extracted from the input image to solve the SISR problem. We introduce a novel prior leading to collaborative filtering of patch groups in 1D similarity domain and couple it with an iterative back-projection framework. The performance of the proposed algorithm is evaluated on a number of SISR benchmark datasets. Without using any external data, the proposed approach outperforms the current non-CNN based methods on the tested datasets for various scaling factors. On certain datasets, the gain is over 1 dB, when compared to the recent method A+. For high sampling rate (x4) the proposed method performs similarly to very recent state-of-the-art deep convolutional network based approaches.
Open AccessSingle Image Super-Resolution based on Wiener Filter in Similarity Domain
Single image super resolution (SISR) is an ill-posed problem aiming at estimating a plausible high resolution (HR) image from a single low resolution (LR) image. Current state-of-the-art SISR methods are patch-based. They use either external data or internal self-similarity to learn a prior for a HR image. External data based methods utilize large number of patches from the training data, while self-similarity based approaches leverage one or more similar patches from the input image. In this paper we propose a self-similarity based approach that is able to use large groups of similar patches extracted from the input image to solve the SISR problem. We introduce a novel prior leading to collaborative filtering of patch groups in 1D similarity domain and couple it with an iterative back-projection framework. The performance of the proposed algorithm is evaluated on a number of SISR benchmark datasets. Without using any external data, the proposed approach outperforms the current non-CNN based methods on the tested datasets for various scaling factors. On certain datasets, the gain is over 1 dB, when compared to the recent method A+. For high sampling rate (x4) the proposed method performs similarly to very recent state-of-the-art deep convolutional network based approaches.
- Open Access
Complex-valued image denosing based on group-wise complex-domain sparsity
Phase imaging and wavefront reconstruction from noisy observations of complex exponent is a topic of this paper. It is a highly non-linear problem because the exponent is a 2{\pi}-periodic function of phase. The reconstruction of phase and amplitude is difficult. Even with an additive Gaussian noise in observations distributions of noisy components in phase and amplitude are signal dependent and non-Gaussian. Additional difficulties follow from a prior unknown correlation of phase and amplitude in real life scenarios. In this paper, we propose a new class of non-iterative and iterative complex domain filters based on group-wise sparsity in complex domain. This sparsity is based on the techniques implemented in Block-Matching 3D filtering (BM3D) and 3D/4D High-Order Singular Decomposition (HOSVD) exploited for spectrum design, analysis and filtering. The introduced algorithms are a generalization of the ideas used in the CD-BM3D algorithms presented in our previous publications. The algorithms are implemented as a MATLAB Toolbox. The efficiency of the algorithms is demonstrated by simulation tests.
Open AccessComplex-valued image denosing based on group-wise complex-domain sparsity
Phase imaging and wavefront reconstruction from noisy observations of complex exponent is a topic of this paper. It is a highly non-linear problem because the exponent is a 2{\pi}-periodic function of phase. The reconstruction of phase and amplitude is difficult. Even with an additive Gaussian noise in observations distributions of noisy components in phase and amplitude are signal dependent and non-Gaussian. Additional difficulties follow from a prior unknown correlation of phase and amplitude in real life scenarios. In this paper, we propose a new class of non-iterative and iterative complex domain filters based on group-wise sparsity in complex domain. This sparsity is based on the techniques implemented in Block-Matching 3D filtering (BM3D) and 3D/4D High-Order Singular Decomposition (HOSVD) exploited for spectrum design, analysis and filtering. The introduced algorithms are a generalization of the ideas used in the CD-BM3D algorithms presented in our previous publications. The algorithms are implemented as a MATLAB Toolbox. The efficiency of the algorithms is demonstrated by simulation tests.
- Open Access
A novel two- and multi-level binary phase mask design for enhanced depth-of-focus
This paper introduces a two-and multi-level phase mask design for improved depth of focus. A novel technique is proposed incorporating cubic and generalized cubic wavefront coding (WFC). The obtained system is optical-electronic requiring computational deblurring post-processing, in order to obtain a sharp image from the observed blurred data. A midwave infrared (MWIR) system is simulated showing that this design will produce high quality images even for large amounts of defocus. It is furthermore shown that this technique can be used to design a flat, single optical element, systems where the phase mask performs both the function of focusing and phase modulation. It is demonstrated that in this lensless design the WFC coding components can be omitted and WFC effects are achieved as a result of the proposed algorithm for phase mask design which uses the quadratic phase of the thin refractive lens as the input signal.
Open AccessA novel two- and multi-level binary phase mask design for enhanced depth-of-focus
This paper introduces a two-and multi-level phase mask design for improved depth of focus. A novel technique is proposed incorporating cubic and generalized cubic wavefront coding (WFC). The obtained system is optical-electronic requiring computational deblurring post-processing, in order to obtain a sharp image from the observed blurred data. A midwave infrared (MWIR) system is simulated showing that this design will produce high quality images even for large amounts of defocus. It is furthermore shown that this technique can be used to design a flat, single optical element, systems where the phase mask performs both the function of focusing and phase modulation. It is demonstrated that in this lensless design the WFC coding components can be omitted and WFC effects are achieved as a result of the proposed algorithm for phase mask design which uses the quadratic phase of the thin refractive lens as the input signal.
- 14 September 2015
- Published by SPIE-Intl Soc Optical Eng in SPIE Newsroom
Decreasing the noise sensitivity of off-axis hologram imaging
- 14 September 2015
- Published by SPIE-Intl Soc Optical Eng in SPIE Newsroom
Decreasing the noise sensitivity of off-axis hologram imaging
- 21 August 2015
- Published by Springer Nature
- p. 483-493
Non-local Sigma Filter