scholarly journals Recognition of Tunnel Lining Cracks Based on Digital Image Processing

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Chunquan Dai ◽  
Kun Jiang ◽  
Quanlei Wang
Keyword(s):  
Median Filter ◽  
Recognition Rate ◽  
Gaussian Function ◽  
Engineering Application ◽  
Recognition Algorithm ◽  
Safety Control ◽  
Computer Vision Technology ◽  
Tunnel Safety ◽  
Crack Recognition ◽  
Opening And Closing

Most of the tunnel projects are related to the national economy and people’s livelihood, and their operational safety is of paramount importance. Tunnel safety accidents or hidden safety hazards often start from subtleties. Therefore, the identification of tunnel cracks is a key part of tunnel safety control. The development of computer vision technology has made it possible for the automatic detection of tunnel cracks. Aiming at the problem of low recognition accuracy of existing crack recognition algorithms, this paper uses an improved homomorphic filtering algorithm to dehaze and clear the collected images according to the characteristics of tunnel images and uses an adaptive median filter to denoise the grayscaled image. The extended difference of Gaussian function is used for edge extraction, and the morphological opening and closing operations are used to remove noise. The breakpoints of the binary image are connected after removing the noise to make the image more in line with the actual situation. Aiming at the identification of tunnel crack types, the block index is proposed and used to distinguish linear cracks and network cracks. Using the histogram-like method to distinguish linear cracks in different directions can well solve the mixed crack situation in an image. Compared with the traditional method, the recognition rate of the new algorithm is increased to 94.5%, which is much higher than the traditional crack recognition algorithm. The average processing time of an image is 5.2 s which is moderate, and the crack type discrimination accuracy is more than 92%. In general, the new algorithm has good prospects for theoretical promotion and high engineering application value.

scholarly journals Tunnel Lining Crack Recognition Based on Improved Multiscale Retinex and Sobel Edge Detection

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Quanlei Wang ◽  
Ning Zhang ◽  
Kun Jiang ◽  
Chao Ma ◽  
Zhaochen Zhou ◽  
...  
Keyword(s):  
Edge Detection ◽  
Engineering Application ◽  
Objective Evaluation ◽  
Recognition Algorithm ◽  
Tunnel Lining ◽  
Automatic Identification ◽  
Main Body ◽  
Morphological Operations ◽  
Crack Recognition ◽  
Sobel Edge Detection

China is gradually transitioning from the “tunnel construction era” to the “tunnel maintenance era,” and more and more operating tunnels need to be inspected for diseases. With the continuous development of computer vision, the automatic identification of tunnel lining cracks with computers has gradually been applied in engineering. On the basis of summarizing the weaknesses and strengths of previous studies, this paper first uses the improved multiscale Retinex algorithm to filter the collected tunnel crack images and introduces the eight-direction Sobel edge detection operator to extract the edges of the cracks. Perform mathematical morphological operations on the image after edge extraction, and use the principle of the smallest enclosing rectangle to remove the isolated points of the image. Finally, the performance of the algorithm is judged by the objective evaluation index of the image, the accuracy of crack recognition, and the running time of the algorithm. The image filtering algorithm proposed in this paper can better preserve the edges of the image while enhancing the image. The objective evaluation indexes of the image have been improved significantly, and the main body of the crack can be accurately identified. The overall crack recognition accuracy rate can reach 97.5%, which is higher than the existing tunnel lining crack recognition algorithm, and the average calculation time for each image is shorter. This algorithm has high research significance and engineering application value.

Human action recognition using simple geometric features and a finite state machine

2013 ◽  
Vol 18 (2-3) ◽  
pp. 49-60 ◽  
Author(s):  
Damian Dudzńiski ◽  
Tomasz Kryjak ◽  
Zbigniew Mikrut
Keyword(s):  
Action Recognition ◽  
Finite State Machine ◽  
Recognition Rate ◽  
Human Action Recognition ◽  
Human Action ◽  
Video Stream ◽  
State Machine ◽  
Recognition Algorithm ◽  
Finite State ◽  
Correct Recognition Rate

Abstract In this paper a human action recognition algorithm, which uses background generation with shadow elimination, silhouette description based on simple geometrical features and a finite state machine for recognizing particular actions is described. The performed tests indicate that this approach obtains a 81 % correct recognition rate allowing real-time image processing of a 360 X 288 video stream.

Research on Modulation Recognition Algorithm of Digital Communication Signal Based on Wavelet Denoising

2014 ◽  
Vol 608-609 ◽  
pp. 459-467 ◽  
Author(s):  
Xiao Yu Gu
Keyword(s):  
Pattern Recognition ◽  
Feature Extraction ◽  
Decision Theory ◽  
Recognition Rate ◽  
Recognition Algorithm ◽  
Modulation Recognition ◽  
The Core ◽  
Feature Parameters ◽  
Communication Signal ◽  
Modulation Signal

The paper researches a recognition algorithm of modulation signal and modulation modes. The modulation modes to be recognized include 2ASK, 2FSK, 2PSK, 4ASK, 4FSK and 4PSK modulation. There are two methods recognizing modulation modes of digital signal, method based on decision theory and pattern-recognition method based on feature extraction. The method based on decision theory is not suitable for recognition with multiple modulation modes. The core of pattern recognition based on feature extraction is selection of feature parameters. So the paper uses the feature parameters with simple calculation, easy to be implemented and high recognition rate as the core. The extraction of feature parameters is based on instant feature of modulation signal after Hilbert transformation.

Design of Gait Recognition System Based on FPGA and DSP

2014 ◽  
Vol 687-691 ◽  
pp. 3861-3868
Author(s):  
Zheng Hong Deng ◽  
Li Tao Jiao ◽  
Li Yan Liu ◽  
Shan Shan Zhao
Keyword(s):  
Monitoring System ◽  
Nearest Neighbor ◽  
Gait Recognition ◽  
Recognition Rate ◽  
Digital Signal ◽  
Recognition System ◽  
Recognition Algorithm ◽  
Zernike Moment ◽  
Intelligent Monitoring ◽  
The One

According to the trend of the intelligent monitoring system, on the basis of the study of gait recognition algorithm, the intelligent monitoring system is designed based on FPGA and DSP; On the one hand, FPGA’s flexibility and fast parallel processing algorithms when designing can be both used to avoid that circuit can not be modified after designed; On the other hand, the advantage of processing the digital signal of DSP is fully taken. In the feature extraction and recognition, Zernike moment is selected, at the same time the system uses the nearest neighbor classification method which is more mature and has good real-time performance. Experiments show that the system has high recognition rate.

scholarly journals Incremental Graph Regulated Nonnegative Matrix Factorization for Face Recognition

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Zhe-Zhou Yu ◽  
Yu-Hao Liu ◽  
Bin Li ◽  
Shu-Chao Pang ◽  
Cheng-Cheng Jia
Keyword(s):  
Face Recognition ◽  
Matrix Factorization ◽  
Information Needs ◽  
Nonnegative Matrix Factorization ◽  
Recognition Rate ◽  
Nonnegative Matrix ◽  
Recognition Algorithm ◽  
Incremental Method ◽  
Real World Application ◽  
The Face

In a real world application, we seldom get all images at one time. Considering this case, if a company hired an employee, all his images information needs to be recorded into the system; if we rerun the face recognition algorithm, it will be time consuming. To address this problem, In this paper, firstly, we proposed a novel subspace incremental method called incremental graph regularized nonnegative matrix factorization (IGNMF) algorithm which imposes manifold into incremental nonnegative matrix factorization algorithm (INMF); thus, our new algorithm is able to preserve the geometric structure in the data under incremental study framework; secondly, considering we always get many face images belonging to one person or many different people as a batch, we improved our IGNMF algorithms to Batch-IGNMF algorithms (B-IGNMF), which implements incremental study in batches. Experiments show that (1) the recognition rate of our IGNMF and B-IGNMF algorithms is close to GNMF algorithm while it runs faster than GNMF. (2) The running times of our IGNMF and B-IGNMF algorithms are close to INMF while the recognition rate outperforms INMF. (3) Comparing with other popular NMF-based face recognition incremental algorithms, our IGNMF and B-IGNMF also outperform then both the recognition rate and the running time.

scholarly journals A Modeling Method for Automatic Extraction of Offshore Aquaculture Zones Based on Semantic Segmentation

2020 ◽  
Vol 9 (3) ◽  
pp. 145 ◽  
Author(s):  
Baikai Sui ◽  
Tao Jiang ◽  
Zhen Zhang ◽  
Xinliang Pan ◽  
Chenxi Liu
Keyword(s):  
Recognition Rate ◽  
Semantic Segmentation ◽  
Recognition Algorithm ◽  
Identification Accuracy ◽  
Generative Adversarial Networks ◽  
Automatic Extraction ◽  
Large Area ◽  
Marine Aquaculture ◽  
Floating Raft ◽  
Offshore Aquaculture

Monitoring of offshore aquaculture zones is important to marine ecological environment protection and maritime safety and security. Remote sensing technology has the advantages of large-area simultaneous observation and strong timeliness, which provide normalized monitoring of marine aquaculture zones. Aiming at the problems of weak generalization ability and low recognition rate in weak signal environments of traditional target recognition algorithm, this paper proposes a method for automatic extraction of offshore fish cage and floating raft aquaculture zones based on semantic segmentation. This method uses Generative Adversarial Networks to expand the data to compensate for the lack of training samples, and uses ratio of green band to red band (G/R) instead of red band to enhance the characteristics of aquaculture spectral information, combined with atrous convolution and atrous space pyramid pooling to enhance the context semantic information, to extract and identify two types of offshore fish cage zones and floating raft aquaculture zones. The experiment is carried out in the eastern coastal waters of Shandong Province, China, and the overall identification accuracy of the two types of aquaculture zones can reach 94.8%. The results show that the method proposed in this paper can realize high-precision extraction both of offshore fish cage and floating raft aquaculture zones.

Vehicle License Plate Recognition Based on Wavelet Transform and Vertical Edge Matching

2019 ◽  
Vol 34 (06) ◽  
pp. 2050016
Author(s):  
Zhongli Wang ◽  
Xiping Ma ◽  
Wenlin Huang
Keyword(s):  
Wavelet Transform ◽  
Road Traffic ◽  
Recognition Rate ◽  
Recognition Algorithm ◽  
License Plate ◽  
License Plate Recognition ◽  
Vertical Edge ◽  
Vertical Projection ◽  
Edge Matching ◽  
Vehicle License Plate Recognition

With the improvement of our country’s economic level and quality of life, the numbers and scales of highway networks and motor vehicles are constantly expanding, which makes the current road traffic burden more and more serious. As an important means of traffic automation management, license plate recognition (LPR) technology plays an important role in traffic surveillance and control. However, the recognition rate and accuracy of the traditional license plate recognition methods still need to be improved. In the case of poor surrounding environment, it is prone to localization failure, vehicle license plate recognition errors or unrecognizable phenomena. Wavelet transform, as another landmark signal processing method after Fourier transform, has been widely used in the field of image processing. In China, the number of horizontal lines is usually larger than that of vertical lines. If the two vertical boundaries of the license plate can be detected successfully, the four angles of the license plate can be determined efficiently to complete the license plate positioning. In view of the advantages of wavelet transform technology and the characteristics of vehicle license plate, in this paper, a vehicle license plate recognition algorithm based on wavelet transform and vertical edge matching is proposed. The edge of the license plate is detected by wavelet transform technology, and then the license plate is located by vertical edge matching technology. After the location is realized, the characters are segmented by vertical projection method and the characters are recognized by improved BP neural network algorithm. The experimental results show that the proposed vehicle license plate recognition algorithm based on wavelet transform and vertical edge matching performs well in algorithm performance, which provides a good reference for the development of vehicle license plate recognition system.

Bayesian Robust Coding Face Recognition Algorithm Based on New Dictionary

2014 ◽  
Vol 644-650 ◽  
pp. 4080-4083
Author(s):  
Ye Cai Guo ◽  
Ling Hua Zhang
Keyword(s):  
Face Recognition ◽  
Recognition Rate ◽  
Recognition Algorithm ◽  
Binary Image ◽  
Test Image ◽  
Face Database ◽  
Robust Coding ◽  
The Face ◽  
Isolated Points ◽  
Rate Comparison

In order to overcome the defects that the face recognition rate can be greatly reduced in the existing uncontrolled environments, Bayesian robust coding for face recognition based on new dictionary was proposed. In this proposed algorithm, firstly a binary image is gained by gray threshold transformation and a more clear image without some isolated points can be obtained via smoothing, secondly a new dictionary can be reconstructed via fusing the binary image with the original training dictionary, finally the test image can be classified as the existing class via Bayesian robust coding. The experimental results based on AR face database show that the proposed algorithm has higher face recognition rate comparison with RRC and RSC algorithm.

scholarly journals FPGA-BASED IMPLEMENTATION OF LITHUANIAN ISOLATED WORD RECOGNITION ALGORITHM / LIETUVIŲ KALBOS PAVIENIŲ ŽODŽIŲ ATPAŽINIMO ALGORITMO ĮGYVENDINIMAS LAUKU PROGRAMUOJAMA LOGINE MATRICA

2013 ◽  
Vol 5 (2) ◽  
pp. 101-104
Author(s):  
Tomyslav Sledevič ◽  
Liudas Stašionis
Keyword(s):  
Word Recognition ◽  
Experimental Testing ◽  
Recognition Rate ◽  
Recognition Algorithm ◽  
Clock Signal ◽  
Time Warping ◽  
Process Implementation ◽  
Isolated Word ◽  
Dynamic Time ◽  
Isolated Word Recognition

The paper describes the FPGA-based implementation of Lithuanian isolated word recognition algorithm. FPGA is selected for parallel process implementation using VHDL to ensure fast signal processing at low rate clock signal. Cepstrum analysis was applied to features extraction in voice. The dynamic time warping algorithm was used to compare the vectors of cepstrum coefficients. A library of 100 words features was created and stored in the internal FPGA BRAM memory. Experimental testing with speaker dependent records demonstrated the recognition rate of 94%. The recognition rate of 58% was achieved for speaker-independent records. Calculation of cepstrum coefficients lasted for 8.52 ms at 50 MHz clock, while 100 DTWs took 66.56 ms at 25 MHz clock. Article in Lithuanian. Santrauka Pateikiamas lietuvių kalbos pavienių žodžių atpažinimo algoritmo įgyvendinimas lauku programuojama logine matrica (LPLM). LPLM įrenginys pasirinktas dėl lygiagrečiai veikiančių procesų įgyvendinimo galimybės taikant VHDL kalbą. Tai užtikrina spartų signalų apdorojimą esant taktiniam dažniui iki 50 MHz. Kalbos požymiams išskirti taikoma kepstrinė šnekos analizė. Požymiams palyginti taikomas dinaminis laiko skalės kraipymo (DSLK) metodas. Sudaryta 100 žodžių požymių biblioteka, kuri saugoma vidinėje LPLM BRAM atmintyje. Pasiektas 94 % atpažinimo tikslumas priklausomai nuo kalbėtojo ir 58 % – nepriklausomai nuo kalbėtojo. Kepstro koeficientų skaičiavimas vienam žodžiui trunka 8,52 ms, esant 50 MHz taktiniam dažniui, ir šimtui DLSK – 66,56 ms, esant 25 MHz taktiniam dažniui.

Sign in / Sign up

Export Citation Format

Share Document