scholarly journals An Inter-Frame Forgery Detection Algorithm for Surveillance Video

Information ◽  
2018 ◽  
Vol 9 (12) ◽  
pp. 301
Author(s):  
Qian Li ◽  
Rangding Wang ◽  
Dawen Xu
Keyword(s):  
Feature Extraction ◽  
Clustering Algorithm ◽  
Detection Algorithm ◽  
Second Phase ◽  
Surveillance Systems ◽  
Surveillance Video ◽  
Phase Congruency ◽  
Surveillance Videos ◽  
Abnormal Points ◽  
Inter Frame

Surveillance systems are ubiquitous in our lives, and surveillance videos are often used as significant evidence for judicial forensics. However, the authenticity of surveillance videos is difficult to guarantee. Ascertaining the authenticity of surveillance video is an urgent problem. Inter-frame forgery is one of the most common ways for video tampering. The forgery will reduce the correlation between adjacent frames at tampering position. Therefore, the correlation can be used to detect tamper operation. The algorithm is composed of feature extraction and abnormal point localization. During feature extraction, we extract the 2-D phase congruency of each frame, since it is a good image characteristic. Then calculate the correlation between the adjacent frames. In the second phase, the abnormal points were detected by using k-means clustering algorithm. The normal and abnormal points were clustered into two categories. Experimental results demonstrate that the scheme has high detection and localization accuracy.

A Survey of Visual Traffic Surveillance Using Spatio-Temporal Analysis and Mining

2013 ◽  
Vol 4 (3) ◽  
pp. 42-60 ◽  
Author(s):  
Chengcui Zhang
Keyword(s):  
Data Mining ◽  
Volume Estimation ◽  
Surveillance Systems ◽  
Temporal Data Mining ◽  
Temporal Data ◽  
Surveillance Video ◽  
Traffic Surveillance ◽  
Surveillance Videos ◽  
Spatio Temporal ◽  
Surveillance Applications

The focus of this survey is on spatio-temporal data mining and database retrieval for visual traffic surveillance systems. In many traffic surveillance applications, such as incident detection, abnormal events detection, vehicle speed estimation, and traffic volume estimation, the data used for reasoning is really in the form of spatio-temporal data (e.g. vehicle trajectories). How to effectively analyze these spatio-temporal data to automatically find its inherent characteristics for different visual traffic surveillance applications has been of great interest. Examples of spatio-temporal patterns extracted from traffic surveillance videos include, but are not limited to, sudden stops, harsh turns, speeding, and collisions. To meet the different needs of various traffic surveillance applications, several application- or event- specific models have been proposed in the literature. This paper provides a survey of different models and data mining algorithms to cover state of the art in spatio-temporal modelling, spatio-temporal data mining, and spatio-temporal retrieval for traffic surveillance video databases. In addition, the database model issues and challenges for traffic surveillance videos are also discussed in this survey.

scholarly journals Automatic textual description of interactions between two objects in surveillance videos

2021 ◽  
Vol 3 (7) ◽  
Author(s):  
Wael F. Youssef ◽  
Siba Haidar ◽  
Philippe Joly
Keyword(s):  
Deep Learning ◽  
Physical Contact ◽  
Surveillance Systems ◽  
Surveillance Video ◽  
Surveillance Videos ◽  
Textual Description ◽  
Video Description ◽  
General Schema ◽  
Remote Interaction ◽  
Context Free

AbstractThe purpose of our work is to automatically generate textual video description schemas from surveillance video scenes compatible with police incidents reports. Our proposed approach is based on a generic and flexible context-free ontology. The general schema is of the form [actuator] [action] [over/with] [actuated object] [+ descriptors: distance, speed, etc.]. We focus on scenes containing exactly two objects. Through elaborated steps, we generate a formatted textual description. We try to identify the existence of an interaction between the two objects, including remote interaction which does not involve physical contact and we point out when aggressivity took place in these cases. We use supervised deep learning to classify scenes into interaction or no-interaction classes and then into subclasses. The chosen descriptors used to represent subclasses are keys in surveillance systems that help generate live alerts and facilitate offline investigation.

Lightweight detection algorithm for fine-grained surface defects of aerospace seal rings

2021 ◽  
pp. 1-18
Author(s):  
Hui Liu ◽  
Boxia He ◽  
Yong He ◽  
Xiaotian Tao
Keyword(s):  
Feature Extraction ◽  
Defect Detection ◽  
Surface Defect ◽  
Surface Defects ◽  
Detection Algorithm ◽  
Seal Ring ◽  
Fine Grained ◽  
Aerospace Applications ◽  
Surface Defect Detection ◽  
The Mean

The existing seal ring surface defect detection methods for aerospace applications have the problems of low detection efficiency, strong specificity, large fine-grained classification errors, and unstable detection results. Considering these problems, a fine-grained seal ring surface defect detection algorithm for aerospace applications is proposed. Based on analysis of the stacking process of standard convolution, heat maps of original pixels in the receptive field participating in the convolution operation are quantified and generated. According to the generated heat map, the feature extraction optimization method of convolution combinations with different dilation rates is proposed, and an efficient convolution feature extraction network containing three kinds of dilated convolutions is designed. Combined with the O-ring surface defect features, a multiscale defect detection network is designed. Before the head of multiscale classification and position regression, feature fusion tree modules are added to ensure the reuse and compression of the responsive features of different receptive fields on the same scale feature maps. Experimental results show that on the O-rings-3000 testing dataset, the mean condition accuracy of the proposed algorithm reaches 95.10% for 5 types of surface defects of aerospace O-rings. Compared with RefineDet, the mean condition accuracy of the proposed algorithm is only reduced by 1.79%, while the parameters and FLOPs are reduced by 35.29% and 64.90%, respectively. Moreover, the proposed algorithm has good adaptability to image blur and light changes caused by the cutting of imaging hardware, thus saving the cost.

scholarly journals Concrete Crack Detection Based on Well-Known Feature Extractor Model and the YOLO_v2 Network

2021 ◽  
Vol 11 (2) ◽  
pp. 813
Author(s):  
Shuai Teng ◽  
Zongchao Liu ◽  
Gongfa Chen ◽  
Li Cheng
Keyword(s):  
Feature Extraction ◽  
Crack Detection ◽  
Computational Cost ◽  
Concrete Structures ◽  
Detection Algorithm ◽  
Computational Time ◽  
Image Size ◽  
Important Indicator ◽  
Feature Extractor ◽  
Model Training

This paper compares the crack detection performance (in terms of precision and computational cost) of the YOLO_v2 using 11 feature extractors, which provides a base for realizing fast and accurate crack detection on concrete structures. Cracks on concrete structures are an important indicator for assessing their durability and safety, and real-time crack detection is an essential task in structural maintenance. The object detection algorithm, especially the YOLO series network, has significant potential in crack detection, while the feature extractor is the most important component of the YOLO_v2. Hence, this paper employs 11 well-known CNN models as the feature extractor of the YOLO_v2 for crack detection. The results confirm that a different feature extractor model of the YOLO_v2 network leads to a different detection result, among which the AP value is 0.89, 0, and 0 for ‘resnet18’, ‘alexnet’, and ‘vgg16’, respectively meanwhile, the ‘googlenet’ (AP = 0.84) and ‘mobilenetv2’ (AP = 0.87) also demonstrate comparable AP values. In terms of computing speed, the ‘alexnet’ takes the least computational time, the ‘squeezenet’ and ‘resnet18’ are ranked second and third respectively; therefore, the ‘resnet18’ is the best feature extractor model in terms of precision and computational cost. Additionally, through the parametric study (influence on detection results of the training epoch, feature extraction layer, and testing image size), the associated parameters indeed have an impact on the detection results. It is demonstrated that: excellent crack detection results can be achieved by the YOLO_v2 detector, in which an appropriate feature extractor model, training epoch, feature extraction layer, and testing image size play an important role.

scholarly journals Community Detection Based on Graph Representation Learning in Evolutionary Networks

2021 ◽  
Vol 11 (10) ◽  
pp. 4497
Author(s):  
Dongming Chen ◽  
Mingshuo Nie ◽  
Jie Wang ◽  
Yun Kong ◽  
Dongqi Wang ◽  
...  
Keyword(s):  
Community Detection ◽  
Network Structure ◽  
Clustering Algorithm ◽  
Laplacian Matrix ◽  
Representation Learning ◽  
Detection Algorithm ◽  
Graph Representation ◽  
Time Slice ◽  
Current Time ◽  
Evolutionary Networks

Aiming at analyzing the temporal structures in evolutionary networks, we propose a community detection algorithm based on graph representation learning. The proposed algorithm employs a Laplacian matrix to obtain the node relationship information of the directly connected edges of the network structure at the previous time slice, the deep sparse autoencoder learns to represent the network structure under the current time slice, and the K-means clustering algorithm is used to partition the low-dimensional feature matrix of the network structure under the current time slice into communities. Experiments on three real datasets show that the proposed algorithm outperformed the baselines regarding effectiveness and feasibility.

Border Detection in Skin Lesion Images Using an Improved Clustering Algorithm

2020 ◽  
Vol 16 (4) ◽  
pp. 15-29
Author(s):  
Jayalakshmi D. ◽  
Dheeba J.
Keyword(s):  
Skin Cancer ◽  
Skin Lesion ◽  
Clustering Algorithm ◽  
Median Filter ◽  
Second Phase ◽  
Border Detection ◽  
Early Computer ◽  
Segmentation Methods ◽  
Two Phases ◽  
Skin Cancer Detection

The incidence of skin cancer has been increasing in recent years and it can become dangerous if not detected early. Computer-aided diagnosis systems can help the dermatologists in assisting with skin cancer detection by examining the features more critically. In this article, a detailed review of pre-processing and segmentation methods is done on skin lesion images by investigating existing and prevalent segmentation methods for the diagnosis of skin cancer. The pre-processing stage is divided into two phases, in the first phase, a median filter is used to remove the artifact; and in the second phase, an improved K-means clustering with outlier removal (KMOR) algorithm is suggested. The proposed method was tested in a publicly available Danderm database. The improved cluster-based algorithm gives an accuracy of 92.8% with a sensitivity of 93% and specificity of 90% with an AUC value of 0.90435. From the experimental results, it is evident that the clustering algorithm has performed well in detecting the border of the lesion and is suitable for pre-processing dermoscopic images.

scholarly journals Object-Based Approach for Adaptive Source Coding of Surveillance Video

2019 ◽  
Vol 9 (10) ◽  
pp. 2003 ◽  
Author(s):  
Tung-Ming Pan ◽  
Kuo-Chin Fan ◽  
Yuan-Kai Wang
Keyword(s):  
Linear Model ◽  
Video Transmission ◽  
Moving Objects ◽  
Source Coding ◽  
Video Quality ◽  
Surveillance Video ◽  
Surveillance Videos ◽  
Object Based ◽  
High Recognition Accuracy ◽  
Object Dynamics

Intelligent analysis of surveillance videos over networks requires high recognition accuracy by analyzing good-quality videos that however introduce significant bandwidth requirement. Degraded video quality because of high object dynamics under wireless video transmission induces more critical issues to the success of smart video surveillance. In this paper, an object-based source coding method is proposed to preserve constant quality of video streaming over wireless networks. The inverse relationship between video quality and object dynamics (i.e., decreasing video quality due to the occurrence of large and fast-moving objects) is characterized statistically as a linear model. A regression algorithm that uses robust M-estimator statistics is proposed to construct the linear model with respect to different bitrates. The linear model is applied to predict the bitrate increment required to enhance video quality. A simulated wireless environment is set up to verify the proposed method under different wireless situations. Experiments with real surveillance videos of a variety of object dynamics are conducted to evaluate the performance of the method. Experimental results demonstrate significant improvement of streaming videos relative to both visual and quantitative aspects.

scholarly journals Self-Adaptive K-Means Based on a Covering Algorithm

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Yiwen Zhang ◽  
Yuanyuan Zhou ◽  
Xing Guo ◽  
Jintao Wu ◽  
Qiang He ◽  
...  
Keyword(s):  
Large Scale ◽  
Clustering Algorithm ◽  
Real Data ◽  
Second Phase ◽  
Data Sets ◽  
Number Of Clusters ◽  
Large Scale Data ◽  
Long Time ◽  
Two Phases ◽  
Selection Of

The K-means algorithm is one of the ten classic algorithms in the area of data mining and has been studied by researchers in numerous fields for a long time. However, the value of the clustering number k in the K-means algorithm is not always easy to be determined, and the selection of the initial centers is vulnerable to outliers. This paper proposes an improved K-means clustering algorithm called the covering K-means algorithm (C-K-means). The C-K-means algorithm can not only acquire efficient and accurate clustering results but also self-adaptively provide a reasonable numbers of clusters based on the data features. It includes two phases: the initialization of the covering algorithm (CA) and the Lloyd iteration of the K-means. The first phase executes the CA. CA self-organizes and recognizes the number of clusters k based on the similarities in the data, and it requires neither the number of clusters to be prespecified nor the initial centers to be manually selected. Therefore, it has a “blind” feature, that is, k is not preselected. The second phase performs the Lloyd iteration based on the results of the first phase. The C-K-means algorithm combines the advantages of CA and K-means. Experiments are carried out on the Spark platform, and the results verify the good scalability of the C-K-means algorithm. This algorithm can effectively solve the problem of large-scale data clustering. Extensive experiments on real data sets show that the accuracy and efficiency of the C-K-means algorithm outperforms the existing algorithms under both sequential and parallel conditions.

Sign in / Sign up

Export Citation Format

Share Document