A fast algorithm for DCT-domain inverse motion compensation

Merhav, Neri; Bhaskaran, Vasudev

doi:10.1109/icassp.1996.547743

Cited by 44 publications

(65 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this paper is limited to the discussion of DCT-based motion estimation techniques, while the issue of DCT-based motion compensation is addressed in [28]. Issues related to the DCT-based video coder architecture or similar issues can be found in [29] and [30]. The preprocessing step and adaptive overlapping approach are also discussed in Section IV.…”

Section: Dct-based Motion Estimation I Introductionmentioning

confidence: 99%

DCT-Based Motion Estimation

Koc¹,

Liu²

1995

View full text Add to dashboard Cite

Abstract-We propose novel discrete cosine transform (DCT) pseudophase techniques to estimate shift/delay between two onedimensional (1-D) signals directly from their DCT coefficients by computing the pseudophase shift hidden in DCT and then employing the sinusoidal orthogonal principles, applicable to signal delay estimation remote sensing. Under the two-dimensional (2-D) translational motion model, we further extend the pseudophase techniques to the DCT-based motion estimation (DXT-ME) algorithm for 2-D signals/images. The DXT-ME algorithm has certain advantages over the commonly used full search blockmatching approach (BKM-ME) for application to video coding despite certain limitations. In addition to its robustness in a noisy environment and low computational complexity, O(M 2 ) complexity of BKM-ME for an N 2 N block, its ability to estimate motion completely in DCT domain makes possible the fully DCT-based motion-compensated video coder structure, which has only one major component in the feedback loop instead of three as in the conventional hybrid video coder design, and thus results in a higher system throughput. Furthermore, combination of the DCT and motion estimation units can provide space for further optimization of the overall coder. In addition, the DXT-ME algorithm has solely highly parallel local operations and this property makes feasible parallel implementation suitable for very large scale integration (VLSI) design. Simulation on a number of video sequences is presented with comparison to BKM-ME and other fast block search algorithms for video coding applications even though DXT-ME is completely different from any block search algorithms.

show abstract

Section: Dct-based Motion Estimation I Introductionmentioning

confidence: 99%

DCT-Based Motion Estimation

Koc¹,

Liu²

1995

View full text Add to dashboard Cite

show abstract

“…In [8,18], further savings in the computation of the windowing/shifting matrices is made by using fast DCT. It is reported that 47% reduction in computational complexity with fast DCT over the brute-force method without the assumption of sparseness and 68% with only the top-left 4×4 subblocks being nonzero can be achieved with the use of fast DCT.…”

Section: Integer-pel Dct-based Motion Compensationmentioning

confidence: 99%

Motion Compensation on DCT Domain

Koc¹,

Liu

2001

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

Alternative fully DCT-based video codec architectures have been proposed in the past to address the shortcomings of the conventional hybrid motion compensated DCT video codec structures traditionally chosen as the basis of implementation of standardcompliant codecs. However, no prior effort has been made to ensure interoperability of these two drastically different architectures so that fully DCT-based video codecs are fully compatible with the existing video coding standards. In this paper, we establish the criteria for matching conventional codecs with fully DCT-based codecs. We find that the key to this interoperability lies in the heart of the implementation of motion compensation modules performed in the spatial and transform domains at both the encoder and the decoder. Specifically, if the spatial-domain motion compensation is compatible with the transform-domain motion compensation, then the states in both the coder and the decoder will keep track of each other even after a long series of P-frames. Otherwise, the states will diverge in proportion to the number of P-frames between two I-frames. This sets an important criterion for the development of any DCT-based motion compensation schemes. We also discuss and develop some DCT-based motion compensation schemes as important building blocks of fully DCT-based codecs. For the case of subpixel motion compensation, DCT-based approaches allow more accurate interpolation without any increase in computation. Furthermore, a scare number of DCT coefficients after quantization significantly decreases the number of calculations required for motion compensation. Coupled with the DCT-based motion estimation algorithms, it is possible to realize fully DCT-based codecs to overcome the disadvantages of conventional hybrid codecs.

show abstract

“…Some implementations/methods reduce dramatically the computational cost, but degrade the processed image quality. In [5,6] two reformulations of the convolution operation were proposed, exploiting the sparseness of the DCT-domain representation. The algorithm was applied on each block and for computing were considered 8 neighbouring blocks of 8× 8 pixels.…”

Section: Introductionmentioning

confidence: 99%

“…Unfortunately, in some cases, the resulting formulation turns out to be no faster than pixel level processing version. Thus, in the literature, researchers have proposed and implemented several fast methods of these algorithms [5] - [14], where a trade-off between speed and quality was considered. Some implementations/methods reduce dramatically the computational cost, but degrade the processed image quality.…”

Section: Introductionmentioning

confidence: 99%

“…In [12], the content descriptor is constructed by a run-length edge-block histogram with three patterns including horizontal edge, vertical edge and no-edge. While most of the implemented approaches are based on linear filters, they either are computationally complex ( [5,6]), or optimize the speed but at the cost of generality and precision (as the edge detection based solutions [[6] - [14]]).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Compressed Domain Computationally Efficient Processing Scheme for JPEG Image Filtering

Florea

Gordan

Orza

et al. 2013

AEF

View full text Add to dashboard Cite

Abstract. Image filtering is one of the principal tools used in computer vision applications. Real systems store and manipulate high resolution images in compressed forms, therefore the implementation of the entire processing chain directly in the compressed domain became essential. This includes almost always linear filtering operations implemented by convolution. Linear image filtering implementation directly on the JPEG images is challenging for several reasons, including the complexity of transposing the pixel level convolution in the compressed domain, which may increase the processing time, despite avoiding the decompression. In this paper we propose a new computationally efficient solution for JPEG image filtering (as a spatial convolution between the input image and a given kernel) directly in the DCT based compressed domain. We propose that the convolution operation to be applied just on the periodical extensions of the DCT basis images, as an off-line processing, obtaining the filtered DCT basis images, which are used in data decompression. While this doesn't solve the near block boundaries filtering artefacts for large convolution kernels, for most practical cases, it provides good quality results at a very low computational complexity. These kind of implementations can run at real-time rates/ speeds and are suitable for developments of applications on digital cameras/ DSP/ FPGA.

show abstract

A fast algorithm for DCT-domain inverse motion compensation

Cited by 44 publications

References 5 publications

DCT-Based Motion Estimation

DCT-Based Motion Estimation

Motion Compensation on DCT Domain

Compressed Domain Computationally Efficient Processing Scheme for JPEG Image Filtering

Contact Info

Product

Resources

About