메뉴 건너뛰기




Volumn 24, Issue 8, 2003, Pages 1043-1050

Segmentation of brush strokes by saliency preserving dual graph contraction

Author keywords

Brush strokes; Dual graph contraction; Portrait miniatures; Preservation of saliency; Segmentation

Indexed keywords

ABSTRACTING; EDGE DETECTION; GRAPHIC METHODS;

EID: 0037406211     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(02)00250-7     Document Type: Article
Times cited : (4)

References (16)
  • 1
    • 0031997849 scopus 로고    scopus 로고
    • A generic grouping algorithm and its quantitative analysis
    • Amir, A., Lindenbaum, M., 1998. A generic grouping algorithm and its quantitative analysis. IEEE Trans. Pattern Anal. Machine Intell. 20 (2), 168-184.
    • (1998) IEEE Trans. Pattern Anal. Machine Intell. , vol.20 , Issue.2 , pp. 168-184
    • Amir, A.1    Lindenbaum, M.2
  • 2
    • 0034187110 scopus 로고    scopus 로고
    • Orientation space filtering for multiple orientation line segmentation
    • Chen, J., Sato, Y., Tamura, S., 2000. Orientation space filtering for multiple orientation line segmentation. PAMI 22 (5), 417-429.
    • (2000) PAMI , vol.22 , Issue.5 , pp. 417-429
    • Chen, J.1    Sato, Y.2    Tamura, S.3
  • 4
    • 23044521738 scopus 로고    scopus 로고
    • Plane embedding of dually contracted graphs
    • DGCF2000, December 2000, Lecture Notes in Computer Science, Uppsala
    • Glantz, R., Kropatsch, W.G., 2000. Plane embedding of dually contracted graphs. Discrete Geometry for Computer Imagery, DGCF2000, December 2000, vol. 1953. Lecture Notes in Computer Science, Uppsala, pp. 348-357.
    • (2000) Discrete Geometry for Computer Imagery , vol.1953 , pp. 348-357
    • Glantz, R.1    Kropatsch, W.G.2
  • 5
    • 4243532022 scopus 로고    scopus 로고
    • Local structure
    • Jähne, B., Haussecker, H., Geissler, P. (Eds.), Academic Press, San Diego
    • Jähne, B., 1999. Local structure. In: Jähne, B., Haussecker, H., Geissler, P. (Eds.), Handbook of Computer Vision and Applications, vol. 2. Academic Press, San Diego.
    • (1999) Handbook of Computer Vision and Applications , vol.2
    • Jähne, B.1
  • 6
  • 7
    • 0029547845 scopus 로고
    • Building irregular pyramids by dual graph contraction
    • Kropatsch, W.G., 1995. Building irregular pyramids by dual graph contraction. IEEE Proc. Vision, Image and Signal Process 142 (6), 366-374.
    • (1995) IEEE Proc. Vision, Image and Signal Process , vol.142 , Issue.6 , pp. 366-374
    • Kropatsch, W.G.1
  • 9
    • 0023829116 scopus 로고
    • Pattern recognition by labeled graph matching
    • van der Malsburg, C., 1988. Pattern recognition by labeled graph matching. Neural Networks 1, 141-148.
    • (1988) Neural Networks , vol.1 , pp. 141-148
    • van der Malsburg, C.1
  • 11
    • 0003086304 scopus 로고    scopus 로고
    • Graph based morphological segmentation
    • Kropatsch, W.G., Jolion, J.-M. (Eds.), OCG-Schriftenreihe, Band 126, Österreichische Computer Gesellschaft
    • Meyer, F., 1999. Graph based morphological segmentation. In: Kropatsch, W.G., Jolion, J.-M. (Eds.), 2nd IAPR-TC-15 Workshop on Graph-based Representation, OCG-Schriftenreihe, Band 126, Österreichische Computer Gesellschaft, pp. 51-60.
    • (1999) 2nd IAPR-TC-15 Workshop on Graph-based Representation , pp. 51-60
    • Meyer, F.1
  • 12
    • 0031188771 scopus 로고    scopus 로고
    • Probabilistic visual learning for object representation
    • Moghaddam, B., Pentland, A., 1997. Probabilistic visual learning for object representation. PAMI 19 (7), 696- 710.
    • (1997) PAMI , vol.19 , Issue.7 , pp. 696-710
    • Moghaddam, B.1    Pentland, A.2
  • 16
    • 0026172104 scopus 로고
    • Watersheds in digital spaces: An efficient algorithm based on immersion simulations
    • Vincent, L., Soille, P., 1992. Watersheds in digital spaces: an efficient algorithm based on immersion simulations. IEEE Trans. Pattern Anal. Machine Intell. 13 (6), 583-598.
    • (1992) IEEE Trans. Pattern Anal. Machine Intell. , vol.13 , Issue.6 , pp. 583-598
    • Vincent, L.1    Soille, P.2


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