EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Two-stage mural image restoration using an edge-constrained attention mechanism

Jianfang Cao iD, Xianhui Wang, Fang Wang, Zhen Cao, Jiaqi Liu, Zhuolin Yang

PLOS ONE · 06.09.2024 · 19 (9) · e0307811

DOI: 10.1371/journal.pone.0307811 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PLOS ONE, online erschienen am 06.09.2024. Verfasst von Jianfang Cao und 5 weiteren Autor:innen. Beteiligte Einrichtung: Department of Computer Science and Technology, Xinzhou Normal University, Xinzhou, China. Hauptthemen laut MEDLINE: Image Processing, Computer-Assisted. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, the Humanities and Social Sciences Research Project of the Ministry of Education, Shanxi Province Natural Fund Project.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The current mainstream image restoration methods have difficulty fully learning the structure and color information of murals in mural image restoration tasks due to the limited size of the available datasets, resulting in problems such as structural loss and texture errors. This study proposes a two-stage mural restoration network based on an edge-constrained attention mechanism. This paper introduces additional sketches as inputs during the coarse restoration phase and incorporates a local edge loss function to enable the network to generate corresponding structural information based on the sketches. In the fine restoration phase, the calculation for the similarity between missing areas and known areas is optimized to enhance the consistency of the restoration results with the texture of the known areas. Furthermore, a structure-guided attention propagation block is introduced after adopting the attention mechanism. This block selectively integrates surrounding contextual information to update the attention score map, thereby enhancing the coherence and plausibility of the generated textures. The experimental results show that the proposed method outperforms the current mainstream restoration methods according to various assessment indices. The proposed method generates high-quality structural information according to user guidance information, and the repaired texture is highly visually consistent with that of the original mural, with few noticeable deviations. This study provides a new approach for mural restoration, which may positively impact cultural heritage protection and artistic restoration applications.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Image Processing, Computer-AssistedAlgorithms

Autor:innen und Institutionen

  • Department of Computer Science and Technology, Xinzhou Normal University, Xinzhou, China.
  • School of Computer Science and Technology, Taiyuan University of Science and Technology, Taiyuan, China.

ORCID-Profile: Jianfang Cao

Förderung

  • National Natural Science Foundation of China
  • the Humanities and Social Sciences Research Project of the Ministry of Education
  • Shanxi Province Natural Fund Project
  • 2024 Cultural Relics Research Project of Shanxi Provincial Cultural Relics Bureau

Zitieren

APA

Cao, J., Wang, X., Wang, F., Cao, Z., Liu, J., & Yang, Z. (2024). Two-stage mural image restoration using an edge-constrained attention mechanism. PLOS ONE, 19(9), e0307811. https://doi.org/10.1371/journal.pone.0307811

Vancouver

Cao J, Wang X, Wang F, Cao Z, Liu J, Yang Z. Two-stage mural image restoration using an edge-constrained attention mechanism. PLOS ONE. 2024;19(9):e0307811. doi:10.1371/journal.pone.0307811

BibTeX
@article{Cao2024,
  author = {Cao, Jianfang and Wang, Xianhui and Wang, Fang and Cao, Zhen and Liu, Jiaqi and Yang, Zhuolin},
  title = {Two-stage mural image restoration using an edge-constrained attention mechanism},
  journal = {PLOS ONE},
  year = {2024},
  volume = {19},
  number = {9},
  pages = {e0307811},
  doi = {10.1371/journal.pone.0307811}
}
Kostenlos starten →