• Title/Summary/Keyword: Detection performance

Search Result 7,833, Processing Time 0.034 seconds

Calculation of the Detection Range for a Given Cumulative Probability in Airborne Surveillance Radars (탐색 레이다에서 누적확률에 기인한 탐지거리 계산에 관한 연구)

  • Kim, Eun Hee;Roh, Ji-Eun
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.29 no.1
    • /
    • pp.24-27
    • /
    • 2018
  • The performance measure of airborne radars is the range at which the cumulative probability of detection has some specified value, because the per-scan detection probability is an oscillatory function of the target range in airborne radars operating with the dynamic clutter environment. As a result, no one range, at which the per-scan detection probability has a given value, can give a meaningful description of the range performance. In this paper, we provide the equation to calculate the cumulative detection probability and show that the result of Monte Carlo simulation is same as the calculated value in a simple scenario. This verified Monte Carlo model will be used to evaluate the performance of airborne radars in various operating scenarios, at which the numerical calculation is difficult.

A Lightweight Real-Time Small IR Target Detection Algorithm to Reduce Scale-Invariant Computational Overhead (스케일 불변적인 연산량 감소를 위한 경량 실시간 소형 적외선 표적 검출 알고리즘)

  • Ban, Jong-Hee;Yoo, Joonhyuk
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.12 no.4
    • /
    • pp.231-238
    • /
    • 2017
  • Detecting small infrared targets from the low-SCR images at a long distance is very hard. The previous Local Contrast Method (LCM) algorithm based on the human visual system shows a superior performance of detecting small targets by a background suppression technique through local contrast measure. However, its slow processing speed due to the heavy multi-scale processing overhead is not suitable to a variety of real-time applications. This paper presents a lightweight real-time small target detection algorithm, called by the Improved Selective Local Contrast Method (ISLCM), to reduce the scale-invariant computational overhead. The proposed ISLCM applies the improved local contrast measure to the predicted selective region so that it may have a comparable detection performance as the previous LCM while guaranteeing low scale-invariant computational load by exploiting both adaptive scale estimation and small target feature feasibility. Experimental results show that the proposed algorithm can reduce its computational overhead considerably while maintaining its detection performance compared with the previous LCM.

Selection of Signal Strength and Detection Threshold for Optimal Tracking with Nearest Neighbor Filter (NN 필터 추적을 위한 최적 신호 강도 및 검출 문턱값 선택)

  • Jeong, Yeong-Heon;Gwon, Il-Hwan;Hong, Sun-Mok
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.37 no.3
    • /
    • pp.1-8
    • /
    • 2000
  • In this paper, we formulate an optimal control problem to obtain the optimal signal strength and detection threshold for tracking with NN filter, First, we predict the tracking performance of NN filter by using the HYCA method. Based on this method, the predicted tracking performance is represented with respect to signal strength and detection threshold. Using this relation, we find the optimal parameters for following three examples: 1) the sequence of optimal detection threshold which minimizes sum of position estimation error; 2) the sequence of optimal detection threshold which minimizes sum of validation gate volume; and 3) the sequence of optimal signal strength and detection threshold which minimizes sum of signal strength.

  • PDF

Computationally-Efficient Algorithms for Multiuser Detection in Short Code Wideband CDMA TDD Systems

  • De, Parthapratim
    • Journal of Communications and Networks
    • /
    • v.18 no.1
    • /
    • pp.27-39
    • /
    • 2016
  • This paper derives and analyzes a novel block fast Fourier transform (FFT) based joint detection algorithm. The paper compares the performance and complexity of the novel block-FFT based joint detector to that of the Cholesky based joint detector and single user detection algorithms. The novel algorithm can operate at chip rate sampling, as well as higher sampling rates. For the performance/complexity analysis, the time division duplex (TDD) mode of a wideband code division multiplex access (WCDMA) is considered. The results indicate that the performance of the fast FFT based joint detector is comparable to that of the Cholesky based joint detector, and much superior to that of single user detection algorithms. On the other hand, the complexity of the fast FFT based joint detector is significantly lower than that of the Cholesky based joint detector and less than that of the single user detection algorithms. For the Cholesky based joint detector, the approximate Cholesky decomposition is applied. Moreover, the novel method can also be applied to any generic multiple-input-multiple-output (MIMO) system.

A Study on Performance Improvement of Convolution coded 16 QAM Signal Reception with Maximum ratio combining Diversity in Fading Channel (페이딩 채널에서 최대비 합성 다이버시티 기법과 길쌈 부호화 기법을 채용한 16 QAM 신호의 수신 성능 개선에 관한 연구)

  • Lee, Ho-Young;Kim, Eon-Gon
    • Proceedings of the KSR Conference
    • /
    • 2008.11b
    • /
    • pp.1312-1320
    • /
    • 2008
  • In this paper, we analyzed the error rate performance of convolution coded 16 QAM signal with Optimum Threshold Detection with maximum ratio combining diversity in Rician Fading Environments. The performance of 16-QAM signal with CTD (conventional threshold detection) which employs convolution coding technique was analyzed and the performance improvement of convolution coded 16-QAM signal with OTD (optimum threshold detection) which is varied according to fading parameter "K" and AWGN in Rician Fading channel was simulated. As a result of analysis, it was shown the effect of performance improvement to overcome the environment of mobile radio data communication channel.

  • PDF

Distance Functions to Detect Changes in Data Streams

  • Bud Ulziitugs;Lim, Jong-Tae
    • Journal of Information Processing Systems
    • /
    • v.2 no.1
    • /
    • pp.44-47
    • /
    • 2006
  • One of the critical issues in a sensor network concerns the detection of changes in data streams. Recently presented change detection schemes primarily use a sliding window model to detect changes. In such a model, a distance function is used to compare two sliding windows. Therefore, the performance of the change detection scheme is greatly influenced by the distance function. With regard to sensor nodes, however, energy consumption constitutes a critical design concern because the change detection scheme is implemented in a sensor node, which is a small battery-powered device. In this paper, we present a comparative study of various distance functions in terms of execution time, energy consumption, and detecting accuracy through simulation of speech signal data. The simulation result demonstrates that the Euclidean distance function has the highest performance while consuming a low amount of power. We believe our work is the first attempt to undertake a comparative study of distance functions in terms of execution time, energy consumption, and accuracy detection.

Numerical estimation on balance coefficients of central difference averaging method for quench detection of the KSTAR PF coils

  • Kim, Jinsub;An, Seok Chan;Ko, Tae Kuk;Chu, Yong
    • Progress in Superconductivity and Cryogenics
    • /
    • v.18 no.3
    • /
    • pp.25-29
    • /
    • 2016
  • A quench detection system of KSTAR Poloidal Field (PF) coils is inevitable for stable operation because normal zone generates overheating during quench occurrence. Recently, new voltage quench detection method, combination of Central Difference Averaging (CDA) and Mutual Inductance Compensation (MIK) for compensating mutual inductive voltage more effectively than conventional voltage detection method, has been suggested and studied. For better performance of mutual induction cancellation by adjacent coils of CDA+MIK method for KSTAR coil system, balance coefficients of CDA must be estimated and adjusted preferentially. In this paper, the balance coefficients of CDA for KSTAR PF coils were numerically estimated. The estimated result was adopted and tested by using simulation. The CDA method adopting balance coefficients effectively eliminated mutual inductive voltage, and also it is expected to improve performance of CDA+MIK method for quench detection of KSTAR PF coils.

Evolutionary Learning of Neural Networks Classifiers for Credit Card Fraud Detection (신용카드 사기 검출을 위한 신경망 분류기의 진화 학습)

  • 박래정
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.5
    • /
    • pp.400-405
    • /
    • 2001
  • This paper addresses an effective approach of training neural networks classifiers for credit card fraud detection. The proposed approach uses evolutionary programming to trails the neural networks classifiers based on maximization of the detection rate of fraudulent usages on some ranges of the rejection rate, loot minimization of mean square error(MSE) that Is a common criterion for neural networks learning. This approach enables us to get classifier of satisfactory performance and to offer a directive method of handling various conditions and performance measures that are required for real fraud detection applications in the classifier training step. The experimental results on "real"credit card transaction data indicate that the proposed classifiers produces classifiers of high quality in terms of a relative profit as well as detection rate and efficiency.

  • PDF

Reliable Measurement Selection for The Small Target Detection and Tracking in The IR Scanning Images (적외선 주사 영상에서 소형 표적의 탐지 및 추적을 위한 신뢰성 있는 측정치 선택 기법)

  • Yang, Yu-Kyung;Kim, Sung-Ho
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.11 no.1
    • /
    • pp.75-84
    • /
    • 2008
  • A new automatic small target detection and tracking algorithm for the real-time IR surveillance system is presented. The automatic target detection and tracking algorithm of the real-time systems, requires low complexity and robust tracking performance in the cluttered environment. Linear-array and parallel-scan IR systems usually suffer from severe scan noise caused by the detector non-uniformity. After the spatial filtering and thresholding, this scan noise still remains as high amplitude clutter which degrades the target detection rate and tracking performance. In this paper, we propose a new feature which consists of area and validity information of a measurement. By adopting this feature to the measurements selection and track confirmation, we can increase the target detection rate and reduce both the track loss rate and false track rate. From the experimental results, we can validate the feasibility of the proposed method in the noisy IR images.

ON-LINE FAULT DETECTION METHOD ACCOUNTINE FOR MODELLING ERRORS

  • Kim, Seong-Jin;Kwon, Oh-Kyu
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1990.10b
    • /
    • pp.1228-1233
    • /
    • 1990
  • This paper proposes a robust on-line fault detection method for uncertain systems. It is based on the fault detection method [10] accounting for modelling errors, which is shown to have superior performance over traditional methods but has some computational problems so that it is hard to be applied to on-line problems. The proposed method in this paper is an on-line version of the fault detection method suggested in [10]. Thus the method has the same detection performance robust to model uncertainties as that of [10]. Moreover, its computational burden is shown to be considerably lessened so that it is applicable to on-line fault detection problems.

  • PDF