1 April 2007 Optimal exploratory effort to build knowledge for video transmission
Jose Antonio Garcia, Rosa Rodriguez-Sanchez, Joaquin Fdez-Valdivia
Author Affiliations +
Abstract
The study of the dynamics of an exploratory effort to build knowledge for progressive transmission shows that if initial knowledge about information of interest is large, most exploration to increase the knowledge base can be postponed to higher bit rates, with independence of transmission costs. On the contrary, if proved knowledge is initially small, high exploratory effort must occur at extremely low bit rates so as to increase the inventory of proved knowledge about relevant visual information. From the dynamics of exploratory effort, it follows a hierarchical quantizer partition tree at a near optimal level of exploratory effort until near the end of the progressive transmission without the necessity for any additional exploratory effort. We show an example of the application of this hierarchical quantizer partition tree for progressive transmission of video sequences, where interquantizer prioritization follows a novel hierarchical bit allocation algorithm.
©(2007) Society of Photo-Optical Instrumentation Engineers (SPIE)
Jose Antonio Garcia, Rosa Rodriguez-Sanchez, and Joaquin Fdez-Valdivia "Optimal exploratory effort to build knowledge for video transmission," Optical Engineering 46(4), 047401 (1 April 2007). https://doi.org/10.1117/1.2727247
Published: 1 April 2007
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Visualization

Information visualization

Video

Wavelets

Optical engineering

Computer programming

Distortion

RELATED CONTENT

Adaptive MPEG-2 information structuring
Proceedings of SPIE (January 22 1999)
Rate control for fully fine-grained scalable video coders
Proceedings of SPIE (January 04 2002)
Rate control for multisequence video streaming
Proceedings of SPIE (January 04 2002)

Back to Top