Share Email Print

Optical Engineering

Boundary block-searching algorithm for arbitrary shaped coding
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Arbitrary shaped coding is an important issue of MPEG-4. In this study, an efficient shaped coding method, called the boundary block-searching (BBS) algorithm, which can enhance the coding efficiency of conventional padding schemes, is proposed. The proposed BBS algorithm assumes that boundary blocks have strong correlation even though they are not connected. For an input boundary block, the most similar block (only object pixels are considered) is sought from the previously coded data. Instead of being encoded by the use of discrete cosine transform, the boundary block is encoded by a position vector, which indicates the relative position of the most similar block. Therefore, the number of bits required to denote the boundary block is greatly reduced and low bit rate can be achieved. For two video sequences under different test conditions, simulation results show that the proposed BBS algorithm can greatly improve coding efficiency.

Paper Details

Date Published: 1 August 2005
PDF: 7 pages
Opt. Eng. 44(8) 087012 doi: 10.1117/1.2013268
Published in: Optical Engineering Volume 44, Issue 8
Show Author Affiliations
Hsuan-Ting Chang, National Yunlin Univ. of Science and Technology (Taiwan)

© SPIE. Terms of Use
Back to Top