메뉴 건너뛰기




Volumn 4, Issue , 2007, Pages 41-44

Effective component tree computation with application to pattern recognition in astronomical imaging

Author keywords

Algorithms; Astronomy; Morphological operations; Nonlinear filters; Pattern recognition

Indexed keywords

ALGORITHMS; ASTRONOMY; FORESTRY; MATHEMATICAL MORPHOLOGY; NONLINEAR FILTERING; PATTERN RECOGNITION; TREES (MATHEMATICS);

EID: 48149096923     PISSN: 15224880     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIP.2007.4379949     Document Type: Conference Paper
Times cited : (83)

References (8)
  • 1
    • 33746202291 scopus 로고    scopus 로고
    • Building the component tree in quasi-linear time
    • November
    • L. Najman and M. Couprie, "Building the component tree in quasi-linear time," IEEE Trans. Image Processing, vol. 15, no. 11, pp. 3531-3539, November 2006.
    • (2006) IEEE Trans. Image Processing , vol.15 , Issue.11 , pp. 3531-3539
    • Najman, L.1    Couprie, M.2
  • 2
    • 0036538250 scopus 로고    scopus 로고
    • A comparison of algorithms for connected set openings and closings
    • A. Meijster and M. H. F. Wilkinson, "A comparison of algorithms for connected set openings and closings," IEEE Trans. Pattern Anal. Machine Intell., vol. 24, no. 4, pp. 484-494, 2002.
    • (2002) IEEE Trans. Pattern Anal. Machine Intell , vol.24 , Issue.4 , pp. 484-494
    • Meijster, A.1    Wilkinson, M.H.F.2
  • 3
    • 85026409101 scopus 로고    scopus 로고
    • Th. Géraud, Ruminations on Tarjan's Union-Find algorithm and connected operators, in Mathematical Morphology: 40 Years On (Proc. of ISMM), Paris, France, April 2005, 30 of Computational Imaging and Vision, pp. 105-116, Springer.
    • Th. Géraud, "Ruminations on Tarjan's Union-Find algorithm and connected operators," in Mathematical Morphology: 40 Years On (Proc. of ISMM), Paris, France, April 2005, vol. 30 of Computational Imaging and Vision, pp. 105-116, Springer.
  • 4
    • 0016495233 scopus 로고
    • Efficiency of a good but not linear set union algorithm
    • R. E. Tarjan, "Efficiency of a good but not linear set union algorithm," Journal of the ACM, vol. 22, no. 2, pp. 215-225, 1975.
    • (1975) Journal of the ACM , vol.22 , Issue.2 , pp. 215-225
    • Tarjan, R.E.1
  • 5
    • 0043048609 scopus 로고    scopus 로고
    • Component trees for image filtering and segmentation
    • E. Coyle, Ed, Mackinac Island, September
    • R. Jones, "Component trees for image filtering and segmentation," in IEEE Workshop on Nonlinear Signal and Image Processing, E. Coyle, Ed., Mackinac Island, September 1997.
    • (1997) IEEE Workshop on Nonlinear Signal and Image Processing
    • Jones, R.1
  • 6
    • 0002332720 scopus 로고
    • Grayscale area openings and closings: Their applications and efficient implementation
    • L. Vincent, "Grayscale area openings and closings: their applications and efficient implementation," in Intl. Symposium on Mathematical Morphology, 1993, pp. 22-27.
    • (1993) Intl. Symposium on Mathematical Morphology , pp. 22-27
    • Vincent, L.1
  • 7
    • 0001584432 scopus 로고    scopus 로고
    • Antiextensive connected operators for image and sequence processing
    • P. Salembier, A. Oliveras, and L. Garrido, "Antiextensive connected operators for image and sequence processing," IEEE Trans. Image Processing, vol. 7, no. 4, pp. 555-570, 1998.
    • (1998) IEEE Trans. Image Processing , vol.7 , Issue.4 , pp. 555-570
    • Salembier, P.1    Oliveras, A.2    Garrido, L.3


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