# Automatic Recognition and Repair System of Mural Image Cracks Based on Cloud Edge Computing and Digitization

Authors: Yongli Gao; Zijie Zhou
Journal: Mobile Information Systems
 (2022)

---

## Abstract

Mural painting is the art on the wall, it is the painting that people draw on the wall, it is one of the earliest forms of painting in human history, and it is also an accessory part of the building. The decorative and beautifying functions of murals make them an important aspect of environmental art. Cloud edge computing is a combination of cloud computing and edge computing, that fully absorbs the advantages of both cloud computing and edge computing and maximizes their advantages. In this study, based on cloud edge computing and digital technology, the automatic identification and repair system of fresco image cracks is studied. Image segmentation techniques have been proposed in this study, using 60 murals in three regions as experimental objects. Through experimental analysis, it is found that the traditional pine poise treatment method takes the shortest repair time. However, for a specific image, it is difficult to guarantee the quality of its restoration. The mural image in area A was repaired with the conventional pine pitch repair method, which took 113.01 seconds, and the subjective evaluation was 69 points. Using the repair method described in this study to repair, it takes 127.38 seconds, and its subjective evaluation score is the highest, which is 87 points. The experimental results have shown that the cloud edge computing method and digital technology have had a certain positive effect on the identification and repair system of fresco image cracks.


---

## Body

## 1. Introduction

As one of the types of cultural relics, frescoes represent the production and living conditions of the society at that time in the form of pictures by the ancients and are an important basis for scholars to study ancient civilizations. Due to factors such as geological activities and human damage, the painted murals have been damaged in various forms such as cracks, fading, and oxidation, and these damaged murals continue to be repaired, but traditional handicraft techniques find it difficult to complete such difficult task. Using computer technology to digitally repair damaged murals, on the one hand, the damaged murals can be repaired in time, and on the other hand, it is also helpful for the virtual display of the murals. For the problem of damaged murals, traditional manual techniques were used to restore them in the past. However, due to the lack of talent, it is difficult to restore a large number of cultural relics in a short period of time. Therefore, the innovation of this study is to use the cloud edge computing method and digital technology to perform image processing on the fresco crack image, automatically identify the crack type, and perform image repair.The advent of the digital age has greatly facilitated work and life. This study has carried out a comprehensive study of cloud edge computing methods, digital technology, and mural crack identification and repair systems. The innovation of this study is using image processing technology, noise processing of mural images, and research on image threshold segmentation. Therefore, the role of cloud edge computing methods and digital technology in fresco crack identification research is effective. To a certain extent, it can save manpower and material resources and speed up the restoration of murals.


## 2. Related Work

With the expansion of human activities, various murals have been discovered. Affected by various natural factors and human activities, the frescoes have problems such as cracks and damages, which need to be identified and repaired using technology. Many scholars have conducted research on this. Wang has proposed using the needs of users in daily life to discuss ways to expand image access points. Due to the advanced Internet and digital technology, as well as the characteristics of the younger generation, images have been searched and used extensively [1]. Patayon and Crisostomo have proposed to develop an automatic identification system for abaca bunchy top disease using different deep learning models [2]. Conforto et al. have proposed a robot-assisted treatment method and have used an automatic identification system to identify the patient’s disease type, which has assisted doctors to make better treatment plans [3]. Mu and Yue have proposed to classify and grade the image degradation of security signs, trying to break the limitation of real-time image recognition [4]. Chen et al. have proposed the establishment of a comprehensive prediction model, which has integrated the medical imaging features of patients and has purposefully identified and classified the disease types of patients [5]. The above studies have applied automatic recognition and repair systems to various fields of research, but few have used automatic recognition systems for crack recognition in mural images.In recent years, cloud edge computing methods have continued to develop, and digital technologies have also been popularized. Scholars from all walks of life have used cloud edge computing methods and digital technologies to conduct research on various academic issues. Chen and Wang have argued that nonintrusive load monitoring can infer the operating status of equipment and its energy consumption by analyzing energy data collected from monitoring equipment. With the rapid increase in the number and types of electrical loads, the traditional way of uploading all energy data to the cloud faces huge challenges [6]. Xu et al. have believed that cloud edge computing already has powerful real-time information collection capabilities and has played a vital role in providing diversified services. It works by transferring the collected information to a centralized, resource-intensive cloud platform for service implementation [7]. Taleb et al. have considered multiaccess edge computing as a platform designed to converge telecom and IT services to provide cloud computing at the edge of the radio access network [8]. Ogino et al. have proposed a flexible multiagent-based IoT edge computing architecture for balancing cloud global and edge local optimization and optimizing the roles of cloud servers and edge servers [9]. Esposito et al. have considered that one of the advantages of connecting edge computing and cloud computing is to achieve high throughput with real-time processing to ensure data durability [10]. The above research is a good analysis and application of cloud edge computing, but the field of application rarely involves the identification of cracks in mural images.


## 3. Recognition and Repair Method for Cracks in Mural Images under Cloud Edge Computing and Digitization

### 3.1. Crack Identification and Repair of Mural Images

Murals are the precious historical and cultural heritage of human beings and an important means of reflecting ancient civilizations and have high artistic value. Due to their existence, the ancient murals have various problems with cracks and damage, and it is necessary to use the current technology to repair the murals [11]. As shown in Figure 1, it is an image of an ancient mural.Figure 1
Ancient mural image.The problems with murals are mainly cracks, falling off, fading, and herpes [12, 13]. With the passage of time, the damage from the strokes will be more serious, so the protection of the murals is imminent. As shown in Figure 2, it is a common problem in murals.Figure 2
Frequently asked questions about murals.According to relevant information, most of the ancient murals appeared in ancient temples, as shown in Figure3.Figure 3
Ancient murals in the temple.It can be seen from Figure3 that the above images are murals taken at Jueshan Temple, Kaihua Temple, Sansheng Temple, and Yanshan Temple, respectively.


### 3.2. Cloud Edge Computing Methods and Digital Technologies

The digitization of cultural relics integrates modern information technology for the protection of cultural relics, and as a new development trend, the digitization of cultural relics is also used by cultural relics protection units around the world [14]. Based on the cloud edge computing method and digital technology, this study uses image preprocessing technology to study the problem of fresco cracks [15]. As shown in Figure 4, it is an introduction diagram for the image preprocessing system.Figure 4
Introduction to the image preprocessing system.Image processing is to process the information collected by the image acquisition system. Due to the influence of various factors, the collected information may have certain problems [16, 17]. Moreover, because of the huge number of crack images in murals, in order to extract information quickly, it is necessary to denoise the images first.Noise introduction: in the process of generation, transmission, and storage, images are prone to noise [18]. This study selects the most common Gaussian noise and salt and pepper noise for analysis.


#### 3.2.1. Gaussian Noise

If Gaussian noise is regarded as a variable in the image, the probability density function formula of noise is as follows [19]. Gaussian function means that the probability density function of the modified noise obeys a normal distribution:(1)Qm=12παe−m−ν2/2α2,where m is a variable, ν represents the expected value of m, α represents the standard deviation of m, and α2 represents the variance of m.


#### 3.2.2. Salt and Pepper Noise

This noise is caused by the photoelectric conversion process of image sensors and other devices and appears as irregular and dark dots in grayscale images [20]. If salt and pepper noise is used as a variable, the probability density function formula for noise is as follows:(2)Qm=QaQb0m=am=bothers,where 0≤Qa≤1 and 0≤Qb≤1. Usually, the pulse value of salt and pepper noise is divided into positive and negative numbers, and the pulse intensity is much larger than that of the image signal, so an image is always numerically converted to the maximum value, that is, pure black or pure white. For noise processing, denoising is required. There are many denoising methods. This study mainly introduces three denoising methods: mean filter, median filter, and Wiener filter [21]. It is as follows.


#### 3.2.3. Mean Filtering

It is because the original pixel in the image and the surrounding pixels are related, but the noise does not have this correlation [22]. Therefore, this property can be used to replace the gray value of the target pixel with the gray value of the pixel in the field, thereby achieving the purpose of reducing sharp noise [23]. As shown in Figure 5, it is a graph of the mean filter model.Figure 5
Mean filter model diagram.The formula is as follows:(3)fm,n=1X∑x,y∈Rgm,n,where gm,n represents the gray value of the original image pixel, fm,n represents the gray value of the processed image pixel, and x∗y represents the field window size.


#### 3.2.4. Median Filtering

It sorts all the pixels in the field according to the gray value and takes the gray median value to replace the gray value of the target pixel [24]. The characteristics of this method are similar to those of the mean filter; that is, the substitute index is replaced by the median value. This method is simple and convenient to calculate, but the phenomenon of image blurring will also occur. The specific formula is as follows:(4)fm,n=medgm1,n1,gmX,nX,where gm,n represents the gray value of the original pixel, fm,n represents the gray value of the processed image pixel, and X represents the number of pixels in the field.


#### 3.2.5. Wiener Filtering

Wiener filtering is an optimal filtering method using the minimum mean square error criterion under stationary conditions. Its central idea is to find an optimal linear filter that minimizes the value of the mean square error [25]. As shown in Figure 6, it is a diagram of the Wiener filter model.Figure 6
Wiener filter model diagram.Its formula is as follows:(5)ν=1X×Y∑m,n∈Rgm,n,α2=1X×Y∑m,n∈Rgm,n−ν2,fm,n=ν+α2−z2α2gm,n−ν,where g (m, n) represents the original image pixel gray value, f (m, n) represents the processed image pixel gray value, v represents the average gray value of the pixel in the field, α2 represents the grayscale variance of pixels in the field, and α2 represents the overall grayscale variance of the image. According to the formula of Wiener filtering, it can be seen that this method can change with the local variance of the image. When the local variance increases, a weaker smoothing process will be performed. Stronger smoothing is performed when the local variance is reduced [26]. For crack images, the smaller the gray variance of the background, the larger the gray variance of the edge region of the crack, so Wiener filtering can fully preserve edge information under a smooth background.Image threshold segmentation research: a binary image refers to an image with only two gray levels of 0 and 1, that is, a black and white image. The process of converting a multigray level image into a binary image is called image segmentation. Image segmentation has two methods: edge detection and region similarity.In segmentation based on regional similarity, threshold segmentation has been widely used in practice due to its simple operation and strong practicability. Threshold segmentation mainly selects a threshold and uses the threshold to segment the image. The formula is as follows:(6)fm,n=0,gm,n<T1,gm,n≥T,where gm,n represents the pixel gray value of the original image, fm,n represents the processed image gray value, and T represents the threshold. It can be seen from the formula that when the gray value of the pixel in the image is lower than the set threshold, the gray value will be redefined as 0. That becomes the black point. When the gray value of the pixel point of the image is higher than the set threshold, the gray value is redefined as 1, that is, the white point. As shown in Figure 7, images with different thresholds are segmented.Figure 7
Segmentation of images with different thresholds.A threshold is selected to segment all pixels of the entire image. Under the dynamic threshold, different thresholds should be selected at different positions for segmentation. The following is an introduction to several commonly used image algorithms.(1) Maximum Entropy Method. Entropy indicates that an information source is uncertain and reflects the amount of information in the image. When the amount of information in the image is larger, the entropy of the image will also increase.Suppose that an image size isX×Y, the gray level is 0∼K, the number of pixels with gray level i in the image is Yi, and the ratio of each gray level in the image is(7)Qi=YiX×Y,i=0,1,2,K,∑i=0KQi=1,where Qi represents the probability that each gray level accounts for the entire image.Set the initial thresholdT, and divide the image into two parts a,b, where a represents the image of the target area and b is the image of the background area; then,(8)HaT=−∑i=1TQiQalogQiQa,HbT=−∑i=1TQiQblogQiQb=−∑i=1+TTQi1−QalogQi1−Qa,Qa=∑i=0TQi,Qb=∑i=1+TTHT=HaT+HbT,HT′=maxHT,where HaT represents the entropy of area a, HbT represents the entropy of area b, HT is the sum of the entropy of area a and area b, and T′ represents the optimal threshold.(2) Maximum Interclass Method. The maximum interclass method refers to considering the image as two parts, namely, the background and the target, using variance to represent the difference between the background and the target, and finding an optimal threshold to maximize the interclass variance in this part.Assuming that the size of the image isX×Y, the gray level is 0∼K, and the number of pixels whose gray level is i in the image is Ni; then, the probability that each gray level occupies the entire image is(9)Qi=NiX×Y,i=0,1,2,K,∑i=0KQi=1.Set the initial threshold and divide the image into two parts,a and b; then,(10)Qa=∑i=0TQi,Qb=∑i=T+1TQi,ν0=∑i=0TiQi,νa=∑i=0TiQiQa,νb=∑i=T+1TiQiQb,where Qa represents the probability that the pixels in the area a occupy the entire image, Qb represents the probability that the pixels in the area b occupy the entire image, ν0 is the grayscale mean of the entire image, ν0 is the grayscale mean of the area a, and ν0 is the grayscale mean of the areab.The formula for the between-class varianceα2 is(11)α2=Qaνa−ν02+Qbνb−ν02.The maximum interclass method is to select the best threshold,T′, to maximize the interclass variance, and its formula is(12)α2T′==maxα2T.The maximum between-class method is usually used in the case where the target and the background of the image are quite different.In the case where the variance value of the target and the background is not much different, the maximum between-class method makes it difficult to obtain a better segmentation method.


## 3.1. Crack Identification and Repair of Mural Images

Murals are the precious historical and cultural heritage of human beings and an important means of reflecting ancient civilizations and have high artistic value. Due to their existence, the ancient murals have various problems with cracks and damage, and it is necessary to use the current technology to repair the murals [11]. As shown in Figure 1, it is an image of an ancient mural.Figure 1
Ancient mural image.The problems with murals are mainly cracks, falling off, fading, and herpes [12, 13]. With the passage of time, the damage from the strokes will be more serious, so the protection of the murals is imminent. As shown in Figure 2, it is a common problem in murals.Figure 2
Frequently asked questions about murals.According to relevant information, most of the ancient murals appeared in ancient temples, as shown in Figure3.Figure 3
Ancient murals in the temple.It can be seen from Figure3 that the above images are murals taken at Jueshan Temple, Kaihua Temple, Sansheng Temple, and Yanshan Temple, respectively.


## 3.2. Cloud Edge Computing Methods and Digital Technologies

The digitization of cultural relics integrates modern information technology for the protection of cultural relics, and as a new development trend, the digitization of cultural relics is also used by cultural relics protection units around the world [14]. Based on the cloud edge computing method and digital technology, this study uses image preprocessing technology to study the problem of fresco cracks [15]. As shown in Figure 4, it is an introduction diagram for the image preprocessing system.Figure 4
Introduction to the image preprocessing system.Image processing is to process the information collected by the image acquisition system. Due to the influence of various factors, the collected information may have certain problems [16, 17]. Moreover, because of the huge number of crack images in murals, in order to extract information quickly, it is necessary to denoise the images first.Noise introduction: in the process of generation, transmission, and storage, images are prone to noise [18]. This study selects the most common Gaussian noise and salt and pepper noise for analysis.


### 3.2.1. Gaussian Noise

If Gaussian noise is regarded as a variable in the image, the probability density function formula of noise is as follows [19]. Gaussian function means that the probability density function of the modified noise obeys a normal distribution:(1)Qm=12παe−m−ν2/2α2,where m is a variable, ν represents the expected value of m, α represents the standard deviation of m, and α2 represents the variance of m.


### 3.2.2. Salt and Pepper Noise

This noise is caused by the photoelectric conversion process of image sensors and other devices and appears as irregular and dark dots in grayscale images [20]. If salt and pepper noise is used as a variable, the probability density function formula for noise is as follows:(2)Qm=QaQb0m=am=bothers,where 0≤Qa≤1 and 0≤Qb≤1. Usually, the pulse value of salt and pepper noise is divided into positive and negative numbers, and the pulse intensity is much larger than that of the image signal, so an image is always numerically converted to the maximum value, that is, pure black or pure white. For noise processing, denoising is required. There are many denoising methods. This study mainly introduces three denoising methods: mean filter, median filter, and Wiener filter [21]. It is as follows.


### 3.2.3. Mean Filtering

It is because the original pixel in the image and the surrounding pixels are related, but the noise does not have this correlation [22]. Therefore, this property can be used to replace the gray value of the target pixel with the gray value of the pixel in the field, thereby achieving the purpose of reducing sharp noise [23]. As shown in Figure 5, it is a graph of the mean filter model.Figure 5
Mean filter model diagram.The formula is as follows:(3)fm,n=1X∑x,y∈Rgm,n,where gm,n represents the gray value of the original image pixel, fm,n represents the gray value of the processed image pixel, and x∗y represents the field window size.


### 3.2.4. Median Filtering

It sorts all the pixels in the field according to the gray value and takes the gray median value to replace the gray value of the target pixel [24]. The characteristics of this method are similar to those of the mean filter; that is, the substitute index is replaced by the median value. This method is simple and convenient to calculate, but the phenomenon of image blurring will also occur. The specific formula is as follows:(4)fm,n=medgm1,n1,gmX,nX,where gm,n represents the gray value of the original pixel, fm,n represents the gray value of the processed image pixel, and X represents the number of pixels in the field.


### 3.2.5. Wiener Filtering

Wiener filtering is an optimal filtering method using the minimum mean square error criterion under stationary conditions. Its central idea is to find an optimal linear filter that minimizes the value of the mean square error [25]. As shown in Figure 6, it is a diagram of the Wiener filter model.Figure 6
Wiener filter model diagram.Its formula is as follows:(5)ν=1X×Y∑m,n∈Rgm,n,α2=1X×Y∑m,n∈Rgm,n−ν2,fm,n=ν+α2−z2α2gm,n−ν,where g (m, n) represents the original image pixel gray value, f (m, n) represents the processed image pixel gray value, v represents the average gray value of the pixel in the field, α2 represents the grayscale variance of pixels in the field, and α2 represents the overall grayscale variance of the image. According to the formula of Wiener filtering, it can be seen that this method can change with the local variance of the image. When the local variance increases, a weaker smoothing process will be performed. Stronger smoothing is performed when the local variance is reduced [26]. For crack images, the smaller the gray variance of the background, the larger the gray variance of the edge region of the crack, so Wiener filtering can fully preserve edge information under a smooth background.Image threshold segmentation research: a binary image refers to an image with only two gray levels of 0 and 1, that is, a black and white image. The process of converting a multigray level image into a binary image is called image segmentation. Image segmentation has two methods: edge detection and region similarity.In segmentation based on regional similarity, threshold segmentation has been widely used in practice due to its simple operation and strong practicability. Threshold segmentation mainly selects a threshold and uses the threshold to segment the image. The formula is as follows:(6)fm,n=0,gm,n<T1,gm,n≥T,where gm,n represents the pixel gray value of the original image, fm,n represents the processed image gray value, and T represents the threshold. It can be seen from the formula that when the gray value of the pixel in the image is lower than the set threshold, the gray value will be redefined as 0. That becomes the black point. When the gray value of the pixel point of the image is higher than the set threshold, the gray value is redefined as 1, that is, the white point. As shown in Figure 7, images with different thresholds are segmented.Figure 7
Segmentation of images with different thresholds.A threshold is selected to segment all pixels of the entire image. Under the dynamic threshold, different thresholds should be selected at different positions for segmentation. The following is an introduction to several commonly used image algorithms.(1) Maximum Entropy Method. Entropy indicates that an information source is uncertain and reflects the amount of information in the image. When the amount of information in the image is larger, the entropy of the image will also increase.Suppose that an image size isX×Y, the gray level is 0∼K, the number of pixels with gray level i in the image is Yi, and the ratio of each gray level in the image is(7)Qi=YiX×Y,i=0,1,2,K,∑i=0KQi=1,where Qi represents the probability that each gray level accounts for the entire image.Set the initial thresholdT, and divide the image into two parts a,b, where a represents the image of the target area and b is the image of the background area; then,(8)HaT=−∑i=1TQiQalogQiQa,HbT=−∑i=1TQiQblogQiQb=−∑i=1+TTQi1−QalogQi1−Qa,Qa=∑i=0TQi,Qb=∑i=1+TTHT=HaT+HbT,HT′=maxHT,where HaT represents the entropy of area a, HbT represents the entropy of area b, HT is the sum of the entropy of area a and area b, and T′ represents the optimal threshold.(2) Maximum Interclass Method. The maximum interclass method refers to considering the image as two parts, namely, the background and the target, using variance to represent the difference between the background and the target, and finding an optimal threshold to maximize the interclass variance in this part.Assuming that the size of the image isX×Y, the gray level is 0∼K, and the number of pixels whose gray level is i in the image is Ni; then, the probability that each gray level occupies the entire image is(9)Qi=NiX×Y,i=0,1,2,K,∑i=0KQi=1.Set the initial threshold and divide the image into two parts,a and b; then,(10)Qa=∑i=0TQi,Qb=∑i=T+1TQi,ν0=∑i=0TiQi,νa=∑i=0TiQiQa,νb=∑i=T+1TiQiQb,where Qa represents the probability that the pixels in the area a occupy the entire image, Qb represents the probability that the pixels in the area b occupy the entire image, ν0 is the grayscale mean of the entire image, ν0 is the grayscale mean of the area a, and ν0 is the grayscale mean of the areab.The formula for the between-class varianceα2 is(11)α2=Qaνa−ν02+Qbνb−ν02.The maximum interclass method is to select the best threshold,T′, to maximize the interclass variance, and its formula is(12)α2T′==maxα2T.The maximum between-class method is usually used in the case where the target and the background of the image are quite different.In the case where the variance value of the target and the background is not much different, the maximum between-class method makes it difficult to obtain a better segmentation method.


## 3.2.1. Gaussian Noise

If Gaussian noise is regarded as a variable in the image, the probability density function formula of noise is as follows [19]. Gaussian function means that the probability density function of the modified noise obeys a normal distribution:(1)Qm=12παe−m−ν2/2α2,where m is a variable, ν represents the expected value of m, α represents the standard deviation of m, and α2 represents the variance of m.


## 3.2.2. Salt and Pepper Noise

This noise is caused by the photoelectric conversion process of image sensors and other devices and appears as irregular and dark dots in grayscale images [20]. If salt and pepper noise is used as a variable, the probability density function formula for noise is as follows:(2)Qm=QaQb0m=am=bothers,where 0≤Qa≤1 and 0≤Qb≤1. Usually, the pulse value of salt and pepper noise is divided into positive and negative numbers, and the pulse intensity is much larger than that of the image signal, so an image is always numerically converted to the maximum value, that is, pure black or pure white. For noise processing, denoising is required. There are many denoising methods. This study mainly introduces three denoising methods: mean filter, median filter, and Wiener filter [21]. It is as follows.


## 3.2.3. Mean Filtering

It is because the original pixel in the image and the surrounding pixels are related, but the noise does not have this correlation [22]. Therefore, this property can be used to replace the gray value of the target pixel with the gray value of the pixel in the field, thereby achieving the purpose of reducing sharp noise [23]. As shown in Figure 5, it is a graph of the mean filter model.Figure 5
Mean filter model diagram.The formula is as follows:(3)fm,n=1X∑x,y∈Rgm,n,where gm,n represents the gray value of the original image pixel, fm,n represents the gray value of the processed image pixel, and x∗y represents the field window size.


## 3.2.4. Median Filtering

It sorts all the pixels in the field according to the gray value and takes the gray median value to replace the gray value of the target pixel [24]. The characteristics of this method are similar to those of the mean filter; that is, the substitute index is replaced by the median value. This method is simple and convenient to calculate, but the phenomenon of image blurring will also occur. The specific formula is as follows:(4)fm,n=medgm1,n1,gmX,nX,where gm,n represents the gray value of the original pixel, fm,n represents the gray value of the processed image pixel, and X represents the number of pixels in the field.


## 3.2.5. Wiener Filtering

Wiener filtering is an optimal filtering method using the minimum mean square error criterion under stationary conditions. Its central idea is to find an optimal linear filter that minimizes the value of the mean square error [25]. As shown in Figure 6, it is a diagram of the Wiener filter model.Figure 6
Wiener filter model diagram.Its formula is as follows:(5)ν=1X×Y∑m,n∈Rgm,n,α2=1X×Y∑m,n∈Rgm,n−ν2,fm,n=ν+α2−z2α2gm,n−ν,where g (m, n) represents the original image pixel gray value, f (m, n) represents the processed image pixel gray value, v represents the average gray value of the pixel in the field, α2 represents the grayscale variance of pixels in the field, and α2 represents the overall grayscale variance of the image. According to the formula of Wiener filtering, it can be seen that this method can change with the local variance of the image. When the local variance increases, a weaker smoothing process will be performed. Stronger smoothing is performed when the local variance is reduced [26]. For crack images, the smaller the gray variance of the background, the larger the gray variance of the edge region of the crack, so Wiener filtering can fully preserve edge information under a smooth background.Image threshold segmentation research: a binary image refers to an image with only two gray levels of 0 and 1, that is, a black and white image. The process of converting a multigray level image into a binary image is called image segmentation. Image segmentation has two methods: edge detection and region similarity.In segmentation based on regional similarity, threshold segmentation has been widely used in practice due to its simple operation and strong practicability. Threshold segmentation mainly selects a threshold and uses the threshold to segment the image. The formula is as follows:(6)fm,n=0,gm,n<T1,gm,n≥T,where gm,n represents the pixel gray value of the original image, fm,n represents the processed image gray value, and T represents the threshold. It can be seen from the formula that when the gray value of the pixel in the image is lower than the set threshold, the gray value will be redefined as 0. That becomes the black point. When the gray value of the pixel point of the image is higher than the set threshold, the gray value is redefined as 1, that is, the white point. As shown in Figure 7, images with different thresholds are segmented.Figure 7
Segmentation of images with different thresholds.A threshold is selected to segment all pixels of the entire image. Under the dynamic threshold, different thresholds should be selected at different positions for segmentation. The following is an introduction to several commonly used image algorithms.(1) Maximum Entropy Method. Entropy indicates that an information source is uncertain and reflects the amount of information in the image. When the amount of information in the image is larger, the entropy of the image will also increase.Suppose that an image size isX×Y, the gray level is 0∼K, the number of pixels with gray level i in the image is Yi, and the ratio of each gray level in the image is(7)Qi=YiX×Y,i=0,1,2,K,∑i=0KQi=1,where Qi represents the probability that each gray level accounts for the entire image.Set the initial thresholdT, and divide the image into two parts a,b, where a represents the image of the target area and b is the image of the background area; then,(8)HaT=−∑i=1TQiQalogQiQa,HbT=−∑i=1TQiQblogQiQb=−∑i=1+TTQi1−QalogQi1−Qa,Qa=∑i=0TQi,Qb=∑i=1+TTHT=HaT+HbT,HT′=maxHT,where HaT represents the entropy of area a, HbT represents the entropy of area b, HT is the sum of the entropy of area a and area b, and T′ represents the optimal threshold.(2) Maximum Interclass Method. The maximum interclass method refers to considering the image as two parts, namely, the background and the target, using variance to represent the difference between the background and the target, and finding an optimal threshold to maximize the interclass variance in this part.Assuming that the size of the image isX×Y, the gray level is 0∼K, and the number of pixels whose gray level is i in the image is Ni; then, the probability that each gray level occupies the entire image is(9)Qi=NiX×Y,i=0,1,2,K,∑i=0KQi=1.Set the initial threshold and divide the image into two parts,a and b; then,(10)Qa=∑i=0TQi,Qb=∑i=T+1TQi,ν0=∑i=0TiQi,νa=∑i=0TiQiQa,νb=∑i=T+1TiQiQb,where Qa represents the probability that the pixels in the area a occupy the entire image, Qb represents the probability that the pixels in the area b occupy the entire image, ν0 is the grayscale mean of the entire image, ν0 is the grayscale mean of the area a, and ν0 is the grayscale mean of the areab.The formula for the between-class varianceα2 is(11)α2=Qaνa−ν02+Qbνb−ν02.The maximum interclass method is to select the best threshold,T′, to maximize the interclass variance, and its formula is(12)α2T′==maxα2T.The maximum between-class method is usually used in the case where the target and the background of the image are quite different.In the case where the variance value of the target and the background is not much different, the maximum between-class method makes it difficult to obtain a better segmentation method.


## 4. Experimental on Crack Identification and Repair in Mural Images

### 4.1. Experimental Results of Crack Identification and Repair in Mural Images

For the automatic identification and repair system of fresco image cracks, this study mainly conducts a statistical analysis of the problems of ancient frescoes. Twenty murals in three regions of A, B, and C were selected as the research objects. Due to the differences in natural conditions such as climate, the murals in the three regions were damaged differently. Details are as follows.


#### 4.1.1. Problems with Murals

Due to the influence of natural factors, the frescoes in the three regions have different degrees of problems, the most important of which are cracks, fading, and damage. The specific situation is shown in Figure8.Figure 8
Problems with murals in three regions.As can be seen from Figure8, among the 20 murals in area A, 19 murals have cracks, 10 murals have faded, and 4 murals have broken and missing pieces. In area B, 3 frescoes have cracks, 7 frescoes have fading problems, and 13 frescoes are found to be missing pieces. In Area C, 15 murals have cracks, 13 have faded, and 18 have missing blocks. From these data, it can be seen that some of the murals in the three regions may have more problems, such as cracks, missing pieces, and fading problems.It can be found from the figure that the murals in areas A and B have fewer problems than the murals in area C. However, due to the difference in climatic factors between A and B, the problems of murals in the two places take on opposite forms. Among them, area A has a high temperature and a dry climate all year round, so the air humidity is low, and the walls of the murals are dry and easy to crack, so the murals have more cracks and fading. Area B is rainy all year round, and the climate is humid. The walls of the murals are wet, so the walls are easy to peel off, and there are cases of missing pieces and damage. However, due to the extreme climatic conditions in the C area, the dry season and the rainy season are distinct, the dry season is hot and dry, and the rainy season is also hot and rainy, which leads to more problems with the murals in the C area. The problems of cracks, missing blocks, and fading are more serious than those in the other two areas. This shows that climatic factors will affect the state of the murals.


#### 4.1.2. The Time When the Murals Existed

Due to the existence of ancient murals for too long, it will also cause problems such as damage to the murals. The specific situation is shown in Figure9.Figure 9
How long did the frescoes exist?.It can be seen from Figure9 that most of the murals in area A have a history of over 1000 years, and some murals are less than 1,000 years old. Among them, there is one under 500 years old, accounting for only 5%. There are 2 pictures from 500 to 1000, accounting for 10%. There are 17 murals over 1000 years old, accounting for as high as 85%; it also reflects from the side that region A has a long history and human activities occurred earlier. Most of the frescoes in area B are more than a thousand years old. Among them, there are 2 murals under 500 years old, accounting for 10%. There are 3 murals from 500 to 1000, accounting for 15%. There are 15 murals over a thousand years old, accounting for 75%. This also shows that the historical civilization of the B region is relatively long. Among the murals in area B, there is 1 mural with horizontal cracks, 3 with vertical cracks, 2 with shedding, and 2 with massive cracks. Compared with the mural history of the other two regions, the history of the murals in the C area is relatively short. Among them, there are no murals under 500 years old, 18 murals are 500 to 1000 years old, accounting for 60%, and 2 murals are more than 1000 years old, accounting for 20%. This shows that the frescoes in the C area mainly appeared 500 years ago, when there were frequent human activities in the area. It can be seen that the appearance time of the murals can also understand the time when the local historical civilization appeared. Due to the existence of murals for too long, it will also lead to various problems with murals.


#### 4.1.3. The Form of Cracks in the Frescoes

This paper mainly studies the identification and repair system of fresco cracks. This study conducts experiments on different cracks since the appearance of cracks is usually accompanied by problems such as wall peeling and water seepage. The specific crack form is shown in Figure10.Figure 10
The fresco appears in the form of cracks.It can be seen from Figure10 that there are cracks in the murals in the three areas. Among them, there are many cracks in the murals of A and C. There are 19 murals with horizontal cracks in the murals in Area A. There are 12 frescoes with longitudinal cracks. There are 9 cases of falling off. There are 15 frescoes with blocky cracks. Among the murals in Area C, there are 13 murals with horizontal cracks, 14 with longitudinal cracks, 11 with falling off, and 15 with massive cracks. Cracks in different directions and shapes are due to local geological activities, human activities, climate, and other factors that cause different degrees of cracks in the murals.In order to facilitate comparison, a representative mural was selected from each of the three regions for comparative analysis, and the restoration time and various restoration indicators of the crack image of the mural are listed in a table, as shown in Table1.Table 1
The repair metrics of the algorithm in this study.
ABCRepair time (s)131.39198.6298.29Fix pixel (per)3568662912656Total pixels (per)974159731461438Sample replication times (times)125211221Number of Poisson treatments (times)224738It can be seen from Table1 that the number of repaired pixels in the repaired image is directly related to the repair time. The more pixels to be repaired, the longer the repair time. The number of repaired pixels can reflect that the search range of the sample block affects the repairing time, and the ratio of repaired pixels to total pixels can also reflect the difficulty of image repairing. The frequency of replication of the samples can reflect the complexity of the cracks in the frescoes to be repaired. The ratio of Poisson processing times to sample replication times is an important comparison parameter. It can be seen from Table 1 that the restoration time of the three murals is calculated in seconds, which is an acceptable restoration time length. The proportion of repaired pixels to total pixels is 3.6%, 7.7%, and 21%, respectively. Different proportions indicate that the difficulty of repairing will also be different. The repairing is achieved for three sets of images to be repaired with different proportions, which shows the effectiveness of the repairing method in this study. In the three groups of experiments, the number of Poisson processing accounted for about 25% of the total number of sample replications, which indicates that the Poisson processed method repaired only the initial outermost sample block as expected. In the field of image restoration, there is still no clear definition of the restoration effect. In the past restoration process, the peak signal-to-noise ratio is often used. Because the object removal experiment does not have known images as a comparison benchmark, which makes the metric difficult to calculate accurately, this kind of experiment cannot be applied to the inpainting experiment. This experiment uses a subjective evaluation strategy; that is, the experimenter evaluates the repaired images without knowing the repaired area.It can be seen from Table2 that this experiment has achieved relatively good results in terms of restoration time and restoration quality. The traditional loose poise processing method takes the shortest restoration time, but for a specific image, it is difficult to guarantee the restoration quality. As can be seen from Table 2, the frescoes in area A were repaired by the conventional pine poise repair method, which took 113.01 seconds and the subjective evaluation was 69 points, while the restoration using the Criminisi repair method took 139.45 seconds and the subjective evaluation was 83 points. Using the repair method in this study to repair, it only takes 127.38 seconds and its subjective evaluation score is the highest, which is 87 points. Although the repair method in this study takes a long time, it can guarantee the quality of its repair. The mural image in area B was repaired with the conventional pine poise repair method, which took 186.66 seconds and the subjective evaluation score was 65 points, while the restoration using the Criminisi repair method took 221.06 seconds and the subjective evaluation score was 69 points. The repair method in this study was used. To repair, it takes 193.12 seconds to use, and the subjective evaluation score is as high as 83 points. To sum up, the repair method described in this study has obvious advantages in repair effect compared with other repair methods, and its evaluation score and repair quality are both high.Table 2
Comparison of repair evaluation and repair time.
Regular Poisson processing fixCriminisi repairHow to fix this articleASubjective evaluation (score/total score)69/10083/10087/100Repair time (s)113.01139.45127.38BSubjective evaluation (number of approvals/samples)65/10069/10083/100Repair time (s)186.66221.06193.12CSubjective evaluation (score/total score)54/10077/10089/100Repair time (s)91.24111.4398.21It can be seen from Table3 that image inpainting can be used for image compression, but since the inpainting principle of image inpainting technology is to use the correlation of the image itself, the prerequisite for applying image inpainting technology to image compression is that the image content has a certain correlation. If the correlation of the image is large, a larger compression ratio can be obtained, but if the image itself is an image with less correlation and more complex cracks, the compression ratio will be reduced accordingly. For example, the fresco images in area C have more complex cracks, and the compression ratio will be lower than the compression ratio of the murals in areas A and B. Among the compression ratios of the mural images in the three regions, the highest compression ratio is the mural image in Region A, whose ratio is less than 5 : 1. The compression ratios obtained in the mural images in the three regions are the maximum values obtained under the premise that the restoration algorithm studied in this paper can be restored, and the existing restoration algorithms have made it difficult to complete the restoration task. Theoretically speaking, with the development of image inpainting technology, a higher compression ratio can be obtained under the condition that the new inpainting technology has more powerful inpainting capabilities.Table 3
Comparison of compression repair schemes.
Original size (KB)Size after compression (KB)Compression ratio (%)AIEI model PSNR (dB)CDD model PSNR (dB)The method of this paper PSNR (dB)A671621.0926.325.427.3B6715.821.8831.328.735.2C8727.333.7331.627.932.3


### 4.2. Improve the Experimental Scheme of Crack Identification and Repair in Mural Images

According to the above analysis, the cloud edge computing method and digital technology are perfectly combined with the research on the fresco crack identification and repair system. The idea of identifying, analyzing, and repairing cracks in frescoes with digital technology has greatly facilitated scholars’ research on this project. However, because the learning on digital technology and cloud edge algorithms is not deep and complete enough, the experiments in this study still have some defects, which need to be improved. The details are as follows. First, in the three regions of A, B, and C as the experimental objects, the selected sample size is not enough, and the number of samples needs to be increased to ensure the accuracy of the experimental results. Second, in the experiment, only the Criminisi repair method and the loose Pois repair method were selected as the comparison methods. It is recommended to add several types of repair algorithms, and the results obtained will be different, and the reliability will also increase. Criminisi repair method is difficult to ensure the repair quality of the edge with a strong structure, and the phenomenon of structural disconnection may occur. The loose Pois repair method also has certain defects. Since the size of the sample block is fixed, the repair process is not flexible enough, and error repair may occur.


## 4.1. Experimental Results of Crack Identification and Repair in Mural Images

For the automatic identification and repair system of fresco image cracks, this study mainly conducts a statistical analysis of the problems of ancient frescoes. Twenty murals in three regions of A, B, and C were selected as the research objects. Due to the differences in natural conditions such as climate, the murals in the three regions were damaged differently. Details are as follows.


### 4.1.1. Problems with Murals

Due to the influence of natural factors, the frescoes in the three regions have different degrees of problems, the most important of which are cracks, fading, and damage. The specific situation is shown in Figure8.Figure 8
Problems with murals in three regions.As can be seen from Figure8, among the 20 murals in area A, 19 murals have cracks, 10 murals have faded, and 4 murals have broken and missing pieces. In area B, 3 frescoes have cracks, 7 frescoes have fading problems, and 13 frescoes are found to be missing pieces. In Area C, 15 murals have cracks, 13 have faded, and 18 have missing blocks. From these data, it can be seen that some of the murals in the three regions may have more problems, such as cracks, missing pieces, and fading problems.It can be found from the figure that the murals in areas A and B have fewer problems than the murals in area C. However, due to the difference in climatic factors between A and B, the problems of murals in the two places take on opposite forms. Among them, area A has a high temperature and a dry climate all year round, so the air humidity is low, and the walls of the murals are dry and easy to crack, so the murals have more cracks and fading. Area B is rainy all year round, and the climate is humid. The walls of the murals are wet, so the walls are easy to peel off, and there are cases of missing pieces and damage. However, due to the extreme climatic conditions in the C area, the dry season and the rainy season are distinct, the dry season is hot and dry, and the rainy season is also hot and rainy, which leads to more problems with the murals in the C area. The problems of cracks, missing blocks, and fading are more serious than those in the other two areas. This shows that climatic factors will affect the state of the murals.


### 4.1.2. The Time When the Murals Existed

Due to the existence of ancient murals for too long, it will also cause problems such as damage to the murals. The specific situation is shown in Figure9.Figure 9
How long did the frescoes exist?.It can be seen from Figure9 that most of the murals in area A have a history of over 1000 years, and some murals are less than 1,000 years old. Among them, there is one under 500 years old, accounting for only 5%. There are 2 pictures from 500 to 1000, accounting for 10%. There are 17 murals over 1000 years old, accounting for as high as 85%; it also reflects from the side that region A has a long history and human activities occurred earlier. Most of the frescoes in area B are more than a thousand years old. Among them, there are 2 murals under 500 years old, accounting for 10%. There are 3 murals from 500 to 1000, accounting for 15%. There are 15 murals over a thousand years old, accounting for 75%. This also shows that the historical civilization of the B region is relatively long. Among the murals in area B, there is 1 mural with horizontal cracks, 3 with vertical cracks, 2 with shedding, and 2 with massive cracks. Compared with the mural history of the other two regions, the history of the murals in the C area is relatively short. Among them, there are no murals under 500 years old, 18 murals are 500 to 1000 years old, accounting for 60%, and 2 murals are more than 1000 years old, accounting for 20%. This shows that the frescoes in the C area mainly appeared 500 years ago, when there were frequent human activities in the area. It can be seen that the appearance time of the murals can also understand the time when the local historical civilization appeared. Due to the existence of murals for too long, it will also lead to various problems with murals.


### 4.1.3. The Form of Cracks in the Frescoes

This paper mainly studies the identification and repair system of fresco cracks. This study conducts experiments on different cracks since the appearance of cracks is usually accompanied by problems such as wall peeling and water seepage. The specific crack form is shown in Figure10.Figure 10
The fresco appears in the form of cracks.It can be seen from Figure10 that there are cracks in the murals in the three areas. Among them, there are many cracks in the murals of A and C. There are 19 murals with horizontal cracks in the murals in Area A. There are 12 frescoes with longitudinal cracks. There are 9 cases of falling off. There are 15 frescoes with blocky cracks. Among the murals in Area C, there are 13 murals with horizontal cracks, 14 with longitudinal cracks, 11 with falling off, and 15 with massive cracks. Cracks in different directions and shapes are due to local geological activities, human activities, climate, and other factors that cause different degrees of cracks in the murals.In order to facilitate comparison, a representative mural was selected from each of the three regions for comparative analysis, and the restoration time and various restoration indicators of the crack image of the mural are listed in a table, as shown in Table1.Table 1
The repair metrics of the algorithm in this study.
ABCRepair time (s)131.39198.6298.29Fix pixel (per)3568662912656Total pixels (per)974159731461438Sample replication times (times)125211221Number of Poisson treatments (times)224738It can be seen from Table1 that the number of repaired pixels in the repaired image is directly related to the repair time. The more pixels to be repaired, the longer the repair time. The number of repaired pixels can reflect that the search range of the sample block affects the repairing time, and the ratio of repaired pixels to total pixels can also reflect the difficulty of image repairing. The frequency of replication of the samples can reflect the complexity of the cracks in the frescoes to be repaired. The ratio of Poisson processing times to sample replication times is an important comparison parameter. It can be seen from Table 1 that the restoration time of the three murals is calculated in seconds, which is an acceptable restoration time length. The proportion of repaired pixels to total pixels is 3.6%, 7.7%, and 21%, respectively. Different proportions indicate that the difficulty of repairing will also be different. The repairing is achieved for three sets of images to be repaired with different proportions, which shows the effectiveness of the repairing method in this study. In the three groups of experiments, the number of Poisson processing accounted for about 25% of the total number of sample replications, which indicates that the Poisson processed method repaired only the initial outermost sample block as expected. In the field of image restoration, there is still no clear definition of the restoration effect. In the past restoration process, the peak signal-to-noise ratio is often used. Because the object removal experiment does not have known images as a comparison benchmark, which makes the metric difficult to calculate accurately, this kind of experiment cannot be applied to the inpainting experiment. This experiment uses a subjective evaluation strategy; that is, the experimenter evaluates the repaired images without knowing the repaired area.It can be seen from Table2 that this experiment has achieved relatively good results in terms of restoration time and restoration quality. The traditional loose poise processing method takes the shortest restoration time, but for a specific image, it is difficult to guarantee the restoration quality. As can be seen from Table 2, the frescoes in area A were repaired by the conventional pine poise repair method, which took 113.01 seconds and the subjective evaluation was 69 points, while the restoration using the Criminisi repair method took 139.45 seconds and the subjective evaluation was 83 points. Using the repair method in this study to repair, it only takes 127.38 seconds and its subjective evaluation score is the highest, which is 87 points. Although the repair method in this study takes a long time, it can guarantee the quality of its repair. The mural image in area B was repaired with the conventional pine poise repair method, which took 186.66 seconds and the subjective evaluation score was 65 points, while the restoration using the Criminisi repair method took 221.06 seconds and the subjective evaluation score was 69 points. The repair method in this study was used. To repair, it takes 193.12 seconds to use, and the subjective evaluation score is as high as 83 points. To sum up, the repair method described in this study has obvious advantages in repair effect compared with other repair methods, and its evaluation score and repair quality are both high.Table 2
Comparison of repair evaluation and repair time.
Regular Poisson processing fixCriminisi repairHow to fix this articleASubjective evaluation (score/total score)69/10083/10087/100Repair time (s)113.01139.45127.38BSubjective evaluation (number of approvals/samples)65/10069/10083/100Repair time (s)186.66221.06193.12CSubjective evaluation (score/total score)54/10077/10089/100Repair time (s)91.24111.4398.21It can be seen from Table3 that image inpainting can be used for image compression, but since the inpainting principle of image inpainting technology is to use the correlation of the image itself, the prerequisite for applying image inpainting technology to image compression is that the image content has a certain correlation. If the correlation of the image is large, a larger compression ratio can be obtained, but if the image itself is an image with less correlation and more complex cracks, the compression ratio will be reduced accordingly. For example, the fresco images in area C have more complex cracks, and the compression ratio will be lower than the compression ratio of the murals in areas A and B. Among the compression ratios of the mural images in the three regions, the highest compression ratio is the mural image in Region A, whose ratio is less than 5 : 1. The compression ratios obtained in the mural images in the three regions are the maximum values obtained under the premise that the restoration algorithm studied in this paper can be restored, and the existing restoration algorithms have made it difficult to complete the restoration task. Theoretically speaking, with the development of image inpainting technology, a higher compression ratio can be obtained under the condition that the new inpainting technology has more powerful inpainting capabilities.Table 3
Comparison of compression repair schemes.
Original size (KB)Size after compression (KB)Compression ratio (%)AIEI model PSNR (dB)CDD model PSNR (dB)The method of this paper PSNR (dB)A671621.0926.325.427.3B6715.821.8831.328.735.2C8727.333.7331.627.932.3


## 4.1.1. Problems with Murals

Due to the influence of natural factors, the frescoes in the three regions have different degrees of problems, the most important of which are cracks, fading, and damage. The specific situation is shown in Figure8.Figure 8
Problems with murals in three regions.As can be seen from Figure8, among the 20 murals in area A, 19 murals have cracks, 10 murals have faded, and 4 murals have broken and missing pieces. In area B, 3 frescoes have cracks, 7 frescoes have fading problems, and 13 frescoes are found to be missing pieces. In Area C, 15 murals have cracks, 13 have faded, and 18 have missing blocks. From these data, it can be seen that some of the murals in the three regions may have more problems, such as cracks, missing pieces, and fading problems.It can be found from the figure that the murals in areas A and B have fewer problems than the murals in area C. However, due to the difference in climatic factors between A and B, the problems of murals in the two places take on opposite forms. Among them, area A has a high temperature and a dry climate all year round, so the air humidity is low, and the walls of the murals are dry and easy to crack, so the murals have more cracks and fading. Area B is rainy all year round, and the climate is humid. The walls of the murals are wet, so the walls are easy to peel off, and there are cases of missing pieces and damage. However, due to the extreme climatic conditions in the C area, the dry season and the rainy season are distinct, the dry season is hot and dry, and the rainy season is also hot and rainy, which leads to more problems with the murals in the C area. The problems of cracks, missing blocks, and fading are more serious than those in the other two areas. This shows that climatic factors will affect the state of the murals.


## 4.1.2. The Time When the Murals Existed

Due to the existence of ancient murals for too long, it will also cause problems such as damage to the murals. The specific situation is shown in Figure9.Figure 9
How long did the frescoes exist?.It can be seen from Figure9 that most of the murals in area A have a history of over 1000 years, and some murals are less than 1,000 years old. Among them, there is one under 500 years old, accounting for only 5%. There are 2 pictures from 500 to 1000, accounting for 10%. There are 17 murals over 1000 years old, accounting for as high as 85%; it also reflects from the side that region A has a long history and human activities occurred earlier. Most of the frescoes in area B are more than a thousand years old. Among them, there are 2 murals under 500 years old, accounting for 10%. There are 3 murals from 500 to 1000, accounting for 15%. There are 15 murals over a thousand years old, accounting for 75%. This also shows that the historical civilization of the B region is relatively long. Among the murals in area B, there is 1 mural with horizontal cracks, 3 with vertical cracks, 2 with shedding, and 2 with massive cracks. Compared with the mural history of the other two regions, the history of the murals in the C area is relatively short. Among them, there are no murals under 500 years old, 18 murals are 500 to 1000 years old, accounting for 60%, and 2 murals are more than 1000 years old, accounting for 20%. This shows that the frescoes in the C area mainly appeared 500 years ago, when there were frequent human activities in the area. It can be seen that the appearance time of the murals can also understand the time when the local historical civilization appeared. Due to the existence of murals for too long, it will also lead to various problems with murals.


## 4.1.3. The Form of Cracks in the Frescoes

This paper mainly studies the identification and repair system of fresco cracks. This study conducts experiments on different cracks since the appearance of cracks is usually accompanied by problems such as wall peeling and water seepage. The specific crack form is shown in Figure10.Figure 10
The fresco appears in the form of cracks.It can be seen from Figure10 that there are cracks in the murals in the three areas. Among them, there are many cracks in the murals of A and C. There are 19 murals with horizontal cracks in the murals in Area A. There are 12 frescoes with longitudinal cracks. There are 9 cases of falling off. There are 15 frescoes with blocky cracks. Among the murals in Area C, there are 13 murals with horizontal cracks, 14 with longitudinal cracks, 11 with falling off, and 15 with massive cracks. Cracks in different directions and shapes are due to local geological activities, human activities, climate, and other factors that cause different degrees of cracks in the murals.In order to facilitate comparison, a representative mural was selected from each of the three regions for comparative analysis, and the restoration time and various restoration indicators of the crack image of the mural are listed in a table, as shown in Table1.Table 1
The repair metrics of the algorithm in this study.
ABCRepair time (s)131.39198.6298.29Fix pixel (per)3568662912656Total pixels (per)974159731461438Sample replication times (times)125211221Number of Poisson treatments (times)224738It can be seen from Table1 that the number of repaired pixels in the repaired image is directly related to the repair time. The more pixels to be repaired, the longer the repair time. The number of repaired pixels can reflect that the search range of the sample block affects the repairing time, and the ratio of repaired pixels to total pixels can also reflect the difficulty of image repairing. The frequency of replication of the samples can reflect the complexity of the cracks in the frescoes to be repaired. The ratio of Poisson processing times to sample replication times is an important comparison parameter. It can be seen from Table 1 that the restoration time of the three murals is calculated in seconds, which is an acceptable restoration time length. The proportion of repaired pixels to total pixels is 3.6%, 7.7%, and 21%, respectively. Different proportions indicate that the difficulty of repairing will also be different. The repairing is achieved for three sets of images to be repaired with different proportions, which shows the effectiveness of the repairing method in this study. In the three groups of experiments, the number of Poisson processing accounted for about 25% of the total number of sample replications, which indicates that the Poisson processed method repaired only the initial outermost sample block as expected. In the field of image restoration, there is still no clear definition of the restoration effect. In the past restoration process, the peak signal-to-noise ratio is often used. Because the object removal experiment does not have known images as a comparison benchmark, which makes the metric difficult to calculate accurately, this kind of experiment cannot be applied to the inpainting experiment. This experiment uses a subjective evaluation strategy; that is, the experimenter evaluates the repaired images without knowing the repaired area.It can be seen from Table2 that this experiment has achieved relatively good results in terms of restoration time and restoration quality. The traditional loose poise processing method takes the shortest restoration time, but for a specific image, it is difficult to guarantee the restoration quality. As can be seen from Table 2, the frescoes in area A were repaired by the conventional pine poise repair method, which took 113.01 seconds and the subjective evaluation was 69 points, while the restoration using the Criminisi repair method took 139.45 seconds and the subjective evaluation was 83 points. Using the repair method in this study to repair, it only takes 127.38 seconds and its subjective evaluation score is the highest, which is 87 points. Although the repair method in this study takes a long time, it can guarantee the quality of its repair. The mural image in area B was repaired with the conventional pine poise repair method, which took 186.66 seconds and the subjective evaluation score was 65 points, while the restoration using the Criminisi repair method took 221.06 seconds and the subjective evaluation score was 69 points. The repair method in this study was used. To repair, it takes 193.12 seconds to use, and the subjective evaluation score is as high as 83 points. To sum up, the repair method described in this study has obvious advantages in repair effect compared with other repair methods, and its evaluation score and repair quality are both high.Table 2
Comparison of repair evaluation and repair time.
Regular Poisson processing fixCriminisi repairHow to fix this articleASubjective evaluation (score/total score)69/10083/10087/100Repair time (s)113.01139.45127.38BSubjective evaluation (number of approvals/samples)65/10069/10083/100Repair time (s)186.66221.06193.12CSubjective evaluation (score/total score)54/10077/10089/100Repair time (s)91.24111.4398.21It can be seen from Table3 that image inpainting can be used for image compression, but since the inpainting principle of image inpainting technology is to use the correlation of the image itself, the prerequisite for applying image inpainting technology to image compression is that the image content has a certain correlation. If the correlation of the image is large, a larger compression ratio can be obtained, but if the image itself is an image with less correlation and more complex cracks, the compression ratio will be reduced accordingly. For example, the fresco images in area C have more complex cracks, and the compression ratio will be lower than the compression ratio of the murals in areas A and B. Among the compression ratios of the mural images in the three regions, the highest compression ratio is the mural image in Region A, whose ratio is less than 5 : 1. The compression ratios obtained in the mural images in the three regions are the maximum values obtained under the premise that the restoration algorithm studied in this paper can be restored, and the existing restoration algorithms have made it difficult to complete the restoration task. Theoretically speaking, with the development of image inpainting technology, a higher compression ratio can be obtained under the condition that the new inpainting technology has more powerful inpainting capabilities.Table 3
Comparison of compression repair schemes.
Original size (KB)Size after compression (KB)Compression ratio (%)AIEI model PSNR (dB)CDD model PSNR (dB)The method of this paper PSNR (dB)A671621.0926.325.427.3B6715.821.8831.328.735.2C8727.333.7331.627.932.3


## 4.2. Improve the Experimental Scheme of Crack Identification and Repair in Mural Images

According to the above analysis, the cloud edge computing method and digital technology are perfectly combined with the research on the fresco crack identification and repair system. The idea of identifying, analyzing, and repairing cracks in frescoes with digital technology has greatly facilitated scholars’ research on this project. However, because the learning on digital technology and cloud edge algorithms is not deep and complete enough, the experiments in this study still have some defects, which need to be improved. The details are as follows. First, in the three regions of A, B, and C as the experimental objects, the selected sample size is not enough, and the number of samples needs to be increased to ensure the accuracy of the experimental results. Second, in the experiment, only the Criminisi repair method and the loose Pois repair method were selected as the comparison methods. It is recommended to add several types of repair algorithms, and the results obtained will be different, and the reliability will also increase. Criminisi repair method is difficult to ensure the repair quality of the edge with a strong structure, and the phenomenon of structural disconnection may occur. The loose Pois repair method also has certain defects. Since the size of the sample block is fixed, the repair process is not flexible enough, and error repair may occur.


## 5. Discussion

With the development of Internet technology, it has become the daily work of experts and technicians to use computer technology to restore the treasures of cultural relics that were difficult to restore manually in the past. In this study, the identification and repair system of fresco cracks has been studied by combining cloud edge computing methods with digital technology. There are still several problems in the research process of this study. (1) The repair algorithm in this study is not perfect, the repair time is too high, and the subjective evaluation score is too low. (2) For more complex cracks, the repair technology in this study is difficult to completely repair and it is difficult to completely repair them. (3) The experimental subjects selected in this study are too few, the number of comparable samples is small, and the reliability of the experimental results is not high. In this regard, there is still a long way to go to completely repair the cracks in the murals using computer technology.This study is devoted to the research based on cloud edge computing methods and digital technology in various fields and applied to the analysis of mural crack repair technology. A new attempt has been made in the study of fresco crack identification and repair systems. Through the case study, it is shown that this study reflects the effectiveness of the cloud edge computing method and digital technology in the analysis of the mural crack repair system.


## 6. Conclusions

This study has taken digital technology as the main analysis technology and has taken 20 murals in three regions A, B, and C as the research objects. Statistical analysis has been carried out on the problems of each mural, and the cloud edge computing method and digital technology have been used to classify them and identify the shape of the cracks in the mural. Through the case study, it has been concluded that factors such as temperature, humidity, precipitation, geological activity, and time can cause various problems such as cracks and fading of murals. The higher the image compression technology and the higher the image compression ratio, the higher the completeness of image restoration. The length of image restoration time does not guarantee the quality of image restoration. To sum up, the research on the fresco crack identification and repair system needs more in-depth and systematic analysis. The research in this study is only based on image pixels, recognition time, and image compression technology. The research of fresco crack repair based on cloud edge computing methods and digital technology has been a popular research object among experts and scholars from all walks of life in recent years, and further research is needed at present.



---

*Source: 1534596-2022-10-10.xml*