• Title/Summary/Keyword: Detection algorithms

Search Result 1,860, Processing Time 0.033 seconds

Experimental and numerical structural damage detection using a combined modal strain energy and flexibility method

  • Seyed Milad Hosseini;Mohamad Mohamadi Dehcheshmeh;Gholamreza Ghodrati Amiri
    • Structural Engineering and Mechanics
    • /
    • v.87 no.6
    • /
    • pp.555-574
    • /
    • 2023
  • An efficient optimization algorithm and damage-sensitive objective function are two main components in optimization-based Finite Element Model Updating (FEMU). A suitable combination of these components can considerably affect damage detection accuracy. In this study, a new hybrid damage-sensitive objective function is proposed based on combining two different objection functions to detect the location and extent of damage in structures. The first one is based on Generalized Pseudo Modal Strain Energy (GPMSE), and the second is based on the element's Generalized Flexibility Matrix (GFM). Four well-known population-based metaheuristic algorithms are used to solve the problem and report the optimal solution as damage detection results. These algorithms consist of Cuckoo Search (CS), Teaching-Learning-Based Optimization (TLBO), Moth Flame Optimization (MFO), and Jaya. Three numerical examples and one experimental study are studied to illustrate the capability of the proposed method. The performance of the considered metaheuristics is also compared with each other to choose the most suitable optimizer in structural damage detection. The numerical examinations on truss and frame structures with considering the effects of measurement noise and availability of only the first few vibrating modes reveal the good performance of the proposed technique in identifying damage locations and their severities. Experimental examinations on a six-story shear building structure tested on a shake table also indicate that this method can be considered as a suitable technique for damage assessment of shear building structures.

Automatic Generation of GCP Chips from High Resolution Images using SUSAN Algorithms

  • Um Yong-Jo;Kim Moon-Gyu;Kim Taejung;Cho Seong-Ik
    • Proceedings of the KSRS Conference
    • /
    • 2004.10a
    • /
    • pp.220-223
    • /
    • 2004
  • Automatic image registration is an essential element of remote sensing because remote sensing system generates enormous amount of data, which are multiple observations of the same features at different times and by different sensor. The general process of automatic image registration includes three steps: 1) The extraction of features to be used in the matching process, 2) the feature matching strategy and accurate matching process, 3) the resampling of the data based on the correspondence computed from matched feature. For step 2) and 3), we have developed an algorithms for automated registration of satellite images with RANSAC(Random Sample Consensus) in success. However, for step 1), There still remains human operation to generate GCP Chips, which is time consuming, laborious and expensive process. The main idea of this research is that we are able to automatically generate GCP chips with comer detection algorithms without GPS survey and human interventions if we have systematic corrected satellite image within adaptable positional accuracy. In this research, we use SUSAN(Smallest Univalue Segment Assimilating Nucleus) algorithm in order to detect the comer. SUSAN algorithm is known as the best robust algorithms for comer detection in the field of compute vision. However, there are so many comers in high-resolution images so that we need to reduce the comer points from SUSAN algorithms to overcome redundancy. In experiment, we automatically generate GCP chips from IKONOS images with geo level using SUSAN algorithms. Then we extract reference coordinate from IKONOS images and DEM data and filter the comer points using texture analysis. At last, we apply automatically collected GCP chips by proposed method and the GCP by operator to in-house automatic precision correction algorithms. The compared result will be presented to show the GCP quality.

  • PDF

Edges Extraction of Buildings Using Sub-divided Pixels (화소 분할을 이용한 건물의 에지 추출)

  • Lee, Dae-Sun;Um, Gi-Mun;Lee, Kwae-Hi
    • Proceedings of the KIEE Conference
    • /
    • 1995.07b
    • /
    • pp.925-927
    • /
    • 1995
  • The purpose of extaction of edges of buildings is an extraction of 3-dimensional imformation. The performance of an exact extraction of edges of buildings using several classic algorithms was not so good. In this study we merged several exposed algorithms-----split-and-merge, anisotropic diffusion, modified canny operation, least mean sqare. Results of this extraction algorithm show better performance than any other detection algorithms of edges of buildings.

  • PDF

Low Complexity Super Resolution Algorithm for FOD FMCW Radar Systems (이물질 탐지용 FMCW 레이더를 위한 저복잡도 초고해상도 알고리즘)

  • Kim, Bong-seok;Kim, Sangdong;Lee, Jonghun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.13 no.1
    • /
    • pp.1-8
    • /
    • 2018
  • This paper proposes a low complexity super resolution algorithm for frequency modulated continuous wave (FMCW) radar systems for foreign object debris (FOD) detection. FOD radar has a requirement to detect foreign object in small units in a large area. However, The fast Fourier transform (FFT) method, which is most widely used in FMCW radar, has a disadvantage in that it can not distinguish between adjacent targets. Super resolution algorithms have a significantly higher resolution compared with the detection algorithm based on FFT. However, in the case of the large number of samples, the computational complexity of the super resolution algorithms is drastically high and thus super resolution algorithms are difficult to apply to real time systems. In order to overcome this disadvantage of super resolution algorithm, first, the proposed algorithm coarsely obtains the frequency of the beat signal by employing FFT. Instead of using all the samples of the beat signal, the number of samples is adjusted according to the frequency of the beat signal. By doing so, the proposed algorithm significantly reduces the computational complexity of multiple signal classifier (MUSIC) algorithm. Simulation results show that the proposed method achieves accurate location even though it has considerably lower complexity than the conventional super resolution algorithms.

A comparative analysis on Blind Adaptation Algorithms performances for User Detection in CDMA Systems (CDMA System에서 사용자 검파를 위한 Blind 적용 알고리즘에 관한 성능 비교 분석)

  • 조미령;윤석하
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.4
    • /
    • pp.537-546
    • /
    • 2001
  • Griffth's and LCCMA which are Single-user detection adaptive algorithm are proposed for mitigate MAI(multiple access interference) and the near-far problem in direct-sequence spread-spectrum CDMA system and MOE Algorithm is proposed for MMSE(Minimum Mean-Square Error). This paper pertains to three types of Blind adaptive algorithms which can upgrade system functionality without the requirements from training sequence. It goes further to compare and analyze the functionalities of the algorithms as per number of interfering users or data update rate of the users. The simulation results was that LCCMA algorithm was superior to other algorithms in both areas. Blind application enabled a more flexible network design by eliminating the necessity of training sequence.

  • PDF

Developing an integrated software solution for active-sensing SHM

  • Overly, T.G.;Jacobs, L.D.;Farinholt, K.M.;Park, G.;Farrar, C.R.;Flynn, E.B.;Todd, M.D.
    • Smart Structures and Systems
    • /
    • v.5 no.4
    • /
    • pp.457-468
    • /
    • 2009
  • A novel approach for integrating active sensing data interrogation algorithms for structural health monitoring (SHM) applications is presented. These algorithms cover Lamb wave propagation, impedance methods, and sensor diagnostics. Contrary to most active-sensing SHM techniques, which utilize only a single signal processing method for damage identification, a suite of signal processing algorithms are employed and grouped into one package to improve the damage detection capability. A MATLAB-based user interface, referred to as HOPS, was created, which allows the analyst to configure the data acquisition system and display the results from each damage identification algorithm for side-by-side comparison. By grouping a suite of algorithms into one package, this study contributes to and enhances the visibility and interpretation of the active-sensing methods related to damage identification. This paper will discuss the detailed descriptions of the damage identification techniques employed in this software and outline future issues to realize the full potential of this software.

A Color Video Flame Detection Method based on Wavelet Transform to Remove Flickering Non-Flame Detection (점멸성 비화염 검출을 제거하는 웨이블릿변환 기반의 컬러영상 화염 검출 방법)

  • Sanjeewa, Nuwan;Lee, Hyun-Sul;Kim, Won-Ho
    • Journal of Satellite, Information and Communications
    • /
    • v.8 no.4
    • /
    • pp.89-94
    • /
    • 2013
  • This paper presents color video flame detection algorithm based on wavelet transform to remove detection of flickering non-flame objects. Conventional flame detection algorithms consist of simple or mixed functions using colors, temporal and spatial characteristics. But those algorithms detect non-flame objects as flame regions sometimes. False alarm reasons are flame-like objects with regular flickering lights such as car signal lamps, alarm lights etc. The proposed algorithm is to reduce false detection which is occurred in periodic flickering lights. At first, It segments the candidate flame regions by using frame difference, flame colors. Then it distinguish flame regions and non flame regions including flickering car lights by analyzing wavelet coefficients. Computer simulation results showed that the proposed algorithm removes false detection due to the periodic flickering lamps by performing 97.9% of correct detection rate while false detection rate is 7.3%.

Blind Watermarking Algorithms: A Tutorial (블라인드 워터마킹: 튜토리얼)

  • 김형중;여인권
    • Journal of Broadcast Engineering
    • /
    • v.6 no.3
    • /
    • pp.270-282
    • /
    • 2001
  • This paper Introduces three well-known blind watermarking algorithms in terms of signal processing aspects. Those three methods include correlation-based, echo-hiding, and patchwork algorithms. Those algorithms can be applied either in time-domain (or equivalently spatial-domain) or frequency-domain (or equivalently transform-domain). This paper describes watermark embedding and detection algorithms as well as basic ideas for those watermarking algorithms. In addition, we include some experimental results.

  • PDF

A Design of Snoring Detection System using Chaotic Signal

  • Choo, Yeon-Gyu
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.5
    • /
    • pp.560-565
    • /
    • 2010
  • In this study, the existence of chaotic characteristics in snoring signals obtained in the form of time series data was checked through quantitative and qualitative analysis methods, and a snoring signal detection system was designed applied with detection algorithms considering diverse parameters of occurring signals in order to enhance the accuracy and reliability of detections and the performance of the system was checked. The system was tested with certain snoring patients and thereby the results as follows could be obtained.

Deep Packet Inspection for Intrusion Detection Systems: A Survey

  • AbuHmed, Tamer;Mohaisen, Abedelaziz;Nyang, Dae-Hun
    • Information and Communications Magazine
    • /
    • v.24 no.11
    • /
    • pp.25-36
    • /
    • 2007
  • Deep packet inspection is widely recognized as a powerful way which is used for intrusion detection systems for inspecting, deterring and deflecting malicious attacks over the network. Fundamentally, almost intrusion detection systems have the ability to search through packets and identify contents that match with known attach. In this paper we survey the deep packet inspection implementations techniques, research challenges and algorithm. Finally, we provide a comparison between the different applied system.