• 제목/요약/키워드: threshold moving

검색결과 177건 처리시간 0.019초

가변 샘플링 간격(VSI)을 갖는 적응형 이동평균 (A-MA) 관리도 (An Adaptive Moving Average (A-MA) Control Chart with Variable Sampling Intervals (VSI))

  • 임태진
    • 대한산업공학회지
    • /
    • 제33권4호
    • /
    • pp.457-468
    • /
    • 2007
  • This paper proposes an adaptive moving average (A-MA) control chart with variable sampling intervals (VSI) for detecting shifts in the process mean. The basic idea of the VSI A-MA chart is to adjust sampling intervals as well as to accumulate previous samples selectively in order to increase the sensitivity. The VSI A-MA chart employs a threshold limit to determine whether or not to increase sampling rate as well as to accumulate previous samples. If a standardized control statistic falls outside the threshold limit, the next sample is taken with higher sampling rate and is accumulated to calculate the next control statistic. If the control statistic falls within the threshold limit, the next sample is taken with lower sampling rate and only the sample is used to get the control statistic. The VSI A-MA chart produces an 'out-of-control' signal either when any control statistic falls outside the control limit or when L-consecutive control statistics fall outside the threshold limit. The control length L is introduced to prevent small mean shifts from being undetected for a long period. A Markov chain model is employed to investigate the VSI A-MA sampling process. Formulae related to the steady state average time-to signal (ATS) for an in-control state and out-of-control state are derived in closed forms. A statistical design procedure for the VSI A-MA chart is proposed. Comparative studies show that the proposed VSI A-MA chart is uniformly superior to the adaptive Cumulative sum (CUSUM) chart and to the Exponentially Weighted Moving Average (EWMA) chart, and is comparable to the variable sampling size (VSS) VSI EWMA chart with respect to the ATS performance.

가산 투엽법을 이용한 이동 물체 추적 방법 (A Moving Target Tracking Algorithm Using Integral Projection)

  • 김태원;서일홍;양해원;오상록;임달호
    • 대한전기학회논문지
    • /
    • 제38권7호
    • /
    • pp.569-581
    • /
    • 1989
  • This paper deals with a tracking algorithm based on integral projection which tracks moving targets with varying brightness and size. An adaptive windowing technique is employed to reduce the sensitivity of the system to the complex background image and also to reduce the computational load. The threshold value is determined by considering both the size and the threshold value of the brightness intensity of the recognized target obtained in the previous processing step. Window position is estimated by using the information of the velocity and acceleration of the target. And integral projection is applied to find the position of the target in the window accurately. Experimental results show that moving targets with varying brightness and size can be tracked properly in noisy environments.

  • PDF

얼굴가림 정보를 이용한 유사 범인 검출에 관한 연구 (A Study on Look alike Offender Detection Using Hidden Face Information)

  • 김수인
    • 조명전기설비학회논문지
    • /
    • 제28권4호
    • /
    • pp.70-79
    • /
    • 2014
  • In this paper, I propose a method for detection of look-alike offenders by using hidden face information. For extraction of moving objects, PRA matching is used to extract moving components, and brightness changes can be dealt with by an adaptive threshold adjusting in the proposed method. Moving objects extracted in the territory of the face region is extracted using the complexion, facial area, eyes, nose, mouth. The extracted information detected by the presence of these characteristics were likely to help judge a person. Results of the extracted face makes the recognition rate of possible murderers 90% so the usefulness of the proposed method was confirmed.

다단계 결합을 이용한 이동 물체 분리 알고리즘에 관한 연구 (The Moving Object Segmentation By Using Multistage Merging)

  • 안용학;이정헌;채옥삼
    • 한국통신학회논문지
    • /
    • 제21권10호
    • /
    • pp.2552-2562
    • /
    • 1996
  • In this paper, we propose a segmentation algorithm that can reliably separate moving objects from noisy background in the image sequance received from a camera at the fixed position. The proposed algorithm consists of three processes:generation of the difference image between the input image and the reference image, multilevel quantization of the difference image, and multistagemerging in the quantized image. The quantization process requantizes the difference image based on the multiple threshold values determined bythe histogram analysis. The merging starts from the seed region which created by using the highest threshold value and ends when termination conditions are met. the proposed method has been tested with various real imge sequances containing intruders. The test results show that the proposed algorithm can detect moving objects like intruders very effectively in the noisy environment.

  • PDF

A Study on a effective Information Compressor Algorithm for the variable environment variation using the Kalman Filter

  • Choi, Jae-Yun
    • 한국컴퓨터정보학회논문지
    • /
    • 제23권4호
    • /
    • pp.65-70
    • /
    • 2018
  • This paper describes a effective information compressor algorithm for the fourth industrial technology. One of the difficult problems for outdoor is to obtain effective updating process of background images. Because input images generally contain the shadows of buildings, trees, moving clouds and other objects, they are changed by lapse of time and variation of illumination. They provide the lowering of performance for surveillance system under outdoor. In this paper, a effective information algorithm for variable environment variable under outdoor is proposed, which apply the Kalman Estimation Modeling and adaptive threshold on pixel level to separate foreground and background images from current input image. In results, the better SNR of about 3dB~5dB and about 10%~25% noise distribution rate in the proposed method. Furthermore, it was showed that the moving objects can be detected on various shadows under outdoor and better result Information.

부대역 부호화를 이용한 동영상 압축 알고리즘 (A moving image compression algorithm using subband coding)

  • 장세봉;최재윤;김태효
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1998년도 하계종합학술대회논문집
    • /
    • pp.655-658
    • /
    • 1998
  • This paper proposes a moving image compression algorithm using subband coding that divides and processes the differential image of each moving image frame into subband frequency. This method decomposes the original image with each subband and performs DCT. The moving blocks are detected from each of wubband using threshold value which is select from the variance of difference between frames. then they are performed SBDCT and huffman coding in order to reduce the data. As the result of simulation, we confirmed that this method improved the blocking effect of reconstructed image in low bit rate.

  • PDF

A Tracking System Using Location Prediction and Dynamic Threshold for Minimizing SMS Delivery

  • Lai, Yuan-Cheng;Lin, Jian-Wei;Yeh, Yi-Hsuan;Lai, Ching-Neng;Weng, Hui-Chuan
    • Journal of Communications and Networks
    • /
    • 제15권1호
    • /
    • pp.54-60
    • /
    • 2013
  • In this paper, a novel method called location-based delivery (LBD), which combines the short message service (SMS) and global position system (GPS), is proposed, and further, a realistic system for tracking a target's movement is developed. LBD reduces the number of short message transmissions while maintaining the location tracking accuracy within the acceptable range. The proposed approach, LBD, consists of three primary features: Short message format, location prediction, and dynamic threshold. The defined short message format is proprietary. Location prediction is performed by using the current location, moving speed, and bearing of the target to predict its next location. When the distance between the predicted location and the actual location exceeds a certain threshold, the target transmits a short message to the tracker to update its current location. The threshold is dynamically adjusted to maintain the location tracking accuracy and the number of short messages on the basis of the moving speed of the target. The experimental results show that LBD, indeed, outperforms other methods because it satisfactorily maintains the location tracking accuracy with relatively fewer messages.

프레임 블록화와 객체의 이동을 이용한 샷 전환 탐지 알고리즘 (A shot change detection algorithm based on frame segmentation and object movement)

  • 김승현;황두성
    • 한국컴퓨터정보학회논문지
    • /
    • 제20권5호
    • /
    • pp.21-29
    • /
    • 2015
  • 본 논문에서는 프레임 블록화와 이동블록 간 객체 이동을 이용한 샷 전환 탐지 알고리즘을 제안한다. 객체의 급격한 이동을 탐지하기 위해 연속 프레임의 현재 블록의 대각선상에 위치한 이동 블록을 정의하고 블록 히스토그램을 비교한다. 제안 방법은 두 연속 프레임 내 블록 간 객체 이동 여부를 검사하며, 객체 이동 블록 정보를 가지고 프레임 간 샷 전환 탐지를 예측한다. 현재 프레임의 블록이 다음 프레임의 이동 블록과 비교 시, 블록 히스토그램이 사용되며 샷 전환 임계값은 Otsu 임계값 방법을 이용하여 자동으로 선정한다. 제안 방법은 영화, 드라마, 애니메이션, 국가기록원 소장 영상 등과 같이 다양한 흑백 또는 칼라 영상에 대해 테스트되었다. 실험결과 제안하는 방법은 기존의 알고리즘과 비교 시 탐지율을 높일 수 있었다.

심전도신호 샘플링 주파수에 따른 R파 검출 최적 문턱치 설정 (Optimal Threshold Setting Method for R Wave Detection According to The Sampling Frequency of ECG Signals)

  • 조익성;권혁숭
    • 한국정보통신학회논문지
    • /
    • 제21권7호
    • /
    • pp.1420-1428
    • /
    • 2017
  • R파 검출에 사용되는 여러 심전도 데이터베이스는 샘플링 주파수의 차이로 인해 서로 다른 환경에 적용할 경우 성능에 변화가 많아 알고리즘의 신뢰도를 보장하기 어렵다. 본 연구에서는 심전도신호의 샘플링 주파수에 따른 R파 검출의 최적 문턱치 설정 방법을 제안한다. 이를 위해 미분 기반의 이동평균과 제곱합수를 이용하여 전처리를 수행하였다. 이후 샘플링 주파수에 따라 피크 문턱치에 대한 최적 값을 검출하였다. 문턱치 단계는 신호의 변화와 이전 검출된 피크 값에 따라 문턱치를 변경함으로써 최적의 성능을 나타내는 값을 선정하는 과정으로 실험하였다. 제안한 방법의 우수성을 입증하기 위해 부정맥 데이터베이스 레코드를 대상으로 실험한 결과 MIT-BIH 샘플링 주파수 360Hz에 대한 미분 구간($N_d$), 윈도우 사이즈(N), 문턱 계수($p_{th}$)의 최적 값은 각각 7, 8, 6.6일 때 R파 검출율은 99.758%의 우수한 성능을 나타내었다.

OFDM시스템을 위한 적응 문턱값 설정방식의 심볼동기화 알고리듬 (A Symbol Synchronization Algorithm With an Adaptive Threshold Establishment Method For OFDM Systems)

  • Song, Dong-Ho;Joo, Chang-Bok
    • 대한전자공학회논문지TC
    • /
    • 제40권6호
    • /
    • pp.213-224
    • /
    • 2003
  • 제안된 알고리듬은 채널 잡음전력에 따라 적응적으로 문턱값 레벨을 결정하는 적응 문턱값 설정방식을 사용하여 채널특성에 관계없이 항상 최적의 문턱값을 설정한다. 또한, 이것은 그 추정성능이 다중경로채널에서의 전력지연 프로파일 변동에 대해 덜 민감하도록 만드는 특별하게 설계된 훈련심볼을 사용한다. 그 결과, 제안된 기법의 추정성능은 채널특성 변동에 대해 영향을 적게 받는다.