Efficient region segmentation on compressed gray images using quadtree and shading representation

DOI10.1016/j.patcog.2004.02.009zbMath1070.68583OpenAlexW2049679899MaRDI QIDQ1764075

Xianqiang Yang

Publication date: 23 February 2005

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2004.02.009

zbMATH Keywords

Image compressionGouraud shadingQuadtreeRegion growingRegion segmentation

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (1)

Efficient algorithms for coding Hilbert curve of arbitrary-sized image and application to window query

Cites Work

• Unnamed Item
• Two linear time Union--Find strategies for image processing
• Efficient Union-Find for planar graphs and other sparse graph classes
• Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees
• Efficiency of a Good But Not Linear Set Union Algorithm

This page was built for publication: Efficient region segmentation on compressed gray images using quadtree and shading representation