Translator Disclaimer
10 February 2009 B-term approximation using tree-structured Haar transforms
Author Affiliations +
Proceedings Volume 7245, Image Processing: Algorithms and Systems VII; 724505 (2009) https://doi.org/10.1117/12.816680
Event: IS&T/SPIE Electronic Imaging, 2009, San Jose, California, United States
Abstract
We present a heuristic solution for B-term approximation using Tree-Structured Haar (TSH) transforms. Our solution consists of two main stages: best basis selection and greedy approximation. In addition, when approximating the same signal with different B constraint or error metric, our solution also provides the flexibility of having less overall running time at expense of more storage space. We adopted lattice structure to index basis vectors, so that one index value can fully specify a basis vector. Based on the concept of fast computation of TSH transform by butterfly network, we also developed an algorithm for directly deriving butterfly parameters and incorporated it into our solution. Results show that, when the error metric is normalized ℓ1-norm and normalized ℓ2-norm, our solution has comparable (sometimes better) approximation quality with prior data synopsis algorithms.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Hsin-Han Ho, Karen O. Egiazarian, and Sanjit K. Mitra "B-term approximation using tree-structured Haar transforms", Proc. SPIE 7245, Image Processing: Algorithms and Systems VII, 724505 (10 February 2009); https://doi.org/10.1117/12.816680
PROCEEDINGS
10 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

A new algorithm for pedestrian detection
Proceedings of SPIE (July 18 2013)
Medium-independent table detection
Proceedings of SPIE (December 21 1999)
Use Of Overlap In The Hough And Fast Hough Transforms
Proceedings of SPIE (November 13 1989)

Back to Top