Title :
Region coding and detail compensation
Author_Institution :
Dept. of Electr. Eng., Imperial Coll. of Sci., Technol. & Med., London, UK
Abstract :
An approach is proposed for segmented image coding which avoids the redundant and false-edges that appear in the late stages of hierarchical segmentation. The recursive shortest spanning tree (RSST) algorithm is used to obtain regions describing the main objects. Significant small features are then extracted from the original image to compensate for the coarse segmented image. The method of extracting details is based on mathematical morphology and is a modification of a detail extracting method described in a previous study. This approach produced better visual image quality than using the segmentation-only algorithms especially in the case of low bit-rate coding
Keywords :
feature extraction; image coding; image segmentation; mathematical morphology; recursive functions; trees (mathematics); coarse segmented image; compensation; detail compensation; feature extraction; hierarchical segmentation; low bit-rate coding; mathematical morphology; recursive shortest spanning tree algorithm; region coding; segmentation-only algorithms; segmented image coding; visual image quality; Biomedical signal processing; Data mining; Digital signal processing; Digital systems; Educational institutions; Image coding; Image quality; Image reconstruction; Image segmentation; Signal processing algorithms;
Conference_Titel :
Signal Processing, 1996., 3rd International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-2912-0
DOI :
10.1109/ICSIGP.1996.566504