Karen Egiazarian

Karen Egiazarian


Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2007 in IEEE International Conference on Image Processing (ICIP)
Verified
Conference Paper
Closed access
KDKostadin Dabov
Kostadin Dabov
AFAlessandro Foi
Alessandro Foi
VKVladimir Katkovnik
Vladimir Katkovnik
KEKaren Egiazarian
Karen Egiazarian
We propose an effective color image denoising method that exploits filtering in highly sparse local 3D transform domain in each channel of a luminance-chrominance color space. For each image block in each channel, a 3D array is formed by stacking together blocks similar to it, a process that we call "grouping". The high similarity between grouped blocks in each 3D array enables a highly sparse representation of the true signal in a 3D transform domain and thus a subsequent shrinkage of the transform spectra results in effective noise attenuation. The peculiarity of the proposed method is the application of a "grouping constraint" on the chrominances by reusing exactly the same grouping as for the luminance. The results demonstrate the effectiveness of the proposed grouping constraint and show that the developed denoising algorithm achieves state-of-the-art performance in terms of both peak signal-to-noise ratio and visual quality.

25 June 2018 in IEEE Signal Processing Letters
Verified
Journal Article
Closed access
CCCristovao Cruz
Cristovao Cruz
AFAlessandro Foi
Alessandro Foi
VKVladimir Katkovnik
Vladimir Katkovnik
KEKaren Egiazarian
Karen Egiazarian
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.

1 September 2007 in IEEE International Conference on Image Processing (ICIP)
Verified
Conference Paper
Closed access
KEKaren Egiazarian
Karen Egiazarian
AFAlessandro Foi
Alessandro Foi
VKVladimir Katkovnik
Vladimir Katkovnik
We introduce a new approach to image reconstruction from highly incomplete data. The available data are assumed to be a small collection of spectral coefficients of an arbitrary linear transform. This reconstruction problem is the subject of intensive study in the recent field of "compressed sensing" (also known as "compressive sampling"). Our approach is based on a quite specific recursive filtering procedure. At every iteration the algorithm is excited by injection of random noise in the unobserved portion of the spectrum and a spatially adaptive image denoising filter, working in the image domain, is exploited to attenuate the noise and reveal new features and details out of the incomplete and degraded observations. This recursive algorithm can be interpreted as a special type of the Robbins-Monro stochastic approximation procedure with regularization enabled by a spatially adaptive filter. Overall, we replace the conventional parametric modeling used in CS by a nonparametric one. We illustrate the effectiveness of the proposed approach for two important inverse problems from computerized tomography: Radon inversion from sparse projections and limited-angle tomography. In particular we show that the algorithm allows to achieve exact reconstruction of synthetic phantom data even from a very small number projections. The accuracy of our reconstruction is in line with the best results in the compressed sensing field.

3 April 2012 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
AVAlexey Vinel
Alexey Vinel
EBEvgeny Belyaev
Evgeny Belyaev
KEKaren Egiazarian
Karen Egiazarian
YKYevgeni Kourcheyavy
Yevgeni Kourcheyavy
Overtaking on rural roads often becomes dangerous when oncoming traffic is detected by the driver too late or its speed is underestimated. Recently proposed cooperative overtaking assistance systems, which are based on Vehicular Ad hoc NETworks (VANETs), rely on either real-time video transmission or the exchange of status messages (beacons). In the first case, a video stream captured by a camera installed at the windshield of a vehicle is compressed and broadcast to any vehicles driving behind it, where it is displayed to the driver. In the second case, beacons that include position, speed, and direction are frequently broadcast by all the vehicles to ensure detection of oncoming traffic as early as possible and to issue a warning to the driver whenever needed. In this paper, we demonstrate that the performance of a video-based overtaking assistant can be significantly improved if codec channel adaptation is undertaken by exploiting information from the beacons about any forthcoming increase in the load of the multiple access channel used. The theoretical framework presented describes the basic patterns of such a coupled overtaking assistant and can serve as a useful guideline for the future practical implementation of the system. The benefits of our approach are demonstrated in relation to the practical scenario of H.264/AVC video coding and IEEE 802.11p/Wireless Access in Vehicular Environments (WAVE) intervehicle communication standards.

4 August 2011
Verified
Book
Open access
Sos AgaianSos Agaian
Sos Agaian
HSHakob G. Sarukhanyan
Hakob G. Sarukhanyan
KEKaren Egiazarian
Karen Egiazarian
JAJaakko Astola
Jaakko Astola
The Hadamard matrix and Hadamard transform are fundamental problem-solving tools in a wide spectrum of scientific disciplines and technologies, such as communication systems, signal and image processing (signal representation, coding, filtering, recognition, and watermarking), digital logic (Boolean function analysis and synthesis), and fault-tolerant system design. Hadamard Transforms intends to bring together different topics concerning current developments in Hadamard matrices, transforms, and their applications. Each chapter begins with the basics of the theory, progresses to more advanced topics, and then discusses cutting-edge implementation techniques. The book covers a wide range of problems related to these matrices/transforms, formulates open questions, and points the way to potential advancements. Hadamard Transforms is suitable for a wide variety of audiences, including graduate students in electrical and computer engineering, mathematics, or computer science. Readers are not presumed to have a sophisticated mathematical background, but some mathematical background is helpful. This book will prepare readers for further exploration and will support aspiring researchers in the field.

1 May 2007
Verified
Conference Paper
Closed access
ABAtanas Boev
Atanas Boev
AGAtanas Gotchev
Atanas Gotchev
KEKaren Egiazarian
Karen Egiazarian
Autostereoscopic displays utilizing slanted lenticular sheets produce specific artifacts. These artifacts affect the perception of a 3D scene, and are caused by a process which can be modeled as inter-channel crosstalk. We propose methodology for measuring such a crosstalk for arbitrary multiview 3D display. The measured data might be used for optimizing multiview image sets for a given display.