Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Konstantinos E. Zachariadis

dblp:41/5128 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2008
0000-0002-6583-153XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%
Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › fading channels
block-fading channel
0.112008
Source fidelity over fading channels: performance of erasure and scalable codes · IEEE Trans. Commun. 2008
Physical-layer communications
fading channels
0.112008
Source fidelity over fading channels: performance of erasure and scalable codes · IEEE Trans. Commun. 2008
Coding theory › error-correcting codes
erasure coding
0.112008
Source fidelity over fading channels: performance of erasure and scalable codes · IEEE Trans. Commun. 2008
Coding theory
source coding
0.112008
Source fidelity over fading channels: performance of erasure and scalable codes · IEEE Trans. Commun. 2008
Coding theory › source coding › scalable source coding
multiresolution source coding
0.012008
Source fidelity over fading channels: performance of erasure and scalable codes · IEEE Trans. Commun. 2008
Coding theory › source coding
scalable source coding
0.012008
Source fidelity over fading channels: performance of erasure and scalable codes · IEEE Trans. Commun. 2008

Methods — techniques the papers use, named apart from their topics

rate-distortion optimization · 0.2power allocation · 0.2
YearPublicationVenuePosition
2008 Source fidelity over fading channels: performance of erasure and scalable codes
abstract
We consider the transmission of a Gaussian source through a block fading channel. Assuming each block is decoded independently, the received distortion depends on the tradeoff between quantization accuracy and probability of outage. Namely, higher quantization accuracy requires a higher channel code rate, which increases the probability of outage. We first treat an outage as an erasure, and evaluate the received mean distortion with erasure coding across blocks as a function of the code length. We then evaluate the performance of scalable, or multi-resolution coding in which coded layers are superimposed within a coherence block, and the layers are sequentially decoded. Both the rate and power allocated to each layer are optimized. In addition to analyzing the performance with a finite number of layers, we evaluate the mean distortion at high signal-to-noise ratios as the number of layers becomes infinite. As the block length of the erasure code increases to infinity, the received distortion converges to a deterministic limit, which is less than the mean distortion with an infinite-layer scalable coding scheme. However, for the same standard deviation in received distortion, infinite layer scalable coding performs slightly better than erasure coding, and with much less decoding delay.
Konstantinos E. Zachariadis, Michael L. Honig, Aggelos K. Katsaggelos
IEEE Trans. Commun.1
2005 Source fidelity over fading channels: erasure codes versus scalable codes
abstract
We consider the transmission of a Gaussian source through a block fading channel. Assuming each block is decoded independently, the received distortion depends on the tradeoff between quantization accuracy and probability of outage. Namely, higher quantization accuracy requires a higher channel code rate, which increases the probability of outage. Here we evaluate the received mean distortion with erasure coding across blocks as a function of the code length. We also evaluate the performance of scalable, or multi-resolution coding in which coded layers are superimposed, and the layers are sequentially decoded. In addition to analyzing a finite number of layers, we evaluate the mean distortion at high signal-to-noise ratios as the number of layers becomes infinite. As the block length of the erasure code increases to infinity, the received distortion converges to a deterministic limit, which is less than the mean distortion with an infinite-layer scalable coding scheme. However, for the same standard deviation in received distortion, infinite layer scalable coding performs slightly better than erasure coding.
Konstantinos E. Zachariadis, Michael L. Honig, Aggelos K. Katsaggelos
GLOBECOM1
2004 Multiple description wavelet coding of layered video
abstract
In this paper, a novel framework for multiple description coding of video is presented. The proposed scheme is based on a wavelet source coder and an efficient methodology for the generation of multiple descriptions. An algorithm is also presented for the optimal, in the sense of maximizing reconstruction quality, allocation of redundancy among the descriptions. Experimental results for the transmission of video using two descriptions demonstrate the efficiency of the proposed method.
Nikolaos V. Boulgouris, Konstantinos E. Zachariadis, Angelos Kanlis 0001, Michael G. Strintzis
ICIP2
2001 Drift-free multiple description coding of video
abstract
A novel framework for multiple description coding of video is presented. The proposed scheme is based on an efficient methodology for the generation of multiple descriptions which eliminates drift at the decoder. An arbitrary number of descriptions can be obtained from the same original video sequence. Experimental results for the transmission of video using two descriptions demonstrate the efficiency of the proposed methodology.
Nikolaos V. Boulgouris, Konstantinos E. Zachariadis, Athanasios Leontaris, Michael G. Strintzis
MMSP2