메뉴 건너뛰기




Volumn 37, Issue 8, 2004, Pages 1591-1605

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

Author keywords

Gouraud shading; Image compression; Quadtree; Region growing; Region segmentation; Union find

Indexed keywords

ALGORITHMS; IMAGE SEGMENTATION; STATISTICS;

EID: 2642526001     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2004.02.009     Document Type: Article
Times cited : (20)

References (17)
  • 3
    • 0035481623 scopus 로고    scopus 로고
    • Symbol recognition by error-tolerant subgraph matching between region adjacency graphs
    • Llados J. Marti E. Villanueva J.J. Symbol recognition by error-tolerant subgraph matching between region adjacency graphs IEEE Trans. Pattern Anal. Mach. Intell. 23 10 2001 1137-1143
    • (2001) IEEE Trans. Pattern Anal. Mach. Intell. , vol.23 , Issue.10 , pp. 1137-1143
    • Llados, J.1    Marti, E.2    Villanueva, J.J.3
  • 6
    • 0347618003 scopus 로고    scopus 로고
    • Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees
    • Dillencourt M.B. Samet H. Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees Algorithmica 15 1 1996 82-102
    • (1996) Algorithmica , vol.15 , Issue.1 , pp. 82-102
    • Dillencourt, M.B.1    Samet, H.2
  • 8
    • 0030569893 scopus 로고    scopus 로고
    • Two linear time union-find strategies for image processing
    • Fiorio C. Gustedt J. Two linear time union-find strategies for image processing Theoret. Comput. Sci. 154 2 1996 165-181
    • (1996) Theoret. Comput. Sci. , vol.154 , Issue.2 , pp. 165-181
    • Fiorio, C.1    Gustedt, J.2
  • 9
    • 0348098752 scopus 로고    scopus 로고
    • Efficient union-find for planar graphs and other sparse graph classes
    • Gustedt J. Efficient union-find for planar graphs and other sparse graph classes Theoret. Comput. Sci. 203 1998 123-141
    • (1998) Theoret. Comput. Sci. , vol.203 , pp. 123-141
    • Gustedt, J.1
  • 10
    • 0031237972 scopus 로고    scopus 로고
    • Image compression by B-tree triangular coding
    • Distasi R. Nappi M. Vitulano S. Image compression by B-tree triangular coding IEEE Trans. Commun. 45 9 1997 1095-1100
    • (1997) IEEE Trans. Commun. , vol.45 , Issue.9 , pp. 1095-1100
    • Distasi, R.1    Nappi, M.2    Vitulano, S.3
  • 14
    • 0033701902 scopus 로고    scopus 로고
    • Improved image compression using S-tree and shading approach
    • Chung K.L. Wu J.G. Improved image compression using S-tree and shading approach IEEE Trans. Commun. 48 5 2000 748-751
    • (2000) IEEE Trans. Commun. , vol.48 , Issue.5 , pp. 748-751
    • Chung, K.L.1    Wu, J.G.2
  • 15
    • 0016495233 scopus 로고
    • Efficiency of a good but not linear set union algorithm
    • Tarjan R.E. Efficiency of a good but not linear set union algorithm J. ACM 22 2 1975 215-225
    • (1975) J. ACM , vol.22 , Issue.2 , pp. 215-225
    • Tarjan, R.E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.