Frequency domain down-conversion of HDTV using adaptive motion compensation

Vetro, Anthony; Sun, Huifang; Bao, Jay; Poon, T.C.

doi:10.1109/icip.1997.648074

Cited by 10 publications

(4 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4 A. Vetro et al studied a DCT-domain down-conversion from high-definition television (HDTV) to standard-definition television for display. 6 In this subsection and those that follow, we present the fundamental techniques of motion compensation and DCT-domain down-conversion.…”

Section: Dct-domain Motion Compensationmentioning

confidence: 99%

CIF-to-QCIF video bitstream down-conversion in the DCT domain

Zhu¹,

Yang²,

Beacken³

2002

Bell Labs Tech. J.

View full text Add to dashboard Cite

Section: Dct-domain Motion Compensationmentioning

confidence: 99%

CIF-to-QCIF video bitstream down-conversion in the DCT domain

Zhu¹,

Yang²,

Beacken³

2002

Bell Labs Tech. J.

View full text Add to dashboard Cite

“…where N k (i) = r 2 N (k) cos 2i + 1 2N k (9) and (k) = 1= p 2 for k = 0, and 1 for k 6 = 0. By substituting (7) into (8) with N = 16 yields,…”

Section: Multiple-block Dependencymentioning

confidence: 99%

“…To simplify the solution to the problem, it is desirable to express the SBD down-conversion over the same range. Therefore, we introduce the lter, X s , which will serve as a compound matrix for the SBD case: 7 5 : (12) In this way, any SBD method can directly down-convert the macroblock a toã according to, a = X s a: (13) Similarly, for an MBD method, the direct conversions can be written as, a = X m a; (14) where X m = X m1 X m2 ]. Note that the lters used in (13) and (14) are the spatial equivalents to those discussed in section 3.…”

Section: Objectives and Proceduresmentioning

confidence: 99%

See 1 more Smart Citation

On the motion compensation within a down-conversion decoder

Vetro

Sun

1998

J. Electron. Imaging

View full text Add to dashboard Cite

The most straightforward approach in obtaining a down-converted image sequence is to decimate each frame after it has been fully decoded. To reduce memory requirements and other costs incurred by this approach, a down-conversion decoder would perform a decimation within the decoding loop. In this way, predictions are made from a low-resolution reference which has experienced a considerable loss of information. Additionally, the predictions must be made from a set of motion vectors which correspond to the full-resolution image sequence. Given these conditions, it is desirable to optimize the performance of the motion compensation process. In this paper we show that the optimal set of lters for performing the low-resolution motion compensation are dependent on the choice of down-conversion lter. The motion compensation lters are determined as the optimal solution of a least squares problem. This problem is formulated in the context of two general classes of down-conversion techniques: one which is dependent on a single block, and another which is dependent on multiple blocks. General solutions for each class of down-conversion are provided. To demonstrate the usefulness of these results, a sample set of motion compensation lters for each class of down-conversion are calculated, and the results are incorporated into a low-resolution decoder. In comparison to a sub-optimal motion compensation scheme, the optimal motion compensation lters realize a drastic reduction in the amount of drift. Simulation results also reveal that the lters which were based on multiple block down-conversion can reduce the amount of prediction drift found in the single block down-conversion by as much as 35%.

show abstract