Conference Paper

J. E. Fowler, "Shape-Adaptive Coding Using Binary Set Splitting with k-d Trees," in Proceedings of the International Conference on Image Processing, Singapore, October 2004, vol. 2, pp. 1301-1304.

• Abstract:
  The binary set splitting with k-d trees (BISK) algorithm is introduced. An embedded wavelet-based image coder based on the popular bitplane-coding paradigm, BISK is designed specifically for the coding of image objects with arbitrary shape. While other similar algorithms employ quadtree-based set partitioning to code significance-map information, BISK uses a simpler, and more flexible, binary decomposition via k-d trees. Additionally, aggressive discarding of transparent regions is implemented by shrinking sets to the bounding box of their constituent opaque coefficients before further partitioning. Empirical results indicate that the proposed BISK coder consistently yields efficient performance when compared to a variety of other shape-adaptive coders.

• Text:

© 2004 IEEE. Published in the 2004 International Conference on Image Processing (ICIP-2004), scheduled for October 24-27, 2004 in Singapore. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works, must be obtained from the IEEE. Contact: Manager, Copyrights and Permissions / IEEE Service Center / 445 Hoes Lane / P.O. Box 1331 / Piscataway, NJ 08855-1331, USA. Telephone: + Intl. 908-562-3966.