[1] Serra J., Analisys and mathematical morphology, Academic Press INC., London, 1982 | Zbl

[2] Yeong-Chyang Shih F., “Threshold decomposition of gray scale morphology into binary morphology”, IEEE Trans. on Pattern Analysis, Machine Intelligence, II:1. January (1989)

[3] Vizilter Yu.V., “Kriterialnye proektivnye morfologii”, Tr. 14 Vseros. konf. Matem. metody raspoznavaniya Obrazov, MMRO-14, Suzdal, 2009, 317–320

[4] Pytev Yu.P., “Morfologicheskii analiz izobrazhenii”, Dokl. AN SSSR, 269:5 (1983), 1061–1064 | MR | Zbl

[5] Mestetskii L.M., Semenov A.V., “Preobrazovanie tsvetnykh izobrazhenii na osnove zhirnykh B-splainovykh krivykh”, Tp. 14 mezhdunar. konf. GRAFIKON-2003, M., 2003

[6] Mestetskii L.M., Nepreryvnaya morfologiya binarnykh izobrazhenii. Figury. Skelety. Tsirkulyary, FIZMATLIT, M., 2009

[7] Mestetskii L.M., Reier I.A., “Nepreryvnoe skeletnoe predstavlenie izobrazheniya s kontroliruemoi tochnostyu”, Tr. 15 mezhdunar. konf. GRAFIKON-2003, M., 2003, 246–249 | Zbl

[8] Domakhina L., Okhlopkov A., “Izomorfnye skelety rastrovykh izobrazhenii”, Trudy 18 mezhdunarodnoi konferentsii GRAFIKON-2008, M., 2008

[9] Domakhina L., Okhlopkov A., “Shape comparison baded on skeleton isomorphism”, Proc. IV Internat. Conf. on Computer Vision Theory and Applications, VISAPP, Lisbon, 2009

[10] Domakhina L.G., “Regulyarizatsiya skeleta dlya zadachi sravneniya formy”, Tr. 14 Vseros. konf. Matem. metody raspoznavaniya obrazov, MMRO-14, M., 2009

[11] Anil K., Jain, Fundamentals of digital image processing, Prentice Hall, 1989

[12] Choi Hyeong In, Choi Sung Woo, Moon Hwan Pyo, “Mathematical theory of medial axis transform”, Pacific. J. of Math., 181:1 (1997), 57–88 | DOI | MR | Zbl

[13] Kharari F., Teoriya grafov, URSS, M., 2003

[14] Chin F., Shoeyink J., Wang C.-A., “Finding the medial axis of a simple polygon in linear time”, Discrete Comput. Geometry, 21:3 (1999), 405–420 | DOI | MR | Zbl

[15] Vizilter Yu.V., “Obobschennaya proektivnaya morfologiya”, Kompyuternaya optika, 32:4 (2008), 384–399

[16] Vasilev N., Metricheskie prostranstva, Kvant, no. 1, 1990

[17] Zhukova K., Reyer I., “Parametric family of boundary-skeletal shape representation”, Proc. 14 Rus. Conf. Mat. Methods of Object Recognition, 2009

[18] Keisler H. Jerome, Elementary calculus. An infinitesimal approach, Prindle, Weber Schmidt, Boston, Massachusetts

[19] Sebastian T.B., Kimia B., “Curves vs skeletons in object recognition”, Proc. 2001 Internat. Conf. Image Proc., ICIP-2001, v. 3, Grece, Thessaloniki, 22–25

[20] Klein P.N., Sebastian T.B., Kimia B.B., “Shape matching using Edit-Distance”, An Implementation the twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, 781–790 | Zbl

[21] Tanase M., Shape decomposition and retrieval, PhD Thesis, Utrecht Un., 2005

[22] Klein P., Tirthapura S., Sharvit D., Kimia B.B., “A tree-edit-distance algorithm for comparing simple, closed shapes”, ACM-SIAM Symp. on Discr. Algorithms, 1999 | MR

[23] Sebastian T.S., Klein P.N., Kimia B.B., “Recognition of shapes by edition shock graphs”, Internat. Conf. on Computer Vision, v. I, 2001, 755–762

[24] Sebastian T.S., Klein P.N., Kimia B.B., “Shock-based indexing into large shape databases”, Eur. Conf. on Computer Vision, v. II, 2002, 731–746 | Zbl

[25] Golland P., Grimson E.L., “Fixed topology skeletons”, Conf. on Computer Vision and Pattern Recognition, 1 (2000), 10–17

[26] Tirthapura S., Sharvit D., Klein P., Kimia B.B., “Indexing based on edit-distance matching of shape graphs SPIE”, Internat. Symp. on Voice, Video, and Data Communications, 1998, 25–36

[27] Siddiqi K., Shokoufandeh A., Dickinson S.J., Zucker S.W., “Shock graphs and shape matching”, Internat. J. Comput. Vision, 35:1 (1999), 13–32 | DOI

[28] Liu T., Geiger D., Approximate tree matching and shape similarity, ICCV, 1999

[29] Pelillo M., Siddiqi K., Zucker S.W., “Matching hierarchical structures using association graphs”, IEEE Trans. Pattern Analys. Mach. Intell., 21:11 (1999), 1105–1120 | DOI

[30] Torsello A., Hancock E.R., Skeletal A., “Measure of 2 D shape similarity”, Computer Vision and Image Understanding, 95:1 (2004), 1–29 | DOI