Region-of-interest coding based on set partitioning in hierarchicaltrees
Keun-hyeong Park
Chul Soo Lee
Hyunwook Park
Hanaro Telecom, Inc., Seoul;
This paper appears in: Image Processing, 2001. Proceedings. 2001 International Conference on
Publication Date: 2001
Volume: 3,
On page(s): 804-807 vol.3
Meeting Date: 10/07/2001 - 10/10/2001
Location: Thessaloniki, Greece
ISBN: 0-7803-6725-1
References Cited: 6
INSPEC Accession Number: 7230929
Digital Object Identifier: 10.1109/ICIP.2001.958242
Current Version Published: 2002-08-07
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
