| 1. |
- Anderson, John B, et al.
(författare)
-
New Trellis source codes based on linear congruential recursions
- 2003
-
Ingår i: Proc., 2003 IEEE International Symposium on Information Theory, Yokohama. - 0780377281 ; , s. 170-170
-
Konferensbidrag (refereegranskat)abstract
- We evaluate a new class of rate-distortion codes based on simple linear congruential recursions. Codes are demonstrated for the uniform and Gaussian sources, whose performance exceeds that so far reported in the literature, including that reported for TCQ codes. The results also point to a new correlation relationship that apparently must exist for trellis codes.
|
|
| 2. |
- Eriksson, Tomas, et al.
(författare)
-
Good trellis source codes at fractional rates
- 2004
-
Ingår i: Proceedings. 2004 IEEE International Symposium on Information Theory. - 0780382803 ; , s. 496-496
-
Konferensbidrag (refereegranskat)abstract
- Two new kinds of fractional-rate trellis source codes based on linear congruential recursions are evaluated. Properties of good codes are given. Square error distortion is similar to or better than competing schemes
|
|
| 3. |
- Eriksson, Tomas, et al.
(författare)
-
Image coding with the MAP criterion
- 2002
-
Ingår i: Proceedings, IEEE 2002 Data Compression Conference. - 0769514774 ; , s. 453-453
-
Konferensbidrag (refereegranskat)abstract
- BCJR based source coding of image residuals is investigated. From a trellis representation of the residual, a joint source-channel coding system is formed. Then the BCJR algorithm is applied to find the MAP encoding. MAP and minimized squared error encoding are compared. The novelty of this work is the use of the BCJR algorithm and the MAP criterion in the source coding procedure. The source encoding system described preserves more features than an MSE based encoder. Also, blocking artifacts are reduced.
|
|
| 4. |
- Eriksson, Tomas, et al.
(författare)
-
MAP criterion image coding using the BCJR algorithm
- 2002
-
Ingår i: Proceedings 2002 IEEE International Symposium on Information Theory (Cat. No.02CH37371). - 0780375017 ; , s. 291-291
-
Konferensbidrag (refereegranskat)abstract
- BCJR based source coding of image residuals is explored. From a trellis representation of the residual, a joint source-channel coding system is formed. The use of the BCJR algorithm is possible due to a procedure which transforms the residuals to a representation with independent identically distributed components having unit variance
|
|
| 5. |
- Eriksson, Tomas, et al.
(författare)
-
MAP criterion trellis source coding for short data sequences
- 2003
-
Ingår i: Proc., IEEE Data Compression Conf., Snowbird, UT. - 0769518966 ; , s. 43-52
-
Konferensbidrag (refereegranskat)abstract
- New trellis constructions for compression of short data sequences are presented. Traditional low rate trellis source coding suffers from having a too small a reproduction alphabet. Governed by alphabet-constrained rate-distortion theory we propose a simple method which for a source coding rate of 1 bit per sample allows 2n reconstruction values for a trellis with 2n states. The proposed method is based on the maximum a posteriori probability criterion distortion measure and it employs tailbiting. Simulation results are compared to TCQ-like methods.
|
|
| 6. |
- Eriksson, Tomas, et al.
(författare)
-
New methods for trellis source coding at rates above and below one
- 2004
-
Ingår i: Proceedings. DCC 2004. Data Compression Conference. - 0769520820 ; , s. 537-537
-
Konferensbidrag (refereegranskat)abstract
- This paper presents new methods trellis source coding at rates above and below one. The new schemes have in common a code design based on branch correlation, a large reproducer alphabet, and an encoder based on either the Viterbi algorithm or a tailbiting MAP technique. The methods are easily adapted to various bit rates, but here only the results for R = 2 and R = 1/2 bits per source sample are presented. Results, demonstrated for the memoryless Gaussian source, show similar or better performances than previous methods with similar coding complexity
|
|
