17 January 2005 Fast and constant time random access decoding with log2n block seek time
Author Affiliations +
Abstract
For faster random access of a target image block, a bi-section idea is applied to link image blocks. Conventional methods configure the blocks in linearly linked way, for which the block seek time entirely depends on the location of the block on the compressed bitstream. The block linkage information is configured such that binary search is possible, giving the worst case block seek time of log2(n), for n blocks. Experimental results with 3D-SPIHT on video sequences show that the presented idea gives substantial speed improvement with minimal bit overhead.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yushin Cho, Yushin Cho, Sungdae Cho, Sungdae Cho, William A. Pearlman, William A. Pearlman, } "Fast and constant time random access decoding with log2n block seek time", Proc. SPIE 5682, Storage and Retrieval Methods and Applications for Multimedia 2005, (17 January 2005); doi: 10.1117/12.585332; https://doi.org/10.1117/12.585332
PROCEEDINGS
8 PAGES


SHARE
Back to Top