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

Robert Link

dblp:51/499 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2000
—ORCID · none

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

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

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.

Computer graphics and multimedia
2 papers
Image and video coding · 75% Multimedia systems and quality of experience · 25%
Theoretical computer science
2 papers
Coding theory · 70% Information theory · 30%

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

TopicWeightPapersLastEvidence papers
Image and video coding
joint source-channel decoding
0.122000
Markov model aided decoding for image transmission using soft-decision-feedback · IEEE Trans. Image Process. 2000
Optimal use of Markov models for DPCM picture transmission over noisy channels · IEEE Trans. Commun. 2000
Image and video coding › predictive coding
differential pulse code modulation
0.012000
Optimal use of Markov models for DPCM picture transmission over noisy channels · IEEE Trans. Commun. 2000
Multimedia systems and quality of experience › image transmission
image transmission over noisy channels
0.012000
Markov model aided decoding for image transmission using soft-decision-feedback · IEEE Trans. Image Process. 2000
Coding theory › error-correcting codes
block codes
0.012000
Optimal use of Markov models for DPCM picture transmission over noisy channels · IEEE Trans. Commun. 2000
Coding theory
channel coding
0.012000
Optimal use of Markov models for DPCM picture transmission over noisy channels · IEEE Trans. Commun. 2000
Coding theory › error-correcting codes › decoding
trellis decoding
0.012000
Markov model aided decoding for image transmission using soft-decision-feedback · IEEE Trans. Image Process. 2000

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

viterbi algorithm · 0.1markov model · 0.1trellis decoding · 0.1soft-decision feedback · 0.1maximum a posteriori · 0.1bahl algorithm · 0.1MAP decoding · 0.1DPCM · 0.1
YearPublicationVenuePosition
2000 Optimal use of Markov models for DPCM picture transmission over noisy channels
abstract
Joint source/channel decoders that use the residual redundancy in the source are investigated for differential pulse code modulation (DPCM) picture transmission over a binary symmetric channel. Markov sequence decoders employing the Viterbi algorithm that use first-order source statistics are reviewed, and generalized for decoders that use second-order source statistics. To make optimal use of the source correlation in both horizontal and vertical directions, it is necessary to generalize the conventional Viterbi decoding algorithm for a one higher-dimensional trellis. The paths through the trellis become two-dimensional "sheets", thus, the technique is coined "sheet decoding". By objective [reconstruction signal-to-noise ratio (SNR)] and subjective measure, it is found that the sheet decoders outperform the Markov sequence decoders that use a first-order Markov model, and outperform two other known decoders (modified maximum a posteriori probability and maximal SNR) that use a second-order Markov model. Moreover, it is found that the use of a simple rate-2/3 block code in conjunction with Markov model-aided decoding (MMAD) offers significant performance improvement for a 2-bit DPCM system. For the example Lenna image, it is observed that the rate-2/3 block code is superior to a rate-2/3 convolutional code for channel-error rates higher than 0.035. The block code is easily incorporated into any of the MMAD DPCM systems and results in a 2-bit MMAD DPCM system that significantly outperforms the noncoded 3-bit MMAD DPCM systems for channel-error rates higher than 0.04.
Robert Link, Samir Kallel
IEEE Trans. Commun.1
2000 Markov model aided decoding for image transmission using soft-decision-feedback
abstract
Soft-decision-feedback MAP decoders are developed for joint source/channel decoding (JSCD) which uses the residual redundancy in two-dimensional sources. The source redundancy is described by a second order Markov model which is made available to the receiver for row-by-row decoding, wherein the output for one row is used to aid the decoding of the next row. Performance can be improved by generalizing so as to increase the vertical depth of the decoder. This is called sheet decoding, and entails generalizing trellis decoding of one-dimensional data to trellis decoding of two-dimensional data (2-D). The proposed soft-decision-feedback sheet decoder is based on the Bahl algorithm, and it is compared to a hard-decision-feedback sheet decoder which is based on the Viterbi algorithm. The method is applied to 3-bit DPCM picture transmission over a binary symmetric channel, and it is found that the soft-decision-feedback decoder with vertical depth V performs approximately as well as the hard-decision-feedback decoder with vertical depth V+1. Because the computational requirement of the decoders depends exponentially on the vertical depth, the soft-decision-feedbark decoder offers significant reduction in complexity. For standard monochrome Lena, at a channel bit error rate of 0.05, the V=1 and V=2 soft-decision-feedback decoder JSCD gains in RSNR are 5.0 and 6.3 dB, respectively.
Robert Link, Samir Kallel
IEEE Trans. Image Process.1