• Title/Summary/Keyword: Early detection algorithm

Search Result 224, Processing Time 0.036 seconds

Flame and Smoke Detection for Early Fire Recognition (조기 화재인식을 위한 화염 및 연기 검출)

  • Park, Jang-Sik;Kim, Hyun-Tae;Choi, Soo-Young;Kang, Chang-Soon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.427-430
    • /
    • 2007
  • Many victims and property damages are caused in fires every year. In this paper, flame and smoke detection algorithm by using image processing technique is proposed to early alarm fires. The first decision of proposed algorithms is to check candidate of flame region with its unique color distribution distinguished from artificial lights. If it is not a flame region then we can check to candidate of smoke region by measuring difference of brightness and chroma at present frame. If we just check flame and smoke with only simple brightness and hue, we will occasionally get false alarms. Therefore we also use motion information about candidate of flame and smoke regions. Finally, to determine the flame after motion detection, activity information is used. And in order to determine the smoke, edges detection method is adopted. As a result of simulation with real CCTV video signal, it is shown that the proposed algorithm is useful for early fire recognition.

  • PDF

Sphere Decoding Algorithm Using Two-Level Search (2-레벨 탐색을 이용한 스피어 디코딩 알고리즘)

  • Huynh, Tronganh;Cho, Jong-Min;Kim, Jin-Sang;Cho, Won-Kyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12A
    • /
    • pp.1133-1137
    • /
    • 2008
  • Sphere decoding is considered as one of the most promising methods for multiple-input multiple-output (MIMO) detection. This paper proposes a novel 2-level-search sphere decoding algorithm. In the proposed algorithm, symbol detection is concurrently performed on two levels of the tree search, which helps avoid discarding good candidates at early stages. Simulation results demonstrate the good performance of the proposed algorithm in terms of bit-error-rate (BER).

A Self-Adaptive Agorithm for Optimizing Random Early Detection(RED) Dynamics (라우터 버퍼 관리 기반 체증 제어 방식의 최적화를 위한 자체 적응 알고리즘)

  • Hong, Seok-Won;Yu, Yeong-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.11
    • /
    • pp.3097-3107
    • /
    • 1999
  • Recently many studies have been done on the Random Early Detection(RED) algorithm as an active queue management and congestion avoidance scheme in the Internet. In this paper we first overview the characteristics of RED and the modified RED algorithms in order to understand the current status of these studies. Then we analyze the RED dynamics by investigating how RED parameters affect router queue behavior. We show the cases when RED fails since it cannot react to queue state changes aggressively due to the deterministic use of its parameters. Based on the RED parameter analysis, we propose a self-adaptive algorithm to cope with this RED weakness. In this algorithm we make two parameters be adjusted themselves depending on the queue states. One parameter is the maximum probability to drop or mark the packet at the congestion state. This parameter can be adjusted to react the long burst of traffic, consequently reducing the congestion disaster. The other parameter is the queue weight which is also adjusted aggressively in order for the average queue size to catch up with the current queue size when the queue moves from the congestion state to the stable state.

  • PDF

A New Queue Management Algorithm for Improving Fairness between TCP and UDP Flows (TCP와 UDP 플로우 간의 공정성 개선을 위한 새로운 큐 관리 알고리즘)

  • Chae, Hyun-Seok;Choi, Myung-Ryul
    • The KIPS Transactions:PartC
    • /
    • v.11C no.1
    • /
    • pp.89-98
    • /
    • 2004
  • AQM (Active Queue Management) techniques such as RED (Random Early Detection) which be proposed to solve the congestion of internet perform congestion control effectively for TCP data. However, in the situation where TCP and UDP share the bottleneck link, they can not solve the problems of the unfairness and long queueing delay. In this paper, we proposed an simple queue management algorithm, called PSRED (Protocol Sensitive RED), that improves fairness and decreases queueing delay. PSRED algorithm improves fairness and decreases average queue length by distinguishes each type of flow in using protocol field of packets and applies different drop functions to them respectively.

Faults Detection Method Unrelated to Signal to Noise Ratio in a Hub Bearing (신호대 잡음비에 무관한 허브 베어링 결함 검출 방법)

  • Choi, Young-Chul;Kim, Yang-Hann;Ko, Eul-seok;Park, Choon-Su
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.14 no.12
    • /
    • pp.1287-1294
    • /
    • 2004
  • Hub bearings not only sustain the body of a cat, but permit wheels to rotate freely. Excessive radial or axial load and many other reasons can cause defects to be created and grown in each component. Therefore, nitration and noise from unwanted defects in outer-race, inner-race or ball elements of a Hub bearing are what we want to detect as early as possible. How early we can detect the faults has to do with how the detection algorithm finds the fault information from measured signal. Fortunately, the bearing signal has Periodic impulse train. This information allows us to find the faults regardless how much noise contaminates the signal. This paper shows the basic signal processing idea and experimental results that demonstrate how good the method is.

Faults Detection in Hub Bearing with Minimum Variance Cepstrum (최소 분산 켑스트럼을 이용한 자동차 허브 베어링 결함 검출)

  • 박춘수;최영철;김양한;고을석
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2004.05a
    • /
    • pp.593-596
    • /
    • 2004
  • Hub bearings not only sustain the body of a car, but permit wheels to rotate freely. Excessive radial or axial load and many other reasons can cause defects to be created and grown in each component. Therefore, vibration and noise from unwanted defects in outer-race, inner-race or ball elements of a Hub bearing are what we want to detect as early as possible. How early we can detect the faults has to do with how the detection algorithm finds the fault information from measured signal. Fortunately, the bearing signal has periodic impulse train. This information allows us to find the faults regardless how much noise contaminates the signal. This paper shows the basic signal processing idea and experimental results that demonstrate how good the method is.

  • PDF

Bearing ultra-fine fault detection method and application (베어링 초 미세 결함 검출방법과 실제 적용)

  • Park, Choon-Su;Choi, Young-Chul;Kim, Yang-Hann;Ko, Eul-Seok
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2004.11a
    • /
    • pp.1093-1096
    • /
    • 2004
  • Bearings are elementary machinery component which loads and do rotating motion. Excessive loads or many other reasons can cause incipient faults to be created and grown in each component. Moreover, it happens that incipient faults which were caused by manufacturing or assembling process' errors of the bearings are created. Finding the incipient faults as early as possible is necessary to the bearings in severe condition: high speed or frequently varying load condition, etc. How early we can detect the faults has to do with how the detection algorithm finds the fault information from measured signal. Fortunately, the bearing fault signal makes periodic impulse train. This information allows us to find the faults regardless how much noise contaminates the signal. This paper shows the basic signal processing idea and experimental results that demonstrate how good the method is.

  • PDF

A Hybrid Active Queue Management for Stability and Fast Adaptation

  • Joo Chang-Hee;Bahk Sae-Woong;Lumetta Steven S.
    • Journal of Communications and Networks
    • /
    • v.8 no.1
    • /
    • pp.93-105
    • /
    • 2006
  • The domination of the Internet by TCP-based services has spawned many efforts to provide high network utilization with low loss and delay in a simple and scalable manner. Active queue management (AQM) algorithms attempt to achieve these goals by regulating queues at bottleneck links to provide useful feedback to TCP sources. While many AQM algorithms have been proposed, most suffer from instability, require careful configuration of nonintuitive control parameters, or are not practical because of slow response to dynamic traffic changes. In this paper, we propose a new AQM algorithm, hybrid random early detection (HRED), that combines the more effective elements of recent algorithms with a random early detection (RED) core. HRED maps instantaneous queue length to a drop probability, automatically adjusting the slope and intercept of the mapping function to account for changes in traffic load and to keep queue length within the desired operating range. We demonstrate that straightforward selection of HRED parameters results in stable operation under steady load and rapid adaptation to changes in load. Simulation and implementation tests confirm this stability, and indicate that overall performances of HRED are substantially better than those of earlier AQM algorithms. Finally, HRED control parameters provide several intuitive approaches to trading between required memory, queue stability, and response time.

Improvement of a characteristic point detection algorithm of arterial pulse (동맥맥파의 특징점 검출 알고리즘 개선에 관한 연구)

  • Jeon, Young-Ju;Lee, Jeon;Kim, Jong-Yeol;Lee, Lark-Beom;Im, Jae-Jong
    • Proceedings of the KIEE Conference
    • /
    • 2007.07a
    • /
    • pp.1916-1917
    • /
    • 2007
  • Aortic AIx(augmentation index) has been used to measure aortic stiffness and evaluate ventricular load quantitatively. Algorithm for the detection of augmentation point gradually increases the differential order to detect inflection point rather than detects the distinctive point that appears after a specific time. Developed algorithm for AIx is proved to provide more accurate results than the ones developed by previous studies with the deviation from $-11.5{\pm}14.34$ points to $-3.75{\pm}1.26$ points. Results could provide the basis for the measurement of aortic stiffness using easily-measurable radial artery pulse waves, and could be extended to develop a system for early diagnosis of various vascular diseases.

  • PDF

A Channel Estimation Scheme using Early-late Doppler Compensator in uplink WCDMA system (WCDMA 시스템의 역방향 링크에서 Early-late 도플러 보상을 이용한 채널 추정 기법)

  • Choi, Jung-Hyun;Kim, Nak-Myeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.1B
    • /
    • pp.90-98
    • /
    • 2002
  • To increase system capacity in WCDMA receiver, the coherent detection is an essential technology for recovering transmitted symbols correctly. For coherent detection, an accurate and fast channel estimation is required. In next generation mobile communication system, high frequency carriers are used, and high data rate services are provided for subscribers having high mobility. In this communication environment, however, the rapidly-changing doppler frequency degrades the quality of the transmitted signal a lot. In WCDMA system, the channel estimation is conducted using pilot channel and/or pilot symbols which are known to both transmitter and receiver. Some existing channel estimation algorithms utilize these information quite well, but the performance of channel estimation gets very poor in a complicated fading channel distorted by the doppler effect. In this paper, we propose a new channel estimation algorithm combining an early-late doppler compensator so that the doppler effect and the fading characteristics are compensated at the same time. By computer simulation, the proposed algorithm proved to be a much more efficient channel estimation method in the fast fading channel, even at reasonably low Eb/No.