Survey and Pareto Analysis Method for Coding Efficiency Assessment of Low Complexity H.264 Algorithms
Files in This Item:
|Survey_and_Pareto_Analysis_Method_for_Coding_Efficiency_Assessment_of_Low_Complexity_H.264_Algorithms.pdf||158.22 kB||Adobe PDF||Download|
|Title:||Survey and Pareto Analysis Method for Coding Efficiency Assessment of Low Complexity H.264 Algorithms||Authors:||Ivanov, Yuri
Bleakley, Chris J.
|Permanent link:||http://hdl.handle.net/10197/7125||Date:||1-Sep-2006||Abstract:||A large number of algorithms have been proposed by researchers to reduce H.264computational complexity. Currently there is no method for reliably comparing theeffectiveness of these algorithms. This paper proposes a method that allows direct comparison of the results obtained for various previously published low complexity H.264 encoding algorithms. The method is based on a new coding efficiency metric for unified bit rate and quality assessment. Pareto analysis is used to derive an optimal reference efficiency complexity curve using standard H.264 encoding tools and parameters. The paper demonstrates application of the method to the assessment of recently published low-complexity algorithms. The method shows that some published low complexity algorithms can be outperformed by simply adjusting the standard video encoder parameters.||Funding Details:||University College Dublin||Type of material:||Conference Publication||Keywords:||Video compression; H.264; Complexity scaling; Pareto analysis||Other versions:||http://www.cs.ucd.ie/staff/cbleakley/home/papers/IMVIP_ivanov_CR.pdf
|Language:||en||Status of Item:||Peer reviewed||Conference Details:||Irish Machine Vision and Image Processing Conference (IMVIP), Dublin, Ireland, 30 August - 1 September, 2006|
|Appears in Collections:||Computer Science Research Collection|
Show full item record
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.