Institut für Informationsverarbeitung,

Slides:



Advertisements
Similar presentations
1
Advertisements

Feichter_DPG-SYKL03_Bild-01. Feichter_DPG-SYKL03_Bild-02.
1 Vorlesung Informatik 2 Algorithmen und Datenstrukturen (Parallel Algorithms) Robin Pomplun.
© 2008 Pearson Addison Wesley. All rights reserved Chapter Seven Costs.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2003 Chapter 3 Data Transmission.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2003 Chapter 11 Ethernet Evolution: Fast and Gigabit Ethernet.
Chapter 1 The Study of Body Function Image PowerPoint
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 1 Embedded Computing.
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 6 Author: Julia Richards and R. Scott Hawley.
Author: Julia Richards and R. Scott Hawley
1 Copyright © 2013 Elsevier Inc. All rights reserved. Appendix 01.
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
Objectives: Generate and describe sequences. Vocabulary:
UNITED NATIONS Shipment Details Report – January 2006.
and 6.855J Spanning Tree Algorithms. 2 The Greedy Algorithm in Action
We need a common denominator to add these fractions.
1 RA I Sub-Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Casablanca, Morocco, 20 – 22 December 2005 Status of observing programmes in RA I.
Properties of Real Numbers CommutativeAssociativeDistributive Identity + × Inverse + ×
Multiplication Facts Review. 6 x 4 = 24 5 x 5 = 25.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Year 6 mental test 10 second questions
1 Discreteness and the Welfare Cost of Labour Supply Tax Distortions Keshab Bhattarai University of Hull and John Whalley Universities of Warwick and Western.
PUBLIC KEY CRYPTOSYSTEMS Symmetric Cryptosystems 6/05/2014 | pag. 2.
Solve Multi-step Equations
REVIEW: Arthropod ID. 1. Name the subphylum. 2. Name the subphylum. 3. Name the order.
Break Time Remaining 10:00.
PP Test Review Sections 6-1 to 6-6
EU market situation for eggs and poultry Management Committee 20 October 2011.
Bright Futures Guidelines Priorities and Screening Tables
XML and Databases Exercise Session 3 (courtesy of Ghislain Fourny/ETH)
2 |SharePoint Saturday New York City
The challenge ahead: Ocean Predictions in the Arctic Region Lars Petter Røed * Presented at the OPNet Workshop May 2008, Geilo, Norway * Also affiliated.
VOORBLAD.
Name Convolutional codes Tomashevich Victor. Name- 2 - Introduction Convolutional codes map information to code bits sequentially by convolving a sequence.
Copyright © 2012, Elsevier Inc. All rights Reserved. 1 Chapter 7 Modeling Structure with Blocks.
1 RA III - Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Buenos Aires, Argentina, 25 – 27 October 2006 Status of observing programmes in RA.
Factor P 16 8(8-5ab) 4(d² + 4) 3rs(2r – s) 15cd(1 + 2cd) 8(4a² + 3b²)
Basel-ICU-Journal Challenge18/20/ Basel-ICU-Journal Challenge8/20/2014.
1..
CONTROL VISION Set-up. Step 1 Step 2 Step 3 Step 5 Step 4.
© 2012 National Heart Foundation of Australia. Slide 2.
Adding Up In Chunks.
Universität Kaiserslautern Institut für Technologie und Arbeit / Institute of Technology and Work 1 Q16) Willingness to participate in a follow-up case.
LO: Count up to 100 objects by grouping them and counting in 5s 10s and 2s. Mrs Criddle: Westfield Middle School.
Understanding Generalist Practice, 5e, Kirst-Ashman/Hull
1 Termination and shape-shifting heaps Byron Cook Microsoft Research, Cambridge Joint work with Josh Berdine, Dino Distefano, and.
Artificial Intelligence
Multiply Binomials (ax + b)(cx +d) (ax + by)(cx +dy)
Model and Relationships 6 M 1 M M M M M M M M M M M M M M M M
Subtraction: Adding UP
1 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit.
Analyzing Genes and Genomes
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Essential Cell Biology
Converting a Fraction to %
Intracellular Compartments and Transport
PSSA Preparation.
& dding ubtracting ractions.
Essential Cell Biology
Immunobiology: The Immune System in Health & Disease Sixth Edition
Energy Generation in Mitochondria and Chlorplasts
Murach’s OS/390 and z/OS JCLChapter 16, Slide 1 © 2002, Mike Murach & Associates, Inc.
User Defined Functions Lesson 1 CS1313 Fall User Defined Functions 1 Outline 1.User Defined Functions 1 Outline 2.Standard Library Not Enough #1.
Adaptive Segmentation Based on a Learned Quality Metric
ADAPTIVE INTERPOLATION FILTER FOR H.264/AVC Bhavana Prabhakar Student Id: Department of Electrical Engineering.
ADAPTIVE INTERPOLATION FILTER FOR H.264/AVC Bhavana Prabhakar Student Id: Department of Electrical Engineering.
Presentation transcript:

Institut für Informationsverarbeitung, Two-dimensional Non-separable Adaptive Wiener Interpolation Filter for H.264/AVC Yuri Vatis Institut für Informationsverarbeitung, Universität Hannover ITG-FA 3.2, 23.06.2005

Motion Compensated Prediction Adaptive Interpolation Filter Outline Introduction Motion Compensated Prediction Adaptive Interpolation Filter Experimental Results Conclusion

Introduction Hybrid Video Encoder: Video input Bitstream + S T Quant e(t) S T Quant EC - T-1 + + S MCP z -1 d(t) s’(t-1) ME

Motion Compensated Prediction (MCP) d(t) Für die bewegungskompensierende Prädiktion braucht man eine Bewegungsschätzung, die hier veranschaulicht wird. Das aktuelle Bild wird zuerst in Blöcke zerlegt. Jeder Block wird dann im Vorgängerbild gesucht. Falls man einen geeigneten Kandidatenblock findet, kann ein Displacementvektor definiert werden, der der Position des Blockes relativ zum Referenzblock im aktuellen Bild entspricht. Bei der Prädiktion berechnet man später die Differenz zwischen jedem Referenzblock und dem korrespondierenden Block. s‘(t-1) s(t) reference block block to code

Motion Compensated Prediction (MCP) MCP with fractional-pel Motion Vector Resolution i Prediction is distorted by: 1. Aliasing in s(t) and s’(t-1) 2. Displacement estimation errors of d(t) 3. Quantisation errors in s’(t-1) 4. etc.  The distortions depend on the motion and content of the video signal j d(t) Die Displacementvektoren haben in den heutigen Standards eine Auflösung von weniger als einem Bildpunkt. Das heißt, für einen Block kann der jeweilige Displacementvektor auf Punkten des Vorgängerbilds zeigen, die zwischen dem Abtastraster liegen. Diese werden als “SubPEL” bezeichnet. Bei der Prädiktion wird wie vorher die Differenz zwischen Referenzblock und korrespondierendem Block berechnet; hier, z.B. zwischen diesem Bildpunkt [zeigen] und diesem SubPEL [zeigen] und so weiter... Bei der Bewegungsschätzung kann ein so gennanter Displacementschätzfehler aus verschiedenen Gründen entstehen: wegen der beschränkten Genauigkeit der Displacementvektoren, wegen einer unvollkommenen Suche des Kandidatenblocks usw. Dieser Fehler bedeutet, dass anstatt der “richtigen” SubPEL andere SubPEL verwendet werden, und die Prädiktion wird schlechter. Das spielt später eine wichtige Rolle beim Entwurf der neuen Filter. Für die genauere Auflösung der Displacementvektoren muss man zuerst eine Interpolation des Vorgängerbilds berechnen, wie... s’(t-1) s(t) reference block block to code  image signal on sub-pel positions has to be generated by interpolation

2D non-separable Adaptive Interpolation Filter Analytical design of a non-separable adaptive 2D interpolation filter. Goal: Prediction (and not just interpolation) of picture elements by minimising prediction error energy. Reduction of aliasing and blurring effects, motion estimation errors. Properties: Symmetric, non-separable 6x6-tap filter. Filter coefficients are calculated analytically once per frame with respect to all reference frames.

Adaptive Interpolation Filter Value ( ) to be interpolated: where is an integer sample value ( ) and are filter coefficients for sub-pel position SP

Analytical Calculation of Filter Coefficients The calculation of coefficients and the motion compensation are performed in the following 3 steps: Displacement vectors are estimated for every image to be coded (standard interpolation filter is used). Independent calculation of 2D filter coefficients for each sub-pel position by minimisation of the prediction error energy: with

Analytical Calculation of Filter Coefficients Estimation of new displacement vectors (applying the adaptive interpolation filter computed in 2). Reducing motion estimation errors, caused by aliasing, camera noise etc. Treating the problem in the rate-distortion sense. The software was declared as a VCEG KTA-Software

Quantisation and Coding of Filter Coefficients Quantisation with 8 bits (magnitude). Required side information for filter coefficients @30 fps ( [VCIP05] ): PCM VCIP05 14.6 kbit/s 3-10 kbit/s

Results CIF ( HDTV) ProfileIDC 100 QPISlice 23, 27, 31, 35 IntraPeriod   CIF ( HDTV) ProfileIDC 100 QPISlice 23, 27, 31, 35 IntraPeriod QPPSlice 24, 28, 32, 36 NumberBFrames 3 QPBSlice 25, 29, 33, 37 BReferencePictures 1 PyramidCoding PyramidLevelQPEnable SearchRange 32 (64) NumberReferenceFrames 5 (3) SymbolMode AdaptiveRounding Transform8x8

Concrete, CIF, 400 Frames @ 30 fps

Crew, HDTV(720p), 20 Frames @ 60 fps

Raven, HDTV(720p), 40 Frames @ 60 fps

Sunflower, HDTV(1080p), 100 Frames @ 25 fps

Average of 12% bit rate savings compared to the standard H.264/AVC Conclusions Average of 12% bit rate savings compared to the standard H.264/AVC Slightly increased decoder complexity Number of operations needed for interpolation is increased Suitable for 24-bit arithmetic