CASA 2006 CASA 2006 A Skinning Approach for Dynamic Mesh Compression Khaled Mamou Titus Zaharia Françoise Prêteux.

Slides:



Advertisements
Similar presentations
Introduction to H.264 / AVC Video Coding Standard Multimedia Systems Sharif University of Technology November 2008.
Advertisements

Robust Invisible Watermarking of Volume Data Y. Wu 1, X. Guan 2, M. S. Kankanhalli 1, Z. Huang 1 NUS Logo 12.
MPEG4 Natural Video Coding Functionalities: –Coding of arbitrary shaped objects –Efficient compression of video and images over wide range of bit rates.
INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS, ICT '09. TAREK OUNI WALID AYEDI MOHAMED ABID NATIONAL ENGINEERING SCHOOL OF SFAX New Low Complexity.
Toward Automatic Music Audio Summary Generation from Signal Analysis Seminar „Communications Engineering“ 11. December 2007 Patricia Signé.
-1/20- MPEG 4, H.264 Compression Standards Presented by Dukhyun Chang
MPEG-4 Objective Standardize algorithms for audiovisual coding in multimedia applications allowing for Interactivity High compression Scalability of audio.
Light Field Compression Using 2-D Warping and Block Matching Shinjini Kundu Anand Kamat Tarcar EE398A Final Project 1 EE398A - Compression of Light Fields.
Reji Mathew and David S. Taubman CSVT  Introduction  Quad-tree representation  Quad-tree motion modeling  Motion vector prediction strategies.
HMM-BASED PATTERN DETECTION. Outline  Markov Process  Hidden Markov Models Elements Basic Problems Evaluation Optimization Training Implementation 2-D.
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.
Spatial and Temporal Data Mining
An Efficient Low Bit-Rate Video-coding Algorithm Focusing on Moving Regions Kwok-Wai Wong, Kin-Man Lam, Wan-Chi Siu IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS.
Digital Days 29/6/2001 ISTORAMA: A Content-Based Image Search Engine and Hierarchical Triangulation of 3D Surfaces. Dr. Ioannis Kompatsiaris Centre for.
High-Quality Video View Interpolation
Frederic Payan, Marc Antonini
A Picture is Worth a Thousand Words Milton Chen. What’s a Picture Worth? A thousand words - Descartes ( ) A thousand bytes - modern translation.
Bernd Girod: Image Compression and Graphics 1 Image Compression and Graphics: More Than a Sum of Parts? Bernd Girod Collaborators: Peter Eisert, Marcus.
Visualization and graphics research group CIPIC Feb 18, 2003Multiresolution (ECS 289L) - Winter Progressive Meshes (SIGGRAPH ’96) By Hugues Hoppe.
Wireless FGS video transmission using adaptive mode selection and unequal error protection Jianhua Wu and Jianfei Cai Nanyang Technological University.
3D Geometry for Computer Graphics
Presented by Pat Chan Pik Wah 28/04/2005 Qualifying Examination
Scalable Rate Control for MPEG-4 Video Hung-Ju Lee, Member, IEEE, Tihao Chiang, Senior Member, IEEE, and Ya-Qin Zhang, Fellow, IEEE IEEE TRANSACTIONS ON.
H.264/AVC for Wireless Applications Thomas Stockhammer, and Thomas Wiegand Institute for Communications Engineering, Munich University of Technology, Germany.
A Low-Power Low-Memory Real-Time ASR System. Outline Overview of Automatic Speech Recognition (ASR) systems Sub-vector clustering and parameter quantization.
Real Time Abnormal Motion Detection in Surveillance Video Nahum Kiryati Tammy Riklin Raviv Yan Ivanchenko Shay Rochel Vision and Image Analysis Laboratory.
Video Compression Concepts Nimrod Peleg Update: Dec
HARDEEPSINH JADEJA UTA ID: What is Transcoding The operation of converting video in one format to another format. It is the ability to take.
Geometry Videos Symposium on Computer Animation 2003 Hector M. Briceño Collaborators: Pedro V. Sander, Leonard McMillan, Steven Gortler, and Hugues Hoppe.
Lossy Compression Based on spatial redundancy Measure of spatial redundancy: 2D covariance Cov X (i,j)=  2 e -  (i*i+j*j) Vertical correlation   
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Computer Vision – Compression(2) Hanyang University Jong-Il Park.
Computer Graphics Group Tobias Weyand Mesh-Based Inverse Kinematics Sumner et al 2005 presented by Tobias Weyand.
 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.
Estimation-Quantization Geometry Coding using Normal Meshes
3D SLAM for Omni-directional Camera
Exploitation of 3D Video Technologies Takashi Matsuyama Graduate School of Informatics, Kyoto University 12 th International Conference on Informatics.
CIS679: Multimedia Basics r Multimedia data type r Basic compression techniques.
Adaptive Multi-path Prediction for Error Resilient H.264 Coding Xiaosong Zhou, C.-C. Jay Kuo University of Southern California Multimedia Signal Processing.
Image Compression Supervised By: Mr.Nael Alian Student: Anwaar Ahmed Abu-AlQomboz ID: IT College “Multimedia”
3D Geometry Coding using Mixture Models and the Estimation Quantization Algorithm Sridhar Lavu Masters Defense Electrical & Computer Engineering DSP GroupRice.
TM Paramvir Bahl Microsoft Corporation Adaptive Region-Based Multi-Scaled Motion- Compensated Video Coding for Error Prone Communication.
Semi-regular 3D mesh progressive compression and transmission based on an adaptive wavelet decomposition 21 st January 2009 Wavelet Applications in Industrial.
Outline Kinds of Coding Need for Compression Basic Types Taxonomy Performance Metrics.
Guillaume Laroche, Joel Jung, Beatrice Pesquet-Popescu CSVT
Applying 3-D Methods to Video for Compression Salih Burak Gokturk Anne Margot Fernandez Aaron March 13, 2002 EE 392J Project Presentation.
Advances in digital image compression techniques Guojun Lu, Computer Communications, Vol. 16, No. 4, Apr, 1993, pp
Event retrieval in large video collections with circulant temporal encoding CVPR 2013 Oral.
Image/Video Coding Techniques for IPTV Applications Wen-Jyi Hwang ( 黃文吉 ) Department of Computer Science and Information Engineering, National Taiwan Normal.
Dr. Sudharman K. Jayaweera and Amila Kariyapperuma ECE Department University of New Mexico Ankur Sharma Department of ECE Indian Institute of Technology,
Ray Tracing Animated Scenes using Motion Decomposition Johannes Günther, Heiko Friedrich, Ingo Wald, Hans-Peter Seidel, and Philipp Slusallek.
Subject Name: Computer Graphics Subject Code: Textbook: “Computer Graphics”, C Version By Hearn and Baker Credits: 6 1.
JPEG Image Compression Standard Introduction Lossless and Lossy Coding Schemes JPEG Standard Details Summary.
Video Compression—From Concepts to the H.264/AVC Standard
Video Compression and Standards
1 Yu Liu 1, Feng Wu 2 and King Ngi Ngan 1 1 Department of Electronic Engineering, The Chinese University of Hong Kong 2 Microsoft Research Asia, Beijing,
Marcus Barkowsky, Savvas Argyropoulos1 Towards a Hybrid Model Provide a structure with building blocks Provide a programming and evaluation environment.
(B1) What are the advantages and disadvantages of digital TV systems? Hint: Consider factors on noise, data security, VOD etc. 1.
IMAGE/VIDEO COMPRESSION STANDARD JPEG-2000/JasPer/Motion JPEG/Wireless JPEG/Kakadu Jan T. Bialasiewicz.
Motion Estimation Multimedia Systems and Standards S2 IF Telkom University.
Principles of Video Compression Dr. S. M. N. Arosha Senanayake, Senior Member/IEEE Associate Professor in Artificial Intelligence Room No: M2.06
Video Compression Video : Sequence of frames Each Frame : 2-D Array of Pixels Video: 3-D data – 2-D Spatial, 1-D Temporal Video has both : – Spatial Redundancy.
Introduction to H.264 / AVC Video Coding Standard Multimedia Systems Sharif University of Technology November 2008.
Last update on June 15, 2010 Doug Young Suh
Quad-Tree Motion Modeling with Leaf Merging
Fully Scalable Multiview Wavelet Video Coding
MPEG4 Natural Video Coding
Wavelet-based Compression of 3D Mesh Sequences
Li Li, Zhu Li, Vladyslav Zakharchenko, Jianle Chen, Houqiang Li
Presentation transcript:

CASA 2006 CASA 2006 A Skinning Approach for Dynamic Mesh Compression Khaled Mamou Titus Zaharia Françoise Prêteux

3D animation industry Context & Objectives  Applications  Virtual and augmented reality  Cartoons  Video games and CGI films

Dynamic 3D content Context & Objectives How to exchange, transmit and visualize such 3D content in a platform-independent manner ?!  Content creation  Motion capture  Skinning models  Physical-based simulation  …

Context & Objectives  Principle  Represent the animation sequence as a set of key-meshes Key-frames Animation Interpolation 3D animation industry: key-frame representations Dynamic 3D content  Apply interpolation procedures to generate the in-between frames at the desired framerate

Context & Objectives Constant topology Time-varying geometry  Sequence of meshes with:  Constant topology  Time-varying geometry Dynamic 3D content Key-frame representations: dynamic 3D meshes  Advantages  Generality  Interoperability  Content protection  Drawbacks  Huge amount of data  Need of compact representations

Objectives Context & Objectives  Compression efficiency Compactness of the coded representation  Progressive transmission Bitstream adaptation to different, fixed or mobile communication networks and terminal devices  Scalable rendering Bitstream adaptation for real-time rendering

Outline Experimental evaluation Conclusion et perspectives Previous work Skinning-based compression

Outline Experimental evaluation Conclusion et perspectives Previous work Skinning-based compression

Wavelets Vertex prediction State of the art MPEG-4/AFX-IC Dynapack AWC GV PCA-based LPCA CPCA PCA Clustering Dynamic 3D mesh compression RT D3DMC  Emerging field of research  Four families of approaches

Wavelets Vertex prediction State of the art MPEG-4/AFX-IC Dynapack  A more elaborated motion model: skinning AWC GV PCA-based LPCA CPCA PCA Clustering Dynamic 3D mesh compression Skinning-based compression RT D3DMC  New motion-based segmentation procedure  Temporal DCT-based compression of the residual errors  Principle: extension of the RT technique

Outline Experimental evaluation Conclusion et perspectives Previous work Skinning-based compression

General view Skinning-basedcompression Temporal DCT Affine motion and weights estimation Motion-based segmentation Static encoder Quantization and arithmetic encoding Prediction residuals Affine transforms Animation weights Partition (Mi)(Mi) M0M0 Compressed DCT coefficients Compressed M 0

Motion-based segmentation Skinning-basedcompression  Objective Partition the mesh vertices into clusters whose motion can be accurately described by a single affine motion

Motion-based segmentation Skinning-basedcompression  Principle  For each vertex v, select a neighborhood v*

Vector of homogeneous coordinates of vertex p at frame i Motion-based segmentation Skinning-basedcompression  For each frame i, compute an affine transform A i v … Frame 0Frame 1Frame (F-1)  Principle  For each vertex v, select a neighborhood v*  Store the ( A i v ) i of each vertex as a single vector α v

Motion-based segmentation Skinning-basedcompression  For each frame i, compute an affine transform A i v  Principle  For each vertex v, select a neighborhood v*  Store the ( A i v ) i of each vertex as a single vector α v Cow  Determine the partition π = ( π k ) k by applying the k-means clustering algorithm to the set ( α v ) v

Motion-based segmentation Skinning-basedcompression Dancer  For each frame i, compute an affine transform A i v  Principle  For each vertex v, select a neighborhood v*  Store the ( A i v ) i of each vertex as a single vector α v  Determine the partition π = ( π k ) k by applying the k-means clustering algorithm to the set ( α v ) v

General view Skinning-basedcompression Temporal DCT Affine motion and weights estimation Motion-based segmentation Static encoder Quantization and arithmetic encoding Prediction residuals Affine transforms Animation weights Partition (Mi)(Mi) M0M0 Compressed DCT coefficients Compressed M 0

Affine motion estimation Skinning-basedcompression  Principle  Model the motion of each cluster k at each frame i by an affine transform H i k  Predict the geometry of frame i from frame 0 by using the affine transforms ( H i k ) k

Affine motion estimation Skinning-basedcompression  Performances  Captures well the object motion Frame 0Frame 36Predicted frame 36 Error distribution 0% 4%  Induces discontinuities at the level of clusters boundaries We need a more elaborated motion model

Skinning model Skinning-basedcompression  Objective Derive a continuous motion field  Principle  Linearly combine the affine motion of adjacent clusters with appropriate weighting coefficients  Compute the animation weights by solving a least squares minimization problem

General view Skinning-basedcompression Temporal DCT Affine motion and weights estimation Motion-based segmentation Static encoder Quantization and arithmetic encoding Prediction residuals Affine transforms Animation weights Partition (Mi)(Mi) M0M0 Compressed DCT coefficients Compressed M 0

DCT-based compression of the residual errors Skinning-basedcompression  Objective  Compress the residual errors by exploiting the temporal correlations Prediction error at frame i and vertex v  Principle  For each vertex v, compute the spectra of its x, y and z errors  Concatenate the spectral coefficients of all vertices into a single vector S  Quantize and arithmetically encode S Well-adapted to progressive transmission

Outline Experimental evaluation Conclusion et perspectives Previous work Skinning-based compression

Evaluation corpus: Snake Experimentalresults 9179 vertices 134 frames

Evaluation corpus: Dancer Experimentalresults 7061 vertices 201 frames

Evaluation corpus: Humanoid Experimentalresults 7646 vertices 154 frames

Evaluation corpus: Chicken Experimentalresults 3030 vertices 400 frames

Objective evaluation: criteria  Compression rates: bits per frame per vertex (bpfv)  Distortion measures: RMSE [MESH tool, Aspert et al, 2002] D : length of the diagonal of the object’s bounding boxExperimentalresults

Compression results: Chicken Experimentalresults  Performances  D3DMC & skinning: best performances  Skinning: up to 47% gain over D3DMC in term of bitrates RMSE bpfv

Compression results: Snake Experimentalresults  Performances  PCA: worst performances (F>>V not verified)  Skinning: up to 45% gain over RT in term of bitrates RMSE bpfv

Compression results: Humanoid Experimentalresults  Performances  AFX-IC: poor performances: elementary predictor  Skinning: up to 67% gain over D3DMC in term of bitrates RMSE bpfv

Compression results: Dancer Experimentalresults RMSE bpfv  Performances  GV: re-meshing related problems  Skinning: up to 65% gain over GV in term of bitrates

Outline Experimental evaluation Conclusion et perspectives Previous work Skinning-based compression

Conclusion & perspectives Summary  A new skinning-based compression techniques for dynamic meshes  Specifically efficient for articulated dynamic meshes  Gains range from 47% to 67% in terms of bitrates over state-of-the-art encoders

Future work Conclusion & perspectives  Optimize the motion-based segmentation stage: How to determine automatically the number of clusters?  Multiple and dynamic skinning models: Temporal segmentation of the sequence  Compression of other attributes: normals, texture coordinates…

Thank you