DocumentCode :
1676190
Title :
Region-of-interest coding based on set partitioning in hierarchical trees
Author :
Park, Keun-hyeong ; Lee, Chul ; Park, HyunWook
Author_Institution :
Hanaro Telecom, Inc., Seoul, South Korea
Volume :
3
fYear :
2001
fDate :
6/23/1905 12:00:00 AM
Firstpage :
804
Abstract :
In many image coding applications, such as Web browsing, image database and telemedicine, it is useful to reconstruct only a region of interest (ROI) before the rest of the image is reconstructed. An ROI coding functionality is incorporated with the set partitioning in hierarchical trees (SPIHT) algorithm (see Said and Pearlman, IEEE Trans. Circuits and Systems for Video Technology, vol.6, p.243-50, 1996). By emphasizing the ROI coefficients, they are coded with higher fidelity than the rest of the image in early stages of progressive reconstruction. The main thrust of this research is how to identify necessary coefficients for the decoder to reconstruct the desired region. The proposed method provides better performance than the previous method
Keywords :
data compression; decoding; image coding; image reconstruction; set theory; trees (mathematics); SPIHT; decoder; image coding; image compression; image reconstruction; progressive reconstruction; region-of-interest coding; set partitioning in hierarchical trees; Computational complexity; Costs; Decoding; Image coding; Image databases; Image reconstruction; Partitioning algorithms; Telecommunications; Telemedicine; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Image Processing, 2001. Proceedings. 2001 International Conference on
Conference_Location :
Thessaloniki
Print_ISBN :
0-7803-6725-1
Type :
conf
DOI :
10.1109/ICIP.2001.958242
Filename :
958242
Link To Document :
بازگشت