# Secure Data Deduplication System with Cyber Security Multikey Management in Cloud Storage

Authors: R. Nandha Kumar; T. Sathiya; Harish Chandra Mohanta; Sayed Sayeed Ahmad; Ankit Kumar; Ghalib H. Alshammri; Henry Kwame Atiglah
Journal: Security and Communication Networks
 (2022)

---

## Abstract

Object detection is essential in a video surveillance system. To recognize an item in a movie, we first examine each picture pixel by pixel. The Secure Data Deduplication system in segmentation is the process of separating distinct picture components into pixels in digital image processing. The performance of segmentation is influenced by irregular and/or poor lighting. These characteristics have a significant impact on the video surveillance system’s real-time object detection process. A multikey management system based on a modified ResNet model is presented in this research (M-ResNet). Cyber security is a suggested algorithm application that is used to improve images that are influenced by a lack of light. The experimental findings reveal a significant improvement in detecting objects in the video stream as compared to the present technique output and modification architecture of the ResNet model. The suggested model achieves superior results in measures like precision, recall, and pixel accuracy, as well as a decent increase in object recognition.


---

## Body

## 1. Introduction

Indexing of fingerprints identifies duplicate and nonduplicate data chunks after the chunking and fingerprinting steps of the deduplication system. An earlier deduplication technique stores the complete chunk fingerprint index in memory for quick redundant data identification. However, due to the exponentially expanding index size of the deduplication system, fast increasing data volume results in a high number of fingerprints created, which overflows the RAM capacity. As a result, frequent access to low-speed storage drives for fingerprint-index search drastically limits throughput. Some data deduplication systems have limited accessing throughput to the on-disk fingerprint index, resulting in a significant performance bottleneck. Random accesses to the on-disk index are substantially slower than those to the on-RAM index. However, the additional hardware costs associated with on-RAM indexing have grown too high. The texture of the fingerprint image is stored on the hard disc of the system, which improves the training and testing process. On the other hand, on-disk fingerprint indexing lowers RAM overhead costs for deduplication indexing. Flash-based indexing strategies raise the hardware expenses of deduplication systems. Cluster deduplication technologies provide scalability for vast storage systems at the expense of a low deduplication ratio or need more resources to achieve a high deduplication ratio. To improve storage space efficiency, deduplication technology is mostly used on disk-based secondary permanent storage. However, typical on-disk indexing techniques are plagued by two significant issues. The duplicate-lookup disc bottleneck is the first technical difficulty, and the storage node island effect is the second important concern. Traditional indexing methods save the complete index of data pieces.As a result, as data volume grows, the index becomes too huge to contain whole hash values. In this circumstance, the deduplicate process finds it difficult to handle the search fingerprints in an on-disk index, reducing efficiency and lowering system performance. The second problem is overcoming the storage node island effect in order to reduce duplicates inside main or backup storage, which is not possible in distributed multiple storage nodes.Image processing in low-light environments is a difficult problem, especially in video surveillance systems. Because of the absence of light, the picture quality is automatically reduced. A large amount of picture information has been warped, affecting image processing applications such as object recognition, object tracking, and segmentation. Because of the automated identification of anomalous occurrences, object detection plays a significant role in video surveillance systems. Detecting objects in a video stream requires additional calculations because of the vast quantity of data, and the picture captured from the video sequence must be of excellent quality. The illumination in a real-world situation is inconsistent, especially at night. Even if the video camera quality is excellent, the retrieved pictures from the video stream may be of poor quality. Image segmentation is the most important phase in image data processing [1]. The fundamental aim of image segmentation is to divide the picture into various semantic sections. Low-quality photos, especially those collected from recorded movies at night, will have an impact on the accuracy of image interpretation. Various ways may be employed to improve visualization. For recognizing lighting sections in segmented scenes, the nonuniform illumination previous model [2] is presented. Convolutional neural networks are a mathematical model that consists of a large number of processing units that operate simultaneously on various sets of data [3]. CNN has a number of layers that recognize essential aspects of picture data without the need for human intervention [4]. The greater the number of layers, the greater the accuracy of the result. When deeper networks are added, performance rises to a certain point before dramatically degrading [5]. In other words, adding additional layers results in more training errors.According to Figure1, the 56-layer CNN architecture has a higher error rate on both testing and training datasets than the 20-layer CNN architecture. ResNet (residual network) is a kind of deep learning model [6] composed of residual blocks. There is a direct link that bypasses certain model levels. The residual block is a collection of layers in which the layer’s output is combined with another layer in the block [7]. This bypass connection is known as a skip connection or shortcut connection, as seen in Figure 2. These residual blocks, when joined, produced residual networks.Figure 1
Training error in 56- and 20-layer deeper network.Figure 2
Basic building block of residual learning.The training phase of a residual network is less difficult than that of regular deeper neural networks, and adding additional layers leads to higher training errors. Residual networks (ResNets) are used to mitigate training mistakes in deeper networks. ResNet is an efficient method for finding features in the salient region [8]. To increase the high-level and low-level semantic characteristics, two distinct residual networks are applied. ResNet offers shortcut connections that allow it to circumvent the insufficient training layers by mapping high-level features to low-level features. We need to improve the picture from low quality owing to limited light to optimum quality so that it can be processed effectively to identify the items. Several image-enhancing techniques have previously been developed, which may be divided into two categories: statistical-based approaches and decomposition-based approaches [9]. The lighting component is detected, and noise is minimized using volume-based subspace analysis.This paper’s significant contributions are summarised as follows: We offer modified ResNet (M-ResNet), which includes bilateral and adaptive supersampling procedures as additional convolution layers inside the original ResNet CNN architecture.The proposed operation consists of residual units that improve image quality from low illumination to normal illumination. If the image already has a good lighting environment, the proposed residual units are skipped to avoid unnecessary computations. The introduced residual unit removes noise and strengthens the edges of each object present in the captured image. While comparing current approaches, the suggested method achieves the desirable improvements.The Content Defined Chunking (CDC) algorithm divides a data stream into variable-size chunks addresses and the Fixed-Size Chunking (FSC) boundary-shifting issue by stating deduplication efficiency of storage systems is greatly improved by using chunk boundaries. To deliver the essential services, a good CDC algorithm should have the main qualities and the following characteristics for effective data deduplication:(1)
Defined content: the CDC algorithm should create chunk boundaries depending on data, which are contents to eliminate the boundary-shift issue.(2)
Reduced calculation overhead: current CDC algorithms verify almost every byte of data. The input data stream to determine the chunk boundary rapidly rises. Due to the long execution time, deduplication throughput is limited. Throughput is increased using the chunking algorithm with the reduction in time consumption.(3)
Variation in chunk size: variation in chunk size has a significant influence on identifying maximal redundancy and boosting deduplication system speed by increasing deduplication efficiency, i.e., TTTD.(4)
Effective for low-entropy strings: the data stream’s contents may change from time to time, consisting of low-entropy strings with a significant number of repeating bytes. It is preferable to discover and delete these duplicate strings to attain greater results.(5)
Efficiency of deduplication.(6)
Fewer chunk size restrictions: maximum and minimum criteria are often used, enforced to decrease computing costs by avoiding too tiny parts.By avoiding too big data, you can improve your deduplication ratio. These thresholds, on the one hand, restrict lessen the variation in chunk size but on the other hand makes the chunk borders position dependent. As a result of not being completely content specified, this affects deduplication efficiency.The remainder of the paper is organized as follows: Section2 discusses the object identification process using several approaches such as low light, Gaussian distribution, probabilistic model, background removal, and graph-based algorithms. Section 3 outlines the suggested work; it demonstrates how the picture may be improved from low light by superimposing large- and small-scale bilateral operation components. Section 4 validates the proposed model using various kinds of datasets and compares it to related data. Section 5 summarizes the paper’s actual work and suggests potential future possibilities.


## 2. Related Work

### 2.1. Object Detection in Low-Light Environment

Detecting things in low-light conditions is a difficult problem in a surveillance system. Due to inadequate lighting, the acquired photographs include a lot of black patches and noise in the picture information. Existing deep learning approaches are incapable of performing effectively in low-light environments. The inconsistent distribution of brightness makes object categorization challenging in this setting. The collected picture from a low-light environment must be improved in order to recognize objects accurately. The following drawbacks exist in the process of upgrading low-light photos using deep learning methods:(i)
Complex structure and a large number of parameters are required(ii)
More layers and computing are required(iii)
The training requires a paired dataset, which is challenging to achieve in realityThe aforementioned difficulties cause object detection systems to perform poorly and waste more computer resources. As a result, a simple technique is required to address these difficulties. The volume-based subspace [9, 10] solves the first and second concerns by segregating the light area and noise in the picture. The light component in the subspace may be detected and separated using principle energy analysis [11]. In the volume-based subspace, noise may be reduced by using an adaptive truncation approach [12]. Deep noise suppression [13] and regularized lighting optimization [14] are two methods for noise reduction. To improve the picture in a low-light situation, a combination of refined lighting and an improved reflection map may be used. A Night Vision Detector (NVD) based on RFB-Net [15, 16] employs both the context fusion and feature pyramid networks. Various lighting data may be modelled individually in this case, even if they interfere with each other throughout the training phase. The third problem may be addressed by the new RetinexGAN and EnlightenGAN models [17]. The training phase employs completely unpaired datasets, and the model employs a basic generative adversarial network. Another technique, built by a pipelined convolutional neural network with a Gaussian kernel and based on multiscale Retinex and discrete wavelet transformation [18], conducts denoising and picture enhancing nets. The image enhancement function in this architecture is learned from a pair of dark and bright images.


### 2.2. Detection of Objects by Applying the Gaussian Distribution

Changes in lighting and noise corruption have a significant impact on the effectiveness of the change detection algorithms. The current noise has a significant impact on the interaction between neighboring pixels. The salience augmentation method [19, 20] improves object saliency weight information. By suppressing background information using a Gaussian mixture model [21], the feature difference between modified and unaffected areas may be identified. Denoising methodologies [22] such as blind global image fusion [23] and Fusion Net gives better results. It uses a Bayesian method to assess the optimality of the training network’s noise level and unobserved Gaussian noise levels. When compared to the Point Distribution Model, the Gaussian Process Morphable Model (GPMM) [24] effectively specifies the covariance function. In modern registration systems, this GPMM incorporates several kernel functions. Shape variations may be accurately simulated using the Gaussian process. The multivariate Gaussian technique [25] may describe normal data in deep feature representations. It is also efficient to transfer learned representations from big datasets like ImageNet to small datasets. The present Gaussian mixture modeling (GMM) approach for background removal is heavily influenced by noise and dynamic background [26]. GMM background subtraction method demonstrates the background reduction by eliminating zeros in the pixels value [27]. For successful results, the background model is first rebuilt by averaging picture blocks, then the noise information is removed, and lastly, the background information is updated.


### 2.3. Detection of Objects Using Probabilistic Methods

Because medical pictures include dynamic image intensity and changing boundary information, standard image segmentation algorithms are unsuitable for Ultra Sound images. To address this problem, Bayesian CNN [28] may be used on Ultra Sound pictures to produce random predictions based on probability distributions. The likelihood may be calculated using a combination of MRI volumes and femoral cartilage outlines in this method. The maximization (EM) approach is often used to simulate brain image expectation. For whatever amount of noise, these approaches also need certain unique denoising algorithms [29]. Another technique [30] is to supplement the probabilistic atlas, which has information about healthy tissue, with a latent atlas, which contains information about lesions. The semantic meaning of the tissues is provided by this generative probabilistic model and discriminative extensions. The author [31] creates a novel method that uses the probability distribution of both the object and the backdrop to get a more accurate segmentation result. The suggested approach maximizes the difference between the background and Gaussian mixture distributions. This probability-based approach is used on several imaging modalities such as dermoscopy, chromoendoscope, and MRI. The presence of thin clouds in remote sensing image processing might reduce the efficacy of cloud identification methods. Before processing remote sensing photos, the cloud material must be removed. The author [29] offers a deep learning cloud detection technique that combines an attention mechanism with probability upsampling. The method is concerned with the link between spatial dimension and multispectral picture of spectral segments. The full convolutional network converts single label retrieval into multilabel retrieval [32], and selecting the proper sample pattern is critical for reconstructing high-quality pictures [33]. A sampling strategy based on a probability mass function may dynamically modify the sample rate depending on data acquired in advance. This static incremental sampling approach with probability mass function eliminates sampling latency, allowing for high-quality picture reconstruction.


### 2.4. Detecting Objects Using Background Subtraction Methods

The background subtraction approach is crucial for distinguishing between a static backdrop and a moving item. Background modifications will make this procedure more complicated and generate erroneous findings. As a result, the dynamic Auto Regressive Moving Average (ARMA) [34] model is used, which uses the spatial and temporal correlation of input pictures to create an appropriate model for the background image. The adaptive least mean square technique may be used to update the dynamic properties of the backdrop. The fuzzy histogram describes the temporal properties of the pixels by using fuzzy C means clustering with fuzzy nearness degree (FCFN) [35] background removal technique. It addresses the categorization problems for background and foreground items. Because of the enormous number of bands in hyperspectral images (HSIs), the dimension must be reduced before processing. After reducing the dimensionality of the HSI, the hyperspectral visual attention model (HVAM) [36] is used in anomaly detection to highlight the prominent features. We remove the noise using a curvature filter, and the first result may be achieved with the background subtraction approach. To reach the final result, the given partial result may be submitted to the adaptive weight approach. Lighting changes, both fast and gradual, have an effect on the background subtraction models. The adaptive local median texture feature [31] approach is presented to address this problem. The adaptive parameter threshold for foreground pixels is extracted. Using ALMT characteristics in foreground pixels, the background model samples are compared to video picture sequences. To get the optimum object identification performance in low-light conditions, the appropriate background removal algorithms and parameters must be used. The author [37] investigated several background subtraction algorithm settings in order to develop an optimum background subtraction technique with the essential characteristics for detecting falls at night.


### 2.5. Graph-Based Network Object Detection

Because the input flow between various neurons in a convolutional neural network may be viewed as a graph, building graph-based convolutional neural networks (GCNNs) is an emerging approach in image processing. GCNN may be separated into two categories depending on the filters used: spatial-based techniques and spectral-based approaches. The spatial technique is based on the aggregate of neighboring pixels. However, the spectral-based technique operates on an undirected graph. The lack of direction in the graphs has a significant impact on the learning process. The directed graph convolution network is powered by a fast localized convolution operator that can grow to huge graph sizes. There may be information loss of object boundaries in video salient object detection models. The author [38] combines the benefits of graph models with deep neural networks. The suggested solution incorporates a unified multistream architecture for video SOD. This design operates inside the context of GCN, which provides a technique for efficiently grouping the common superpixels. The study in [39] introduces a new attention module for encoding superpixels. Finally, smoothness awareness regularization ensures the homogeneity of the main items. Skeleton-based action recognition systems often use hierarchical GCN, which may result in joint feature information loss after lengthy diffusion. To increase the local context information of joints, the author [40] offers multiscale mixed dense graph CNN. Two modules, spatial and attention, are used to fine-tune the spatial-temporal aspects. This suggested approach offers a changeable kernel size for each layer, resulting in a flexible temporal graph [22].Few changes are required to improve image processing efficiency for image denoising challenges. To accomplish the network’s strong learning capacity, graph convolution layers may be implemented in trainable neural network design [39, 41–43], which discovers the relationship between hidden characteristics of the network. Every pixel is represented as a vertex in a graph convolution network [41], and dynamically determined similarities are represented as edges. The advantages of incorporating graph convolution into an existing CNN include dynamic generation of neighborhood graphs, the creation of nonlocal filters that aggregate feature weights [39], and the avoidance of preset parameter operations. The architecture employs both local and nonlocal similarities for adaptable functioning [42]. We combine the benefits of GNN and CNN [43] to address knowledge base completion using out-of-knowledge-based entities [44]. To transfer knowledge to entities that do not have knowledge, a novel technique is given that uses a weight matrix to describe the relationships in the KBC model. After learning the information between nodes in this design, transition matrices are used to build more expressive embeddings. The proposed transition-based knowledge graph model solves the knowledge base completion tasks by employing these parameter values [45].


## 2.1. Object Detection in Low-Light Environment

Detecting things in low-light conditions is a difficult problem in a surveillance system. Due to inadequate lighting, the acquired photographs include a lot of black patches and noise in the picture information. Existing deep learning approaches are incapable of performing effectively in low-light environments. The inconsistent distribution of brightness makes object categorization challenging in this setting. The collected picture from a low-light environment must be improved in order to recognize objects accurately. The following drawbacks exist in the process of upgrading low-light photos using deep learning methods:(i)
Complex structure and a large number of parameters are required(ii)
More layers and computing are required(iii)
The training requires a paired dataset, which is challenging to achieve in realityThe aforementioned difficulties cause object detection systems to perform poorly and waste more computer resources. As a result, a simple technique is required to address these difficulties. The volume-based subspace [9, 10] solves the first and second concerns by segregating the light area and noise in the picture. The light component in the subspace may be detected and separated using principle energy analysis [11]. In the volume-based subspace, noise may be reduced by using an adaptive truncation approach [12]. Deep noise suppression [13] and regularized lighting optimization [14] are two methods for noise reduction. To improve the picture in a low-light situation, a combination of refined lighting and an improved reflection map may be used. A Night Vision Detector (NVD) based on RFB-Net [15, 16] employs both the context fusion and feature pyramid networks. Various lighting data may be modelled individually in this case, even if they interfere with each other throughout the training phase. The third problem may be addressed by the new RetinexGAN and EnlightenGAN models [17]. The training phase employs completely unpaired datasets, and the model employs a basic generative adversarial network. Another technique, built by a pipelined convolutional neural network with a Gaussian kernel and based on multiscale Retinex and discrete wavelet transformation [18], conducts denoising and picture enhancing nets. The image enhancement function in this architecture is learned from a pair of dark and bright images.


## 2.2. Detection of Objects by Applying the Gaussian Distribution

Changes in lighting and noise corruption have a significant impact on the effectiveness of the change detection algorithms. The current noise has a significant impact on the interaction between neighboring pixels. The salience augmentation method [19, 20] improves object saliency weight information. By suppressing background information using a Gaussian mixture model [21], the feature difference between modified and unaffected areas may be identified. Denoising methodologies [22] such as blind global image fusion [23] and Fusion Net gives better results. It uses a Bayesian method to assess the optimality of the training network’s noise level and unobserved Gaussian noise levels. When compared to the Point Distribution Model, the Gaussian Process Morphable Model (GPMM) [24] effectively specifies the covariance function. In modern registration systems, this GPMM incorporates several kernel functions. Shape variations may be accurately simulated using the Gaussian process. The multivariate Gaussian technique [25] may describe normal data in deep feature representations. It is also efficient to transfer learned representations from big datasets like ImageNet to small datasets. The present Gaussian mixture modeling (GMM) approach for background removal is heavily influenced by noise and dynamic background [26]. GMM background subtraction method demonstrates the background reduction by eliminating zeros in the pixels value [27]. For successful results, the background model is first rebuilt by averaging picture blocks, then the noise information is removed, and lastly, the background information is updated.


## 2.3. Detection of Objects Using Probabilistic Methods

Because medical pictures include dynamic image intensity and changing boundary information, standard image segmentation algorithms are unsuitable for Ultra Sound images. To address this problem, Bayesian CNN [28] may be used on Ultra Sound pictures to produce random predictions based on probability distributions. The likelihood may be calculated using a combination of MRI volumes and femoral cartilage outlines in this method. The maximization (EM) approach is often used to simulate brain image expectation. For whatever amount of noise, these approaches also need certain unique denoising algorithms [29]. Another technique [30] is to supplement the probabilistic atlas, which has information about healthy tissue, with a latent atlas, which contains information about lesions. The semantic meaning of the tissues is provided by this generative probabilistic model and discriminative extensions. The author [31] creates a novel method that uses the probability distribution of both the object and the backdrop to get a more accurate segmentation result. The suggested approach maximizes the difference between the background and Gaussian mixture distributions. This probability-based approach is used on several imaging modalities such as dermoscopy, chromoendoscope, and MRI. The presence of thin clouds in remote sensing image processing might reduce the efficacy of cloud identification methods. Before processing remote sensing photos, the cloud material must be removed. The author [29] offers a deep learning cloud detection technique that combines an attention mechanism with probability upsampling. The method is concerned with the link between spatial dimension and multispectral picture of spectral segments. The full convolutional network converts single label retrieval into multilabel retrieval [32], and selecting the proper sample pattern is critical for reconstructing high-quality pictures [33]. A sampling strategy based on a probability mass function may dynamically modify the sample rate depending on data acquired in advance. This static incremental sampling approach with probability mass function eliminates sampling latency, allowing for high-quality picture reconstruction.


## 2.4. Detecting Objects Using Background Subtraction Methods

The background subtraction approach is crucial for distinguishing between a static backdrop and a moving item. Background modifications will make this procedure more complicated and generate erroneous findings. As a result, the dynamic Auto Regressive Moving Average (ARMA) [34] model is used, which uses the spatial and temporal correlation of input pictures to create an appropriate model for the background image. The adaptive least mean square technique may be used to update the dynamic properties of the backdrop. The fuzzy histogram describes the temporal properties of the pixels by using fuzzy C means clustering with fuzzy nearness degree (FCFN) [35] background removal technique. It addresses the categorization problems for background and foreground items. Because of the enormous number of bands in hyperspectral images (HSIs), the dimension must be reduced before processing. After reducing the dimensionality of the HSI, the hyperspectral visual attention model (HVAM) [36] is used in anomaly detection to highlight the prominent features. We remove the noise using a curvature filter, and the first result may be achieved with the background subtraction approach. To reach the final result, the given partial result may be submitted to the adaptive weight approach. Lighting changes, both fast and gradual, have an effect on the background subtraction models. The adaptive local median texture feature [31] approach is presented to address this problem. The adaptive parameter threshold for foreground pixels is extracted. Using ALMT characteristics in foreground pixels, the background model samples are compared to video picture sequences. To get the optimum object identification performance in low-light conditions, the appropriate background removal algorithms and parameters must be used. The author [37] investigated several background subtraction algorithm settings in order to develop an optimum background subtraction technique with the essential characteristics for detecting falls at night.


## 2.5. Graph-Based Network Object Detection

Because the input flow between various neurons in a convolutional neural network may be viewed as a graph, building graph-based convolutional neural networks (GCNNs) is an emerging approach in image processing. GCNN may be separated into two categories depending on the filters used: spatial-based techniques and spectral-based approaches. The spatial technique is based on the aggregate of neighboring pixels. However, the spectral-based technique operates on an undirected graph. The lack of direction in the graphs has a significant impact on the learning process. The directed graph convolution network is powered by a fast localized convolution operator that can grow to huge graph sizes. There may be information loss of object boundaries in video salient object detection models. The author [38] combines the benefits of graph models with deep neural networks. The suggested solution incorporates a unified multistream architecture for video SOD. This design operates inside the context of GCN, which provides a technique for efficiently grouping the common superpixels. The study in [39] introduces a new attention module for encoding superpixels. Finally, smoothness awareness regularization ensures the homogeneity of the main items. Skeleton-based action recognition systems often use hierarchical GCN, which may result in joint feature information loss after lengthy diffusion. To increase the local context information of joints, the author [40] offers multiscale mixed dense graph CNN. Two modules, spatial and attention, are used to fine-tune the spatial-temporal aspects. This suggested approach offers a changeable kernel size for each layer, resulting in a flexible temporal graph [22].Few changes are required to improve image processing efficiency for image denoising challenges. To accomplish the network’s strong learning capacity, graph convolution layers may be implemented in trainable neural network design [39, 41–43], which discovers the relationship between hidden characteristics of the network. Every pixel is represented as a vertex in a graph convolution network [41], and dynamically determined similarities are represented as edges. The advantages of incorporating graph convolution into an existing CNN include dynamic generation of neighborhood graphs, the creation of nonlocal filters that aggregate feature weights [39], and the avoidance of preset parameter operations. The architecture employs both local and nonlocal similarities for adaptable functioning [42]. We combine the benefits of GNN and CNN [43] to address knowledge base completion using out-of-knowledge-based entities [44]. To transfer knowledge to entities that do not have knowledge, a novel technique is given that uses a weight matrix to describe the relationships in the KBC model. After learning the information between nodes in this design, transition matrices are used to build more expressive embeddings. The proposed transition-based knowledge graph model solves the knowledge base completion tasks by employing these parameter values [45].


## 3. Proposed Work

This proposed work uses an optimization strategy to offer efficient data deduplication. For rapid convergence, an evolutionary DE technique is applied. It is stable, is simple to use, and lends itself nicely to parallel processing, making it ideal for Hadoop technology in cloud computing. The deduplication system receives the input data. The whole procedure is broken into the following steps.


### 3.1. Effective Chunking

Using two thresholds and two divisors with appropriate values, the input data stream is split into variable size pieces. The differential evolution algorithm searches for these parameters.The values of divisor and threshold are taken as optimum values using differential evolution.


### 3.2. SHA-1 Secure Hash Value Creation

In secure cryptographic hash functions, each chunk’s hash value is computed using SHA-1.In certain circumstances, MD5 produces the same hash value for various chunks, which causes confusion and degrades speed. SHA-1 is used to generate safe, collision-free hashes of data chunks. A duplicate chunk is identified by locating its fingerprint in the key-value storage.


### 3.3. Redundancy Identification and Removal with Bucket Indexing

Based on bucket indexing, generated hash values are stored in the correct bucket from bucket 0 to bucket 9 and bucket A to bucket F by measuring the leftmost digit of the hash value, i.e., 9aca34....ef, 4ade923...cf, b23a3ce...cd1 hash value in bucket 9, bucket 4, bucket B. Duplicate hash values must be recognised and deleted using the Map and Reduce function. The driver provides Map and Reduce jobs to the relevant Data Nodes in the cluster during a MapReduce process.


### 3.4. ResNet Architecture

We can perform complicated problems in image processing activities such as categorization and identification of specific objects by adding additional layers to deep learning architecture. However, adding additional layers to the neural network causes accuracy loss and a difficult training period [46]. The ResNet architecture’s residual blocks solve this problem. The ResNet architecture consists of 34 layers with quick connections between them. These short-cut connections are referred to as residual blocks. Figure 3 depicts an overview of the ResNet architecture [47].Figure 3
34-layer residual network.Object identification accuracy increased by improving lighting effects and avoiding noise in the image [23]. Bilateral, adaptive, supersampling, and symmetric local binary patterns are novel layer operations, as depicted in Figure 4. Bilateral filtering creates a noise-reducing smoothing process while preserving edges. As a result, the skeleton of the items seen in the video frames may be preserved and the objects can be precisely recognized.Figure 4
Additional layer operation.


### 3.5. Proposed Architecture

#### 3.5.1. Bilateral Filtering

The input picture from the video series is treated to a nonlinear bilateral filtering technique. This procedure increases smoothness while retaining edge information. The average of the neighboring pixels is computed in this method, which may be substituted by the original pixel. As a result, this bilateral procedure is also known as the weighted average of pixels [48].(1)Two neighborhood pixels are taken and compared to get similar feature values during processing [49]. The bilateral filter operation is given by(2)BFIinputp=1wp∑xi∈ΩIxiFrIxi−Ixgsxi−x,(3)Wp=∑xi∈ΩFrIxi−Ixigsxi−x.As illustrated in Figure5, the input picture may be divided into two layers: a smoothed version called the large-scale component and a residual version called the small-scale component [50]. These remaining bits include noise and show the structure of the input picture, which is useful throughout the denoising process. Bilateral filtering combines a domain filter with a range filter. It computes and replaces the mean of comparable and neighboring pixel values for a given pixel. To apply the suggested work to a video surveillance system, sample photos are acquired ahead of time under optimal lighting conditions [51]. During surveillance, especially at night, the suggested system analyses the picture at a certain time interval using the current and sample image frames. The small size component of the sample picture may be overlaid on the big scale component of the current image frame to provide an upgraded image that precisely incorporates all of the item information, allowing the object identification procedure to be carried out. The full procedure is shown in Figure 6.Figure 5
Output of the bilateral filter.Figure 6
Modified image generation.


### 3.6. Adaptive Super Sampling

The result of bilateral operation may lead to pixelated edges, which causes aliasing of visual data. Aliasing happens as a result of continuous smooth curves and lines. A few samples are obtained for each pixel; if the samples have similar characteristics, the output pixel value is determined; if the samples are different, additional samples are needed to find the target pixel value [52]. As a result, it is not required to collect additional samples at all times. As a result, adaptive supersampling gives the pixel margin and preserves the object edges. The average of a function evaluated at a collection of points x1, …, xN is used to estimate the integral of a function f. Figure 7 shows the output of adaptive supersampling.Figure 7
Output of adaptive supersampling.This can be calculated by aggregating the image functionp (x, y), that can represent the radiance of the particular point (x, y) in the image pixels. The radiance L can be calculated by(4)L=∫Apx,yfx,ydxdy.Here,f(x, y) is a antialiasing filter and A is a supporting area of the filter. The random samples based on the Monte Carlo method [9], Xi, i = 1, …, n, obtains(5)L=1n∑iXi.The samples are disseminated to corresponding kernel filters.


#### 3.6.1. Symmetric Local Binary Pattern

It labels the pixels of an image by thresholding the neighborhood of each pixel and considers the result as a binary number [53]. The LBP operator in a video surveillance application can find the variations during illumination changes.LPB can be calculated by identifying the difference between the intensities of pixels of neighborhood pixels. LetI0 represent the intensity of a particular pixel, and the neighbors are represented as in, where n represents the position of the neighbor. Figure 8 represents the size of n as 8. If the neighboring pixel value is equal or greater, the value is set to one, or otherwise, it is zero. Figure 9 represents the matrix allocation of pixel values.(6)LBP=∑i=0p−1sni−Gc2i,sx=1,ifx>0,0,otherwise.Figure 8
Local binary pattern.Figure 9
The matrix allocation of pixel values.


#### 3.6.2. Experiment and Results

To demonstrate the difference between the existing ResNet architecture and the modified ResNet (M-ResNet) architecture when processing low illumination images in a video surveillance system, we selected more images from the three different datasets coco, CIFAR, and WildTrack for testing to see if there were any effective improvements after the ResNet architecture was modified [54]. The outcomes of the tests are compared to the current methodologies. The coco dataset contains 5000 photos that are utilized throughout the training phase. Figure 10 shows how three distinct photos with poor lighting may be applied to current and customized ResNet architectures. Figure 10 shows two variants of the same picture selected from the coco dataset for experimentation [55]. The input image is preprocessed here using the usual lighting condition (Figure 10(a)). This picture has appropriate illumination and three zebras are detected, with the probabilities of the three items stated as 99.9, 99.8, and 99.4 accordingly. Figure 10(b) shows the same picture that does not have suitable lighting conditions. The second picture is now evaluated with the ResNet model, and the results show four zebras and one horse. This erroneous output might be generated as a result of a poor lighting conditions.Figure 10
Testing the dataset images.After applying the mentioned modifications described in the proposed architecture to the existing model, the challenging light condition image can be subjected into bilateral filtering and adaptive sampling process that can increase the atmospheric light environment in the image. The new image can be subjected to the convolution process, and the output can be recorded. The first and third outputs are almost the same with less error. This can be indicated in Figure11.Figure 11
Analysis of existing and modified architecture results.Figure11 clearly shows the improvement of the detection process after the modification in the deep learning network.


## 3.1. Effective Chunking

Using two thresholds and two divisors with appropriate values, the input data stream is split into variable size pieces. The differential evolution algorithm searches for these parameters.The values of divisor and threshold are taken as optimum values using differential evolution.


## 3.2. SHA-1 Secure Hash Value Creation

In secure cryptographic hash functions, each chunk’s hash value is computed using SHA-1.In certain circumstances, MD5 produces the same hash value for various chunks, which causes confusion and degrades speed. SHA-1 is used to generate safe, collision-free hashes of data chunks. A duplicate chunk is identified by locating its fingerprint in the key-value storage.


## 3.3. Redundancy Identification and Removal with Bucket Indexing

Based on bucket indexing, generated hash values are stored in the correct bucket from bucket 0 to bucket 9 and bucket A to bucket F by measuring the leftmost digit of the hash value, i.e., 9aca34....ef, 4ade923...cf, b23a3ce...cd1 hash value in bucket 9, bucket 4, bucket B. Duplicate hash values must be recognised and deleted using the Map and Reduce function. The driver provides Map and Reduce jobs to the relevant Data Nodes in the cluster during a MapReduce process.


## 3.4. ResNet Architecture

We can perform complicated problems in image processing activities such as categorization and identification of specific objects by adding additional layers to deep learning architecture. However, adding additional layers to the neural network causes accuracy loss and a difficult training period [46]. The ResNet architecture’s residual blocks solve this problem. The ResNet architecture consists of 34 layers with quick connections between them. These short-cut connections are referred to as residual blocks. Figure 3 depicts an overview of the ResNet architecture [47].Figure 3
34-layer residual network.Object identification accuracy increased by improving lighting effects and avoiding noise in the image [23]. Bilateral, adaptive, supersampling, and symmetric local binary patterns are novel layer operations, as depicted in Figure 4. Bilateral filtering creates a noise-reducing smoothing process while preserving edges. As a result, the skeleton of the items seen in the video frames may be preserved and the objects can be precisely recognized.Figure 4
Additional layer operation.


## 3.5. Proposed Architecture

### 3.5.1. Bilateral Filtering

The input picture from the video series is treated to a nonlinear bilateral filtering technique. This procedure increases smoothness while retaining edge information. The average of the neighboring pixels is computed in this method, which may be substituted by the original pixel. As a result, this bilateral procedure is also known as the weighted average of pixels [48].(1)Two neighborhood pixels are taken and compared to get similar feature values during processing [49]. The bilateral filter operation is given by(2)BFIinputp=1wp∑xi∈ΩIxiFrIxi−Ixgsxi−x,(3)Wp=∑xi∈ΩFrIxi−Ixigsxi−x.As illustrated in Figure5, the input picture may be divided into two layers: a smoothed version called the large-scale component and a residual version called the small-scale component [50]. These remaining bits include noise and show the structure of the input picture, which is useful throughout the denoising process. Bilateral filtering combines a domain filter with a range filter. It computes and replaces the mean of comparable and neighboring pixel values for a given pixel. To apply the suggested work to a video surveillance system, sample photos are acquired ahead of time under optimal lighting conditions [51]. During surveillance, especially at night, the suggested system analyses the picture at a certain time interval using the current and sample image frames. The small size component of the sample picture may be overlaid on the big scale component of the current image frame to provide an upgraded image that precisely incorporates all of the item information, allowing the object identification procedure to be carried out. The full procedure is shown in Figure 6.Figure 5
Output of the bilateral filter.Figure 6
Modified image generation.


## 3.5.1. Bilateral Filtering

The input picture from the video series is treated to a nonlinear bilateral filtering technique. This procedure increases smoothness while retaining edge information. The average of the neighboring pixels is computed in this method, which may be substituted by the original pixel. As a result, this bilateral procedure is also known as the weighted average of pixels [48].(1)Two neighborhood pixels are taken and compared to get similar feature values during processing [49]. The bilateral filter operation is given by(2)BFIinputp=1wp∑xi∈ΩIxiFrIxi−Ixgsxi−x,(3)Wp=∑xi∈ΩFrIxi−Ixigsxi−x.As illustrated in Figure5, the input picture may be divided into two layers: a smoothed version called the large-scale component and a residual version called the small-scale component [50]. These remaining bits include noise and show the structure of the input picture, which is useful throughout the denoising process. Bilateral filtering combines a domain filter with a range filter. It computes and replaces the mean of comparable and neighboring pixel values for a given pixel. To apply the suggested work to a video surveillance system, sample photos are acquired ahead of time under optimal lighting conditions [51]. During surveillance, especially at night, the suggested system analyses the picture at a certain time interval using the current and sample image frames. The small size component of the sample picture may be overlaid on the big scale component of the current image frame to provide an upgraded image that precisely incorporates all of the item information, allowing the object identification procedure to be carried out. The full procedure is shown in Figure 6.Figure 5
Output of the bilateral filter.Figure 6
Modified image generation.


## 3.6. Adaptive Super Sampling

The result of bilateral operation may lead to pixelated edges, which causes aliasing of visual data. Aliasing happens as a result of continuous smooth curves and lines. A few samples are obtained for each pixel; if the samples have similar characteristics, the output pixel value is determined; if the samples are different, additional samples are needed to find the target pixel value [52]. As a result, it is not required to collect additional samples at all times. As a result, adaptive supersampling gives the pixel margin and preserves the object edges. The average of a function evaluated at a collection of points x1, …, xN is used to estimate the integral of a function f. Figure 7 shows the output of adaptive supersampling.Figure 7
Output of adaptive supersampling.This can be calculated by aggregating the image functionp (x, y), that can represent the radiance of the particular point (x, y) in the image pixels. The radiance L can be calculated by(4)L=∫Apx,yfx,ydxdy.Here,f(x, y) is a antialiasing filter and A is a supporting area of the filter. The random samples based on the Monte Carlo method [9], Xi, i = 1, …, n, obtains(5)L=1n∑iXi.The samples are disseminated to corresponding kernel filters.


### 3.6.1. Symmetric Local Binary Pattern

It labels the pixels of an image by thresholding the neighborhood of each pixel and considers the result as a binary number [53]. The LBP operator in a video surveillance application can find the variations during illumination changes.LPB can be calculated by identifying the difference between the intensities of pixels of neighborhood pixels. LetI0 represent the intensity of a particular pixel, and the neighbors are represented as in, where n represents the position of the neighbor. Figure 8 represents the size of n as 8. If the neighboring pixel value is equal or greater, the value is set to one, or otherwise, it is zero. Figure 9 represents the matrix allocation of pixel values.(6)LBP=∑i=0p−1sni−Gc2i,sx=1,ifx>0,0,otherwise.Figure 8
Local binary pattern.Figure 9
The matrix allocation of pixel values.


### 3.6.2. Experiment and Results

To demonstrate the difference between the existing ResNet architecture and the modified ResNet (M-ResNet) architecture when processing low illumination images in a video surveillance system, we selected more images from the three different datasets coco, CIFAR, and WildTrack for testing to see if there were any effective improvements after the ResNet architecture was modified [54]. The outcomes of the tests are compared to the current methodologies. The coco dataset contains 5000 photos that are utilized throughout the training phase. Figure 10 shows how three distinct photos with poor lighting may be applied to current and customized ResNet architectures. Figure 10 shows two variants of the same picture selected from the coco dataset for experimentation [55]. The input image is preprocessed here using the usual lighting condition (Figure 10(a)). This picture has appropriate illumination and three zebras are detected, with the probabilities of the three items stated as 99.9, 99.8, and 99.4 accordingly. Figure 10(b) shows the same picture that does not have suitable lighting conditions. The second picture is now evaluated with the ResNet model, and the results show four zebras and one horse. This erroneous output might be generated as a result of a poor lighting conditions.Figure 10
Testing the dataset images.After applying the mentioned modifications described in the proposed architecture to the existing model, the challenging light condition image can be subjected into bilateral filtering and adaptive sampling process that can increase the atmospheric light environment in the image. The new image can be subjected to the convolution process, and the output can be recorded. The first and third outputs are almost the same with less error. This can be indicated in Figure11.Figure 11
Analysis of existing and modified architecture results.Figure11 clearly shows the improvement of the detection process after the modification in the deep learning network.


## 3.6.1. Symmetric Local Binary Pattern

It labels the pixels of an image by thresholding the neighborhood of each pixel and considers the result as a binary number [53]. The LBP operator in a video surveillance application can find the variations during illumination changes.LPB can be calculated by identifying the difference between the intensities of pixels of neighborhood pixels. LetI0 represent the intensity of a particular pixel, and the neighbors are represented as in, where n represents the position of the neighbor. Figure 8 represents the size of n as 8. If the neighboring pixel value is equal or greater, the value is set to one, or otherwise, it is zero. Figure 9 represents the matrix allocation of pixel values.(6)LBP=∑i=0p−1sni−Gc2i,sx=1,ifx>0,0,otherwise.Figure 8
Local binary pattern.Figure 9
The matrix allocation of pixel values.


## 3.6.2. Experiment and Results

To demonstrate the difference between the existing ResNet architecture and the modified ResNet (M-ResNet) architecture when processing low illumination images in a video surveillance system, we selected more images from the three different datasets coco, CIFAR, and WildTrack for testing to see if there were any effective improvements after the ResNet architecture was modified [54]. The outcomes of the tests are compared to the current methodologies. The coco dataset contains 5000 photos that are utilized throughout the training phase. Figure 10 shows how three distinct photos with poor lighting may be applied to current and customized ResNet architectures. Figure 10 shows two variants of the same picture selected from the coco dataset for experimentation [55]. The input image is preprocessed here using the usual lighting condition (Figure 10(a)). This picture has appropriate illumination and three zebras are detected, with the probabilities of the three items stated as 99.9, 99.8, and 99.4 accordingly. Figure 10(b) shows the same picture that does not have suitable lighting conditions. The second picture is now evaluated with the ResNet model, and the results show four zebras and one horse. This erroneous output might be generated as a result of a poor lighting conditions.Figure 10
Testing the dataset images.After applying the mentioned modifications described in the proposed architecture to the existing model, the challenging light condition image can be subjected into bilateral filtering and adaptive sampling process that can increase the atmospheric light environment in the image. The new image can be subjected to the convolution process, and the output can be recorded. The first and third outputs are almost the same with less error. This can be indicated in Figure11.Figure 11
Analysis of existing and modified architecture results.Figure11 clearly shows the improvement of the detection process after the modification in the deep learning network.


## 4. Performance Evaluation

In the coco, WildTrack, and CIFAR data sets, performance may be measured using several measures such as recall, precision, andF1 score, pixel accuracy, intersection over union, and mean intersection over union shown in Table 1. The recall indicates how close the produced predictions are to the reality. The precision shows how the positive detections compare to the ground truth. The pixel accuracy is the proportion of pixels in a picture that are properly categorised. To give the percentage overlap between goal and projected output, the intersection over union (IoU) is also known as the Jaccard index. The average IoU metric is calculated by taking the average of all semantic class intersection over union values.Table 1
Performance metrics.
SnMethodPrecisionRecallF1-scorePixel accuracyIoUMean IoU1Generative probablistic model648175818071.32ACNN model649174908479.53Faster R-CNN528172796958.84Gaussian mixture model728674808175.45DCGAN model668372857968.96Active contour mode738880918280.27Dilated convolution628579807870.58Edge_Constraint U-net568072837458.49CSCC algorithm678176817768.410Proposed model758483908684.3It can be concluded from the above graphs, the performance of M-ResNet can be much more improved when compared to existing methods.


## 5. Conclusion

In this work, an improved ResNet model is presented to reduce object identification faults in video surveillance systems owing to inadequate light. ResNet design uses skip connections to prevent difficulties caused by disappearing explosive gradients. Incorporating additional layers with skip connections into the current ResNet design can deliver improved results on low-light pictures in video surveillance systems without affecting performance. The new layer operations include improving illumination conditions with bilateral filtering, avoiding antialiasing effects with adaptive sampling, and improving image quality using local binary patterns. These three operations provide more precise information for further analyzing the picture in order to improve the object recognition process. This improved ResNet architecture is tested against several picture quality measures using different datasets. When compared to current approaches, the suggested method produces superior outcomes. This article has one limitation: if the processed picture has extremely low light, it takes longer to process the data for real-time photographs. Future studies will investigate ways to enhance picture illumination data in the video surveillance object recognition process without needing both low light and normal light images, which gives both higher performance and less processing time.



---

*Source: 9790398-2022-08-12.xml*