• Title/Summary/Keyword: Adaptive threshold algorithm

Search Result 279, Processing Time 0.023 seconds

An ABR Service Traffic Control of Using feedback Control Information and Algorithm (피드백 제어 정보 및 알고리즘을 이용한 ABR 서비스 트래픽제어)

  • 이광옥;최길환;오창윤;배상현
    • Journal of Internet Computing and Services
    • /
    • v.3 no.3
    • /
    • pp.67-74
    • /
    • 2002
  • Asynchronous transfer mode (ATM) can be efficiently used to transport packet data services. The switching system will support voice and packet data services simultaneously from end to end applications. To guarantee quality of service (QoS) of the offered services, source rate to send packet data is needed to control the network overload condition. Most existing control algorithms are shown to provide the threshold-based feedback control technique. However, real-time voice calls can be dynamically connected and released during data services in the network. If the feedback control information delays, quality of the serviced voice can be degraded due to a time delay between source and destination in the high speed link, An adaptive algorithm based on the optimal least mean square error technique is presented for the predictive feedback control technique. The algorithm attempts to predict a future buffer size from weight (slope) adaptation of unknown functions, which are used for feedback control. Simulation results are presented, which show the effectiveness of the algorithm.

  • PDF

Tracking ond Distance Measurement of the Moving Object in Stereo Camera System as a Security Equipment (방범 설비의 스테레오 카메라 시스템에서 이동객체의 추적과 거리측정)

  • 이재수;홍권의;손영우
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.17 no.4
    • /
    • pp.106-115
    • /
    • 2003
  • In crossing stereo camera system as a security equipment system, a new algorithm for the tracking method of the moving object and the measurement method of distance of the object from cameras to moving object is proposed. The stereo input images are matched by a pixel for the moving object extraction, then the moving elements obtained from an adaptive threshold's value for an error correction and the moving object area extracted by noise eliminative algorithm. In addition to, the moving object traced by control pan/tilt of cameras using a coordinate value of the moving object, and the measurement method of distance to moving object by using special features of the crossing stereo camera system is proposed. From the experimental results, the proposed algorithm was found to be able to measure of the distance and trace for moving object in a stereo security camera system. The error rate of a distance measurement be existed within 6%. Moreover in implementation the proposed algorithm, the stereo security system, the automatic moving robot system and the stereo remote control system will be applied practical application.

Adaptive Burst Size-based Loss Differentiation for Transmitting Massive Medical Data in Optical Internet (광 인터넷에서 대용량 의학 데이터 전송을 위한 적응형 버스트 길이 기반 손실 차등화 기법)

  • Lee, Yonggyu
    • Journal of Digital Convergence
    • /
    • v.20 no.3
    • /
    • pp.389-397
    • /
    • 2022
  • As increasing the growth of the Internet in medical area, a new technology to transmit effectively massive medical data is required. In optical internet, all OBS nodes have fiber delay lines, hardware components. These components are calculated under some optimal traffic conditions, and this means that if the conditions change, then the components should be altered. Therefore, in this article a new service differentiation algorithm using the previously installed components is proposed, which is used although the conditions vary. When traffic conditions change, the algorithm dynamically recalculates the threshold value used to decide the length of data bursts. By doing so, irrelevant to changes, the algorithm can maintain the service differentiation between classes without replacing any fiber delay lines. With the algorithm, loss sensitive medical data can be transferred well.

A Study on the Improvement of Wavefront Sensing Accuracy for Shack-Hartmann Sensors (Shack-Hartmann 센서를 이용한 파면측정의 정확도 향상에 관한 연구)

  • Roh, Kyung-Wan;Uhm, Tae-Kyoung;Kim, Ji-Yeon;Park, Sang-Hoon;Youn, Sung-Kie;Lee, Jun-Ho
    • Korean Journal of Optics and Photonics
    • /
    • v.17 no.5
    • /
    • pp.383-390
    • /
    • 2006
  • The SharkHartmann wavefront sensors are the most popular devices to measure wavefront in the field of adaptive optics. The Shack-Hartmann sensors measure the centroids of spot irradiance distribution formed by each corresponding micro-lens. The centroids are linearly proportional to the local mean slopes of the wavefront defined within the corresponding sub-aperture. The wavefront is then reconstructed from the evaluated local mean slopes. The uncertainty of the Shack-Hartmann sensor is caused by various factors including the detector noise, the limited size of the detector, the magnitude and profile of spot irradiance distribution, etc. This paper investigates the noise propagation in two major centroid evaluation algorithms through computer simulation; 1st order moments of the irradiance algorithms i.e. center of gravity algorithm, and correlation algorithm. First, the center of gravity algorithm is shown to have relatively large dependence on the magnitudes of noises and the shape & size of irradiance sidelobes, whose effects are also shown to be minimized by optimal thresholding. Second, the correlation algorithm is shown to be robust over those effects, while its measurement accuracy is vulnerable to the size variation of the reference spot. The investigation is finally confirmed by experimental measurements of defocus wavefront aberrations using a Shack-Hartmann sensor using those two algorithms.

Robust k-means Clustering-based High-speed Barcode Decoding Method to Blur and Illumination Variation (블러와 조명 변화에 강인한 k-means 클러스터링 기반 고속 바코드 정보 추출 방법)

  • Kim, Geun-Jun;Cho, Hosang;Kang, Bongsoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.1
    • /
    • pp.58-64
    • /
    • 2016
  • In this paper presents Robust k-means clustering-based high-speed bar code decoding method to blur and lighting. for fast operation speed and robust decoding to blur, proposed method uses adaptive local threshold binarization methods that calculate threshold value by dividing blur region and a non-blurred region. Also, in order to prevent decoding fail from the noise, decoder based on k-means clustering algorithm is implemented using area data summed pixel width line of the same number of element. Results of simulation using samples taken at various worst case environment, the average success rate of proposed method is 98.47%. it showed the highest decoding success rate among the three comparison programs.

Dominant Path Selection Algorithm for Channel Estimation of MUD Based Receiver (MUD 기반 수신기의 채널 추정을 위한 주 경로 선택 알고리즘)

  • Byon Hyoung-joo;Seo In-kwon;Kim Younglok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5C
    • /
    • pp.398-405
    • /
    • 2005
  • The multiuser detection (MUD) based wireless receiver requires more accurate channel estimation than the single user detection (SUD) schemes such as Rake receiver, and hence the post processing is required for MUD to clean up the estimated channel coefficients by eliminating the noise only coefficients. The adaptive post processing method is proposed in order to provide more accurate channel responses and the power level of the background noise and interferences at the cost of the negligible processing delay compared to the conventional method based on the threshold test with the threshold value relative to the noise variance. The simulations are performed in 3GPP-TDD mode environment. The results show that the noise estimation error of the proposed method is maximum $10\%$, which is much smaller than $50\%$ maximum error of the conventional method.

Recognition Performance Improvement of QR and Color Codes Posted on Curved Surfaces (곡면상에 부착된 QR 코드와 칼라 코드의 인식률 개선)

  • Kim, Jin-soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.3
    • /
    • pp.267-275
    • /
    • 2019
  • Currently, due to the widespread use of a smartphone, QR codes allow users to access a variety of added services. However, the QR codes posted on curved surfaces tend to be non-uniformly illuminated and bring about the decline of recognition rate. So, in this paper, the block-adaptive binarization policy is adopted to find an optimal threshold appropriate for bimodal image like QR codes. For a large block, its histogram distribution is found to get an initial threshold and then the block is partitioned to reflect the local characteristics of small blocks. Also, morphological operation is applied to their neighboring boundary at the discontinuous at the QR code junction. This paper proposes an authentication method based on the color code, uniquely painted within QR code. Through a variety of practical experiments, it is shown that the proposed algorithm outperforms the conventional method in detecting QR code and also maintains good recognition rate up to 40 degrees on curved surfaces.

A Feedback Control Model for ABR Traffic with Long Delays (긴 지연시간을 갖는 ABR 트래픽에 대한 피드백제어 모델)

  • O, Chang-Yun;Bae, Sang-Hyeon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.4
    • /
    • pp.1211-1216
    • /
    • 2000
  • Asynchronous transfer mode (ATM) can be efficiently used to transport packet data services. The switching system will support voice and packet data services simultaneously from end to end applications. To guarantee quality of service (QoS) of the offered services, source rateot send packet data is needed to control the network overload condition. Most existing control algorithms are shown to provide the threshold-based feedback control technique. However, real-time voice calls can be dynamically connected and released during data services in the network. If the feedback control information delays, quality of the serviced voice can be degraded due to a time delay between source and destination in the high speed link. An adaptive algorithm based on the optimal least mean square error technique is presented for the predictive feedback control technique. The algorithm attempts to predict a future buffer size from weight (slope) adaptation of unknown functions, which are used fro feedback control. Simulation results are presented, which show the effectiveness of the algorithm.

  • PDF

A SIP INVITE Flooding Detection algorithm Considering Upperbound of Possible Number of SIP Messages (발생 메시지의 상한값을 고려한 SIP INVITE 플러딩 공격 탐지 기법연구)

  • Ryu, Jea-Tek;Ryu, Ki-Yeol;Roh, Byeong-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.8B
    • /
    • pp.797-804
    • /
    • 2009
  • Recently, SIP(Session Initiation Protocol) is used to set up and manage sessions for multimedia applications such as VoIP(Voice over IP) and IMS(IP Multimedia Subsystem). However, because SIP operates over the Internet, it is exposed to pre-existed internet security threats such as service degradation or service disruptions. Multimedia applications which are delay sensitive even suffers more from the threats mentioned above. The proposed methods so far to detect SIP INVITE flooding are CUSUM(Cumulative Sum), Hellinger distance and adaptive threshold, but among methods only take normal state into consideration. So, it is not capable of adapting the condition of the network congestion which are dynamically changing. In this paper, SIP INVITE flooding detection algorithm considering network congestion which enables efficient detections of such attacks is proposed. The proposed algorithm is expected to detect other types of attacks such as BYE and CANCEL more precisely compared to other methods.

A Study on Implementation of the High Speed Feature Extraction System Based on Block Type Classification (블록 유형 분류 알고리즘 기반 고속 특징추출 시스템 구현에 관한 연구)

  • Lee, Juseong;An, Ho-Myoung
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.12 no.3
    • /
    • pp.186-191
    • /
    • 2019
  • In this paper, we propose a implementation approach of the high-speed feature extraction algorithm. The proposed method is based on the block type classification algorithm which reduces the computation time when target macro block is divided to smooth block type that has no image features. It is quantitatively identified that occurs at 29.5% of the total image using 200 standard test images with $64{\times}64$ macro block size. This means that within a standard test image containing various image information, 29.5% can reduce the complexity of the operation. When the proposed approach is applied to the Canny edge detection, the required latency of the edge detection can be completely eliminated, such as 2D derivative filter, gradient magnitude/direction computation, non-maximal suppression, adaptive threshold calculation, hysteresis thresholding. Also, it is expected that operation time of the feature detection can be reduced by applying block type classification algorithm to various feature extraction algorithms in this way.