CHARACTERISTICS OF VISUAL COMPLEXITY: CALLIGRAPHIC FONTS VS. PRINTED FONTS

被引:0
|
作者
Wang, Yuchen [1 ]
Lyu, Ruimin [1 ]
机构
[1] Jiangnan Univ, Jiangsu Key Univ Lab Software & Media Technol Hum, Wuxi, Jiangsu, Peoples R China
关键词
Visual complexity; writing systems; Chinese calligraphic; AI calligraphic; COMPRESSION;
D O I
10.1109/ICMEW63481.2024.10645358
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Chinese characters possess diverse calligraphic styles and corresponding calligraphers. These styles are evidently manifested on a visual level, stemming from certain visual disparities between calligraphic characters and common characters. We aim to explore the specific visual disparities that distinguish calligraphic characters from standard ones, endowing them with higher levels of recognition difficulty and artistic value. This can help evaluate to what extent AI-generated calligraphic characters match a specific calligraphy style. To achieve this, we leveraged research findings on visual complexity to measure various aspects of complexity for a certain number of calligraphic characters and printed characters. We found that the significant differences in visual complexity between the two lie in perimeter complexity, terminations, and intersections. Based on the findings, we evaluated the quality of calligraphic characters generated by Midjourney. They basically possess the common characteristics of calligraphic characters, but do not quite match the specified calligraphic style.
引用
收藏
页数:6
相关论文
共 50 条
  • [31] Dubbing vs. subtitling Complexity matters
    Perego, Elisa
    Del Missier, Fabio
    Straga, Marta
    TARGET-INTERNATIONAL JOURNAL OF TRANSLATION STUDIES, 2018, 30 (01) : 137 - 157
  • [32] Entropy Measures vs. Kolmogorov Complexity
    Teixeira, Andreia
    Matos, Armando
    Souto, Andre
    Antunes, Luis
    ENTROPY, 2011, 13 (03) : 595 - 611
  • [33] Biomarkers for Sarcopenia: Reductionism vs. Complexity
    Calvani, Riccardo
    Picca, Anna
    Cesari, Matteo
    Tosato, Matteo
    Marini, Federico
    Manes-Gravina, Ester
    Bernabei, Roberto
    Landi, Francesco
    Marzetti, Emanuele
    CURRENT PROTEIN & PEPTIDE SCIENCE, 2018, 19 (07) : 639 - 642
  • [34] On the Complexity of Symmetric vs. Functional PCSPs
    Nakajima, Tamio-Vesa
    Zivny, Stanislav
    ACM TRANSACTIONS ON ALGORITHMS, 2024, 20 (04)
  • [35] Shannon entropy vs. Kolmogorov complexity
    Muchnik, An.
    Vereshchagin, N.
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2006, 3967 : 281 - 291
  • [36] Truth vs. Proof in computational complexity
    Barak, Boaz
    Barak, B. (b@boazbarak.org), 1600, European Association for Theoretical Computer Science, C/O Ioannis Chatzigiannakis, 1 N. Kazantzaki Str.,Rio, 26504, Greece (108): : 131 - 142
  • [37] Historians and complexity: Trends vs. collapses?
    Linstone, Harold A.
    TECHNOLOGICAL FORECASTING AND SOCIAL CHANGE, 2010, 77 (08) : 1415 - 1418
  • [38] Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
    Kowalski, DR
    Pelc, A
    THEORETICAL COMPUTER SCIENCE, 2005, 333 (03) : 355 - 371
  • [39] Real Complexity vs. Apparent Complexity in Modeling Social Processes
    Malita, Mihaela
    Stefan, Gheorghe
    ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY, 2013, 16 (2-3): : 131 - 143
  • [40] On P vs. NP and Geometric Complexity Theory
    Mulmuley, Ketan D.
    JOURNAL OF THE ACM, 2011, 58 (02)