# Multi-DS Strategy for Source Camera Identification in Few-Shot Sample Data Sets

Authors: Bo Wang; Jiayao Hou; Yanyan Ma; Fei Wang; Fei Wei
Journal: Security and Communication Networks
 (2022)

---

## Abstract

Source camera identification (SCI) is an intriguing problem in digital forensics, which identifies the source device of given images. However, most existing works require sufficient training samples to ensure performance. In this work, we propose a method based on semi-supervised ensemble learning (multi-DS) strategy, which extends labeled data set by multi-distance-based clustering strategy and then calibrate the pseudo-labels through a self-correction mechanism. Next, we iteratively perform the calibration-appending-training process to improve our model. We design comprehensive experiments, and our model achieves satisfactory performance on benchmark public databases (i.e., Dresden, VISION, and SOCRatES).


---

## Body

## 1. Introduction

Digital images are widely used in social media and people’s modern life. An enormous number of user-friendly photo editing apps are available in the market, such that it is important to identify the authenticity of digital images for preventing digital images from being used by intentional people and suffering malicious tampering. In the field of digital image forensics, the most important approach is passive forensics, as it is often difficult to obtain reliable digital watermark or digital label information in the actual judicial forensic scenario. Source camera identification (SCI) is an important branch in the field of digital image forensics [1]. Due to the difference in device types, models, individual hardware, and build-in image generation algorithms in the image-creating process, these unique marks may be left as trace in the images. For example, Lucas et al. [2] analyze the noise introduced in the imaging process and take the photo-response nonuniformity (PRNU) noise as the fingerprint, which proved the feasibility of mining the internal traces of the image.Previous methods obtain high identification accuracy when training sets are sufficiently large, and insufficient training sets (aka few-shot sets) may significantly impact the performance. However, the construction of large labeled sample set is time-consuming, laborious, and sometimes impossible. It is interesting to find a method, which gives accurate identification results even when the training samples with known labels are limited, or at least provides a more reliable and convincing source identification result. At present, the typical methods to solve few-shot sample problems are usually data expansion, such as generating virtual samples [3, 4], data enhancement [5–7], and semi-supervised learning [8–10]. We attempt to solve the problem of source camera identification in the case of few-shot samples based on the semi-supervised learning method and try to propose an algorithm model that can be applied to actual judicial forensics and other scenarios to ensure a relatively reliable source camera identification accuracy rate.In this work, we propose a distance-based semi-supervised ensemble learning (multi-DS) strategy to solve the camera source identification problem under few-shot sample conditions. We first perform classifying by comprehensively comparing multiple distances between unlabeled-labeled sample pairs, then mark unlabeled image samples with pseudo-labels by a sorting algorithm, calibrate the pseudo-labels by a support vector machine (SVM)-based self-correction mechanism, and append the new labeled sample to the training set. By iteratively repeating the labeling-calibrating-appending-training process, we obtain the final model with stopping conditions.Our contributions are as follows:(i)
We propose a distance semi-supervised ensemble learning (multi-DS) strategy, which integrates multiple distance indicators to cluster unlabeled samples based on few-shot labeled samples, so as to make full use of the information of few-shot sample data sets.(ii)
We mark the samples close to the cluster center with pseudo-labels of the same class as reliable pseudo-label samples and use these samples to expand the few-shot sample set for SVM self-correction training, so as to optimize the model through continuous iteration.(iii)
We conduct comprehensive experiments on multiple threshold parameters in multi-DS strategy to prove the effectiveness of our model. The experimental results show that our strategy is superior to other existing methods on few-shot sample data sets.The rest of this article is structured as follows. The second part introduces the field of camera source recognition and related work in few-shot sample scenes. The third part introduces in detail our proposed distance-based semi-supervised ensemble learning (multi-DS) strategy. The fourth part provides some background information about the strategy we used. In the fifth part, we discussed the experimental design and results in detail. A summary of our work can be found in Section6.


## 2. Related Works

In this work, we mainly focus on camera model identification. In this section, we review the existing work in this field. In the past two decades, based on different levels of camera source identification, people have gradually carried out SCI research from three directions: equipment-based, model-based, and individual-based. We mainly identify the source according to the model of the source camera.Model-based SCI can identify the source camera model of a given image, to accurately identify the specific brand and model of the source camera. Since each camera brand has a different model, statistical characteristics are of sufficient importance. Kharrazi et al. [11] and others proposed that through the inherent structural differences in the camera model, the statistical characteristics of the image color correlation and color energy ratio can be used for SCI problems. They use wavelet features [12] and image quality features [13] to collect image information and then build higher-order statistical models of natural images. Support vector machines are then used to discriminate between untouched and adulterated images, so as to complete source camera identification. In addition, they also used more features, including statistical features such as color correlation, color energy ratio, and neighborhood distribution centroid for identification. Çeliktutan et al. [14] combined three sets of forensic features to measure, including binary similarity metric (BSM), image quality metric (IQM), and high-order wavelet statistics (HOWS), which further proved the feasibility of comprehensive forensics of multiple features. Swaminathan et al. [15] searched for the correlation between image pixels caused by color filter array (CFA) interpolation features and proposed a linear interpolation model based on the peaks existing in the spectral domain to estimate the neighborhood CFA interpolation coefficients. Xu et al. [16] proposed a method of combining the local binary pattern (LBP) and local phase quantization (LPQ) features of the hue and value color channels in the hue, saturation, and value (HSV) color space. They extracted the LBP features and the LPQ features from the contourlet transform coefficients of the original image and residual noise image. The LPQ feature recognizes 10 camera brands from the Dresden image data set with an accuracy rate of 99.8%.However, the work of the above researchers is aimed at the training environment with sufficient labeled samples, but when the labeled training samples are insufficient, the SVM classifier or other learning algorithms cannot be fully trained, which will significantly reduce the classification accuracy of SCI. Tan et al. [17] constructed multiple prototype sets using the ensemble projection (EP) method and used richer features to solve the problem of insufficient known labels in the few-shot sample problem. Liang et al. [18] used the attention multisource fusion few-shot learning method (AMF-FSL) to transfer the classification ability of few-shot learning from multisource data to target data, which improved the generalization ability of the classification model in cross-domain. Sameer and Naskar [19] used the deep Siamese network method to enhance the training space by forming paired samples from the same camera model and different camera models and obtained a better model of camera source identification problem. Huo et al. [20] focused on the scene of zero sample and few sample mixed learning with extreme scarcity. They chose to obtain more noisy label samples from the image search engine for data expansion and then used the enhanced but noisy label training data for projection learning through noise suppression and semantic projection learning algorithms, which provide a feasible scheme for practical application scenarios when data are particularly inadequate.In fact, the number of training samples in source camera identification is often difficult to meet the needs of identification. Therefore, considering the practical application scenarios of few-shot labeled samples, we propose our strategy below.


## 3. The Proposed Multi-DS Strategy

To make full use of more detailed information of the few-shot samples, this section proposes a strategy of few-shot sample image source identification based on distance semi-supervised ensemble learning, named multi-DS algorithm.The complete multi-DS algorithm block diagram is shown in Figure1. After extracting sufficient features for all data sets, two screenings are performed based on the distance threshold and the statistical frequency threshold based on the three distance indicators to complete the semi-supervised ensemble learning process, and the pseudo-label information is corrected repeatedly until it is stable. The details of each part of the algorithm are as follows.Figure 1
Framework of multi-DS algorithm.The block diagram of feature extraction and multi-distance integrated integration to filter pseudo-label samples is shown in Figure2. To fully obtain the detailed information of all camera images, multi-statistical features are extracted for all samples in training and testing. At the same time, to ensure the accuracy of assigning pseudo-labels, we use a variety of distance indicators to supervise the distribution process of pseudo-labels: for the sample feature information of each dimension, we calculate the Euclidean distance, Manhattan distance, and Chebyshev distance from each test sample to each training sample, to obtain multi-distance indicators. By sorting these distance indicators, we select the nearest m unlabeled samples of each training sample to assign the same class of pseudo-labels, and the samples with statistical times not less than t are selected as effective pseudo-label samples to complete semi-supervised ensemble learning training.Figure 2
Selecting pseudo-label samples based on multiple distances.The pseudo-code corresponding to the above process is illustrated in Algorithm 1. In the second step, we generate distance vectors based on multiple distance indicators and sort them in ascending order to match the nearestm unlabeled samples for each labeled sample. In the third step, we count the selected times of these unlabeled samples in each camera class and mark the unlabeled samples not less than the statistical time threshold t as valid pseudo-label samples, to realize a round of pseudo-label sample filtering.Algorithm 1: Selecting pseudo-label samples based on multiple distances.
Symbols:U: Set of unlabeled samplesℒ: Set of labelsSl: Set of samples with label l∈ℒℳ: Collection of distance measuresm: The distance thresholdt: The statistics threshold(1)
Extract multiple feature vectors from all training samples;(2)
Calculate multiple distance parameters as follows:fori∈ℳ and s∈Sl:l∈ℒdoForm distance vectorDs,i=ds,ui:u∈USortDs,i in ascend order and take the first m entries to form a new vector Ds,i′end for(3)
Selecting pseudo-label samples:foru∈Udoforl∈ℒdoCount foru in Ds,i′:s∈Sl,i∈ℳif Total count of u is greater than a selected threshold tthenLabelu with pseudo-label l (Note: one unlabeled u may be marked with multiple pseudo-labels and appended to corresponding labeled sets)end ifend forend forAmong them, to obtain more a priori information as much as possible in the case of few-shot samples, we use LBP and CFA image statistical features. The relevant details will be described in Section4.In addition, semi-supervised ensemble learning based on three distance indicators is the focus of our work. In this process, we have carried out two rounds of screening to ensure that the selected pseudo-label samples are as authentic and reliable as possible. Firstly, we get enough pseudo-label samples through the distance thresholdm, and then, we select sufficiently reliable pseudo-label samples through the statistics threshold t. After two thresholds, we can ensure that the final pseudo-label samples are close enough to labeled samples in the spatial domain, so that the distribution of the pseudo-labels can be reliable. Therefore, by calculating multiple distances separately, we can combine the characteristics of multiple distance indicators and use the idea of ensemble learning to select more reliable pseudo-label samples.After obtaining valid pseudo-label samples, we use SVM self-correction to correct some labels. Through the SVM classifier trained based on few-shot samples and selected pseudo-label samples to retest all unlabeled samples, we can get new pseudo-label samples and then repeat this process until the model converges, to complete the process of SVM self-correction. Finally, we can get the final classification accuracy on the testing data sets, as shown in Figure3. We use labeled samples to guide the selected pseudo-label samples for semi-supervised learning. At the same time, we update iteratively based on the results of each round of SVM classifier and then train the known labeled samples and the updated pseudo-label samples with SVM classifier to get the final model. The details of relevant strategy will be described in Section 4.Figure 3
SVM self-correction model based on semi-supervised training.In this process, the reliable pseudo-label samples are the samples with high reliability screened through multiple thresholds, but they may not correspond to the real labels. At the same time, the pseudo-label samples also expand the training samples, making the available information more rich and reliable.With these reliable pseudo-label samples, in the model training stage, we can guide and supervise the labeled samples with the help of the information of the pseudo-label samples. In this way, we can effectively enrich the information of the few-shot sample data sets and finally complete the process of semi-supervised learning.


## 4. Algorithm-Related Details

### 4.1. Feature Extraction Algorithm

To verify the rationality of our proposed multi-DS strategy, we combine the two characteristics of LBP and CFA. These two features have different generalization performances for image features. Among them, the LBP feature with equivalent mode effectively reduces the noise impact of high-frequency mode and has a strong ability to generalize features, while the CFA feature shows the inherent algorithmic differences in the cameras. The inherent difference between camera models is strong, so these two features can extract the inherent information of the image from two different aspects, to realize the extraction of camera features more scientifically.


#### 4.1.1. CFA Features

CFA interpolation algorithm is a widely used model-based variable camera feature. Swaminathan et al. [21] calculated the pixel interpolation of each color channel, respectively, and calculated the CFA interpolation coefficient through the linear model. Taking the green channel of the image as an example, assuming that the position coordinate of the selected interpolation point is m,n and the selected neighborhood size is the pixel area of 2k+1×2k+1, the interpolation model of N interpolation pixels is shown as follows:(1)G1G2⋮GN=a1gg11+⋯+a2k+12−1gg2k+12−11a1gg12+⋯+a2k+12−1gg2k+12−12⋮a1gg1N+⋯+a2k+12−1gg2k+12−1N+a1rr11+⋯+a2k+12rr2k+121a1rr12+⋯+a2k+12rr2k+122⋮a1rr1N+⋯+a2k+12rr2k+12N+a1bb11+⋯+a2k+12bb2k+121a1bb12+⋯+a2k+12bb2k+122⋮a1bb1N+⋯+a2k+12bb2k+12N.Among them,aig, air, and aib are the CFA interpolation coefficient weights of the green, red, and blue channels in the color image, respectively. gαk is the α interpolation coefficient of the neighborhood of the k pixel in the green channel. Similarly, rαk and bαk represent the corresponding coefficients of the red channel and the blue channel, respectively. Equation (2) can be abbreviated into the vector form of the following equation:(2)G=a1gg1+⋯+a2k+12−1gg2k+12−1+a1rr1+⋯+a2k+12rr2k+12+a1bb1+⋯+a2k+12bb2k+12.The interpolation coefficients of other red channels and blue channels of color images can be similarly calculated by this strategy. Finally, the interpolation coefficients on the three color channels are obtained. For a given digital image, if we setk=3, the neighborhood size of the interpolation point is 7×7. According to the 2×2 Bayer CFA structure, the G interpolation coefficients of R and B sampling points and the R and B interpolation coefficients of two G sampling points are estimated, respectively, and a total of 2k+12−1×5=240 interpolation coefficients are obtained. The mean and variance of 240 dimensional CFA interpolation coefficients are integrated into 480 dimensional CFA features.


#### 4.1.2. LBP Features

LBP feature is an operator that reflects the local texture features of an image. It has the advantages of gray invariance, rotation invariance, and so on. The original LBP operator takes the gray value of the pixel of the center point as the standard threshold in the window of3×3, and the gray value of the other eight points is 1 if it is greater than the threshold and 0 if it is less than the threshold. After comparison, the eight bit binary number will be converted into decimal, which is the LBP value of the center point. The calculation formula is shown as follows:(3)LBPP,R=∑p=0P−1sgp−gc2p,(4)sx=1,x≥0,0,x<0.Among them, parametergc is the gray value of the central point pixel, gp represents the gray value of the adjacent points around the central point, and P is the total number of the surrounding adjacent points around the central pixel with R as the radius, where p=1,2,…,P. sx is the binarization threshold processing function.Considering that there are28=256 modes of LBP features for 8 neighborhood pixels, Ojala et al. [22] proposed a uniform pattern for dimensionality reduction: since the LBP feature mode of most images only jumps between 0 and 1 twice, the researchers defined the “equivalent mode” as that the number of numerical jumps after one rotation is less than 3; on the contrary, other modes become “mixed mode” (nonuniform pattern); that is, the LBP features of the mixed mode are integrated and the interference of high-frequency noise is reduced. Accordingly, the dimension of the features is also reduced from 256 to 59. Then, the 59 dimensional LBP features are extracted from the spatial domain, prediction error domain, and wavelet transform domain of the image, respectively. Color images have three color channels, and the post-processing algorithms of red channel and blue channel images are basically the same, so only LBP features of red channel and green channel need to be extracted. A total of 59×3×2=354 dimensional LBP features are obtained.


### 4.2. Multiple Distance Indicators

We know that the essence of norm is distance, and its significance is to achieve comparison, so we can use a variety of distance indicators to measure distance. Here, we use one norm, two norms, and infinite norms for comprehensive judgment. They are also called Euclidean distance (ED), Manhattan distance (MD), and Chebyshev distance (CD).The three distances are the measurement parameters for the characteristics of image samples, and their expressions in two-dimensional space are in the following formulas:(5)d=x2−x12+y2−y12,(6)d=x1−x2+y1−y2,(7)d=maxx2−x1,y2−y1.


### 4.3. Semi-Supervised Learning

Semi-supervised learning (SSL) mainly aims at the problem of algorithm failure in the case of few-shot data. The characteristic of this strategy is that it does not introduce external information and introduces unlabeled samples with the help of few-shot sample labels and some criteria conditions, to make the greatest use of the information of unlabeled samples from various ways. The expansion of finite sample set is realized to better train the model.


### 4.4. The Idea of Ensemble Learning

The idea of ensemble learning is to combine multiple weak supervision models to achieve a more comprehensive strong supervision model. The common combination methods are average method, voting method, and learning method.By combining the different characteristics of multiple distance indicators, we use the idea of ensemble learning to select the pseudo-label samples closer to the labeled samples in the spatial domain. Because of the flexibility of the multiple distance indicators, it is possible to improve the reliability of the selected pseudo-label samples by integrating multiple distance indicators.


### 4.5. The SVM Self-Correction Classifier

The goal of the SVM classifier is to find a hyperplane to separate two classes of data, making the maximum margin between the samples. Multi-class classification can be realized by reusing SVM classifier. Among them, hyperplane refers to the separation surface that can divide the n-dimensional space into two parts. Support vector is the sample point closest to the classification hyperplane, and the geometric interval is usually used as the distance measure:(8)γi=yiωωTxi+bω.Among them,y represents the class label of the data point, and ω and b are the parameters of hyperplane ωTx+b=0. By continuous iterative training, the optimal hyperplane with the largest edge can be found. This iterative process is the training process of SVM classifier.In our strategy, SVM classifier is used to classify the feature vectors of camera photographs. After identifying the selected pseudo-label samples, we put few-shot labeled and selected pseudo-label samples with labels and multiple feature vectors into the SVM for training. Then, we test with these pseudo-label samples, thereby continually iterating and updating the labels of pseudo-label samples to complete the SVM self-correction training process.


## 4.1. Feature Extraction Algorithm

To verify the rationality of our proposed multi-DS strategy, we combine the two characteristics of LBP and CFA. These two features have different generalization performances for image features. Among them, the LBP feature with equivalent mode effectively reduces the noise impact of high-frequency mode and has a strong ability to generalize features, while the CFA feature shows the inherent algorithmic differences in the cameras. The inherent difference between camera models is strong, so these two features can extract the inherent information of the image from two different aspects, to realize the extraction of camera features more scientifically.


### 4.1.1. CFA Features

CFA interpolation algorithm is a widely used model-based variable camera feature. Swaminathan et al. [21] calculated the pixel interpolation of each color channel, respectively, and calculated the CFA interpolation coefficient through the linear model. Taking the green channel of the image as an example, assuming that the position coordinate of the selected interpolation point is m,n and the selected neighborhood size is the pixel area of 2k+1×2k+1, the interpolation model of N interpolation pixels is shown as follows:(1)G1G2⋮GN=a1gg11+⋯+a2k+12−1gg2k+12−11a1gg12+⋯+a2k+12−1gg2k+12−12⋮a1gg1N+⋯+a2k+12−1gg2k+12−1N+a1rr11+⋯+a2k+12rr2k+121a1rr12+⋯+a2k+12rr2k+122⋮a1rr1N+⋯+a2k+12rr2k+12N+a1bb11+⋯+a2k+12bb2k+121a1bb12+⋯+a2k+12bb2k+122⋮a1bb1N+⋯+a2k+12bb2k+12N.Among them,aig, air, and aib are the CFA interpolation coefficient weights of the green, red, and blue channels in the color image, respectively. gαk is the α interpolation coefficient of the neighborhood of the k pixel in the green channel. Similarly, rαk and bαk represent the corresponding coefficients of the red channel and the blue channel, respectively. Equation (2) can be abbreviated into the vector form of the following equation:(2)G=a1gg1+⋯+a2k+12−1gg2k+12−1+a1rr1+⋯+a2k+12rr2k+12+a1bb1+⋯+a2k+12bb2k+12.The interpolation coefficients of other red channels and blue channels of color images can be similarly calculated by this strategy. Finally, the interpolation coefficients on the three color channels are obtained. For a given digital image, if we setk=3, the neighborhood size of the interpolation point is 7×7. According to the 2×2 Bayer CFA structure, the G interpolation coefficients of R and B sampling points and the R and B interpolation coefficients of two G sampling points are estimated, respectively, and a total of 2k+12−1×5=240 interpolation coefficients are obtained. The mean and variance of 240 dimensional CFA interpolation coefficients are integrated into 480 dimensional CFA features.


### 4.1.2. LBP Features

LBP feature is an operator that reflects the local texture features of an image. It has the advantages of gray invariance, rotation invariance, and so on. The original LBP operator takes the gray value of the pixel of the center point as the standard threshold in the window of3×3, and the gray value of the other eight points is 1 if it is greater than the threshold and 0 if it is less than the threshold. After comparison, the eight bit binary number will be converted into decimal, which is the LBP value of the center point. The calculation formula is shown as follows:(3)LBPP,R=∑p=0P−1sgp−gc2p,(4)sx=1,x≥0,0,x<0.Among them, parametergc is the gray value of the central point pixel, gp represents the gray value of the adjacent points around the central point, and P is the total number of the surrounding adjacent points around the central pixel with R as the radius, where p=1,2,…,P. sx is the binarization threshold processing function.Considering that there are28=256 modes of LBP features for 8 neighborhood pixels, Ojala et al. [22] proposed a uniform pattern for dimensionality reduction: since the LBP feature mode of most images only jumps between 0 and 1 twice, the researchers defined the “equivalent mode” as that the number of numerical jumps after one rotation is less than 3; on the contrary, other modes become “mixed mode” (nonuniform pattern); that is, the LBP features of the mixed mode are integrated and the interference of high-frequency noise is reduced. Accordingly, the dimension of the features is also reduced from 256 to 59. Then, the 59 dimensional LBP features are extracted from the spatial domain, prediction error domain, and wavelet transform domain of the image, respectively. Color images have three color channels, and the post-processing algorithms of red channel and blue channel images are basically the same, so only LBP features of red channel and green channel need to be extracted. A total of 59×3×2=354 dimensional LBP features are obtained.


## 4.1.1. CFA Features

CFA interpolation algorithm is a widely used model-based variable camera feature. Swaminathan et al. [21] calculated the pixel interpolation of each color channel, respectively, and calculated the CFA interpolation coefficient through the linear model. Taking the green channel of the image as an example, assuming that the position coordinate of the selected interpolation point is m,n and the selected neighborhood size is the pixel area of 2k+1×2k+1, the interpolation model of N interpolation pixels is shown as follows:(1)G1G2⋮GN=a1gg11+⋯+a2k+12−1gg2k+12−11a1gg12+⋯+a2k+12−1gg2k+12−12⋮a1gg1N+⋯+a2k+12−1gg2k+12−1N+a1rr11+⋯+a2k+12rr2k+121a1rr12+⋯+a2k+12rr2k+122⋮a1rr1N+⋯+a2k+12rr2k+12N+a1bb11+⋯+a2k+12bb2k+121a1bb12+⋯+a2k+12bb2k+122⋮a1bb1N+⋯+a2k+12bb2k+12N.Among them,aig, air, and aib are the CFA interpolation coefficient weights of the green, red, and blue channels in the color image, respectively. gαk is the α interpolation coefficient of the neighborhood of the k pixel in the green channel. Similarly, rαk and bαk represent the corresponding coefficients of the red channel and the blue channel, respectively. Equation (2) can be abbreviated into the vector form of the following equation:(2)G=a1gg1+⋯+a2k+12−1gg2k+12−1+a1rr1+⋯+a2k+12rr2k+12+a1bb1+⋯+a2k+12bb2k+12.The interpolation coefficients of other red channels and blue channels of color images can be similarly calculated by this strategy. Finally, the interpolation coefficients on the three color channels are obtained. For a given digital image, if we setk=3, the neighborhood size of the interpolation point is 7×7. According to the 2×2 Bayer CFA structure, the G interpolation coefficients of R and B sampling points and the R and B interpolation coefficients of two G sampling points are estimated, respectively, and a total of 2k+12−1×5=240 interpolation coefficients are obtained. The mean and variance of 240 dimensional CFA interpolation coefficients are integrated into 480 dimensional CFA features.


## 4.1.2. LBP Features

LBP feature is an operator that reflects the local texture features of an image. It has the advantages of gray invariance, rotation invariance, and so on. The original LBP operator takes the gray value of the pixel of the center point as the standard threshold in the window of3×3, and the gray value of the other eight points is 1 if it is greater than the threshold and 0 if it is less than the threshold. After comparison, the eight bit binary number will be converted into decimal, which is the LBP value of the center point. The calculation formula is shown as follows:(3)LBPP,R=∑p=0P−1sgp−gc2p,(4)sx=1,x≥0,0,x<0.Among them, parametergc is the gray value of the central point pixel, gp represents the gray value of the adjacent points around the central point, and P is the total number of the surrounding adjacent points around the central pixel with R as the radius, where p=1,2,…,P. sx is the binarization threshold processing function.Considering that there are28=256 modes of LBP features for 8 neighborhood pixels, Ojala et al. [22] proposed a uniform pattern for dimensionality reduction: since the LBP feature mode of most images only jumps between 0 and 1 twice, the researchers defined the “equivalent mode” as that the number of numerical jumps after one rotation is less than 3; on the contrary, other modes become “mixed mode” (nonuniform pattern); that is, the LBP features of the mixed mode are integrated and the interference of high-frequency noise is reduced. Accordingly, the dimension of the features is also reduced from 256 to 59. Then, the 59 dimensional LBP features are extracted from the spatial domain, prediction error domain, and wavelet transform domain of the image, respectively. Color images have three color channels, and the post-processing algorithms of red channel and blue channel images are basically the same, so only LBP features of red channel and green channel need to be extracted. A total of 59×3×2=354 dimensional LBP features are obtained.


## 4.2. Multiple Distance Indicators

We know that the essence of norm is distance, and its significance is to achieve comparison, so we can use a variety of distance indicators to measure distance. Here, we use one norm, two norms, and infinite norms for comprehensive judgment. They are also called Euclidean distance (ED), Manhattan distance (MD), and Chebyshev distance (CD).The three distances are the measurement parameters for the characteristics of image samples, and their expressions in two-dimensional space are in the following formulas:(5)d=x2−x12+y2−y12,(6)d=x1−x2+y1−y2,(7)d=maxx2−x1,y2−y1.


## 4.3. Semi-Supervised Learning

Semi-supervised learning (SSL) mainly aims at the problem of algorithm failure in the case of few-shot data. The characteristic of this strategy is that it does not introduce external information and introduces unlabeled samples with the help of few-shot sample labels and some criteria conditions, to make the greatest use of the information of unlabeled samples from various ways. The expansion of finite sample set is realized to better train the model.


## 4.4. The Idea of Ensemble Learning

The idea of ensemble learning is to combine multiple weak supervision models to achieve a more comprehensive strong supervision model. The common combination methods are average method, voting method, and learning method.By combining the different characteristics of multiple distance indicators, we use the idea of ensemble learning to select the pseudo-label samples closer to the labeled samples in the spatial domain. Because of the flexibility of the multiple distance indicators, it is possible to improve the reliability of the selected pseudo-label samples by integrating multiple distance indicators.


## 4.5. The SVM Self-Correction Classifier

The goal of the SVM classifier is to find a hyperplane to separate two classes of data, making the maximum margin between the samples. Multi-class classification can be realized by reusing SVM classifier. Among them, hyperplane refers to the separation surface that can divide the n-dimensional space into two parts. Support vector is the sample point closest to the classification hyperplane, and the geometric interval is usually used as the distance measure:(8)γi=yiωωTxi+bω.Among them,y represents the class label of the data point, and ω and b are the parameters of hyperplane ωTx+b=0. By continuous iterative training, the optimal hyperplane with the largest edge can be found. This iterative process is the training process of SVM classifier.In our strategy, SVM classifier is used to classify the feature vectors of camera photographs. After identifying the selected pseudo-label samples, we put few-shot labeled and selected pseudo-label samples with labels and multiple feature vectors into the SVM for training. Then, we test with these pseudo-label samples, thereby continually iterating and updating the labels of pseudo-label samples to complete the SVM self-correction training process.


## 5. Experimental Results and Analysis

### 5.1. Experimental Image Data Sets and Settings

To fully verify the effectiveness of distance based on semi-supervised ensemble learning, all experiments in this study use the public databases in the field of image forensics: Dresden database, VISION database, and SOCRatES database, which are some popular image data sets used in forensic research.In this experiment, we select 16 different classes of equipment in the Dresden database [23], 10 different classes of equipment in the VISION database [24], and 10 different types of equipment in the SOCRatES database [25]. The specific equipment information is shown in Tables 1–3. Among them, the number of training samples is limited, ranging from 5, 10, 15, 20, and 25 images of each class. The test set consists of 150 unlabeled samples for each class, which means 2400 (in the Dresden data set) and 1500 (in the VISION and SOCRatES data sets) image samples in total. Based on our dynamic threshold selection strategy, different numbers of pseudo-label samples (from 25 to 55) were selected for each class, from these unlabeled samples. We expanded the training set using the pseudo-label samples as training samples. The final result is a stable statistical result obtained by averaging the results after 10 random training tests.Table 1
Data set in experiments (Dresden).
Camera modelAbbr.Canon_IXUS 70C1Casio_EX-Z150C2FujiFilm_FinePix J50F1Kodak_M1063K1Nikon_CoolPix S710N1Nikon_D70N2Nikon_D200N3Olympus_Mju_1050SWO1Panasonic_DMC-FZ50P1Praktica_DCZ5.9P2Rollei_RCP-7325XSR1Samsung_L74WideSL1Samsung_NV15SN1Sony_DSC-H50SD1Sony_DSC-T77SD2Sony_DSC-W170SD3Table 2
Data set in experiments (VISION).
Camera modelAbbr.Samsung_Galaxy S3Sa1Apple_iPhone 4sAp1Huawei_P9Hu1LG_D290Lg1Apple_iPhone 5cAp2Apple_iPhone 6Ap3Lenovo_P70ALe1Samsung_Galaxy Tab 3Sa2Apple_iPhone 4Ap4Microsoft_Lumia 640 LTEMi1Table 3
Data set in experiments (SOC rates).
Camera modelAbbr.Apple iPhone 5sA1Apple iPhone 6A2Apple iPhone 6sA3Apple iPhone 7A4Asus Zenfone 2As1LG G3L1Motorola Moto GM1Samsung Galaxy A3SG1Samsung Galaxy S5SG2Samsung Galaxy S7 EdgeSG3


### 5.2. Algorithm Performance Evaluation and Analysis

In this study, the experiment with LBP features is labeled as the LBP-SVM method, and the experiment with CFA features is labeled as the CFA-SVM method. The experiment with double features is labeled as the multi-SVM method. At the same time, for the experiment with the DS method using only one kind of features, the method using only LBP features is called LBP-DS, the method using only CFA features is called CFA-DS, and the final method integrating the two features is called multi-DS.In this experiment, the number of training samples is 5, 10, 15, 20, and 25, respectively, which is to simulate the situation of different numbers of training samples, and there are two thresholds in this strategy. We conducted detailed experiments on each data set.For the pseudo-label distance threshold ofm, we tested the accuracy when the number of training samples was 5, 10, 15, 20, and 25, respectively. The pseudo-label distance threshold m ranges from 5 to 50, representing the number of unlabeled samples of each class selected based on multi-distance indicators. By testing the pseudo-label distance threshold m with different sample numbers, we finally determined that the parameter m is 10, as shown in Figure 4.Figure 4
Accuracy versus the pseudo-label distance thresholdm on multiple data sets, with respect to the size of labeled sample set n=5,10,15,20,25 for each label. (a) Dresden. (b) VISION. (c) SOCRatES.
(a)(b)(c)For the statistical number thresholdt, the experimental results are shown in Tables 4–6. When the number of training samples of each class is 5, 10, 15, 20, and 25, respectively, we test the accuracy of the value of different statistical time threshold t. For each labeled sample, we selected the nearest m unlabeled samples according to three distance thresholds. According to the number of times these unlabeled samples were selected, we set threshold t for each camera class, indicating the minimum number of times each unlabeled sample needs to be selected to be marked as a valid pseudo-labeled sample, that is, the statistical time threshold t. Finally, for different numbers of training samples, the threshold t of statistical times we choose is 3, 5, 6, 7, and 8, respectively. The reason why the threshold is selected in this way is that when the threshold is increased again, unlabeled samples will not be selected for some classes. When the threshold is reduced, the selected samples will be increased, resulting in a decrease in the purity of the selected sample set.Table 4
Effect of statistical number thresholdt on accuracy (%) (Dresden data set).
Thresholdt510152025171.2175.4278.9680.3880.54272.3377.0879.9683.2584.96372.5076.7980.0283.3384.21455.7576.0880.1782.9683.21544.5476.6379.2583.6382.38639.7974.0079.5483.0085.50745.4264.0478.5084.2985.46841.0071.5875.7181.7986.04Table 5
Effect of statistical number thresholdt on accuracy (%) (VISION data set).
Thresholdt510152025177.6081.4788.2788.7389.07282.1383.9388.0088.7390.87382.2783.2087.0789.0090.73475.2779.8787.8787.6091.20566.4785.4088.1389.4791.40670.0781.2789.8089.1390.47771.6779.4085.6789.6791.27857.6067.9385.3388.6091.53Table 6
Effect of statistical number thresholdt on accuracy (%) (SOCRatES data set).
Thresholdt510152025152.5366.0070.5376.0775.53253.0067.2770.2774.8777.87352.5367.8069.8776.8778.33452.6067.0766.7372.8076.87552.3368.1368.5374.6076.93648.1364.6070.7374.8778.73747.7364.7370.2076.2779.20847.0762.3369.2076.8080.40In this study, 10 random experiments were carried out on several databases, and the results were averaged. The final experimental results in the three experimental databases are shown in Figures5–7, and the confusion matrices between different classes are shown in Tables 7–9.Figure 5
Results of multi-DS strategy (%) (Dresden database).Figure 6
Results of multi-DS strategy (%) (VISION database).Figure 7
Results of multi-DS strategy (%) (SOCRatES database).Table 7
Average confusion matrix obtained by SVM classification over 20 iterations (%) (Dresden database).
C1C2F1K1N1N2N3O1P1P2R1SL1SN1SD1SD2SD3C197.50.70.2—0.20.1—0.30.10.30.10.5————C22.290.90.10.10.7———0.60.8—3.6—0.30.50.2F10.1—86.30.1—0.40.30.11.81.58.20.50.5——0.1K1——0.394.6—0.73.6——0.7——0.1———N10.72.3—0.792.21.30.80.2—0.4—1.4————N20.50.7—1.10.791.93.30.1—0.30.40.70.3———N3——0.50.8—2.995.0—0.11.00.2——0.10.3—O12.2—0.30.20.10.50.593.50.10.30.12.10.1———P10.10.90.10.1—0.12.00.193.70.20.12.20.2—0.10.1P20.41.30.91.42.12.6——0.887.21.9—1.20.1—0.1R1—0.13.70.10.52.20.10.1—1.090.40.41.4———SL11.02.10.1—0.91.30.20.30.80.40.592.00.4———SN1—0.91.40.80.10.60.10.10.74.32.40.787.40.5——SD10.10.10.30.1——0.9—0.20.30.4—0.266.53.727.2SD2——0.2———0.7——0.10.40.2—2.093.92.5SD3—0.10.1———0.7——0.10.1——50.21.347.4The bold values (diagonal values) indicate that the prediction labels of the model are equal to the real labels, that is, the accuracy of the correctly classified results.Table 8
Confusion matrix of the results of multi-DS (%) (VISION database).
Sa1Ap1Hu1Lg1Ap2Ap3Le1Sa2Ap4Mi1Sa193.50.12.50.90.41.60.80.3——Ap1—76.21.91.212.04.02.60.9—1.1Hu11.22.687.72.90.22.13.2———Lg10.10.32.690.91.01.33.6——0.1Ap20.18.90.71.284.03.00.70.60.10.7Ap30.62.92.11.83.986.31.70.7——Le10.10.21.51.90.70.295.1——0.4Sa20.9—0.80.1———98.2——Ap4—0.1——0.40.2——98.90.4Mi10.10.51.01.40.20.50.5—0.395.6The bold values (diagonal values) indicate that the prediction labels of the model are equal to the real labels, that is, the accuracy of the correctly classified results.Table 9
Confusion matrix of the results of multi-DS (%) (SOCRatES database).
A1A2A3A4As1L1M1SG1SG2SG3A181.66.45.42.80.50.20.40.71.60.3A24.671.46.55.00.91.02.72.82.52.6A33.47.178.85.21.80.10.40.60.81.8A43.33.99.176.82.10.51.50.40.91.4As11.00.52.83.885.61.91.21.11.40.8L10.40.90.31.32.888.51.00.73.40.6M10.52.51.05.13.20.981.91.22.21.5SG12.31.40.30.30.50.10.888.02.63.6SG23.04.20.82.02.16.31.52.886.01.3SG30.21.61.71.82.81.51.62.61.085.2The bold values (diagonal values) indicate that the prediction labels of the model are equal to the real labels, that is, the accuracy of the correctly classified results.As shown in Figure5, in the experiment of Dresden data set, when the number of training samples is 5, the accuracy of CFA-DS method is 18.6% higher than that of the CFA-SVM method, which fully reflects that the CFA-DS method has much better performance than the CFA-SVM method in the case of few-shot samples. However, in terms of LBP features, the performance of LBP-DS method is not satisfactory. Therefore, this study considers using the idea of ensemble learning to combine LBP features and CFA features, that is, multi-DS method, and carries out subsequent experiments on other data sets.Table7 shows the confusion matrix obtained by repeating the experiment 10 times when the number of training samples of multi-DS method is 25. Where the accuracy is less than 0.1%, it is marked as “—.” Through the confusion matrix, we can see that Sony_DSC-H50 (SD1) model and Sony_DSC-W170 (SD3) model are 66.5% and 47.4%, respectively, and the degree of mutual confusion is the greatest. Through consulting the data, we find that the results are still the same in many previous research works, which are the same as that in the strategy proposed in this study. This is because the cameras of the two models adopt similar image post-processing algorithms. The difference between camera models is very low.From the results of multiple experimental data sets, the performance improvement is more obvious when the number of training samples is less. The three experimental databases show similar results, which shows that the strategy proposed in this study is a good solution to the problem of few-shot samples. Therefore, the experimental results of this study can fully reflect the wide applicability and universality of the strategy proposed in this study and help to solve the actual judicial evidence problem of insufficient known samples.At the same time, to validate the stability of the model, we conduct a set of stability experiments. When the number of samples in each class is quite small, randomly selected samples may not necessarily represent the whole sample population. Therefore, when the number of few-shot samples in each class is only 5, we conduct 20 experiments and average the results as shown in Table10. We thicken the maximum and minimum values in each data set. The experimental results show that our model is not stable with few-shot samples.Table 10
Stability analysis with 5 few-shot samples per class.
ResultsDresdenVISIONSOCRatES178.8376.5359.80278.6478.6058.80372.1371.0062.27475.7972.3360.33572.9683.0761.47672.8877.4061.93769.5874.8762.33864.2980.0059.67978.4269.2065.601075.2177.1356.671176.5480.0757.671279.2177.4057.731369.2175.6361.871470.0074.6051.271569.3372.8761.331677.4278.2761.131777.2176.0062.601873.2574.0757.271976.2573.7363.402067.8377.7358.33Average73.7576.0360.07The bold values represent the maximum value, minimum value, and average value of each column to indicate the variation range.In addition, we compare the proposed multi-DS strategy with other existing methods to verify the performance of our strategy. We reselected 14 (in the Dresden data set), 11 (in the VISION data set), and 10 (in the SOCRatES data set) camera models and 10 labeled samples of each class. These reselected camera classes have the same class settings as the data set in the paper [19] to ensure fairness in our performance evaluation. The experimental results between us and other existing methods are shown in Table 11. In the same experimental setup, our experimental results have better performance than other existing methods.Table 11
Camera identification accuracy compared with the previous methods (%).
MethodDresdenVISIONSOCRatESEP [17]73.8479.9463.91MTDEM [26]75.1680.4964.84Deep Siamese85.3075.20—Network [19]Multi-DS86.0885.5667.00The bold values indicates the maximum value of each column to indicate the best performing approach on each dataset.In addition, we added the experiment of the influence of the number of classes on the classification accuracy. The independent variables range from only part of the data set at the model level to the complete data set. The number of camera model classes in the Dresden database ranges from 14 to 27 (the whole data set), while the number of classes in VISION database ranges from 11 to 35 (the whole data set). The experimental results show that the classification accuracy will gradually decrease when the number of models increases. We verified this result on the Dresden and VISION databases in Figures8 and 9, which is consistent with the results in [19].Figure 8
Impact of number of classes on accuracy (Dresden database).Figure 9
Impact of number of classes on accuracy (VISION database).


## 5.1. Experimental Image Data Sets and Settings

To fully verify the effectiveness of distance based on semi-supervised ensemble learning, all experiments in this study use the public databases in the field of image forensics: Dresden database, VISION database, and SOCRatES database, which are some popular image data sets used in forensic research.In this experiment, we select 16 different classes of equipment in the Dresden database [23], 10 different classes of equipment in the VISION database [24], and 10 different types of equipment in the SOCRatES database [25]. The specific equipment information is shown in Tables 1–3. Among them, the number of training samples is limited, ranging from 5, 10, 15, 20, and 25 images of each class. The test set consists of 150 unlabeled samples for each class, which means 2400 (in the Dresden data set) and 1500 (in the VISION and SOCRatES data sets) image samples in total. Based on our dynamic threshold selection strategy, different numbers of pseudo-label samples (from 25 to 55) were selected for each class, from these unlabeled samples. We expanded the training set using the pseudo-label samples as training samples. The final result is a stable statistical result obtained by averaging the results after 10 random training tests.Table 1
Data set in experiments (Dresden).
Camera modelAbbr.Canon_IXUS 70C1Casio_EX-Z150C2FujiFilm_FinePix J50F1Kodak_M1063K1Nikon_CoolPix S710N1Nikon_D70N2Nikon_D200N3Olympus_Mju_1050SWO1Panasonic_DMC-FZ50P1Praktica_DCZ5.9P2Rollei_RCP-7325XSR1Samsung_L74WideSL1Samsung_NV15SN1Sony_DSC-H50SD1Sony_DSC-T77SD2Sony_DSC-W170SD3Table 2
Data set in experiments (VISION).
Camera modelAbbr.Samsung_Galaxy S3Sa1Apple_iPhone 4sAp1Huawei_P9Hu1LG_D290Lg1Apple_iPhone 5cAp2Apple_iPhone 6Ap3Lenovo_P70ALe1Samsung_Galaxy Tab 3Sa2Apple_iPhone 4Ap4Microsoft_Lumia 640 LTEMi1Table 3
Data set in experiments (SOC rates).
Camera modelAbbr.Apple iPhone 5sA1Apple iPhone 6A2Apple iPhone 6sA3Apple iPhone 7A4Asus Zenfone 2As1LG G3L1Motorola Moto GM1Samsung Galaxy A3SG1Samsung Galaxy S5SG2Samsung Galaxy S7 EdgeSG3


## 5.2. Algorithm Performance Evaluation and Analysis

In this study, the experiment with LBP features is labeled as the LBP-SVM method, and the experiment with CFA features is labeled as the CFA-SVM method. The experiment with double features is labeled as the multi-SVM method. At the same time, for the experiment with the DS method using only one kind of features, the method using only LBP features is called LBP-DS, the method using only CFA features is called CFA-DS, and the final method integrating the two features is called multi-DS.In this experiment, the number of training samples is 5, 10, 15, 20, and 25, respectively, which is to simulate the situation of different numbers of training samples, and there are two thresholds in this strategy. We conducted detailed experiments on each data set.For the pseudo-label distance threshold ofm, we tested the accuracy when the number of training samples was 5, 10, 15, 20, and 25, respectively. The pseudo-label distance threshold m ranges from 5 to 50, representing the number of unlabeled samples of each class selected based on multi-distance indicators. By testing the pseudo-label distance threshold m with different sample numbers, we finally determined that the parameter m is 10, as shown in Figure 4.Figure 4
Accuracy versus the pseudo-label distance thresholdm on multiple data sets, with respect to the size of labeled sample set n=5,10,15,20,25 for each label. (a) Dresden. (b) VISION. (c) SOCRatES.
(a)(b)(c)For the statistical number thresholdt, the experimental results are shown in Tables 4–6. When the number of training samples of each class is 5, 10, 15, 20, and 25, respectively, we test the accuracy of the value of different statistical time threshold t. For each labeled sample, we selected the nearest m unlabeled samples according to three distance thresholds. According to the number of times these unlabeled samples were selected, we set threshold t for each camera class, indicating the minimum number of times each unlabeled sample needs to be selected to be marked as a valid pseudo-labeled sample, that is, the statistical time threshold t. Finally, for different numbers of training samples, the threshold t of statistical times we choose is 3, 5, 6, 7, and 8, respectively. The reason why the threshold is selected in this way is that when the threshold is increased again, unlabeled samples will not be selected for some classes. When the threshold is reduced, the selected samples will be increased, resulting in a decrease in the purity of the selected sample set.Table 4
Effect of statistical number thresholdt on accuracy (%) (Dresden data set).
Thresholdt510152025171.2175.4278.9680.3880.54272.3377.0879.9683.2584.96372.5076.7980.0283.3384.21455.7576.0880.1782.9683.21544.5476.6379.2583.6382.38639.7974.0079.5483.0085.50745.4264.0478.5084.2985.46841.0071.5875.7181.7986.04Table 5
Effect of statistical number thresholdt on accuracy (%) (VISION data set).
Thresholdt510152025177.6081.4788.2788.7389.07282.1383.9388.0088.7390.87382.2783.2087.0789.0090.73475.2779.8787.8787.6091.20566.4785.4088.1389.4791.40670.0781.2789.8089.1390.47771.6779.4085.6789.6791.27857.6067.9385.3388.6091.53Table 6
Effect of statistical number thresholdt on accuracy (%) (SOCRatES data set).
Thresholdt510152025152.5366.0070.5376.0775.53253.0067.2770.2774.8777.87352.5367.8069.8776.8778.33452.6067.0766.7372.8076.87552.3368.1368.5374.6076.93648.1364.6070.7374.8778.73747.7364.7370.2076.2779.20847.0762.3369.2076.8080.40In this study, 10 random experiments were carried out on several databases, and the results were averaged. The final experimental results in the three experimental databases are shown in Figures5–7, and the confusion matrices between different classes are shown in Tables 7–9.Figure 5
Results of multi-DS strategy (%) (Dresden database).Figure 6
Results of multi-DS strategy (%) (VISION database).Figure 7
Results of multi-DS strategy (%) (SOCRatES database).Table 7
Average confusion matrix obtained by SVM classification over 20 iterations (%) (Dresden database).
C1C2F1K1N1N2N3O1P1P2R1SL1SN1SD1SD2SD3C197.50.70.2—0.20.1—0.30.10.30.10.5————C22.290.90.10.10.7———0.60.8—3.6—0.30.50.2F10.1—86.30.1—0.40.30.11.81.58.20.50.5——0.1K1——0.394.6—0.73.6——0.7——0.1———N10.72.3—0.792.21.30.80.2—0.4—1.4————N20.50.7—1.10.791.93.30.1—0.30.40.70.3———N3——0.50.8—2.995.0—0.11.00.2——0.10.3—O12.2—0.30.20.10.50.593.50.10.30.12.10.1———P10.10.90.10.1—0.12.00.193.70.20.12.20.2—0.10.1P20.41.30.91.42.12.6——0.887.21.9—1.20.1—0.1R1—0.13.70.10.52.20.10.1—1.090.40.41.4———SL11.02.10.1—0.91.30.20.30.80.40.592.00.4———SN1—0.91.40.80.10.60.10.10.74.32.40.787.40.5——SD10.10.10.30.1——0.9—0.20.30.4—0.266.53.727.2SD2——0.2———0.7——0.10.40.2—2.093.92.5SD3—0.10.1———0.7——0.10.1——50.21.347.4The bold values (diagonal values) indicate that the prediction labels of the model are equal to the real labels, that is, the accuracy of the correctly classified results.Table 8
Confusion matrix of the results of multi-DS (%) (VISION database).
Sa1Ap1Hu1Lg1Ap2Ap3Le1Sa2Ap4Mi1Sa193.50.12.50.90.41.60.80.3——Ap1—76.21.91.212.04.02.60.9—1.1Hu11.22.687.72.90.22.13.2———Lg10.10.32.690.91.01.33.6——0.1Ap20.18.90.71.284.03.00.70.60.10.7Ap30.62.92.11.83.986.31.70.7——Le10.10.21.51.90.70.295.1——0.4Sa20.9—0.80.1———98.2——Ap4—0.1——0.40.2——98.90.4Mi10.10.51.01.40.20.50.5—0.395.6The bold values (diagonal values) indicate that the prediction labels of the model are equal to the real labels, that is, the accuracy of the correctly classified results.Table 9
Confusion matrix of the results of multi-DS (%) (SOCRatES database).
A1A2A3A4As1L1M1SG1SG2SG3A181.66.45.42.80.50.20.40.71.60.3A24.671.46.55.00.91.02.72.82.52.6A33.47.178.85.21.80.10.40.60.81.8A43.33.99.176.82.10.51.50.40.91.4As11.00.52.83.885.61.91.21.11.40.8L10.40.90.31.32.888.51.00.73.40.6M10.52.51.05.13.20.981.91.22.21.5SG12.31.40.30.30.50.10.888.02.63.6SG23.04.20.82.02.16.31.52.886.01.3SG30.21.61.71.82.81.51.62.61.085.2The bold values (diagonal values) indicate that the prediction labels of the model are equal to the real labels, that is, the accuracy of the correctly classified results.As shown in Figure5, in the experiment of Dresden data set, when the number of training samples is 5, the accuracy of CFA-DS method is 18.6% higher than that of the CFA-SVM method, which fully reflects that the CFA-DS method has much better performance than the CFA-SVM method in the case of few-shot samples. However, in terms of LBP features, the performance of LBP-DS method is not satisfactory. Therefore, this study considers using the idea of ensemble learning to combine LBP features and CFA features, that is, multi-DS method, and carries out subsequent experiments on other data sets.Table7 shows the confusion matrix obtained by repeating the experiment 10 times when the number of training samples of multi-DS method is 25. Where the accuracy is less than 0.1%, it is marked as “—.” Through the confusion matrix, we can see that Sony_DSC-H50 (SD1) model and Sony_DSC-W170 (SD3) model are 66.5% and 47.4%, respectively, and the degree of mutual confusion is the greatest. Through consulting the data, we find that the results are still the same in many previous research works, which are the same as that in the strategy proposed in this study. This is because the cameras of the two models adopt similar image post-processing algorithms. The difference between camera models is very low.From the results of multiple experimental data sets, the performance improvement is more obvious when the number of training samples is less. The three experimental databases show similar results, which shows that the strategy proposed in this study is a good solution to the problem of few-shot samples. Therefore, the experimental results of this study can fully reflect the wide applicability and universality of the strategy proposed in this study and help to solve the actual judicial evidence problem of insufficient known samples.At the same time, to validate the stability of the model, we conduct a set of stability experiments. When the number of samples in each class is quite small, randomly selected samples may not necessarily represent the whole sample population. Therefore, when the number of few-shot samples in each class is only 5, we conduct 20 experiments and average the results as shown in Table10. We thicken the maximum and minimum values in each data set. The experimental results show that our model is not stable with few-shot samples.Table 10
Stability analysis with 5 few-shot samples per class.
ResultsDresdenVISIONSOCRatES178.8376.5359.80278.6478.6058.80372.1371.0062.27475.7972.3360.33572.9683.0761.47672.8877.4061.93769.5874.8762.33864.2980.0059.67978.4269.2065.601075.2177.1356.671176.5480.0757.671279.2177.4057.731369.2175.6361.871470.0074.6051.271569.3372.8761.331677.4278.2761.131777.2176.0062.601873.2574.0757.271976.2573.7363.402067.8377.7358.33Average73.7576.0360.07The bold values represent the maximum value, minimum value, and average value of each column to indicate the variation range.In addition, we compare the proposed multi-DS strategy with other existing methods to verify the performance of our strategy. We reselected 14 (in the Dresden data set), 11 (in the VISION data set), and 10 (in the SOCRatES data set) camera models and 10 labeled samples of each class. These reselected camera classes have the same class settings as the data set in the paper [19] to ensure fairness in our performance evaluation. The experimental results between us and other existing methods are shown in Table 11. In the same experimental setup, our experimental results have better performance than other existing methods.Table 11
Camera identification accuracy compared with the previous methods (%).
MethodDresdenVISIONSOCRatESEP [17]73.8479.9463.91MTDEM [26]75.1680.4964.84Deep Siamese85.3075.20—Network [19]Multi-DS86.0885.5667.00The bold values indicates the maximum value of each column to indicate the best performing approach on each dataset.In addition, we added the experiment of the influence of the number of classes on the classification accuracy. The independent variables range from only part of the data set at the model level to the complete data set. The number of camera model classes in the Dresden database ranges from 14 to 27 (the whole data set), while the number of classes in VISION database ranges from 11 to 35 (the whole data set). The experimental results show that the classification accuracy will gradually decrease when the number of models increases. We verified this result on the Dresden and VISION databases in Figures8 and 9, which is consistent with the results in [19].Figure 8
Impact of number of classes on accuracy (Dresden database).Figure 9
Impact of number of classes on accuracy (VISION database).


## 6. Conclusion

In this study, we solve the problem of few-shot label classification in source camera recognition. Due to the practical significance of the few-shot label scenario, it is very important to deal with this challenge effectively. Therefore, we propose a (multi-DS) strategy to solve this problem. Through the ensemble learning of various types of distance indicators and the self-correction of SVM to obtain the unlabeled sample information, the available information is effectively supplemented. Our experimental results show that this strategy can effectively improve the image traceability accuracy when facing few-shot sample data sets and provide a good solution for the actual judicial forensic problem with insufficient number of known samples. In the future work, the actual judicial forensic task of source camera identification with fewer shot samples or in extreme cases deserves our attention and discussion.



---

*Source: 8716884-2022-09-06.xml*