• 제목/요약/키워드: optimal detection distance

검색결과 76건 처리시간 0.024초

Optimal sensor placement for bridge damage detection using deflection influence line

  • Liu, Chengyin;Teng, Jun;Peng, Zhen
    • Smart Structures and Systems
    • /
    • 제25권2호
    • /
    • pp.169-181
    • /
    • 2020
  • Sensor placement is a crucial aspect of bridge health monitoring (BHM) dedicated to accurately estimate and locate structural damages. In addressing this goal, a sensor placement framework based on the deflection influence line (DIL) analysis is here proposed, for the optimal design of damage detection-oriented BHM system. In order to improve damage detection accuracy, we explore the change of global stiffness matrix, damage coefficient matrix and DIL vector caused by structural damage, and thus develop a novel sensor placement framework based on the Fisher information matrix. Our approach seeks to determine the contribution of each sensing node to damage detection, and adopts a distance correction coefficient to eliminate the information redundancy among sensors. The proposed damage detection-oriented optimal sensor placement (OSP) method is verified by two examples: (1) a numerically simulated three-span continuous beam, and (2) the Pinghu bridge which has existing real damage conditions. These two examples verify the performance of the distance corrected damage sensitivity of influence line (DSIL) method in significantly higher contribution to damage detection and lower information redundancy, and demonstrate the proposed OSP framework can be potentially employed in BHM practices.

Adaboost 최적 특징점을 이용한 차량 검출 (Vehicle Detection Using Optimal Features for Adaboost)

  • 김규영;이근후;김재호;박장식
    • 한국전자통신학회논문지
    • /
    • 제8권8호
    • /
    • pp.1129-1135
    • /
    • 2013
  • 본 논문에서는 최적 특징점 선택기법를 적용한 다중 최적 Adaboost 분류기를 기반으로 새로운 차량 검출 알고리즘을 제안한다. 제안하는 알고리즘은 2 가지 주요 모듈로 구성된다. 첫 번째는 설치된 카메라의 사이트 모델링을 이용한 영상 스케일링을 기반으로 하는 이론적 DDISF(Distance Dependent Image Scaling Factor) 모듈이며, 두 번째는 차량과 카메라의 거리에 대응하는 최적 Haar-like 특징을 활용하는 것이다. 실험 결과 제안하는 알고리즘은 기존의 방법에 비하여 인식 성능이 개선됨을 확인하였다. 제안하는 알고리즘은 96.43% 의 인식률과 약 3.77%의 오검출이 발생하였다. 이러한 성능은 기존의 표준 Adabooost 알고리즘에 비하여 각각 3.69%와 1.28% 의 성능을 개선한 것이다.

셀룰라 병렬처리 회로망에 의한 동적계획법 설계와 자율주행 자동차를 위한 도로 윤곽 검출 (Cellular Parallel Processing Networks-based Dynamic Programming Design and Fast Road Boundary Detection for Autonomous Vehicle)

  • 홍승완;김형석
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제53권7호
    • /
    • pp.465-472
    • /
    • 2004
  • Analog CPPN-based optimal road boundary detection algorithm for autonomous vehicle is proposed. The CPPN is a massively connected analog parallel array processor. In the paper, the dynamic programming which is an efficient algorithm to find the optimal path is implemented with the CPPN algorithm. If the image of road-boundary information is utilized as an inter-cell distance, and goals and start lines are positioned at the top and the bottom of the image, respectively, the optimal path finding algorithm can be exploited for optimal road boundary detection. By virtue of the parallel and analog processing of the CPPN and the optimal solution of the dynamic programming, the proposed road boundary detection algorithm is expected to have very high speed and robust processing if it is implemented into circuits. The proposed road boundary algorithm is described and simulation results are reported.

3차원 일대일 충돌 감지 및 회피 알리고리듬 (Algorithm for Pairwise Collision Detection and Avoidace in 3-D)

  • 김광연;박정우;탁민제
    • 한국항공우주학회지
    • /
    • 제36권10호
    • /
    • pp.996-1002
    • /
    • 2008
  • 본 논문에서는 3차원 일대일 충돌 감지, 충돌 회피 및 경로점 유도를 위한 알고리듬에 대해 다룬다. 항공기는 질점 모델로 가정하였다. 충돌 감지는 최근접점까지 남은 시간과 그 때의 거리를 기준 값과 비교하여 수행하였다. 충돌 회피는 최적 제어 이론을 이용하여 최종 시간에서의 상대 거리를 최대화하는 가속도 입력을 계산하여 수행하였다. 경로점 유도는 잘 알려진 비례항법유도를 적용하였다. 제안된 알고리듬의 성능은 두 개의 시나리오를 통하여 검증하였다.

The Optimized Detection Range of RFID-based Positioning System using k-Nearest Neighbor Algorithm

  • 김정환;허준;한수희;김상민
    • 한국GIS학회:학술대회논문집
    • /
    • 한국GIS학회 2008년도 공동추계학술대회
    • /
    • pp.270-271
    • /
    • 2008
  • The positioning technology for a moving object is an important and essential component of ubiquitous communication computing environment and applications, for which Radio Frequency IDentification Identification(RFID) is has been considered as also a core technology for ubiquitous wireless communication. RFID-based positioning system calculates the position of moving object based on k-nearest neighbor(k-nn) algorithm using detected k-tags which have known coordinates and k can be determined according to the detection range of RFID system. In this paper, RFID-based positioning system determines the position of moving object not using weight factor which depends on received signal strength but assuming that tags within the detection range always operate and have same weight value. Because the latter system is much more economical than the former one. The geometries of tags were determined with considerations in huge buildings like office buildings, shopping malls and warehouses, so they were determined as the line in 1-Dimensional space, the square in 2-Dimensional space and the cubic in 3-Dimensional space. In 1-Dimensional space, the optimal detection range is determined as 125% of the tag spacing distance through the analytical and numerical approach. Here, the analytical approach means a mathematical proof and the numerical approach means a simulation using matlab. But the analytical approach is very difficult in 2- and 3-Dimensional space, so through the numerical approach, the optimal detection range is determined as 134% of the tag spacing distance in 2-Dimensional space and 143% of the tag spacing distance in 3-Dimensional space. This result can be used as a fundamental study for designing RFID-based positioning system.

  • PDF

Ordinal Measure of DCT Coefficients for Image Correspondence and Its Application to Copy Detection

  • Changick Kim
    • 방송공학회논문지
    • /
    • 제7권2호
    • /
    • pp.168-180
    • /
    • 2002
  • This paper proposes a novel method to detect unauthorized copies of digital images. This copy detection scheme can be used as either an alternative approach or a complementary approach to watermarking. A test image is reduced to 8$\times$8 sub-image by intensity averaging, and the AC coefficients of its discrete cosine transform (DCT) are used to compute distance from those generated from the query image, of which a user wants to find copies. Copies may be Processed to avoid copy detection or enhance image quality. We show ordinal measure of DCT coefficients, which is based on relative ordering of AC magnitude values and using distance metrics between two rank permutations, are robust to various modifications of the original image. The optimal threshold selection scheme using the maximum a posteriori (MAP) criterion is also addressed.

An eigenspace projection clustering method for structural damage detection

  • Zhu, Jun-Hua;Yu, Ling;Yu, Li-Li
    • Structural Engineering and Mechanics
    • /
    • 제44권2호
    • /
    • pp.179-196
    • /
    • 2012
  • An eigenspace projection clustering method is proposed for structural damage detection by combining projection algorithm and fuzzy clustering technique. The integrated procedure includes data selection, data normalization, projection, damage feature extraction, and clustering algorithm to structural damage assessment. The frequency response functions (FRFs) of the healthy and the damaged structure are used as initial data, median values of the projections are considered as damage features, and the fuzzy c-means (FCM) algorithm are used to categorize these features. The performance of the proposed method has been validated using a three-story frame structure built and tested by Los Alamos National Laboratory, USA. Two projection algorithms, namely principal component analysis (PCA) and kernel principal component analysis (KPCA), are compared for better extraction of damage features, further six kinds of distances adopted in FCM process are studied and discussed. The illustrated results reveal that the distance selection depends on the distribution of features. For the optimal choice of projections, it is recommended that the Cosine distance is used for the PCA while the Seuclidean distance and the Cityblock distance suitably used for the KPCA. The PCA method is recommended when a large amount of data need to be processed due to its higher correct decisions and less computational costs.

Error analysis for time-in-flight laser range finder with multiple toe amplitude modulation

  • Matsumoto-Moriyama, Masao;Mima, Kazuhiko;Ishimatsu, Takakazu
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국제학술편); Seoul National University, Seoul; 20-22 Oct. 1993
    • /
    • pp.554-557
    • /
    • 1993
  • The error analysis for the Time-in-Flight Laser Range Finder with Multiple Tone Amplitude Modulation relevant to the phase detection error is made. The distance can be estimated to solve the formulate which express the relationship between the absolute distance from the range finder to the object and the wavenumbers and the phases of the modulated waves by the optimization technique. The main cause of the estimation error can be considered as the phase detection error induced from the amplitude modulator and the phase detector. To clarify the phase detection error and the optimal amplitude frequency set, the numerical analysis are made.

  • PDF

Hausdorff와 LBP 거리의 융합을 이용한 개선된 얼굴검출 (An Improved Face Detection Method Using a Hybrid of Hausdorff and LBP Distance)

  • 박성천;구자영
    • 한국컴퓨터정보학회논문지
    • /
    • 제15권11호
    • /
    • pp.67-73
    • /
    • 2010
  • 본 논문에서는 두 점의 집합들 사이의 기하학적 유사도에 근거한 Hausdorff 거리와 국지적 미세 텍스처의 분포에 근거한 Local Binary Pattern 거리가 융합된 새로운 측도를 도입함으로써 얼굴검출의 정확도를 높이는 방법을 제안하고 있다. 트레이닝 데이터를 이용해서 두 가지의 상이한 측도들을 정규화할 수 있는 매개변수와 최적화된 융합 비율을 찾는 방법을 보였다. 흔히 사용되는 얼굴 데이터베이스에 적용함으로써 제시된 방법이 두 가지 방법 각각을 이용한 방법보다 효과적이고 얼굴의 자세, 조명, 배경의 변화에 강인함을 보였다. 실험에서 사용된 데이터베이스의 경우 실제 얼굴의 위치와 검출된 얼굴의 위치 간의 평균거리오차가 LBP 방식의 47.9%, Hausdorff 방식의 22.8% 로 감소됨을 보였다.

Distance Sensitive AdaBoost using Distance Weight Function

  • Lee, Won-Ju;Cheon, Min-Kyu;Hyun, Chang-Ho;Park, Mi-Gnon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제12권2호
    • /
    • pp.143-148
    • /
    • 2012
  • This paper proposes a new method to improve performance of AdaBoost by using a distance weight function to increase the accuracy of its machine learning processes. The proposed distance weight algorithm improves classification in areas where the original binary classifier is weak. This paper derives the new algorithm's optimal solution, and it demonstrates how classifier accuracy can be improved using the proposed Distance Sensitive AdaBoost in a simulation experiment of pedestrian detection.