• Title/Summary/Keyword: adaptive threshold

Search Result 526, Processing Time 0.022 seconds

Initial Investigation on Consolidation with Adaptive Dynamic Threshold for ABR Multicast Connections in ATM Networks (비동기 전송모드 망의 점대다중점연결을 위한 적응동적임계치기반 병합알고리즘)

  • Shin, Soung-Wook;Cho, Kwang-Hyun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.7 no.11
    • /
    • pp.962-966
    • /
    • 2001
  • The major problem at a branch point for point-to-multipoint available bit rate(ABR) services in asynchronous transfer mode (ATM) networks is how to consolidate backward resource management(BRM) cells from each branch for a multicast connection. In this paper, we propose an efficient feedback consolidation algorithm based on an adaptive dynamic threshold(ADT) to eliminate the consolidation noise and the reduce the consolidation delay. The main idea of the ADT algorithm lies in that each branch point estimates the ABR traffic condition of the network through the virtual queue estimation and the transmission threshold of the queue level in branch points is adaptively controlled according to the estimation. Simulation results show that the proposed ADT algorithm can achieve a faster response in congestion status and a higher link utilization compared with the previous works.

  • PDF

A Study on Preprocessing Technique for Fingerprint Recognition using Applied Slit-Sum Method (Slit-Sum 방법을 응용한 지문인식 전처리 기술 연구)

  • 임철수;조성원
    • The Journal of the Korea Contents Association
    • /
    • v.2 no.4
    • /
    • pp.46-50
    • /
    • 2002
  • This paper suggests the adaptive binary method which applies advanced silt sum technique, so that threshold value can be changed heuristically according to the brightness of captured fingerprint image. Through this research, we tried to resolve threshold value setting issue by the local differences of brightness of fingerprint image in the binary image preprocessing. The experimental results show that our proposed preprocessing method demonstrates the better recognition accuracy and can be applied to minutiae extraction algorithm for fingerprint recognition system.

  • PDF

A Design of an Algorithm for Analysis of Activity Using 3-Axis Accelerometer (3축 가속도 센서를 이용한 동작분석 알고리즘 설계)

  • 이승형;임예택;이경중
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.53 no.5
    • /
    • pp.361-367
    • /
    • 2004
  • This paper describes design of an algorithm for analyzing human activity using body-fixed 3-axis accelerometer in the small of the back. In the first step, we distinguish static and dynamic activity period using AC signal analysis. Then five postures were classified by applying the threshold in DC signal corresponding to the static activity period. Also, after comparison of average power and taking negative peak signal in the dynamic activity period, the four dynamic activities were classified by adaptive threshold method. To evaluate the performance of the proposed algorithm, the measured signals obtained from six subjects were applied to the proposed algorithm and the results were compared with the simultaneously measured video data. As a result, the activity classification rate of 95.7% on average was obtained. Overall results show that the proposed classification algorithm has a possibility to be used to analyze the static and dynamic physical activity.

A Study on the Fingerprint Recognition Preprocessing using adaptive binary method (적응 이진화를 이용한 지문인식 전처리에 관한 연구)

  • Cho, Seong-Wong;Kim, Jae-Min
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.3
    • /
    • pp.227-230
    • /
    • 2002
  • An important preprocessing for fingerprint recognition is the binarization operation, which takes as an input gray-scale image and returns a binary image as the output. The difficult in performing binarization is to find an appropriate threshold value. This paper presents a new adaptive binarization method, which determines the threshold value according to the brightness of local ridges and valleys. We experimentally show that the presented method results in better performance than a traditional method.

An Adaptive Watermark Detection Algorithm for Vector Geographic Data

  • Wang, Yingying;Yang, Chengsong;Ren, Na;Zhu, Changqing;Rui, Ting;Wang, Dong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.1
    • /
    • pp.323-343
    • /
    • 2020
  • With the rapid development of computer and communication techniques, copyright protection of vector geographic data has attracted considerable research attention because of the high cost of such data. A novel adaptive watermark detection algorithm is proposed for vector geographic data that can be used to qualitatively analyze the robustness of watermarks against data addition attacks. First, a watermark was embedded into the vertex coordinates based on coordinate mapping and quantization. Second, the adaptive watermark detection model, which is capable of calculating the detection threshold, false positive error (FPE) and false negative error (FNE), was established, and the characteristics of the adaptive watermark detection algorithm were analyzed. Finally, experiments were conducted on several real-world vector maps to show the usability and robustness of the proposed algorithm.

Adaptive Cooperative Spectrum Sensing Based on SNR Estimation in Cognitive Radio Networks

  • Ni, Shuiping;Chang, Huigang;Xu, Yuping
    • Journal of Information Processing Systems
    • /
    • v.15 no.3
    • /
    • pp.604-615
    • /
    • 2019
  • Single-user spectrum sensing is susceptible to multipath effects, shadow effects, hidden terminals and other unfavorable factors, leading to misjudgment of perceived results. In order to increase the detection accuracy and reduce spectrum sensing cost, we propose an adaptive cooperative sensing strategy based on an estimated signal-to-noise ratio (SNR). Which can adaptive select different sensing strategy during the local sensing phase. When the estimated SNR is higher than the selection threshold, adaptive double threshold energy detector (ED) is implemented, otherwise cyclostationary feature detector is performed. Due to the fact that only a better sensing strategy is implemented in a period, the detection accuracy is improved under the condition of low SNR with low complexity. The local sensing node transmits the perceived results through the control channel to the fusion center (FC), and uses voting rule to make the hard decision. Thus the transmission bandwidth is effectively saved. Simulation results show that the proposed scheme can effectively improve the system detection probability, shorten the average sensing time, and has better robustness without largely increasing the costs of sensing system.

Adaptive Shot Change Detection Technique Using Mean of Feature Value on Variable Reference Block (가변 참조 구간의 평균 특징값을 이용한 적응적인 장면 전환 검출 기법)

  • Kim, Won-Hee;Moon, Kwang-Seok;Kim, Jong-Nam
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.4
    • /
    • pp.272-279
    • /
    • 2008
  • Shot change detection is an important technique for effective management of video data, so detection scheme requires adaptive detection techniques to be used actually in various video. In this paper, we propose an adaptive shot change detection algorithm using the mean of feature value on variable reference blocks. Our algorithm determines shot change detection by defining adaptive threshold values with the feature value extracted from video frames and comparing the feature value and the threshold value. We obtained better detection ratio than the conventional methods maximally by 15% in the experiment with the same test sequence. We also had good detection ratio for other several methods of feature extraction and could see realtime operation of shot change detection in the hardware platform with low performance was possible by implementing it in TVUS model of HOMECAST company. Thus, our algerian in the paper can be useful in PMP(portable multimedia player) or other portable players.

  • PDF

Adaptive Shot Change Detection Technique Using Histogram Mean within Extension Sliding Window and Its Implementation on Portable Multimedia Player (확장 참조 구간의 히스토그램 평균값을 이용한 적응적인 장면 전환 검출 기법과 휴대용 멀티미디어 재생기에서의 구현)

  • Kim, Won-Hee;Cho, Gyeong-Yeon;Kim, Jong-Nam
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.4
    • /
    • pp.23-33
    • /
    • 2009
  • A shot change detection technique is an important technique for effective management of video data, thus it requires an adaptive algorithm for various video sequences to detect an accurate shot change frames. In this paper, we propose an adaptive shot change detection algorithm using histogram mean of frames within extension sliding window. Our algorithm calculates a frame feature value using histogram and defines an adaptive threshold using an average of histogram mean of frames within the extension sliding window and determines a shot change by comparing the feature value and the threshold. We obtained better detection rate than the conventional methods maximally by 15% in the experiment with the same test sequence. We verified real-time operation of shot change detection in the hardware platform with low performance by implementing it on TVUS HM-900 PLUS model of Homecast. The Proposed algorithm can be useful in the hardware platform such as portable multimedia player(PMP) or cellular phone with low CPU performance.

Scale Invariant Target Detection using the Laplacian Scale-Space with Adaptive Threshold (라플라스 스케일스페이스 이론과 적응 문턱치를 이용한 크기 불변 표적 탐지 기법)

  • Kim, Sung-Ho;Yang, Yu-Kyung
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.11 no.1
    • /
    • pp.66-74
    • /
    • 2008
  • This paper presents a new small target detection method using scale invariant feature. Detecting small targets whose sizes are varying is very important to automatic target detection. Scale invariant feature using the Laplacian scale-space can detect different sizes of targets robustly compared to the conventional spatial filtering methods with fixed kernel size. Additionally, scale-reflected adaptive thresholding can reduce many false alarms. Experimental results with real IR images show the robustness of the proposed target detection in real world.

A New Approach to Adaptive HFC-based GAs: Comparative Study on Crossover Genetic Operator (적응 HFC 기반 유전자알고리즘의 새로운 접근: 교배 유전자 연산자의 비교연구)

  • Kim, Gil-Sung;Choi, Jeoung-Nae;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.9
    • /
    • pp.1636-1641
    • /
    • 2008
  • In this study, we introduce a new approach to Parallel Genetic Algorithms (PGA) which combines AHFCGA with crossover operator. As to crossover operators, we use three types of the crossover operators such as modified simple crossover(MSX), arithmetic crossover(AX), and Unimodal Normal Distribution Crossover(UNDX) for real coding. The AHFC model is given as an extended and adaptive version of HFC for parameter optimization. The migration topology of AHFC is composed of sub-populations(demes), the admission threshold levels, and admission buffer for the deme of each threshold level through succesive evolution process. In particular, UNDX is mean-centric crossover operator using multiple parents, and generates offsprings obeying a normal distribution around the center of parents. By using test functions having multimodality and/or epistasis, which are commonly used in the study of function parameter optimization, Experimental results show that AHFCGA can produce more preferable output performance result when compared to HFCGA and RCGA.