• Title/Summary/Keyword: Average number of false alarms

Search Result 7, Processing Time 0.021 seconds

An Economic Design of the Chart with Variable Sample Size Scheme

  • Park, Chang-Soon;Ji, Seon-Su
    • Journal of the Korean Statistical Society
    • /
    • v.23 no.2
    • /
    • pp.403-420
    • /
    • 1994
  • An economic design of the $\bar{X}-R$ chart using variable sample size (VSS) scheme is proposed in this paper. In this design the sample size at each sampling time changes according to the values of the previous two sample statistics, sample mean and range. The VSS scheme uses large sample if the sample statistics appear near inside the control limits and smaller sample otherwise. The set of process parameters, such as the sampling interval, control limits and the sample sizes, are chosen to minimize the expected cost per hour. The efficiency of the VSS scheme is compared to the fixed sample size one for cases where there is multiple of assignable causes. Percent reductions of the expected cost in the VSS design are calculated for some given sets of cost parameters. It is shown that the VSS scheme improves the confidence of the procedure and performs statistically better in terms of the number of false alarms and the average time to signal, respectively.

  • PDF

Detection of Group of Targets Using High Resolution Satellite SAR and EO Images (고해상도 SAR 영상 및 EO 영상을 이용한 표적군 검출 기법 개발)

  • Kim, So-Yeon;Kim, Sang-Wan
    • Korean Journal of Remote Sensing
    • /
    • v.31 no.2
    • /
    • pp.111-125
    • /
    • 2015
  • In this study, the target detection using both high-resolution satellite SAR and Elecro-Optical (EO) images such as TerraSAR-X and WorldView-2 is performed, considering the characteristics of targets. The targets of our interest are featured by being stationary and appearing as cluster targets. After the target detection of SAR image by using Constant False Alarm Rate (CFAR) algorithm, a series of processes is performed in order to reduce false alarms, including pixel clustering, network clustering and coherence analysis. We extend further our algorithm by adopting the fast and effective ellipse detection in EO image using randomized hough transform, which is significantly reducing the number of false alarms. The performance of proposed algorithm has been tested and analyzed on TerraSAR-X SAR and WordView-2 EO images. As a result, the average false alarm for group of targets is 1.8 groups/$64km^2$ and the false alarms of single target range from 0.03 to 0.3 targets/$km^2$. The results show that groups of targets are successfully identified with very low false alarms.

Performance Prediction of Multiple Hypothesis Tracking Algorithm (다중 가설 추적 알고리듬의 추적 성능예측)

  • 정영헌
    • Proceedings of the IEEK Conference
    • /
    • 2003.07c
    • /
    • pp.2787-2790
    • /
    • 2003
  • In this paper, we predict tracking performance of the multiple hypothesis tracking (MHT) algorithm. The MHT algorithm is known to be an optimal Bayesian approach and is superior to asly other tracking filters because it takes into account the events that the measurements can be originated from new targets and false alarms 3s well as interesting targets. In the MHT algorithm, a number of candidate hypotheses are generated and evaluated later as more data are received. The probability of each candidate hypotheses is approximately evaluated by using the hybrid conditional average approach (HYCA). We performed numerical experiments to show the validity of our performance prediction.

  • PDF

Development of Incident Detection Model Using Compression Wave Test Module (압축파 검사 모듈을 이용한 돌발상황 검지 모형의 개발)

  • Lee, Hwan-Pil;Kim, Nam-Sun;Oh, Young-Tae;Kim, Soo-Hee
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.6
    • /
    • pp.77-88
    • /
    • 2004
  • This study aims at developing the model that is able to detect the compression wave, which is included as a similar situation in incidents, that causes false applicable to the similar character such as incidents in the incident detection model for expressways. In this study, it has been checked whether the number of false alarms is decreased or not by modularizing this model for being able to applicable to other models such as DES and DELOS, etc. which do not perform the compression wave test based on the compression wave test process of APID model which has been being used in the expressway traffic management system currently. The evaluation in this study focuses on the sensitivity of the model and the results analysis is performed classified by each polling cycle. And how well these models are working is evaluated by each polling cycle. In addition to this, the detection rate, the false alarm rate and the average detection time in both the existing models and the model in this study are calcuated. As a result of appling the model in this study, it is found that the false alarm rate is improved through the reasonable decrease in the number of false alarm frequencies and there are not remarkable changes concerning the detection rate and the average detection time. To sum up, it is expected that a good number of improvement effects will be occurred when this model is applied to the actual expressway traffic management system.

Performance Prediction of the MHT Algorithm for Tracking under Cluttered Environments (클러터 환경에서 표적 추적을 위한 다중 가설 추적 알고리듬의 성능 예측)

  • 정영헌
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.41 no.4
    • /
    • pp.13-20
    • /
    • 2004
  • In this paper, we developed a method for predicting the tracking performance of the multiple hypothesis tracking (MHT) algorithm. The MHT algerithm is known to be a measurement-oriented optimal Bayesian approach and is superior to any other tracking filters because it takes into account the events that the measurements can be originated from new targets and false alarms as well as interesting targets. In the MHT algorithm, a number of candidate hypotheses are generated and evaluated later as more data are received. The probability of each candidate hypotheses is approximately evaluated by using the hybrid conditional average approach (HYCA). We performed numerical experiments to show the validity of our performance prediction.

A Clustering-Based Fault Detection Method for Steam Boiler Tube in Thermal Power Plant

  • Yu, Jungwon;Jang, Jaeyel;Yoo, Jaeyeong;Park, June Ho;Kim, Sungshin
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.4
    • /
    • pp.848-859
    • /
    • 2016
  • System failures in thermal power plants (TPPs) can lead to serious losses because the equipment is operated under very high pressure and temperature. Therefore, it is indispensable for alarm systems to inform field workers in advance of any abnormal operating conditions in the equipment. In this paper, we propose a clustering-based fault detection method for steam boiler tubes in TPPs. For data clustering, k-means algorithm is employed and the number of clusters are systematically determined by slope statistic. In the clustering-based method, it is assumed that normal data samples are close to the centers of clusters and those of abnormal are far from the centers. After partitioning training samples collected from normal target systems, fault scores (FSs) are assigned to unseen samples according to the distances between the samples and their closest cluster centroids. Alarm signals are generated if the FSs exceed predefined threshold values. The validity of exponentially weighted moving average to reduce false alarms is also investigated. To verify the performance, the proposed method is applied to failure cases due to boiler tube leakage. The experiment results show that the proposed method can detect the abnormal conditions of the target system successfully.

Generalization of Window Construction for Subsequence Matching in Time-Series Databases (시계열 데이터베이스에서의 서브시퀀스 매칭을 위한 윈도우 구성의 일반화)

  • Moon, Yang-Sae;Han, Wook-Shin;Whang, Kyu-Young
    • Journal of KIISE:Databases
    • /
    • v.28 no.3
    • /
    • pp.357-372
    • /
    • 2001
  • In this paper, we present the concept of generalization in constructing windows for subsequence matching and propose a new subsequence matching method. GeneralMatch, based on the generalization. The earlier work of Faloutsos et al.(FRM in short) causes a lot of false alarms due to lack of the point-filtering effect. DualMatch, which has been proposed by the authors, improves performance significantly over FRM by exploiting the point filtering effect, but it has the problem of having a smaller maximum window size (half that FRM) given the minimum query length. GeneralMatch, an improvement of DualMatch, offers advantages of both methods: it can use large windows like FRM and, at the same time, can exploit the point-filtering effect like DualMatch. GeneralMatch divides data sequences into J-sliding windows (generalized sliding windows) and the query sequence into J-disjoint windows (generalized disjoint windows). We formally prove that our GeneralMatch is correct, i.e., it incurs no false dismissal. We also prove that, given the minimum query length, there is a maximum bound of the window size to guarantee correctness of GeneralMatch. We then propose a method of determining the value of J that minimizes the number of page accesses, Experimental results for real stock data show that, for low selectivities ($10^{-6}~10^{-4}$), GeneralMatch improves performance by 114% over DualMatch and by 998% iver FRM on the average; for high selectivities ($10^{-6}~10^{-4}$), by 46% over DualMatch and by 65% over FRM on the average.

  • PDF