• Title/Summary/Keyword: threshold algorithm

Search Result 1,450, Processing Time 0.027 seconds

A study on threshold detection algorithm for adaptive transmission in underwater acoustic communication (수중 음향 통신에서 적응형 전송을 위한 임계값 검출 알고리즘)

  • Jung, Ji-Won;Kim, In-Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.39 no.6
    • /
    • pp.585-591
    • /
    • 2020
  • The adaptive transmission techniques are efficient method for underwater acoustic communication to improve the system efficiency by varying transmission parameters according to channel conditions. In this paper, we construct four transmission modes with different data rates using the convolutional codes, which is freely set to size of information bits. On the receiver side, one critical component of adaptive system is to find which mode has best performance. In this paper, we proposed threshold detection algorithm to decide appropriate mode and applied turbo equalization method based on BCJR decoder in order to improve performance. We analyzed the performance of four modes based on threshold detection algorithm through the lake experiment.

Prolong life-span of WSN using clustering method via swarm intelligence and dynamical threshold control scheme

  • Bao, Kaiyang;Ma, Xiaoyuan;Wei, Jianming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.6
    • /
    • pp.2504-2526
    • /
    • 2016
  • Wireless sensors are always deployed in brutal environments, but as we know, the nodes are powered only by non-replaceable batteries with limited energy. Sending, receiving and transporting information require the supply of energy. The essential problem of wireless sensor network (WSN) is to save energy consumption and prolong network lifetime. This paper presents a new communication protocol for WSN called Dynamical Threshold Control Algorithm with three-parameter Particle Swarm Optimization and Ant Colony Optimization based on residual energy (DPA). We first use the state of WSN to partition the region adaptively. Moreover, a three-parameter of particle swarm optimization (PSO) algorithm is proposed and a new fitness function is obtained. The optimal path among the CHs and Base Station (BS) is obtained by the ant colony optimization (ACO) algorithm based on residual energy. Dynamical threshold control algorithm (DTCA) is introduced when we re-select the CHs. Compared to the results obtained by using APSO, ANT and I-LEACH protocols, our DPA protocol tremendously prolongs the lifecycle of network. We observe 48.3%, 43.0%, and 24.9% more percentages of rounds respectively performed by DPA over APSO, ANT and I-LEACH.

Directional Particle Filter Using Online Threshold Adaptation for Vehicle Tracking

  • Yildirim, Mustafa Eren;Salman, Yucel Batu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.2
    • /
    • pp.710-726
    • /
    • 2018
  • This paper presents an extended particle filter to increase the accuracy and decrease the computation load of vehicle tracking. Particle filter has been the subject of extensive interest in video-based tracking which is capable of solving nonlinear and non-Gaussian problems. However, there still exist problems such as preventing unnecessary particle consumption, reducing the computational burden, and increasing the accuracy. We aim to increase the accuracy without an increase in computation load. In proposed method, we calculate the direction angle of the target vehicle. The angular difference between the direction of the target vehicle and each particle of the particle filter is observed. Particles are filtered and weighted, based on their angular difference. Particles with angular difference greater than a threshold is eliminated and the remaining are stored with greater weights in order to increase their probability for state estimation. Threshold value is very critical for performance. Thus, instead of having a constant threshold value, proposed algorithm updates it online. The first advantage of our algorithm is that it prevents the system from failures caused by insufficient amount of particles. Second advantage is to reduce the risk of using unnecessary number of particles in tracking which causes computation load. Proposed algorithm is compared against camshift, direction-based particle filter and condensation algorithms. Results show that the proposed algorithm outperforms the other methods in terms of accuracy, tracking duration and particle consumption.

Enhanced ERICA Switch Algorithm using Buffer Management Scheme (버퍼 관리 기법을 이용한 개선된 ERICA 스위치 알고리즘)

  • 양기원;오창석
    • The Journal of the Korea Contents Association
    • /
    • v.2 no.2
    • /
    • pp.73-84
    • /
    • 2002
  • In this paper, we propose a enhanced ERICA switch algorithm using the buffer management scheme which can reduce the queue length, support the efficiency link utilization and the fair share. It has three different buffer thresholds which are low threshold, congestion notification threshold and high threshold. According to the each buffer threshold status, switch announced congestion notification to the source differently. So, sources could know the congestion more quickly and fast remover from network congestion. As a experimental results, it is proved that proposed algorithm is the more efficient than ERICA. Especially, proposed switch algorithm provides congestion control mechanism to make the best use of with keeping fairness and reduce queue length.

  • PDF

Improved MOG Algorithm for Periodic Background (주기성 배경을 위한 개선된 MOG 알고리즘)

  • Jeong, Yong-Seok;Oh, Jeong-Su
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.10
    • /
    • pp.2419-2424
    • /
    • 2013
  • In a conventional MOG algorithm, a small threshold for background decision causes the background recognition delay in a periodic background and a large threshold makes it recognize passing objects as background in a stationary background. This paper proposes the improved MOG algorithm using adaptive threshold. The proposed algorithm estimates changes of weight in the dominant model of the MOG algorithm both in the short and long terms, classifies backgrounds into the stationary and periodic ones, and assigns proper thresholds to them. The simulation results show that the proposed algorithm decreases the maximum number of frame in background recognition delay from 137 to 4 in the periodic background keeping the equal performance with the conventional algorithm in the stationary background.

An Evolutionary Algorithm to the Threshold Detection Method for the M-ary Holographic Data Storage (M-ary 홀로그래픽 저장 장치의 적응적 문턱값 검출을 위한 진화 연산 기법)

  • Kim, Sunho;Lee, Jieun;Im, Sungbin
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.5
    • /
    • pp.51-57
    • /
    • 2014
  • In this paper, we introduce the adaptive threshold detection scheme based on an evolutionary arithmetic algorithm for the M-ary holographic data storage(HDS) system. The genetic algorithm is a particular class of evolutionary arithmetic based on the process of biological evolution, which is a very promising technique for optimization problem and estimation applications. In this study, to improve the detection performance that is degraded by the HDS channel environment and the pixel misalignment, the threshold value was assumed to be a population set of the evolutionary algorithm. The proposed method can find an appropriate population set of bit threshold, which minimizes bit error rate(BER) as increased generation. For performance evaluation, we consider severe misalignment effect in the 4-ary holographic data storage system. Furthermore, we measure the BER performance and compare the proposed methods with the conventional threshold detection scheme, which verifies the superiority of the proposed scheme.

System Trading using Case-based Reasoning based on Absolute Similarity Threshold and Genetic Algorithm (절대 유사 임계값 기반 사례기반추론과 유전자 알고리즘을 활용한 시스템 트레이딩)

  • Han, Hyun-Woong;Ahn, Hyun-Chul
    • The Journal of Information Systems
    • /
    • v.26 no.3
    • /
    • pp.63-90
    • /
    • 2017
  • Purpose This study proposes a novel system trading model using case-based reasoning (CBR) based on absolute similarity threshold. The proposed model is designed to optimize the absolute similarity threshold, feature selection, and instance selection of CBR by using genetic algorithm (GA). With these mechanisms, it enables us to yield higher returns from stock market trading. Design/Methodology/Approach The proposed CBR model uses the absolute similarity threshold varying from 0 to 1, which serves as a criterion for selecting appropriate neighbors in the nearest neighbor (NN) algorithm. Since it determines the nearest neighbors on an absolute basis, it fails to select the appropriate neighbors from time to time. In system trading, it is interpreted as the signal of 'hold'. That is, the system trading model proposed in this study makes trading decisions such as 'buy' or 'sell' only if the model produces a clear signal for stock market prediction. Also, in order to improve the prediction accuracy and the rate of return, the proposed model adopts optimal feature selection and instance selection, which are known to be very effective in enhancing the performance of CBR. To validate the usefulness of the proposed model, we applied it to the index trading of KOSPI200 from 2009 to 2016. Findings Experimental results showed that the proposed model with optimal feature or instance selection could yield higher returns compared to the benchmark as well as the various comparison models (including logistic regression, multiple discriminant analysis, artificial neural network, support vector machine, and traditional CBR). In particular, the proposed model with optimal instance selection showed the best rate of return among all the models. This implies that the application of CBR with the absolute similarity threshold as well as the optimal instance selection may be effective in system trading from the perspective of returns.

Video-based fall detection algorithm combining simple threshold method and Hidden Markov Model (단순 임계치와 은닉마르코프 모델을 혼합한 영상 기반 낙상 알고리즘)

  • Park, Culho;Yu, Yun Seop
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.9
    • /
    • pp.2101-2108
    • /
    • 2014
  • Automatic fall-detection algorithms using video-data are proposed. Six types of fall-feature parameters are defined applying the optical flows extracted from differential images to principal component analysis(PCA). One fall-detection algorithm is the simple threshold method that a fall is detected when a fall-feature parameter is over a threshold, another is to use the HMM, and the other is to combine the simple threshold and HMM. Comparing the performances of three types of fall-detection algorithm, the algorithm combining the simple threshold and HMM requires less computational resources than HMM and exhibits a higher accuracy than the simple threshold method.

An Enhanced Fuzzy ART Algorithm for The Effective Identifier Recognition From Shipping Container Image (효과적인 운송 컨테이너 영상의 식별자 인식을 위한 개선된 퍼지 ART 알고리즘)

  • 김광백
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5C
    • /
    • pp.486-492
    • /
    • 2003
  • The vigilance threshold of conventional fuzzy ART algorithm decide whether to permit the mismatch between any input pattern and stored pattern. If the vigilance threshold was large, despite of little difference among input and stored patterns, the input pattern may be classified to new category. On the other hand, if the vigilance threshold was small, the similarity between two patterns may be accepted in spite of lots of difference and the input pattern are classified to category of the stored pattern. Therefore, the vigilance threshold for the image recognition must be experientially set for the good result. Moreover, it may occur in the fuzzy ART algorithm that the information of stored patterns is lost in the weight-adjusting process and the rate of pattern recognition is dropped. In this paper, I proposed the enhanced fuzzy ART algorithm that supports the dynamical setting of the vigilance threshold using the generalized intersection operator of fuzzy logic and the weight value being adaptively set in proportional to the current weight change and the previous weight by reflecting the frequency of the selection of winner node. For the performance evaluation of the proposed method, we applied to the recognition of container identifiers from shipping container images. The experiment showed that the proposed method produced fewer clusters than conventional ART2 and fuzzy ART algorithm. and had tile higher recognition rate.

A Back-Pressure Algorithm for Lifetime Extension of the Wireless Sensor Networks with Multi-Level Energy Thresholds (센서네트워크 수명 연장을 위한 에너지 임계값 기반 다단계 Back-Pressure 알고리즘)

  • Jeong, Dae-In
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12B
    • /
    • pp.1083-1096
    • /
    • 2008
  • This paper proposes an energy-aware path management scheme, so-called the TBP(Threshold based Back-Pressure) algorithm, which is designed for lifetime extension of the energy-constrained wireless sensor networks. With the goal of fair energy consumptions, we extensively utilize the available paths between the source and the sink nodes. The traffic distribution feature of the TBP algorithm operates in two scales; the local and the whole routing area. The threshold and the back-pressure signal are introduced for implementing those operations. It is noticeable that the TBP algorithm maintains the scalability by defining both the threshold and the back-pressure signal to have their meanings locally confined to one hop only. Throughout several experiments, we observe that the TBP algorithm enhances the network-wide energy distribution. which implies the extension of the network lifetime. Additionally, both the delay and the throughput outcomes show remarkable improvements. This shows that the energy-aware path control scheme holds the effects of the congestion control.