MANY image and video compression standards such as

Similar documents
COMPRESSED DOMAIN SPATIAL SCALING OF MPEG VIDEO BIT- STREAMS WITH COMPARATIVE EVALUATION

Video Compression System for Online Usage Using DCT 1 S.B. Midhun Kumar, 2 Mr.A.Jayakumar M.E 1 UG Student, 2 Associate Professor

Multiframe Blocking-Artifact Reduction for Transform-Coded Video

DUE to the high computational complexity and real-time

A Fast Scheme for Downsampling and Upsampling in the DCT

Express Letters. A Simple and Efficient Search Algorithm for Block-Matching Motion Estimation. Jianhua Lu and Ming L. Liou

ECE 417 Guest Lecture Video Compression in MPEG-1/2/4. Min-Hsuan Tsai Apr 02, 2013

Video Compression Method for On-Board Systems of Construction Robots

Efficient Halving and Doubling 4 4 DCT Resizing Algorithm

Efficient DCT-domain Blind Measurement and Reduction of Blocking Artifacts

PERFORMANCE ANALYSIS OF INTEGER DCT OF DIFFERENT BLOCK SIZES USED IN H.264, AVS CHINA AND WMV9.

2D-DST scheme for image mirroring and rotation

EE 5359 Low Complexity H.264 encoder for mobile applications. Thejaswini Purushotham Student I.D.: Date: February 18,2010

THE orthogonal frequency-division multiplex (OFDM)

Sequence Mirroring Properties of Orthogonal Transforms Having Even and Odd Symmetric Vectors. K. R. Rao

DIGITAL TELEVISION 1. DIGITAL VIDEO FUNDAMENTALS

Adaptive Up-Sampling Method Using DCT for Spatial Scalability of Scalable Video Coding IlHong Shin and Hyun Wook Park, Senior Member, IEEE

An efficient multiplierless approximation of the fast Fourier transform using sum-of-powers-of-two (SOPOT) coefficients

Comparative Study of Partial Closed-loop Versus Open-loop Motion Estimation for Coding of HDTV

Motion Estimation Using Low-Band-Shift Method for Wavelet-Based Moving-Picture Coding

Twiddle Factor Transformation for Pipelined FFT Processing

CSE237A: Final Project Mid-Report Image Enhancement for portable platforms Rohit Sunkam Ramanujam Soha Dalal

Optimizing the Deblocking Algorithm for. H.264 Decoder Implementation

System Modeling and Implementation of MPEG-4. Encoder under Fine-Granular-Scalability Framework

Outline Introduction MPEG-2 MPEG-4. Video Compression. Introduction to MPEG. Prof. Pratikgiri Goswami

Computer and Machine Vision

Video Compression An Introduction

Scalable Multiresolution Video Coding using Subband Decomposition

DIGITAL WATERMARKING FOR GRAY-LEVEL WATERMARKS

FPGA Implementation of Low Complexity Video Encoder using Optimized 3D-DCT

Video Transcoding Architectures and Techniques: An Overview. IEEE Signal Processing Magazine March 2003 Present by Chen-hsiu Huang

Implementation and analysis of Directional DCT in H.264

EE 5359 H.264 to VC 1 Transcoding

Enhanced Hexagon with Early Termination Algorithm for Motion estimation

A VLSI Architecture for H.264/AVC Variable Block Size Motion Estimation

Homogeneous Transcoding of HEVC for bit rate reduction

VLSI Computational Architectures for the Arithmetic Cosine Transform

Fast Decision of Block size, Prediction Mode and Intra Block for H.264 Intra Prediction EE Gaurav Hansda

AN EFFICIENT VIDEO WATERMARKING USING COLOR HISTOGRAM ANALYSIS AND BITPLANE IMAGE ARRAYS

Comparative Analysis of 2-Level and 4-Level DWT for Watermarking and Tampering Detection

AMONG various transform techniques for image compression,

M.N.MURTY Department of Physics, National Institute of Science and Technology, Palur Hills, Berhampur , Odisha (INDIA).

The VC-1 and H.264 Video Compression Standards for Broadband Video Services

DESIGN OF DCT ARCHITECTURE USING ARAI ALGORITHMS

Pipelined Fast 2-D DCT Architecture for JPEG Image Compression

Week 14. Video Compression. Ref: Fundamentals of Multimedia

IMAGE COMPRESSION USING ANTI-FORENSICS METHOD

Estimating Multimedia Instruction Performance Based on Workload Characterization and Measurement

Low-Complexity Block-Based Motion Estimation via One-Bit Transforms

Three Dimensional Motion Vectorless Compression

A deblocking filter with two separate modes in block-based video coding

Three-D DWT of Efficient Architecture

EE Low Complexity H.264 encoder for mobile applications

Adaptive Quantization for Video Compression in Frequency Domain

Chapter 11.3 MPEG-2. MPEG-2: For higher quality video at a bit-rate of more than 4 Mbps Defined seven profiles aimed at different applications:

Zonal MPEG-2. Cheng-Hsiung Hsieh *, Chen-Wei Fu and Wei-Lung Hung

A Parallel Reconfigurable Architecture for DCT of Lengths N=32/16/8

A New Configuration of Adaptive Arithmetic Model for Video Coding with 3D SPIHT

Chapter 10. Basic Video Compression Techniques Introduction to Video Compression 10.2 Video Compression with Motion Compensation

PREFACE...XIII ACKNOWLEDGEMENTS...XV

signal-to-noise ratio (PSNR), 2

Hybrid Video Compression Using Selective Keyframe Identification and Patch-Based Super-Resolution

An Improved Images Watermarking Scheme Using FABEMD Decomposition and DCT

Motion Estimation. Original. enhancement layers. Motion Compensation. Baselayer. Scan-Specific Entropy Coding. Prediction Error.

Motion-Compensated Subband Coding. Patrick Waldemar, Michael Rauth and Tor A. Ramstad

EE 5359 MULTIMEDIA PROCESSING SPRING Final Report IMPLEMENTATION AND ANALYSIS OF DIRECTIONAL DISCRETE COSINE TRANSFORM IN H.

Index. 1. Motivation 2. Background 3. JPEG Compression The Discrete Cosine Transformation Quantization Coding 4. MPEG 5.

Interframe coding A video scene captured as a sequence of frames can be efficiently coded by estimating and compensating for motion between frames pri

IMAGE COMPRESSION USING HYBRID TRANSFORM TECHNIQUE

Locating 1-D Bar Codes in DCT-Domain

Extraction of Region of Interest in Compressed Domain

System Modeling and Implementation of MPEG-4. Encoder under Fine-Granular-Scalability Framework

New Approach of Estimating PSNR-B For Deblocked

Parallel-computing approach for FFT implementation on digital signal processor (DSP)

Complexity Reduction Tools for MPEG-2 to H.264 Video Transcoding

Packed Integer Wavelet Transform Constructed by Lifting Scheme

VIDEO streaming applications over the Internet are gaining. Brief Papers

Automatic Video Caption Detection and Extraction in the DCT Compressed Domain

Network Image Coding for Multicast

VIDEO AND IMAGE PROCESSING USING DSP AND PFGA. Chapter 3: Video Processing

Fast Wavelet-based Macro-block Selection Algorithm for H.264 Video Codec

MPEG-2. And Scalability Support. Nimrod Peleg Update: July.2004

A 3-D Virtual SPIHT for Scalable Very Low Bit-Rate Embedded Video Compression

Performance analysis of Integer DCT of different block sizes.

THE discrete cosine transform (DCT) is the most popular

Design of 2-D DWT VLSI Architecture for Image Processing

Transactions Briefs. An Adaptive Search Length Algorithm for Block Matching Motion Estimation

Design and Implementation of Lifting Based Two Dimensional Discrete Wavelet Transform

Feature Based Watermarking Algorithm by Adopting Arnold Transform

Using Streaming SIMD Extensions in a Fast DCT Algorithm for MPEG Encoding

Authentication and Secret Message Transmission Technique Using Discrete Fourier Transformation

Satellite Image Processing Using Singular Value Decomposition and Discrete Wavelet Transform

MULTIDIMENSIONAL SIGNAL, IMAGE, AND VIDEO PROCESSING AND CODING

Implementation of Lifting-Based Two Dimensional Discrete Wavelet Transform on FPGA Using Pipeline Architecture

N RISCE 2K18 ISSN International Journal of Advance Research and Innovation

A Novel Statistical Distortion Model Based on Mixed Laplacian and Uniform Distribution of Mpeg-4 FGS

EFFICIENT DEISGN OF LOW AREA BASED H.264 COMPRESSOR AND DECOMPRESSOR WITH H.264 INTEGER TRANSFORM

International Journal of Wavelets, Multiresolution and Information Processing c World Scientific Publishing Company

Modeling and Simulation of H.26L Encoder. Literature Survey. For. EE382C Embedded Software Systems. Prof. B.L. Evans

Fast frame memory access method for H.264/AVC

Transcription:

696 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL 9, NO 5, AUGUST 1999 An Efficient Method for DCT-Domain Image Resizing with Mixed Field/Frame-Mode Macroblocks Changhoon Yim and Michael A Isnardi Abstract This paper deals with discrete cosine transform (DCT)-domain image resizing as compressed domain processing Previous DCT-domain image resizing methods assume that all macroblocks are in the frame mode In this paper, we propose an efficient method for DCT-domain image resizing with mixed field/frame-mode macroblocks This method is developed from the investigation of the DCT-domain image resizing operation through a decomposition of matrix operations, from which we define new downsampling matrices for frame- and field-mode macroblocks This leads to new frame- and field-mode resizing transformation matrices for DCT-domain image resizing The proposed DCT-domain image resizing method can be used when there are mixed field/frame-mode macroblocks Index Terms Compressed domain processing, discrete cosine transform (DCT)-domain image resizing, field/frame-mode macroblock, resizing transformation matrix I INTRODUCTION MANY image and video compression standards such as JPEG, MPEG-1, MPEG-2, and H261 are based on discrete cosine transform (DCT) coding techniques Video manipulation in the compressed domain can save computation by processing less data and reducing the conversion process between compressed and uncompressed data There has been considerable research for processing images and videos directly in the DCT domain in the context of compressed domain processing [1] [4] Image resizing is a fundamental form of image manipulation Some research has been performed for image resizing in the DCT domain [3], [5] [7] MPEG-2 is specified as the video compression standard for digital television by the Advanced Television Systems Committee [8] In MPEG-2, there are field and frame pictures to accommodate coding of progressive and interlaced video [9] In a frame picture, either field or frame mode may be selected on a macroblock-by-macroblock basis for the improvement of coding efficiency Hence there can be mixed field- and frame-mode macroblocks in MPEG-2 video compression Fig 1 shows the field and frame mode of a macroblock in the spatial domain In Fig 1, and represent the vertical (row) and horizontal (column) index, respectively Previous DCT-domain image resizing methods [3], [5] [7] assume that Manuscript received January 25, 1998; revised December 11, 1998 This work was performed as part of the NIST HDTV Broadcast Technology Project (70NANB5H1174) and was supported by Thomson Consumer Electronics and by the National Institute of Standards and Technology This paper was recommended by Associate Editor S-F Chang C Yim was with the Compression Systems Group, Sarnoff Corp, Princeton, NJ 08543-5300 USA He is now with Bell Labs, Lucent Technologies, Murray Hill, NJ 07974 USA M A Isnardi is with the Compression Systems Group, Sarnoff Corp, Princeton, NJ 08543-5300 USA Publisher Item Identifier S 1051-8215(99)06181-9 all macroblocks are in the frame mode Hence we need a new method for DCT-domain image resizing when there are fieldand frame-mode macroblocks In this paper, we propose an efficient method for DCT-domain image resizing with mixed field/frame-mode macroblocks The organization of this paper is as follows In Section II, we first describe a DCT-domain 2 : 1 image resizing method as a background This method assumes that all macroblocks are in the frame mode Section III presents the decomposition of a DCT-domain image resizing operation We investigate the role of each matrix in the DCT-domain image resizing operation In Section IV, we propose an efficient method for DCT-domain image resizing with mixed field/frame-mode macroblocks, using new field/frame-mode resizing transformation matrices In Section V, we discuss a DCT-domain filtering operation for DCT-domain image resizing with mixed field/frame-mode macroblocks Experimental results are shown in Section VI A brief conclusion is presented in Section VII II DCT-DOMAIN IMAGE RESIZING This section describes a DCT-domain 2 : 1 image resizing method as a background, which is based on [5] (This method is equivalent to the method in [7]) We assume that the block size for DCT is 8 8, as in most video compression standards The 2 : 1 resizing transformation matrix is represented as where is the DCT transform matrix, is a downsampling matrix, and is a matrix for low-pass filtering The sizes of,, and are 8 8, 8 16, and 16 16, respectively The 2 : 1 downsampling matrix can be defined as (1) (2) where is the 8 8 identity matrix and represents a Kronecker product The matrix is for low-pass filtering to reduce aliasing effects on the resized image For 2 : 1 image resizing, can be defined as a simple truncation operation [5], [7] (3) 1051 8215/99$1000 1999 IEEE

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL 9, NO 5, AUGUST 1999 697 Fig 1 Field and frame mode of a macroblock in the spatial domain Note that there can be many other ways to perform low-pass filtering in the DCT domain DCT domain resizing is block-based For 2 : 1 resizing, 2 2 DCT blocks are converted to one DCT block Since one DCT block is of size 8 8, one 16 16 block is converted to one 8 8 block for 2 : 1 resizing in the DCT domain The 2 : 1 DCT-domain resizing operation can be represented as where is a matrix of size 16 16 from 2 2 DCT blocks, is the 2 : 1 resized matrix in the DCT domain of size 8 8, and is the 2 : 1 resizing transformation matrix For the luminance component, one macroblock (16 16) is resized to one DCT block (8 8) For the 2 : 1 image resizing of the whole picture, the 2 : 1 DCT-domain resizing operation in (4) should be performed for all 16 16 blocks in the DCT domain The 2 : 1 resizing transformation matrix can be precalculated as in (1) and is of size 8 16 Note that this method assumes that all macroblocks are in the frame mode III DECOMPOSITION OF DCT-DOMAIN IMAGE RESIZING OPERATION In this section, we present the decomposition of the DCTdomain image resizing operation described in Section II By this way, we investigate the role of each matrix in the resizing operation Based on this decomposition, we develop the method for field-mode as well as for frame-mode macroblocks From (1) and (4) Note that and The operation in (6) can be decomposed into several steps (4) (5) (6) (7) (8) (9) The operation in (6) represents a low-pass filtering in the DCT domain The operation in (7) represents the inverse DCT (IDCT) for a DCT block To verify this, let where s ( ) are all 8 8 DCT blocks Then where represents the IDCT of Hence is conceptually a spatial domain matrix of size 16 16 from 2 2 DCT blocks The operation in (8) means downsampling in the spatial domain The first multiplication by in (8) represents the 2 : 1 downsampling in the vertical direction, and the second multiplication by in (8) represents the 2 : 1 downsampling in the horizontal direction Let If we use the downsampling matrix in (2), then Hence is the 2 : 1 downsampling matrix in the vertical direction Similarly, we can verify that is the 2 : 1 downsampling matrix in the horizontal direction Since and are of sizes 8 16 and 16 8, respectively, the matrix in (8) is of size 8 8 Let be a row vector of size 1 16, where only the th element is one and all other elements are zero For example,, etc Then the 8 16 matrix can be represented in terms of s as (10) The downsampling matrix in (10) selects even lines of a macroblock in the vertical downsampling This downsampling by corresponds to the subsampling of every two pixels in the spatial domain Note that the downsampling matrix in (10)

698 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL 9, NO 5, AUGUST 1999 can be used only for frame-mode macroblocks in the vertical downsampling Finally, the operation in (9) represents the forward DCT to obtain the resized DCT block From the consideration of the decomposed steps in (6) (9), we found that the DCT-domain resizing operation in (5) contains the four operations: low-pass filtering in the DCT domain (6), inverse DCT (7), 2 : 1 downsampling (8), and forward DCT (9) Hence the operation in (4) represents 2 : 1 resizing in the DCT domain Based on this decomposition, we develop a new DCTdomain image resizing method for field-mode as well as frame-mode macroblocks in the next section and (14) Downsampling by and correspond to the downsampling by averaging of two pixels in the spatial domain Note that the averaging operation is a kind of low-pass filtering Hence low-pass filtering is performed implicitly in the downsampling operations by and The explicit form of and can be obtained by representing s as elements IV PROPOSED DCT-DOMAIN IMAGE RESIZING METHOD In this section, we propose a new method for DCT-domain image resizing We define new downsampling matrices for frame- and field-mode macroblocks This leads to new frameand field-mode resizing transformation matrices for DCTdomain image resizing This method can be used when there are mixed field- and frame-mode macroblocks Let be a matrix of size 16 16 representing the frame-mode macroblock in the spatial domain with elements Then (15) (16) (11) Let be a matrix of size 16 16 representing the fieldmode macroblock in the spatial domain Then the elements of can be represented in terms of the elements of as Notice that can also be represented simply as (17) where is the identity matrix of size 8 8 Frame- and field-mode resizing transformation matrices are defined in terms of frame- and field-mode downsampling matrices, respectively Let and be the frame- and fieldmode resizing transformation matrices, respectively We define and as (18) (12) and (19) The matrix can be further simplified by (17) and (19) The first eight rows of represent the even lines, and the last eight rows of represent the odd lines in the macroblock We develop new frame- and field-mode downsampling matrices for frame- and field-mode macroblocks, respectively In this method, the downsampling operation is performed by an averaging operation Let and be the frame- and fieldmode downsampling matrices, respectively Let be a row vector of size 1 16, where only the th and th elements are one and all other elements are zero Then we propose to define and as (20) The 2 : 1 DCT-domain resizing operation for a frame-mode macroblock is performed as (21) where is a frame-mode DCT-domain macroblock of size 16 16 and is the 2 : 1 resized DCT block of size 8 8 The 2 : 1 DCT-domain resizing operation for a field-mode macroblock is performed as (13) (22) where is a field-mode DCT-domain macroblock of size 16 16 and is the 2 : 1 resized DCT block of size 8 8

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL 9, NO 5, AUGUST 1999 699 Fig 2 Flowergarden image (original) Note that the horizontal image resizing operation is performed in the same way by in (21) and (22) This is because macroblock formation is the same in the horizontal direction for frame- and field-mode macroblocks Fig 3 Flowergarden image with mixed field/frame-mode macroblocks Frame-mode macroblocks are displayed as original intensity, and field-mode macroblocks are displayed as reduced (darker) intensity V DISCUSSION ON DCT-DOMAIN FILTERING In this section, we discuss a DCT-domain low-pass filtering operation for DCT-domain image resizing with mixed field/frame-mode macroblocks In previous DCT-domain image resizing methods in [5] and [7], low-pass filtering is performed in the DCT domain by in (3), as represented in (6) It is a simple intrablock low-pass filtering by truncation in the DCT domain However, the matrix in (3) in the DCT domain is not equivalent to a sharp low-pass filter in the discrete Fourier transform (DFT) domain [7] The intrablock operation by in (3) does not correspond to a linear convolution in the spatial domain Actually, this matrix operation by may produce visible aliasing and blocking artifacts Moreover, the DCT-domain low-pass filtering by as in (3) would affect differently the field- and frame-mode macroblocks in the spatial domain This may result in serious blocking artifacts between field- and frame-mode macroblocks To overcome the limitation by intrablock filtering, Neri et al propose interblock filtering in the DCT domain [7] However, this method would greatly increase the complexity, and it cannot be used when there are mixed field- and frame-mode macroblocks Considering these points, the implicit low-pass filtering operation as averaging by the downsampling matrices in (13) and (14) would be a good compromise for block-based DCTdomain image resizing This low-pass filtering as averaging would not have any blocking artifact, and the filtering characteristics would be the same for field- and frame-mode macroblocks There might be a better method to perform low-pass filtering in the DCT domain for DCT-domain image resizing with moderate complexity, which could be done as future research There has been some related research on filtering in the DCT Fig 4 DCT-domain image resizing with mixed field/frame-mode macroblocks using the proposed method domain [7], [10], [11] The DCT-domain filtering can be incorporated in the DCT-domain image resizing operation Note that the filtering characteristics should be the same for field- and frame-mode macroblocks to apply here VI EXPERIMENTAL RESULTS We performed experiments of DCT-domain 2 : 1 image resizing with mixed field/frame-mode macroblocks, in which the proposed method performed well In this section, we present the results for one kind of image Fig 2 shows an original image of size 480 720 in the Flowergarden image sequence Fig 3 shows the Flowergarden image with mixed field/frame-mode macroblocks In Fig 3, frame-mode macroblocks are displayed as original intensity, and field-mode macroblocks are displayed as reduced (darker) intensity The field/frame mode of each macroblock is randomly generated

700 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL 9, NO 5, AUGUST 1999 Fig 4 shows the DCT-domain image resizing with mixed field/frame-mode macroblocks using the proposed method in Section IV This result is obtained when there are mixed fieldand frame-mode macroblocks as in Fig 3 VII CONCLUSION We proposed an efficient method for DCT-domain image resizing with mixed field/frame-mode macroblocks This method especially can handle field-mode macroblocks It is developed from the investigation of the DCT-domain image resizing operation through a decomposition of matrix operations From the decomposition, we define new downsampling matrices for frame- and field-mode macroblocks, leading to new frameand field-mode sizing In the discussion about DCT-domain filtering, we can see that a simple intrablock operation by truncation in the DCT domain for low-pass filtering my produce visible aliasing and block artifacts We propose to perform the low-pass filtering implicitly as averaging by downsampling operations to avoid the blocking artifacts and the difference in the filtering characteristics between the field- and framemode macroblocks Future research could be performed for more efficient low-pass filtering in the DCT domain for DCTdomain image resizing REFERENCES [1] S-F Chang and D G Messerschmitt, A new approach to decoding and compositing motion-compensated DCT-based images, in Proc IEEE Int Conf Acoustics, Speech, and Signal Processing, Apr 1993, pp V421 424 [2], Manipulation and compositing of MC-DCT compressed video, IEEE J Select Areas Commun, vol 13, pp 1 11, Jan 1995 [3] N Merhav and V Bhaskaran, Fast algorithms for DCT-domain image down-sampling and for inverse motion compensation, IEEE Trans Circuits Syst Video Technol, vol 7, pp 468 476, June 1997 [4] B Smith and L A Rowe, Algorithms for manipulating compressed images, IEEE Comput Graph Applicat Mag, pp 34 42, Sept 1993 [5] R H Jonsson, DCT domain resizing, David Sarnoff Research Center, Tech Rep, Jan 1996 [6] S A Marturcci, Image resizing in the discrete cosine transform domain, in Proc IEEE Int Conf Image Processing, 1995, pp II244 II247 [7] A Neri, G Russo, and P Talone, Inter-block filtering and downsampling in DCT domain, Signal Process: Image Commun, vol 6, no 4, pp 303 317, Aug 1994 [8] B Bhatt and D Birks, Digital television: Making it work, IEEE Spectrum, vol 34, no 10, Oct 1997 [9] T Sikora, MPEG digital video coding standards, IEEE Signal Processing Mag, vol 14, no 5, pp 82 100, Sept 1997 [10] B Chitprasert and K R Rao, Discrete cosine transform filtering, Signal Process, vol 19, pp 233 245, 1990 [11] J B Lee and B G Lee, Transform domain filtering based on pipelining structure, IEEE Trans Signal Processing, vol 40, pp 2061 2064, Aug 1992