Fast and constant time random access decoding with log(2)n block seek time

Yushin Cho; Sungdae Cho; William A. Pearlman

doi:10.1117/12.585332

17 January 2005 Fast and constant time random access decoding with log2n block seek time

Yushin Cho, Sungdae Cho, William A. Pearlman

Proceedings Volume 5682, Storage and Retrieval Methods and Applications for Multimedia 2005; (2005) https://doi.org/10.1117/12.585332
Event: Electronic Imaging 2005, 2005, San Jose, California, United States

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 log₂(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.

Citation Download Citation

Yushin Cho, Sungdae Cho, and 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); https://doi.org/10.1117/12.585332

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available