Image Coding by Adaptive Tree-Structured Segmentation

IEEE Transactions on Information Theory

Volumn 38, Issue 6, 1992, Pages 1755-1767

  Wu, Xiaolin ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

data structures and algorithms; digital geometry; Image coding; optimization; piecewise functional approximation; segmentation

Indexed keywords

ALGORITHMS; TREES (MATHEMATICS);

ADAPTIVE SEGMENTATION; IMAGE SEGMENTATION;

IMAGE CODING;

EID: 0026954770     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.165448     Document Type: Article

References (20)

1. R. Bellman, “On the approximation of curves by line segments using dynamic programming,” Comm. ACM., vol. 4, no. 6, p. 284, June 1961.
2. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone, Classification and Regression Trees. Pacific Grove, CA: Wadsworth and Brooks, 1984.
3. E. J. Delp and O. R. Mitchell, “Image compression using block truncation coding,” IEEE Trans. Commun., vol. COM-27, pp. 1335-1342, Sept. 1979.
4. H. M. Dreizen, “Content-driven progressive transmission of grayscale images,” IEEE Trans. Commun., vol. COM-35, pp. 289-296, Mar. 1987.
5. M. J. Durst, “Progressive transmission increasing both spatial and gray scale resolutions,” in Proc. Int. Conf. Multimedia Inform. Syst. ‘91. Singapore: McGraw-Hill, 1991, pp. 175-186.
6. C. R. Dyer, “The space efficiency of quadtrees,” Comput. Graphics Image Processing, vol. 19, pp. 335-348, 1982.
7. J. D. Foley, A. V. Dam, S. K. Feiner, and J. F. Hughes, Computer Graphics, Principles and Practice, 2nd ed. Reading, MA: Addison-Wesley, 1990.
8. R. C. Gonzalez and P. Wintz, Digital Image Processing, 2nd ed. Reading, MA: Addison-Welsey, 1987.
9. R. M. Gray, “Vector quantization,” IEEE ASSP Mag., pp. 4-29, Apr. 1984.
10. E. Kawaguchi, T. Endo, and J. Matsunaga, “Depth-first expression viewed from digital picture processing,” IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-5, pp. 373-384, July 1983.
11. K. Knowlton, “Progressive transmission of grey-scale and binary pictures by simple, efficient, and lossless encoding schemes,” Proc. IEEE, vol. 68, pp. 885-896, July 1980.
12. M. Kunt, A. Ikonomopoulos, and M. Kocher, “Second generation image coding techniques,” Proc. IEEE, vol. 73, pp. 549-574, Apr. 1985.
13. M. Kunt, M. Benard, and R. Leonardi, “Recent result in high-compression image coding,” IEEE Tran. Circuits Syst., vol. CAS-34, no. 11, pp. 1306-1336, Nov. 1987.
14. D. E. McClure, “Nonlinear segmented function approximation and analysis of line patterns,” Quart. Appl. Math., vol. 33, pp. 1-37, 1975.
15. J. N. Morgan and J. A. Sonquist, “Problems in the analysis of survey data, and a proposal,” J. Amer. Statist. Assoc., vol. 58, pp. 415-434, 1963.
16. T. Pavlidis, Structural Pattern Recognition. New York: Springer, 1977.
17. “Optimal piecewise polynomial L2 approximation of functions of one and two variables,” IEEE Tran. Comput., vol. - pp. 98-102, Jan. 1975.
18. F. P. Preparata and M. I. Shamos, Computational Geometry. New York: Springer-Verlag, 1985.
19. H. Samet, The Design and Analysis of Spatial Data Structures. Reading MA: Addison-Wesley, 1990.
20. P. Strobach, “Image coding based on quadtree-structured recursive least-squares approximation,” Proc. IEEE ICASSP'89, Glasgow, 1989, pp. 1961-1964.