An optimal yet fast pruning algorithm to reduce latency in multiview prediction structures

Carballeira López, Pablo and Cabrera Quesada, Julian and Jaureguizar Núñez, Fernando and García Santos, Narciso (2014). An optimal yet fast pruning algorithm to reduce latency in multiview prediction structures. In: "3DTV-Conference: The True Vision - Capture, Transmission and Display of 3D Video (3DTV-CON)", 02/07/2014 - 04/07/2014, Budapest, Hungary. pp. 1-4.

Description

Title: An optimal yet fast pruning algorithm to reduce latency in multiview prediction structures
Author/s:
  • Carballeira López, Pablo
  • Cabrera Quesada, Julian
  • Jaureguizar Núñez, Fernando
  • García Santos, Narciso
Item Type: Presentation at Congress or Conference (Article)
Event Title: 3DTV-Conference: The True Vision - Capture, Transmission and Display of 3D Video (3DTV-CON)
Event Dates: 02/07/2014 - 04/07/2014
Event Location: Budapest, Hungary
Title of Book: 3DTV-Conference: The True Vision - Capture, Transmission and Display of 3D Video (3DTV-CON)
Título de Revista/Publicación: 2014 3DTV-CONFERENCE: THE TRUE VISION - CAPTURE, TRANSMISSION AND DISPLAY OF 3D VIDEO (3DTV-CON)
Date: 2014
Subjects:
Freetext Keywords: 3D Video, video-conference, multiview video coding, prediction structure, low latency, graph theory
Faculty: E.T.S.I. Telecomunicación (UPM)
Department: Señales, Sistemas y Radiocomunicaciones
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB) | Preview

Abstract

We propose a new algorithm for the design of prediction structures with low delay and limited penalty in the rate-distortion performance for multiview video coding schemes. This algorithm constitutes one of the elements of a framework for the analysis and optimization of delay in multiview coding schemes that is based in graph theory. The objective of the algorithm is to find the best combination of prediction dependencies to prune from a multiview prediction structure, given a number of cuts. Taking into account the properties of the graph-based analysis of the encoding delay, the algorithm is able to find the best prediction dependencies to eliminate from an original prediction structure, while limiting the number of cut combinations to evaluate. We show that this algorithm obtains optimum results in the reduction of the encoding latency with a lower computational complexity than exhaustive search alternatives.

More information

Item ID: 36208
DC Identifier: http://oa.upm.es/36208/
OAI Identifier: oai:oa.upm.es:36208
Official URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6874722
Deposited by: Memoria Investigacion
Deposited on: 05 Jul 2015 10:47
Last Modified: 05 Jul 2015 10:47
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM