• Title/Summary/Keyword: adaptive threshold

Search Result 526, Processing Time 0.031 seconds

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.

Robust Object Tracking based on Weight Control in Particle Swarm Optimization (파티클 스웜 최적화에서의 가중치 조절에 기반한 강인한 객체 추적 알고리즘)

  • Kang, Kyuchang;Bae, Changseok;Chung, Yuk Ying
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.14 no.6
    • /
    • pp.15-29
    • /
    • 2018
  • This paper proposes an enhanced object tracking algorithm to compensate the lack of temporal information in existing particle swarm optimization based object trackers using the trajectory of the target object. The proposed scheme also enables the tracking and documentation of the location of an online updated set of distractions. Based on the trajectories information and the distraction set, a rule based approach with adaptive parameters is utilized for occlusion detection and determination of the target position. Compare to existing algorithms, the proposed approach provides more comprehensive use of available information and does not require manual adjustment of threshold values. Moreover, an effective weight adjustment function is proposed to alleviate the diversity loss and pre-mature convergence problem in particle swarm optimization. The proposed weight function ensures particles to search thoroughly in the frame before convergence to an optimum solution. In the existence of multiple objects with similar feature composition, this algorithm is tested to significantly reduce convergence to nearby distractions compared to the other existing swarm intelligence based object trackers.

VM Scheduling for Efficient Dynamically Migrated Virtual Machines (VMS-EDMVM) in Cloud Computing Environment

  • Supreeth, S.;Patil, Kirankumari
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.6
    • /
    • pp.1892-1912
    • /
    • 2022
  • With the massive demand and growth of cloud computing, virtualization plays an important role in providing services to end-users efficiently. However, with the increase in services over Cloud Computing, it is becoming more challenging to manage and run multiple Virtual Machines (VMs) in Cloud Computing because of excessive power consumption. It is thus important to overcome these challenges by adopting an efficient technique to manage and monitor the status of VMs in a cloud environment. Reduction of power/energy consumption can be done by managing VMs more effectively in the datacenters of the cloud environment by switching between the active and inactive states of a VM. As a result, energy consumption reduces carbon emissions, leading to green cloud computing. The proposed Efficient Dynamic VM Scheduling approach minimizes Service Level Agreement (SLA) violations and manages VM migration by lowering the energy consumption effectively along with the balanced load. In the proposed work, VM Scheduling for Efficient Dynamically Migrated VM (VMS-EDMVM) approach first detects the over-utilized host using the Modified Weighted Linear Regression (MWLR) algorithm and along with the dynamic utilization model for an underutilized host. Maximum Power Reduction and Reduced Time (MPRRT) approach has been developed for the VM selection followed by a two-phase Best-Fit CPU, BW (BFCB) VM Scheduling mechanism which is simulated in CloudSim based on the adaptive utilization threshold base. The proposed work achieved a Power consumption of 108.45 kWh, and the total SLA violation was 0.1%. The VM migration count was reduced to 2,202 times, revealing better performance as compared to other methods mentioned in this paper.

An Improved ViBe Algorithm of Moving Target Extraction for Night Infrared Surveillance Video

  • Feng, Zhiqiang;Wang, Xiaogang;Yang, Zhongfan;Guo, Shaojie;Xiong, Xingzhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.12
    • /
    • pp.4292-4307
    • /
    • 2021
  • For the research field of night infrared surveillance video, the target imaging in the video is easily affected by the light due to the characteristics of the active infrared camera and the classical ViBe algorithm has some problems for moving target extraction because of background misjudgment, noise interference, ghost shadow and so on. Therefore, an improved ViBe algorithm (I-ViBe) for moving target extraction in night infrared surveillance video is proposed in this paper. Firstly, the video frames are sampled and judged by the degree of light influence, and the video frame is divided into three situations: no light change, small light change, and severe light change. Secondly, the ViBe algorithm is extracted the moving target when there is no light change. The segmentation factor of the ViBe algorithm is adaptively changed to reduce the impact of the light on the ViBe algorithm when the light change is small. The moving target is extracted using the region growing algorithm improved by the image entropy in the differential image of the current frame and the background model when the illumination changes drastically. Based on the results of the simulation, the I-ViBe algorithm proposed has better robustness to the influence of illumination. When extracting moving targets at night the I-ViBe algorithm can make target extraction more accurate and provide more effective data for further night behavior recognition and target tracking.

A Study on Structural-Thermal-Optical Performance through Laser Heat Source Profile Modeling Using Beer-Lambert's Law and Thermal Deformation Analysis of the Mirror for Laser Weapon System (Beer-Lambert 법칙을 적용한 레이저 열원 프로파일 모델링 및 레이저무기용 반사경의 열변형 해석을 통한 구조-열-광학 성능 연구)

  • Hong Dae Gi
    • Journal of Aerospace System Engineering
    • /
    • v.17 no.4
    • /
    • pp.18-27
    • /
    • 2023
  • In this paper, the structural-thermal-optical performance analysis of the mirror was performed by setting the laser heat source as the boundary condition of the thermal analysis. For the laser heat source model, the Beer-Lambert model considering semi-transparent optical material based on Gaussian beam was selected as the boundary condition, and the mechanical part was not considered, to analyze the performance of only the mirror. As a result of the thermal analysis, thermal stress and thermal deformation data due to temperature change on the surface of the mirror were obtained. The displacement data of the surface due to thermal deformation was fitted to a Zernike polynomial to calculate the optical performance, through which the performance of the mirror when a high-energy laser was incident on the mirror could be predicted.

Robust Scheme of Segmenting Characters of License Plate on Irregular Illumination Condition (불규칙 조명 환경에 강인한 번호판 문자 분리 기법)

  • Kim, Byoung-Hyun;Han, Young-Joon;Hahn, Hern-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.11
    • /
    • pp.61-71
    • /
    • 2009
  • Vehicle license plate is the only way to check the registrated information of a vehicle. Many works have been devoted to the vision system of recognizing the license plate, which has been widely used to control an illegal parking. However, it is difficult to correctly segment characters on the license plate since an illumination is affected by a weather change and a neighboring obstacles. This paper proposes a robust method of segmenting the character of the license plate on irregular illumination condition. The proposed method enhance the contrast of license plate images using the Chi-Square probability density function. For segmenting characters on the license plate, binary images with the high quality are gained by applying the adaptive threshold. Preprocessing and labeling algorithm are used to eliminate noises existing during the whole segmentation process. Finally, profiling method is applied to segment characters on license plate from binary images.

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.

Estimation of Maximum Crack Width Using Histogram Analysis in Concrete Structures (히스토그램 분석을 이용한 콘크리트 구조물의 최대 균열 폭 평가)

  • Lee, Seok-Min;Jung, Beom-Seok
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.23 no.7
    • /
    • pp.9-15
    • /
    • 2019
  • The purpose of present study is to assess the maximum width of the surface cracks using the histogram analysis of image processing techniques in concrete structures. For this purpose, the concrete crack image is acquired by the camera. The image is Grayscale coded and Binary coded. After Binary coded image is Dilate and Erode coded, the image is then recognized as separated objects by applying Labeling techniques. Over time, dust and stains may occur naturally on the surface of concrete. The crack image of concrete may include shadows and reflections by lighting depending on a surrounding conditions. In general, concrete cracks occur in a continuous pattern and noise of image appears in the form of shot noises. Bilateral Blurring and Adaptive Threshold apply to the Grayscale image to eliminate these effects. The remaining noises are removed by the object area ratio to the Labeled area. The maximum numbers of pixels and its positions in the crack objects without noises are calculated in x-direction and y-direction by Histogram analysis. The widths of the crack are estimated by trigonometric ratio at the positions of the pixels maximum numbers for the Labeled objects. Finally, the maximum crack width estimated by the proposed method is compared to the crack width measured with the crack gauge. The proposed method by the present study may increase the reliability for the estimation of maximum crack width using image processing techniques in concrete surface images.

The Flood Water Stage Prediction based on Neural Networks Method in Stream Gauge Station (하천수위표지점에서 신경망기법을 이용한 홍수위의 예측)

  • Kim, Seong-Won;Salas, Jose-D.
    • Journal of Korea Water Resources Association
    • /
    • v.33 no.2
    • /
    • pp.247-262
    • /
    • 2000
  • In this paper, the WSANN(Water Stage Analysis with Neural Network) model was presented so as to predict flood water stage at Jindong which has been the major stream gauging station in Nakdong river basin. The WSANN model used the improved backpropagation training algorithm which was complemented by the momentum method, improvement of initial condition and adaptive-learning rate and the data which were used for this study were classified into training and testing data sets. An empirical equation was derived to determine optimal hidden layer node between the hidden layer node and threshold iteration number. And, the calibration of the WSANN model was performed by the four training data sets. As a result of calibration, the WSANN22 and WSANN32 model were selected for the optimal models which would be used for model verification. The model verification was carried out so as to evaluate model fitness with the two-untrained testing data sets. And, flood water stages were reasonably predicted through the results of statistical analysis. As results of this study, further research activities are needed for the construction of a real-time warning of the impending flood and for the control of flood water stage with neural network method in river basin. basin.

  • PDF

Hand Gesture Segmentation Method using a Wrist-Worn Wearable Device

  • Lee, Dong-Woo;Son, Yong-Ki;Kim, Bae-Sun;Kim, Minkyu;Jeong, Hyun-Tae;Cho, Il-Yeon
    • Journal of the Ergonomics Society of Korea
    • /
    • v.34 no.5
    • /
    • pp.541-548
    • /
    • 2015
  • Objective: We introduce a hand gesture segmentation method using a wrist-worn wearable device which can recognize simple gestures of clenching and unclenching ones' fist. Background: There are many types of smart watches and fitness bands in the markets. And most of them already adopt a gesture interaction to provide ease of use. However, there are many cases in which the malfunction is difficult to distinguish between the user's gesture commands and user's daily life motion. It is needed to develop a simple and clear gesture segmentation method to improve the gesture interaction performance. Method: At first, we defined the gestures of making a fist (start of gesture command) and opening one's fist (end of gesture command) as segmentation gestures to distinguish a gesture. The gestures of clenching and unclenching one's fist are simple and intuitive. And we also designed a single gesture consisting of a set of making a fist, a command gesture, and opening one's fist in order. To detect segmentation gestures at the bottom of the wrist, we used a wrist strap on which an array of infrared sensors (emitters and receivers) were mounted. When a user takes gestures of making a fist and opening one's a fist, this changes the shape of the bottom of the wrist, and simultaneously changes the reflected amount of the infrared light detected by the receiver sensor. Results: An experiment was conducted in order to evaluate gesture segmentation performance. 12 participants took part in the experiment: 10 males, and 2 females with an average age of 38. The recognition rates of the segmentation gestures, clenching and unclenching one's fist, are 99.58% and 100%, respectively. Conclusion: Through the experiment, we have evaluated gesture segmentation performance and its usability. The experimental results show a potential for our suggested segmentation method in the future. Application: The results of this study can be used to develop guidelines to prevent injury in auto workers at mission assembly plants.