Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429)
DOI: 10.1109/icip.2003.1247363
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of optimal dynamic rate shaping of Markov-1 sources

Abstract: We discuss the behavior of the optimal solution to the dynamic rate shaping problem assuming an AR(I) source model. By analyzing the statistical and ratedistortion behavior of the different components of this minimization prohlem, the following key result is mathematically proven: "The set of optimal breakpoint values for any frame is invariant to the accumulated motion wmpensated shaping enor fmm past frames and may be very reasonably approximated using the current frame shaping error alone".

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
6
0

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(7 citation statements)
references
References 7 publications
1
6
0
Order By: Relevance
“…The importance of this result is that it allows us to use the much simpler memoryless DRS algorithms without any significant distortion penalty. For the sake of completeness, we repeat a part of the problem formulation from [4], [17]- [20] in the next section.…”
Section: B Contributionsmentioning
confidence: 99%
See 2 more Smart Citations
“…The importance of this result is that it allows us to use the much simpler memoryless DRS algorithms without any significant distortion penalty. For the sake of completeness, we repeat a part of the problem formulation from [4], [17]- [20] in the next section.…”
Section: B Contributionsmentioning
confidence: 99%
“…Thus, the minimization problem for the intercoded case becomes (4) Here, is the accumulated error due to motion compensation based on (optimal) truncation of DCT coefficients in the past frame, while is current-frame only distortion due to rate shaping of transformed prediction error. Note that in general , i.e., motion compensation is a nonlinear operation, because it involves integer arithmetic with truncation away from zero.…”
Section: Constrained Drs Of Intercoded Picturesmentioning
confidence: 99%
See 1 more Smart Citation
“…Let x j be the decoded value of the m-th pixel in scan order within block y j,i , and let x j-1 be the motioncompensated component of x j , that is, the m-th value of block C j,i (y j-1 ) in the same scan order. If the relationship between these two values can be described as a first-order autoregressive [AR(1)] sequence [16] and random MSE distortion (0) j δ is added to x j-1 , the distortion is propagated to x j with (1) …”
Section: An Adaptive Estimation Model For the Overall CD Distortionsmentioning
confidence: 99%
“…Simulation Results for UDA Algorithm Figure 6 shows the simulation results for the Akiyo and Coast Guard sequences, which were controlled for MSE=15 and MSE=25, respectively. In order to compare the performance of the UDA algorithm, a uniform distortion-based CD (UDCD) scheme was chosen [1], [5], [6], [10], [12], [16], [17]. In the UDCD scheme, without considering the propagated errors of each CD distortion, DCT coefficients corresponding to a constant distortion per frame are dropped.…”
Section: P4_10%cd Sum_modelsmentioning
confidence: 99%