Research Institute for Future Media Computing

Slides:



Advertisements
Similar presentations
Low-Complexity Transform and Quantization in H.264/AVC
Advertisements

[1] AN ANALYSIS OF DIGITAL WATERMARKING IN FREQUENCY DOMAIN.
A Comprehensive Design Evaluation for SPIHT Coding 台北科技大學資工所指導教授:楊士萱學生:廖武傑 2003/06/05.
Fourier Transform – Chapter 13. Image space Cameras (regardless of wave lengths) create images in the spatial domain Pixels represent features (intensity,
Computer Graphics Recitation 6. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
Computer Graphics Recitation 7. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
Low Complexity Transform and Quantization in H.264/AVC Speaker: Pei-cheng Huang 2005/6/2.
A New Scheme for Progressive Image Transmission and Flexible Reconstruction with DCT Minqing Xing and Xue Dong Yang Department of Computer Science University.
Automatic Key Video Object Plane Selection Using the Shape Information in the MPEG-4 Compressed Domain Berna Erol and Faouzi Kossentini, Senior Member,
Losslessy Compression of Multimedia Data Hao Jiang Computer Science Department Sept. 25, 2007.
CS430 © 2006 Ray S. Babcock Lossy Compression Examples JPEG MPEG JPEG MPEG.
Image Compression - JPEG. Video Compression MPEG –Audio compression Lossy / perceptually lossless / lossless 3 layers Models based on speech generation.
MPEG: (Moving Pictures Expert Group) A Video Compression Standard for Multimedia Applications Seo Yeong Geon Dept. of Computer Science in GNU.
1 Wavelets, Ridgelets, and Curvelets for Poisson Noise Removal 國立交通大學電子研究所 張瑞男
By : Vladimir Novikov. Digital Watermarking? Allows users to embed SPECIAL PATTERN or SOME DATA into digital contents without changing its perceptual.
Object Based Video Coding - A Multimedia Communication Perspective Muhammad Hassan Khan
Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain.
1 Chapter 5 Image Transforms. 2 Image Processing for Pattern Recognition Feature Extraction Acquisition Preprocessing Classification Post Processing Scaling.
Information hiding in stationary images staff corporal Piotr Lenarczyk Military Uniwersity of Technology Institute of Electronics and Telecomunication.
Digital image processing is the use of computer algorithms to perform image processing on digital images which is a subfield of digital signal processing.
Under Supervision of Dr. Kamel A. Arram Eng. Lamiaa Said Wed
R. Ray and K. Chen, department of Computer Science engineering  Abstract The proposed approach is a distortion-specific blind image quality assessment.
Image Processing and Computer Vision: 91. Image and Video Coding Compressing data to a smaller volume without losing (too much) information.
Digital Image Processing Image Compression
Eyes detection in compressed domain using classification Eng. Alexandru POPA Technical University of Cluj-Napoca Faculty.
DCT.
Reversible image hiding scheme using predictive coding and histogram shifting Source: Authors: Reporter: Date: Signal Processing, Vol.89, Issue 6, pp ,
2005/12/021 Fast Image Retrieval Using Low Frequency DCT Coefficients Dept. of Computer Engineering Tatung University Presenter: Yo-Ping Huang ( 黃有評 )
Implementation, Comparison and Literature Review of Spatio-temporal and Compressed domains Object detection. By Gokul Krishna Srinivasan Submitted to Dr.
Chittampally Vasanth Raja 10IT05F vasanthexperiments.wordpress.com.
Chittampally Vasanth Raja vasanthexperiments.wordpress.com.
Fourier and Wavelet Transformations Michael J. Watts
Chapter 8 Lossy Compression Algorithms. Fundamentals of Multimedia, Chapter Introduction Lossless compression algorithms do not deliver compression.
Introduction to JPEG m Akram Ben Ahmed
Hopfield Neural Networks for Optimization 虞台文 大同大學資工所 智慧型多媒體研究室.
CS 376b Introduction to Computer Vision 03 / 17 / 2008 Instructor: Michael Eckmann.
Dr. Abdul Basit Siddiqui FUIEMS. QuizTime 30 min. How the coefficents of Laplacian Filter are generated. Show your complete work. Also discuss different.
Homework II Fast Discrete Cosine Transform Jain-Yi Lu ( 呂健益 ) Visual Communications Laboratory Department of Communication Engineering National Central.
Attila Kiss, Tamás Németh, Szabolcs Sergyán, Zoltán Vámossy, László Csink Budapest Tech Recognition of a Moving Object in a Stereo Environment Using a.
Topics 1 Specific topics to be covered are: Discrete-time signals Z-transforms Sampling and reconstruction Aliasing and anti-aliasing filters Sampled-data.
Computer Graphics & Image Processing Chapter # 4 Image Enhancement in Frequency Domain 2/26/20161.
Automatic Caption Localization in Compressed Video By Yu Zhong, Hongjiang Zhang, and Anil K. Jain, Fellow, IEEE IEEE Transactions on Pattern Analysis and.
1 Part A Multimedia Production Chapter 2 Multimedia Basics Digitization, Coding-decoding and Compression Information and Communication Technology.
Digital Image Processing Lecture 7: Image Enhancement in Frequency Domain-I Naveed Ejaz.
Data statistics and transformation revision Michael J. Watts
The content of lecture This lecture will cover: Fourier Transform
JPEG Compression What is JPEG? Motivation
Fuzzy type Image Fusion using hybrid DCT-FFT based Laplacian Pyramid Transform Authors: Rajesh Kumar Kakerda, Mahendra Kumar, Garima Mathur, R P Yadav,
JPEG Compressed Image Retrieval via Statistical Features
Filtering and enhancement of color images in the block DCT domain
Visible Watermarking of An Image Using DCT Technique
DCT IMAGE COMPRESSION.
Research Institute for Future Media Computing
Research Institute for Future Media Computing
Last update on June 15, 2010 Doug Young Suh
DCT-Domain Inverse Motion Compensation (IMC)
Image Segmentation Techniques
Research Institute for Future Media Computing
Fourier Transform and Data Compression
12/5/2018.
Standards Presentation ECE 8873 – Data Compression and Modeling
Image Compression Techniques
1-D DISCRETE COSINE TRANSFORM DCT
Reduction of blocking artifacts in DCT-coded images
Advisor: Prof. Chin-Chen Chang (張真誠 教授) Student: Wei-Liang Tai (戴維良)
Research Institute for Future Media Computing
Digital Image Procesing Discrete CosineTrasform (DCT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL.
Research Institute for Future Media Computing
Research Institute for Future Media Computing
Hopfield Neural Networks for Optimization
Presentation transcript:

Research Institute for Future Media Computing 未来媒体技术与计算研究所 Research Institute for Future Media Computing http://futuremedia.szu.edu.cn 7. DCT-based Research Topics 江健民,国家千人计划特聘教授 深圳大学未来媒体技术与计算研究所所长 Office Room: 409 Email: jianmin.jiang@szu.edu.cn http://futuremedia.szu.edu.cn

Research Road Map Input Information or Data Visualization to convert the data into 2D or other multi-dimensional sets Data transform via Fourier, DCT, etc. Feature extraction and analysis in transform domain

7.1 Image extraction in DCT domain Jiang J. and Weng Y. (2004) “Video Extraction for Fast Content Access to MPEG Compressed Videos” IEEE Transactions on Circuits, Systems and Video Technology, Vol 14, No 5, 2004,pp595-605; Jiang J. and Feng G.C. (2002): "The spatial relationship of DCT coefficients between a block and its sub-blocks" IEEE Transactions on Signal Processing, IEEE, 50 (5): 1160-1169 Jiang J., Qiu K. and G. Xiao (2008) “An edge block content descriptor for MPEG compressed videos”, IEEE Transactions on Circuits, Systems and Video Tech. Vol 18, No 7, pp 994-998;

DCT Simplifications

Introduction of Taylor series

Taylor series expansion of discrete cosine transform When v=1, we have:

DCT simplifications for v=1

DCT simplification for v=0 Consider:

DCT simplification for variable u For variable u, we can make similar arrangement as given below: Consider the simplification derived for variable v: Observations: The constant coefficient is 4 for v=0,and for v=1; When v=0,the corresponding two terms indexed by j are added together, and when v=1, the corresponding two terms indexed by j are subtracted together.

Inference on DCT simplifications for variable u For b00 : For b01 : For b10 : For b11 :

DCT simplification results

Summary of DCT Simplifications

Approximated image extraction in DCT domain Solving the above equations,we have: Observations: The approximated image has ¼ of the original width and height; The extracted pixel aij is constructed from the first four DCT coefficients, b00, b01, b10, b11, which contain the majority of energy inside the block;

Implementation of the image extraction algorithm b11 b00 b01 b10 a00 a10 a01 a11 - + 1/8 Observation of the implementation cost: As seen above, the extraction of 2x2 pixel block only needs 8 additions; The multiplication with 1/8 can be implemented via shifting 3 bits to the right.