PREDICTIVE SHAPE CODING USING GENERIC POLYGON APPROXIMATION Jong-il Kim and Brain L. Evans Circuits and Systems, 1998. ISCAS '98. Proceedings of the 1998.

Slides:



Advertisements
Similar presentations
MPEG4 Natural Video Coding Functionalities: –Coding of arbitrary shaped objects –Efficient compression of video and images over wide range of bit rates.
Advertisements

MPEG-4 Objective Standardize algorithms for audiovisual coding in multimedia applications allowing for Interactivity High compression Scalability of audio.
Rate-Distortion Optimal Skeleton-Based Shape Coding Haohong Wang, Aggelos K. Katsaggelos, and Thrasyvoulos N. Pappas Image Processing, Proceedings.
Feature Vector Selection and Use With Hidden Markov Models to Identify Frequency-Modulated Bioacoustic Signals Amidst Noise T. Scott Brandes IEEE Transactions.
1 Pixel Interpolation By: Mieng Phu Supervisor: Peter Tischer.
CABAC Based Bit Estimation for Fast H.264 RD Optimization Decision
Recursive End-to-end Distortion Estimation with Model-based Cross-correlation Approximation Hua Yang, Kenneth Rose Signal Compression Lab University of.
Efficient multi-frame motion estimation algorithms for MPEG-4 AVC/JVTH.264 Mei-Juan Chen, Yi-Yen Chiang, Hung- Ju Li and Ming-Chieh Chi ISCAS 2004.
Binary Search Visualization i j.
Binary Image Compression Using Efficient Partitioning into Rectangular Regions IEEE Transactions on Communications Sherif A.Mohamed and Moustafa M. Fahmy.
New Sorting-Based Lossless Motion Estimation Algorithms and a Partial Distortion Elimination Performance Analysis Bartolomeo Montrucchio and Davide Quaglia.
1 Enhancing Cellular Multicast Performance Using Ad Hoc Networks Jun Cheol Park Sneha Kumar Kasera School of.
A Coding Technique for the Contours in Smoothly Perfect Eight-Connectivity Based on Two-Stage Motion Compensation Sung Ho Cho, Rin Chul Kim, Seung Seok.
An Arithmetic Structure for Test Data Horizontal Compression Marie-Lise FLOTTES, Regis POIRIER, Bruno ROUZEYRE Laboratoire d’Informatique, de Robotique.
Analysis, Fast Algorithm, and VLSI Architecture Design for H
Automatic Key Video Object Plane Selection Using the Shape Information in the MPEG-4 Compressed Domain Berna Erol and Faouzi Kossentini, Senior Member,
A New Dynamic Finite-State Vector Quantization Algorithm for Image Compression Jyi-Chang Tsai, Chaur-Heh Hsieh, and Te-Cheng Hsu IEEE TRANSACTIONS ON IMAGE.
FAST MULTI-BLOCK SELECTION FOR H.264 VIDEO CODING Chang, A.; Wong, P.H.W.; Yeung, Y.M.; Au, O.C.; Circuits and Systems, ISCAS '04. Proceedings of.
A Generic Shape Descriptor using Bezier Curves Presenting by – Dr. Manzur Murshed Authors – Ferdous Ahmed Sohel Dr. Gour C. Karmakar Prof. Laurence S.
A Low-Power VLSI Architecture for Full-Search Block-Matching Motion Estimation Viet L. Do and Kenneth Y. Yun IEEE Transactions on Circuits and Systems.
 Coding efficiency/Compression ratio:  The loss of information or distortion measure:
Frame by Frame Bit Allocation for Motion-Compensated Video Michael Ringenburg May 9, 2003.
PARALLEL TABLE LOOKUP FOR NEXT GENERATION INTERNET
1 4-Integrating Peripherals in Embedded Systems (cont.)
INTERPOLATED HALFTONING, REHALFTONING, AND HALFTONE COMPRESSION Prof. Brian L. Evans Collaboration.
1 Data Partition for Wavefront Parallelization of H.264 Video Encoder Zhuo Zhao, Ping Liang IEEE ISCAS 2006.
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
Doc.: IEEE /0370r3 Submission TIM Compression November 2012 Slide 1 Date: Haiguang Wang, I2R.
Author :Monica Barbu-McInnis, Jose G. Tamez-Pena, Sara Totterman Source : IEEE International Symposium on Biomedical Imaging April 2004 Page(s): 840 -
JPEG2000 Yeh Po-Yin Lien Shao-Chieh Yang Yi-Lun. Outline Introduction Features Flow chart Discrete wavelet transform EBCOT ROI coding Comparison of ROI.
Reducing Test Application Time Through Test Data Mutation Encoding Sherief Reda and Alex Orailoglu Computer Science Engineering Dept. University of California,
Sejong University, DMS Lab. An Efficient True-Motion Estimator Using Candidate Vectors from a Parametric Motion Model Dong-kywn Kim IEEE TRANSACTIONS ON.
Feature Vector Selection and Use With Hidden Markov Models to Identify Frequency-Modulated Bioacoustic Signals Amidst Noise T. Scott Brandes IEEE Transactions.
A survey of different shape analysis techniques 1 A Survey of Different Shape Analysis Techniques -- Huang Nan.
Advances in digital image compression techniques Guojun Lu, Computer Communications, Vol. 16, No. 4, Apr, 1993, pp
1 Information Hiding Based on Search Order Coding for VQ Indices Source: Pattern Recognition Letters, Vol.25, 2004, pp.1253 – 1261 Authors: Chin-Chen Chang,
MPEG-4: Multimedia Coding Standard Supporting Mobile Multimedia System -MPEG-4 Natural Video Coding April, 2001.
An efficient Video Coding using Phase-matched Error from Phase Correlation Information Manoranjan Paul 1 and Golam Sorwar IEEE.
BASIC VHDL LANGUAGE ELEMENTS Digital Design for Instrumentation with VHDL 1.
DYNAMIC ELEMENT MATCHING (DEM) Presented By: Raf Karakiewicz.
Page 11/28/2016 CSE 40373/60373: Multimedia Systems Quantization  F(u, v) represents a DCT coefficient, Q(u, v) is a “quantization matrix” entry, and.
ECE472/572 - Lecture 14 Morphological Image Processing 11/17/11.
Course 3 Binary Image Binary Images have only two gray levels: “1” and “0”, i.e., black / white. —— save memory —— fast processing —— many features of.
November 25Asian Test Symposium 2008, Nov 24-27, Sapporo, Japan1 Sequential Circuit BIST Synthesis using Spectrum and Noise from ATPG Patterns Nitin Yogi.
July 10, th VLSI Design and Test Symposium1 BIST / Test-Decompressor Design using Combinational Test Spectrum Nitin Yogi Vishwani D. Agrawal Auburn.
Fine-granular Motion Matching for Inter-view Motion Skip Mode in Multi-view Video Coding Haitao Yanh, Yilin Chang, Junyan Huo CSVT.
Fast disparity motion estimation in MVC based on range prediction Xiao Zhong Xu, Yun He ICIP 2008.
Introduction to H.264 / AVC Video Coding Standard Multimedia Systems Sharif University of Technology November 2008.
Multimedia Outline Compression RTP Scheduling Spring 2000 CS 461.
FHTW Wavelet Based Video Compression Using Long Term Memory Motion-Compensated Prediction and Context-based Adaptive Arithmetic Coding D.Marpe, H.L.Cycon,
Polygons Similar and Congruent
Greedy Algorithm.
2018/9/16 Distributed Source Coding Using Syndromes (DISCUS): Design and Construction S.Sandeep Pradhan, Kannan Ramchandran IEEE Transactions on Information.
Arithmetic operations Programming
Submission Title: Performance evaluation for LG’s proposal
Source :Journal of visual Communication and Image Representation
Computing Vertex Normals from Arbitrary Meshes
Standards Presentation ECE 8873 – Data Compression and Modeling
MPEG4 Natural Video Coding
Esam Ali Khan M.S. Thesis Defense
Yongjian Hu, Member, IEEE, Heung-Kyu Lee, Kaiying Chen, and Jianwei Li
Jason Klaus, Duncan Elliott Confidential
Dynamic embedding strategy of VQ-based information hiding approach
Chair Professor Chin-Chen Chang Feng Chia University
An Algorithm for Compression of Bilevel Images
Chapter 8 – Compression Aims: Outline the objectives of compression.
一種兼顧影像壓縮與資訊隱藏之技術 張 真 誠 國立中正大學資訊工程學系 講座教授
Source: IEEE Transactions on Circuits and Systems,
Presentation transcript:

PREDICTIVE SHAPE CODING USING GENERIC POLYGON APPROXIMATION Jong-il Kim and Brain L. Evans Circuits and Systems, ISCAS '98. Proceedings of the 1998 IEEE International Symposium on, Volume: 5, 1998

Outline Lossy Shape Coding Using Generalized Chain Coding Generalized Predictive Shape Coding Simulation

Lossy Shape Coding Using Generalized Chain Coding

Lossy Shape Coding Using Generalized Chain Coding (con’t) Polygon approximation

Lossy Shape Coding Using Generalized Chain Coding (con’t) Vertex coding –Ri = Vi – Vi-1 –x_max_magnitude, y_max_magnitude –x_dynamic_range_indicator y_dynamic_range_indicator Example : V = (80,60),(105,66),(85,70),(70,63) R = (25,6),(-20,4),(-15,-7) x_max_magnitude = 25, x_dynamic_range_indicator = 4 y_max_magnitude = 7, y_dynamic_range_indicator = 2

Lossy Shape Coding Using Generalized Chain Coding (con’t) octant number containing the sign bit of x and y A flag indicating which component is the major component –Example : Ri(y) < Ri(x),Ri’s major component is the x-component

Lossy Shape Coding Using Generalized Chain Coding (con’t) If Ri(y) < Ri(x),Ri’s major component is the x-component –major_component needs (x_dynamic_range_indicator+1) bits –Minor_component needs min( y_dynamic_range_indicator+1,  lg|Ri(x)|+1  )

Lossy Shape Coding Using Generalized Chain Coding (con’t) Example : –Dynamic range –31~+31, Ri = (6,-3) –Header : x_dynamic_range_indicator = 4=>3 bits y_dynamic_range_indicator = 4=>3 bits –Ri in bitstream : Octant = 7=>3bits major_component (|x|>|y|,|x|=6) 4+1=>5 bits minor_component : min(4+1,  lg(6+1)  )=>3 bits

Generalized Predictive Shape Coding

Contour Motion Estimation Ic, Ir : current and reference contour set Nc, Nr : current and reference contour length A contour pel matching algorithm finds the offset vector (mv x, mv y ) to maximize the number of element in Ic ∩ Ir (mv x,mv y ) Comparison operation : 2*Nc*Nr times

Contour Motion Estimation Global motion estimation : all of the contour in a VOP Local motion estimation : single contour in a VOP Lossless or Lossy motion estimation : –A contour pel in current contour is within d max range from a reference contour pel

(a)(b) d max =1 (c)(d) d max =2

Coding of matched and mismatched contour position – Reference Index Based Coding Matched contour position –2D -> 1D –Reference contour length is Lr , just need  lg Lr  –Initial index is 1(the first pel during raster scan) , counter clockwise direction have increasing indices –For example (last page) Lr = 100 (V2,V3,V4,V1) = (30,38,45,58) Mismatched contour position –Generalized chain coding (octant,major,minor)

Simulation Ec : average bit for a contour pel

Simulation (con’t)

Conclusion Propose a new predictive binary shape coding method