Segmentation of brush strokes by saliency preserving dual graph contraction
暂无分享,去创建一个
[1] Robert Sablatnig,et al. Structural analysis of paintings based on brush strokes , 1998, Electronic Imaging.
[2] M. N. Shanmukha Swamy,et al. Graphs: Theory and Algorithms , 1992 .
[3] Walter G. Kropatsch,et al. Plane Embedding of Dually Contracted Graphs , 2000, DGCI.
[4] S. Lippman,et al. The Scripps Institution of Oceanography , 1959, Nature.
[5] W. Kropatsch. Building irregular pyramids by dual-graph contraction , 1995 .
[6] Michael Lindenbaum,et al. A Generic Grouping Algorithm and Its Quantitative Analysis , 1998, IEEE Trans. Pattern Anal. Mach. Intell..
[7] Yoshinobu Sato,et al. Orientation Space Filtering for Multiple Orientation Line Segmentation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..
[8] Reinhard Diestel,et al. Graph Theory , 1997 .
[9] Christoph von der Malsburg,et al. Pattern recognition by labeled graph matching , 1988, Neural Networks.
[10] Luc Vincent,et al. Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations , 1991, IEEE Trans. Pattern Anal. Mach. Intell..
[11] Jos B. T. M. Roerdink,et al. A disjoint set algorithm for the watershed transform , 1998, 9th European Signal Processing Conference (EUSIPCO 1998).
[12] Alex Pentland,et al. Probabilistic Visual Learning for Object Representation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..
[13] Andrea J. van Doorn,et al. Image Structure , 1997, DAGM-Symposium.
[14] Joachim M. Buhmann,et al. Distortion Invariant Object Recognition in the Dynamic Link Architecture , 1993, IEEE Trans. Computers.