JBEAM: Multiscale curve coding via beamlets

IEEE Transactions on Image Processing

Volumn 14, Issue 11, 2005, Pages 1665-1677

  Huo, Xiaoming ^a   Chen, Jihong ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b EMORY UNIVERSITY   (United States)

Author keywords

Beamlet; Curve coding; Tree based coding

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FEATURE EXTRACTION; IMAGE COMPRESSION; OPTIMIZATION; TREES (MATHEMATICS);

BEAMLET; CURVE CODING; TREE-BASED CODING;

IMAGE CODING;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; COMPUTER ASSISTED DIAGNOSIS; COMPUTER GRAPHICS; COMPUTER PROGRAM; IMAGE ENHANCEMENT; INFORMATION PROCESSING; MATHEMATICAL COMPUTING; METHODOLOGY; SIGNAL PROCESSING;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER GRAPHICS; DATA COMPRESSION; IMAGE ENHANCEMENT; IMAGE INTERPRETATION, COMPUTER-ASSISTED; NUMERICAL ANALYSIS, COMPUTER-ASSISTED; PATTERN RECOGNITION, AUTOMATED; SIGNAL PROCESSING, COMPUTER-ASSISTED; SOFTWARE;

EID: 27844537874     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIP.2005.857273     Document Type: Article

References (28)

1. Data Web Site [Online]. Available: http://www.ee.columbia.edu/~luoht/ research/rvSeg/
2. Jbeam Software [Online]. Available: http://www.isye.gatech.edu/~xiaoming/ jbeam2004/
3. S. M. Aghito and S. Forchhammer, "Contex based coding of binary shapes by object boundary straightness analysis.," in Proc. Data Compression Conf., Mar. 2004, pp. 399-408.
4. A. Averbuch, R. R. Coifman, D. L. Donoho, M. Israeli, and J. Walden, "Fast slant stack: A notion of radon transform for data in a Cartesian grid which is rapidly computable, algebraically exact, geometrically faithful and invertible," Stanford Univ., Stanford, CA, http://www-stat.stanford.edu/donoho/Reports/2001/ FastSlantStack.pdf, Tech. Rep., 2001.
5. S. Biswas, "Contour coding through stretching of discrete circular arcs by affine transformation," Pattern Recognit., vol. 34, pp. 63-77, 2001.
6. L. Breiman, J. Friedman, R. Olshen, and C. J. Stone, Classification and Regression Trees. Belmont, CA: Wadsworth, 1983.
7. R. R. Coifinan and M. V. Wickerhauser, "Entropy-based algorithms for best-basis selection," IEEE Trans. Inf Theory, vol. 38, no. 2, pp. 713-718, Apr. 1992.
8. D. L. Donoho, "Wedgelets: nearly minimax estimation of edges," Ann. Stat., vol. 27, pp. 859-897, 1999.
9. D. L. Donoho and X. Huo, Beamlets and multiscale image analysis, in In Multiscale and Multiresolution Methods, Lecture Notes in Computational Science and Engineering, vol. 20, 2001.
10. M. Etoh, J. Ostermann, and T. Sikora, "Editorial: Special issue on shape coding for emerging multimedia applications," Signal Process.: Image Commun., vol. 15, no. 7/8, pp. 581-583, 2000.
11. H. Freeman, "On the coding of arbitrary geometric configurations," IRE Trans. Electron. Comput., vol. EC-10, pp. 260-268, Jun. 1961.
12. H. Freeman, "Application of the generalized chain coding scheme to map data processing," in Proc. IEEE Comput. Soc. Conf. Pattern Recognition and Image Processing, May 1978, pp. 220-226.
13. D. Hearn and M.P. Baker, Computer Graphics: C Version, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 1996.
14. P.G. Howard et al., "The emerging jbig2 standard," IEEE Trans. Circuits Syst. Video Technol., vol. 8, no. 7, pp. 838-848, Nov. 1998.
15. A. K. Katsaggelos, L. P. Kondi, J. Ostermann, F. W. Meier, and G. M. Schuster, "Mpeg-4 and rate-distortion-based shape-coding techniques," Proc. IEEE, vol. 86, no. 6, pp. 1126-1154, Jun. 1998.
16. J. Kim, A. C. Bovik, and B. L. Evans, "Generalized predictive binary shape coding using polygon approximation," Signal Process.: Image Commun., vol. 15, pp. 643-663, 2000.
17. J. Koplowitz and J. DeLeone, "Hierarchical representation of chain-encoded binary image contours," Comput. Vis. Image Understand., vol. 63, no.2, pp. 344-352, 1996.
18. C. C. Lu and J. G. Dunham, "Highly efficient coding schemes for contour lines based on chain code representation," IEEE Trans. Commun., vol. 39, no. 10, pp. 1511-1514, Oct. 1991.
19. P. Meer, A. Sher, and A. Rosenfeld, "The chain pyramid: Hierarchical contour processing," IEEE Trans. Pattern Anal. Mach. Intell., vol. 12, no. 4, pp. 363-376, Apr. 1990.
20. A. Said and W.A. Pearlman, "A new, fast, and efficient image codec based on set partitioning in hierarchical trees," IEEE Trans. Circuits Syst. Video Technol., vol. 6, pp. 243-250, Jun. 1996.
21. G. M. Schuster and A. K. Katsaggelos, "An optimal polygonal boundary encoding scheme in the rate distortion sense," IEEE Trans. Image Process., vol. 7, no. 1, pp. 13-26, Jan. 1998.
22. J. M. Shapiro, "Embedded image coding using zerotrees of wavelet co-efficients," IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3445-3462, Dec. 1993.
23. R. Shukla, P. L. Dragotti, M. N. Do, and M. Vetterli, "Rate-distortion optimized tree structured compression algorithms for piecewise smooth images," IEEE Trans. Image Process., vol. 14, no. 3, pp. 343-359, Mar.2005.
24. D. S. Taubman and M. W. Marcellin, JPEG2000: Image Compression Fundamentals, Standards, and Practice. Boston, MA: KJuwer, 2002.
25. R. Ulichney, "Bresenham-style scaling," in Proc. IS&T Annu. Conf, 1993, pp. 101-103.
26. M. B. Wakin, J. K. Romberg, H. Choi, and R. G. Baraniuk, Wavelet-domain approximation and compression of piecewise smooth images, to be published.
27. H. Wang, G. M. Schuster, A. K. Katsaggelos, and T. N. Pappas, "An efficient rate-distortion optimal shape coding approach utilizing a skeleton-based decomposition," IEEE Trans. Image Process., vol. 12, no. 10, pp. 1181-1193, Oct. 2003.
28. I. H. Witten, R. M. Neal, and J. G. Cleary, "Arithmetic coding for data compression," Commun. ACM, vol. 30, no. 6, Jun. 1987.