• 제목/요약/키워드: Early detection algorithm

검색결과 224건 처리시간 0.026초

우선순위와 문턱치를 가지고 최적 후보 조기 검출을 사용하는 고속 움직임 예측 알고리즘 (Fast Motion Estimation Algorithm Using Early Detection of Optimal Candidates with Priority and a Threshold)

  • 김종남
    • 융합신호처리학회논문지
    • /
    • 제21권2호
    • /
    • pp.55-60
    • /
    • 2020
  • 본 논문에서는 우선순위와 문턱치를 가지고 최적 후보의 조기 탐지를 이용한 움직임 추정의 고속 블록 매칭 알고리즘을 제안한다. 전 영역 탐색(full search) 알고리즘의 계산량을 줄이기 위해 많은 고속 움직임 추정 알고리즘이 발표되었지만, 여전히 움직임 추정 성능을 향상시키기 위한 많은 연구가 보고되고 있다. 제안된 알고리즘은 이전 부분 매칭 오류에서 우선순위가 높은 각 후보에 대한 블록 매칭 오류를 계산한다. 제안된 알고리즘은 대부분의 기존 고속 블록 매칭 알고리즘에 추가적으로 적용하여 속도를 높일 수 있다. 그렇게 함으로써 최소 오류 지점을 조기에 찾고 불가능한 후보에 대한 불필요한 계산을 줄임으로써 속도를 높일 수 있다. 제안된 알고리즘은 전 영역 탐색 알고리즘과 동일한 예측 화질을 가지면서 기존의 고속 무손실 탐색 알고리즘보다 적은 계산을 사용한다. 실험결과로서, 제안된 알고리즘은 예측 화질 저하 없이 PDE 및 전 영역 탐색 방법의 계산에 비해 30 ~ 70%까지 줄일 수 있으며, 다른 고속 손실 알고리즘을 사용하면 더욱 감소시키는 것으로 나타났다.

QoS Buffer Management of Multimedia Networking with GREEN Algorithm

  • Hwang, Lain-Chyr;Ku, Cheng-Yuan;Hsu, Steen-J.;Lo, Huan-Ying
    • Journal of Communications and Networks
    • /
    • 제3권4호
    • /
    • pp.334-341
    • /
    • 2001
  • The provision of QoS control is a key of the successful deployment of multimedia networks. Buffer management plays an important role in QoS control. Therefore, this paper proposes a novel QoS buffer management algorithm named GREEN (Global Random Early Estimation for Nipping), which extends the concepts of ERD (early random drop) and RED (random early detection). Specifically, GREEN enhances the concept of "Random" to "Global Random" by globally considering the random probability function. It also enhances the concept of "Early" to "Early Esti mation" by early estimating the network status. For performance evaluation, except compared with RED, extensive simulation cases are performed to probe the characteristics of GREEN.

  • PDF

다중가스센서를 이용한 화재의 조기검출에 대한 연구 (A Study on the Early Fire Detection by Using Multi-Gas Sensor)

  • 조시형;장향원;전진욱;최석임;김선규;강종위;최삼진;박찬원
    • 센서학회지
    • /
    • 제23권5호
    • /
    • pp.342-348
    • /
    • 2014
  • This paper introduced a novel multi-gas sensor detector with simple signal processing algorithm. This device was evaluated by investigating the characteristics of combustible materials using fire-generated smell and smoke. Plural sensors including TGS821, TGS2442, and TGS260X were equipped to detect carbon monoxide, hydrogen gas, and gaseous air contaminants which exist in cigarette smoke, respectively. Signal processing algorithm based on the difference of response times in fire-generated gases was implemented with early and accurately fire detection from multiple gas sensing signals. All fire experiments were performed in a virtual fire chamber. The cigarette, cotton fiber, hair, polyester fiber, nylon fiber, paper, and bread were used as a combustible material. This analyzing software and sensor controlling algorithm were embedded into 8-bit micro-controller. Also the detected multiple gas sensor signals were simultaneously transferred to the personnel computer. The results showed that the air pollution detecting sensor could be used as an efficient sensor for a fire detector which showed high sensitivity in volatile organic compounds. The proposed detecting algorithm may give more information to us compared to the conventional method for determining a threshold value. A fire detecting device with a multi-sensor is likely to be a practical and commercial technology, which can be used for domestic and office environment as well as has a comparatively low cost and high efficiency compared to the conventional device.

PVC Classification Algorithm Through Efficient R Wave Detection

  • Cho, Ik-Sung;Kwon, Hyeog-Soong
    • 센서학회지
    • /
    • 제22권5호
    • /
    • pp.338-345
    • /
    • 2013
  • Premature ventricular contractions are the most common of all arrhythmias and may cause more serious situation like ventricular fibrillation and ventricular tachycardia in some patients. Therefore, the detection of this arrhythmia becomes crucial in the early diagnosis and the prevention of possible life threatening cardiac diseases. Most methods for detecting arrhythmia require pp interval, or the diversity of P wave morphology, but they are difficult to detect the p wave signal because of various noise types. Thus, it is necessary to use noise-free R wave. So, the new approach for the detection of PVC is presented based on the rhythm analysis and the beat matching in this paper. For this purpose, we removed baseline wandering of low frequency band and made summed signals that are composed of two high frequency bands including the frequency component of QRS complex using the wavelet filter. And then we designed R wave detection algorithm using the adaptive threshold and window through RR interval. Also, we developed algorithm to classify PVC using RR interval. The performance of R wave and PVC detection is evaluated by using MIT-BIH arrhythmia database. The achieved scores indicate average detection rate of 99.76%, sensitivity of 99.30% and specificity of 98.66%; accuracy respectively for R wave and PVC detection.

딥러닝 인공지능 기법을 이용한 화재인식 알고리즘에 관한 연구 (A Study on Fire Recognition Algorithm Using Deep Learning Artificial Intelligence)

  • 류진규;곽동걸;김재중;최정규
    • 전력전자학회:학술대회논문집
    • /
    • 전력전자학회 2018년도 전력전자학술대회
    • /
    • pp.275-277
    • /
    • 2018
  • Recently, the importance of an early response has been emphasized due to the large fire. The most efficient method of extinguishing a large fire is early response to a small flame. To implement this solution, we propose a fire detection mechanism based on a deep learning artificial intelligence. In this study, a small amount of data sets is manipulated by an image augmentation technique using rotating, tilting, blurring, and distorting effects in order to increase the number of the data sets by 5 times, and we study the flame detection algorithm using faster R-CNN.

  • PDF

Complexity-Reduced Algorithms for LDPC Decoder for DVB-S2 Systems

  • Choi, Eun-A;Jung, Ji-Won;Kim, Nae-Soo;Oh, Deock-Gil
    • ETRI Journal
    • /
    • 제27권5호
    • /
    • pp.639-642
    • /
    • 2005
  • This paper proposes two kinds of complexity-reduced algorithms for a low density parity check (LDPC) decoder. First, sequential decoding using a partial group is proposed. It has the same hardware complexity and requires a fewer number of iterations with little performance loss. The amount of performance loss can be determined by the designer, based on a tradeoff with the desired reduction in complexity. Second, an early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Once the edges are detected, no further iteration is required; thus early detection reduces the computational complexity.

  • PDF

Using a Genetic-Fuzzy Algorithm as a Computer Aided Breast Cancer Diagnostic Tool

  • Alharbi, Abir;Tchier, F;Rashidi, MM
    • Asian Pacific Journal of Cancer Prevention
    • /
    • 제17권7호
    • /
    • pp.3651-3658
    • /
    • 2016
  • Computer-aided diagnosis of breast cancer is an important medical approach. In this research paper, we focus on combining two major methodologies, namely fuzzy base systems and the evolutionary genetic algorithms and on applying them to the Saudi Arabian breast cancer diagnosis database, to aid physicians in obtaining an early-computerized diagnosis and hence prevent the development of cancer through identification and removal or treatment of premalignant abnormalities; early detection can also improve survival and decrease mortality by detecting cancer at an early stage when treatment is more effective. Our hybrid algorithm, the genetic-fuzzy algorithm, has produced optimized systems that attain high classification performance, with simple and readily interpreted rules and with a good degree of confidence.

ATM-GFR 서비스에서 TCP 트래픽의 최소 대역폭 보장에 관한 연구 (A Study to Guarantee Minimum Bandwidth to TCP Traffic over ATM-GFR Service)

  • 박인용
    • 한국통신학회논문지
    • /
    • 제27권4C호
    • /
    • pp.308-315
    • /
    • 2002
  • Guaranteed frame rate (GFR) 서비스는 ATM 망에서 인터넷 트래픽을 전송하는 가상 연결에게 예약된 minimum cell rate (MCR)을 보장하고, 여분의 대역폭을 가상 연결들에게 공평하게 배분하기 위해 정의되었다. ATM 망에서 GFR 서비스를 제공하기 위한 가장 간단한 스위치 구현 방법은 frame-based generic cell rate algorithm (F-GCRA) 프레임 분류기와 FIFO 버퍼를 위한 early packet discard (EPD) 기법의 버퍼 허용 알고리즘으로 이루어진다. 이 구현 방법은 간단하지만, 상대적으로 큰 MCR을 예약한 가상 연결에게 예약한 만큼의 대역폭을 보장 할 수 없었다. 본 논문은 TCP 트래픽에 패킷 스페이싱 기법을 적용하여 burstness을 완화시켜서 가상 연결에게 더 큰 MCR을 보장하도록 한다. 또한, 버퍼 허용 알고리즘에 random early detection (RED) 기법을 적용하여 여분의 대역폭 사용에 있어서 공평성을 향상시킨다. 모의 실험을 통해 두 기법이 TCP 트래픽에 대한 GFR 서비스의 QoS를 향상시킴을 보였다.

An Efficient and Stable Congestion Control Scheme with Neighbor Feedback for Cluster Wireless Sensor Networks

  • Hu, Xi;Guo, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권9호
    • /
    • pp.4342-4366
    • /
    • 2016
  • Congestion control in Cluster Wireless Sensor Networks (CWSNs) has drawn widespread attention and research interests. The increasing number of nodes and scale of networks cause more complex congestion control and management. Active Queue Management (AQM) is one of the major congestion control approaches in CWSNs, and Random Early Detection (RED) algorithm is commonly used to achieve high utilization in AQM. However, traditional RED algorithm depends exclusively on source-side control, which is insufficient to maintain efficiency and state stability. Specifically, when congestion occurs, deficiency of feedback will hinder the instability of the system. In this paper, we adopt the Additive-Increase Multiplicative-Decrease (AIMD) adjustment scheme and propose an improved RED algorithm by using neighbor feedback and scheduling scheme. The congestion control model is presented, which is a linear system with a non-linear feedback, and modeled by Lur'e type system. In the context of delayed Lur'e dynamical network, we adopt the concept of cluster synchronization and show that the congestion controlled system is able to achieve cluster synchronization. Sufficient conditions are derived by applying Lyapunov-Krasovskii functionals. Numerical examples are investigated to validate the effectiveness of the congestion control algorithm and the stability of the network.

Costing of a State-Wide Population Based Cancer Awareness and Early Detection Campaign in a 2.67 Million Population of Punjab State in Northern India

  • Thakur, JS;Prinja, Shankar;Jeet, Gursimer;Bhatnagar, Nidhi
    • Asian Pacific Journal of Cancer Prevention
    • /
    • 제17권2호
    • /
    • pp.791-797
    • /
    • 2016
  • Background: Punjab state is particularly reporting a rising burden of cancer. A 'door to door cancer awareness and early detection campaign' was therefore launched in the Punjab covering about 2.67 million population, wherein after initial training accredited social health activists (ASHAs) and other health staff conducted a survey for early detection of cancer cases based on a twelve point clinical algorithm. Objective: To ascertain unit cost for undertaking a population-based cancer awareness and early detection campaign. Materials and Methods: Data were collected using bottom-up costing methods. Full economic costs of implementing the campaign from the health system perspective were calculated. Options to meet the likely demand for project activities were further evaluated to examine their worth from the point of view of long-term sustainability. Results: The campaign covered 97% of the state population. A total of 24,659 cases were suspected to have cancer and were referred to health facilities. At the state level, incidence and prevalence of cancer were found to be 90 and 216 per 100,000, respectively. Full economic cost of implementing the campaign in pilot district was USD 117,524. However, the financial cost was approximately USD 6,301. Start-up phase of campaign was more resource intensive (63% of total) than the implementation phase. The economic cost per person contacted and suspected by clinical algorithm was found to be USD 0.20 and USD 40 respectively. Cost per confirmed case under the campaign was 7,043 USD. Conclusions: The campaign was able to screen a reasonably large population. High to high economic cost points towards the fact that the opportunity cost of campaign put a significant burden on health system and other programs. However, generating awareness and early detection strategy adopted in this campaign seems promising in light of fact that organized screening is not in place in India and in many developing countries.