Construction cost prediction system based on Random Forest optimized by the Bird Swarm Algorithm

1.   Introduction

Copyright protection of multimedia contents have become a great concern over the decades and it also developed a series of techniques, the most notable of which are the cryptographic schemes and digital watermarking methods. The cryptographic schemes, also called digital signature methods, are usually based on a hashing function ^[1] or image feature extraction ^[2,3,4,5] followed by a public key encryption system. Unfortunately, the digital signature-based methods are mainly used for integrity authentication rather than ownership protection, because no explicit copyright information can be extracted from digital products. On the other hand, digital watermarking methods embed a watermark into the image without causing significant damage to its usage, and later it can be extracted from the watermarked image for ownership verification. Generally speaking, an effective watermarking scheme should be perceptually invisible and robust to possible attacks including signal processing, geometric distortion, and intentional manipulations.

In recent years, robust watermarking systems has become an intriguing research topic, among them are the spatial domain methods ^{[6,7,8,9,10,11,12,13,14,15]} and the transform domain methods ^{[16,17,18,19,20,21,22]}. Either way, though, in order to gain robustness, as Cox's prominent argument in ^[23], the destination of the watermark should be the perceptually most significant components of the carrier signal, despite the risk of potential fidelity distortions. Obviously, this criterion would lead to a counter-balance paradox between robustness and imperceptibility, since improving the robustness will have a notable impact on the visual quality of the image. To alleviate this problem, many adaptive watermarking embedding algorithms emerged, including watermark embedding strength adaption ^[24,25,26] and embedding position adaption ^[27], etc. However, neither of these methods has solved this issue with finality. Additionally, most of the existing robust watermarking methods essentially design or utilize some stable features of the image to embed the watermark. For example, transform domain methods typically embed the watermark in the DCT coefficients or the wavelet subbands of the image because they are relatively stable. The transform process can be regarded as the robustness feature extraction from the original image. Nevertheless, artificially designing and extracting robust features is no easy task, especially when the method is supposed to resist one or several particular attacks.

Based on these considerations, we propose a new scheme for multiple digital image copyright protection to displace the traditional image watermarking architecture by resorting to the deep neural network technique, which has achieved superior performance on feature extraction and representation ^[28,29,30]. In order to get around the paradox between robustness and imperceptibility, we no longer modify the image but represent the copyright message by exploring the patterns of image data itself through a neural network. To be specific, a large number of selected image blocks along with the message bits as their corresponding labels will be feed into the network, enabling the network to extract copyright message from images by classifying the image blocks to target labels (bits). Moreover, to enhance the robustness, we provide a preventive strategy to further train the network, namely, feeding image blocks from the post-attacked images to the network. By doing this, the neural network could automatically extract those classification features that are robust to certain attacks. The trained neural network can then be stored in a database (or added to the image header) for future use in ownership verification. Finally, we found the neural network-based scheme is particularly suitable for multiple images copyright protection. Based on experiments, a well-designed neural network is capable of representing the copyright message for a considerable number of images under various intentional attacks. Superior robustness and perfect imperceptibility are achieved in the proposed scheme.

This paper is organized as follows. Section 2 outlines the proposed system for image copyright protection. Some discussion and analysis for the scheme are described in Section 3. The experiments in Section 4 suggest our scheme is of considerable load capacity and strong robustness to a variety of attacks. Finally, Section 5 concludes the paper and discuss possible enhancements to the proposed scheme.

2.   Proposed copyright protection scheme

This section will elaborate on the proposed scheme in detail. The image copyright protection scheme consists of two parts: copyright image registration where we train a neural network for a number of given images, and copyright verification where the stored neural network extracts copyright message from the images to be verified.

2.1.   Copyright images registration

The neural network in our scheme can be partly analogous to the hashing procedure in general digital signature systems, in the sense that the neural network serves as a mapping from images to discrete numeric values (digests). But we hope that our scheme could not only reduce the data but also name an explicit message bitstream for copyright verification. We then train a neural network to transform the image blocks into copyright message. The procedure for training is showed in Figure 1:

In a most common application scenario, our scheme starts with a series of RGB images $I = (I_1, I_2, \cdots, I_n)$ to be registered to our verification system and binary sequences of copyright message for each image $W_j = (w_1, w_2, \cdots, w_m), w_i\in \{0, 1\}, j = 1, 2, \cdots, n$. In practice, the choice of $n$ and $m$ depends on the capacity of the network. In general, as the number of images and the copyright message length are increased, the optimal network structure to which should be altered. In this paper, we adopted a 5-layer fully connected neural network structured in Figure 2. The choice of network is further elaborated in Section 3.4.

Before training the network, expanded training data is yield from an attack set $A = {A_1, A_2, \cdots, A_r}$ including $r$ types of attack, the proposed $A$ is showed in Table 1. For each image $I_k$, the corresponding attacked image set is denoted by $A(I_k) = \{A_1(I_k), A_2(I_k), \cdots, A_r(I_k)\}$.

To determine the location of the candidate training data, $I$ is processed as follows: Normalize the size of all the images in $I$ to $M\times M$, and then divide each image into non-overlapping blocks of size $b\times b$. For each image, calculate keypoints with diameter $b$ of these normalized images, and locate $m$ strongest keypoints at block scale. In other words, for each image, we choose the $m$ image blocks containing the strongest keypoints and then save the location information of these chosen image blocks. These $m$ image blocks are supposed to be the input of the network and the corresponding output should be the $m$ message bits.

Then we normalize the images in the attacked image set $A(I_k), k = 1, \cdots, n$ and choose the corresponding image blocks with the saved location information. Taking all $n$ images in $I$ into account, we train the neural network to map $nm(r+1)$ image blocks to the $n$ copyright message bitstreams for $n$ images. The trained neural network can then be stored in a database (or added to the image header) for ownership verification.

2.2.   Copyright verification

During the copyright verification stage, the copyright owner use the trained network to extract copyright messages from the registered images to declare the ownership.

Continuing from the application scenario above, the image distributor registered an image on a neural network, let's say $I_c$, which has possibly been through some malicious or non-malicious manipulations. As Figure 3 shows, in order to feed the trained network $N_{IW}$, we should first normalize the image $I_c$ to size $M\times M$ and then divide it into $b\times b$ non-overlapping blocks as the registration stage does. It is worth noting that during verification stage the distributor has already known the location information of the registered image blocks, and thus making it possible for distributor to locate the image blocks and feed them to the network sequentially. After this, the trained neural network $N_{IW}$, serving as a copyright message extractor, is able to yield a bit sequence $W_{c}$ from the possibly distorted registered image $I_c$, and $W_{c}$ is supposed to be the copyright message for image $I_c$ to verify the copyright ownership.

3.   Discussion and analysis

In this section, we give some explanation and discussion on the overall and details of the design scheme.

3.1.   Feasibility

The universality theorem ^[31,32] ensures that a neural network can fit any mapping from image blocks to the classification labels, as long as there is no such case where identical image blocks are mapped to different labels. Actually, this unexpected case is possible in our training set, in another word, it is possible that two identical image blocks (or highly similar image blocks) are chosen to participate in the training process and unfortunately they are paired with two different message bits. However, we have taken the following measures to avoid this block collision case as much as possible.

● Choosing the keypoint-included blocks reduces the probability of such coincidence. The more complex of an image block is, the less possible it coincides with another image block. What's more, there are much more similar simple areas than the complex areas in the natural image samples, thus, those areas containing complex contents are preferable in our scheme.

● Controlling the number of candidate image blocks also lessens the co-occurrence possibility of two similar image blocks. Our choices are based on the complexity of the image blocks, in this manner, as the number of blocks raises, the chance of simple blocks' co-occurrence raises.

● Likewise, an appropriate block size also suppresses the possibility of such coincidence. An undersized block may lead to more similarities in content. However, an oversized block may decrease the copyright message capacity of each image. For this reason, we determined an appropriate block size to further optimize the feasibility.

With the neural network's universality theorem and the collision avoidance rules listed above, we are able to guarantee the feasibility of the proposed scheme (See Section 4 for detailed settings). But still, we hope the trained network would be equipped with robustness for representing copyright message to adapt to lossy channel and resist malicious manipulation.

3.2.   Robustness

The robustness of the scheme comes from three parts, the error tolerance of the neural network, the preventive training set, and the robust feature extraction. Firstly, error tolerance is the inherent nature of the proposed neural network. The neural network essentially works as a soft classifier which gives a probabilistic, rather than a hard yes/no classification result, allowing the disturbed signals to be classified to the expected class.

Secondly, since the expanded training set has already contained varied attacked images, a well trained neural network guarantees perfect extraction of those image blocks in the training set. So our scheme is capable of resisting certain attacks that contains in the preventive training set. Furthermore, the robustness of the proposed scheme can be enhanced by adding new attacked images to the preventive training set. As such, it enables a dynamic evolution of robustness according to practical demands.

Finally, our scheme also gets it robustness from the generalization ability of the neural network. Above all, the process that the neural network maps the original image block and the attacked image block to the same label is exactly the process where the neural network extracts the robust features and then classifies them. In this way, even for those attacked images that are not included in the training set, the trained network is still able to perform a correct classification by recognizing the robust features.

3.3.   Network capacity for multiple images

The capacity of our scheme is plainly defined as the number of "image block-message bit pair" that the neural network could effectively enroll. Due to transmission and storage considerations, we expect a single neural network could register as many images as possible. Interestingly, we have experimentally determined such a fact that choosing the same number of blocks from many disparate images instead of a small number of images, will significantly enlarge the network's capacity. This is partly because choosing blocks from various images would provide more diverse pixel distributions, and then the image blocks probabilistically could have more identifiable features for the neural network. In conclusion, to train the network in an economical manner, we prefer a shorter copyright message for each image but a richer image set to be registered by the network.

Of particular note is that the robustness and capacity of our scheme also depend closely on the network structure and training algorithm, but confined to the length of the paper, we only focus on the network structure proposed above. All experiments in Section 4 that will further explore the robustness and capacity of our scheme are based on this structure.

3.4.   Network choice

Our choice of fully connected neural network rather than the more effective CNN in image feature extraction is out of the resource utilization and classification optimization considerations. Firstly, as the proposed method is based on image blocks, to increase the length of the represented copyright message, the block size should not be too large otherwise there will not be sufficient room to cover copyright message length (expanding normalization size can also increase the number of image blocks, but we expect more 'content' in a block rather than simply more pixels). However, on a smaller scale we can no longer bring CNN's superiority into full play. To be specific, when the block size is $8\times 8$ as Section 4 does, the convolutional kernel size of CNN can either be too small to capture the spatial correlation details among adjacent region or be too large to effectively reduce the number of parameters.

Moreover, our classification task might become rigorous at times. For example, sometimes we need the network be able to distinguish one image block from another highly similar one (See co-occurrence occasion described in Section 3.1) where leaving out any of the details can bring about classification failure, thus we dropped weight sharing and local connection to avoid any information loss and finally chose fully connected neural network to extract robust features and represent the copyright message.

4.   Experiment

In this section, experiments are performed to evaluate the proposed scheme, which should be able to extract a copyright message from each registered image, even though the image could have suffered disturbance or damage. We take a number of RGB images from "Standard" test images and BossBase-1.0 as copyright images (Figure 4 shows some of them), and pseudo-random binary sequences as copyright messages. For each image we take 64 bits as it copyright message. All the experiments were performed on Windows PC with Intel^® Core^TM I7-4720 CPU at 2.6GHz, 8GB RAM with Tensorflow version 1.6.0.

The network architecture used in this paper is shown in Figure 2. The input image block is first flattened and then sequentially passed through four layers of gradually narrowed fully connected networks. Each layer is activated by the ReLU function, and the final output of the two nodes passes through the Softmax layer to obtain the probability of corresponding classification labels. The mini-batch size used for training is 32, and Adam is adopted to optimize the network for 600 training epochs on the training set.

Based on the analysis and discussion in Section 3, this part mainly shows the general resistance of the proposed scheme to various attacks, including the superposition Gaussian noise with zero mean and standard deviation ranging from 5% to 30% of the maximum pixel value 255, JPEG compression with quality factor 70, 50, 30 and 10, resizing and various filtering attacks such as Guassian filtering and median filtering (some of the attacked sample images are illustrated in Figure 5). To further explore the capacity of our network, different numbers of images including 10, 20, 30, 40, 90 images are registered to 5 neural networks respectively in the following experiments, and then we evaluate the each network's extraction accuracy under different attacks. It should be noted that each image corresponds to an individual 64-bit copyright message. Therefore, we are actually testing the neural network's capability of 640, 1280, 1920, 2560 and 5760 bits copyright messages. In general, we take the ratio of the number of correctly extracted message bits to the total number of bits as extraction accuracy to evaluate the performance.

Table 2 shows the average extraction accuracy rate after superposition Gaussian additive noise attacked the images, for each image, we register 64 bit copyright message for it. The noise is normally distributed with zero mean and standard deviation Std, which ranges from 0 to 76.5 in the experiment. At a larger Std, as the numbers of images participated in the training raises, the robustness performance presents a regular decline trend. Table 3 shows the robustness against JPEG compression. In the case of lower compression quality factors, the extraction accuracy rate reduced slightly. Even for those quality factors that are not involved in training, the trained network can still achieve a reasonably high extraction accuracy rate. Table 4 shows the extraction accuracy rate for three kinds of filtering attacks including mean value filtering, Gaussian filtering, and median filtering. With the same size of the filtering kernel, the extraction accuracy of the Gaussian filtering is relatively higher than the other two methods, since Gaussian filter impacts less to the image than the mean and median filters. Table 5 shows the robustness against rescaling attacks. The extraction is almost unaffected when the rescaling size is larger than the normalization size, which is by no means difficult to foretell. When the rescaling size is smaller than the normalization size, the extraction accuracy reduced considerably at 20% and 12.5% rescaling level. Still, expanding the training set can effectively improve the reduction.

^*The underlined items are included in the attack set during the training process.

5.   Conclusion

This paper proposes a deep neural network based large scale image copyright protection scheme. Instead of modifying the original image to embed the copyright message as the traditional watermarking system, the proposed scheme trains a neural network to register multiple images, and when copyright verification is required, the neural network could represent a copyright message for each image by classifying image blocks to message bits. With the error tolerance of the neural network and a preventive training strategy, the proposed scheme is remarkably robust to many attacks, including additive noise, JPEG compression, filtering and resizing. Moreover, this scheme is especially appropriate for multiple images' copyright verification as experimental results showed. Lastly, the preventive method can be modified for specific attacks in practice, thus a stronger robustness can be obtained by expanding the preventive training set. For now, our scheme is only based on a single network structure which clearly limited its robustness and capacity. To further improve its performance with alternative network structure will be a promising study in the future.

Acknowledgments

This work was supported in part by the National Natural Science Foundation of China (No. 61772549, 61872448, U1736214, 61602508, and 61601517), and the National Key R & D Program of China(No. 2016YFB0801303 and 2016QY01W0105).

Conflict of interest

The authors declare no conflict of interest.