• Title/Summary/Keyword: Information Algorithm

Search Result 28,971, Processing Time 0.05 seconds

A Multi-Level HW/SW Partitioning Algorithm for SoCs (SoC를 위한 다단 HW/SW 분할 알고리듬)

  • Ahn, Byung-Gyu;Sihn, Bong-Sik;Chong, Jong-Wha
    • Proceedings of the IEEK Conference
    • /
    • 2004.06b
    • /
    • pp.553-556
    • /
    • 2004
  • In this paper, we present a new efficient multi-level hardware/software partitioning algorithm for system-on-a-chip design. Originally the multi-level partitioning algorithm are proposed to enhance the performance of previous iterative improvement partitioning algorithm for large scale circuits. But when designing very complex and heterogeneous SoCs, the HW/SW partitioning decision needs to be made prior to refining the system description. In this paper, we present a new method, based on multi-level algorithm, which can cover SoC design. The different variants of algorithm are evaluated by a randomly generated test graph. The experimental results on test graphs show improvement average $9.85\%$ and $8.51\%$ in total communication costs over FM and CLIP respectively.

  • PDF

Recognition of Car License Plates using Morphological Information and SOM Algorithm

  • Lim, Eun-Kyung;Kim, Young-Ju;Kim, Dae-Su;Kwang-Baek, Kim
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.648-651
    • /
    • 2003
  • In this paper, we propose the recognition system of a license plate using SOM algorithm. The recognition of license plate was investigated by means of the SOM algorithm. The morphological information of horizontal and vertical edges was used to extract a plate region from a car image. In addition, the 4-direction contour tracking algorithm was applied to extract the specific area, which includes characters from an extracted plate area. Therefore, we proposed how to extract license plate region using morphological information and how to recognize the character string using SOM algorithm. In this paper, 50 car images were tested. The extraction rate obtained by the proposed extraction method showed better results than that from the color information of RGB and HSI, respectively. And the license plate recognition using SOM algorithm was very efficient.

  • PDF

On Modification and Application of the Artificial Bee Colony Algorithm

  • Ye, Zhanxiang;Zhu, Min;Wang, Jin
    • Journal of Information Processing Systems
    • /
    • v.14 no.2
    • /
    • pp.448-454
    • /
    • 2018
  • Artificial bee colony (ABC) algorithm has attracted significant interests recently for solving the multivariate optimization problem. However, it still faces insufficiency of slow convergence speed and poor local search ability. Therefore, in this paper, a modified ABC algorithm with bees' number reallocation and new search equation is proposed to tackle this drawback. In particular, to enhance solution accuracy, more bees in the population are assigned to execute local searches around food sources. Moreover, elite vectors are adopted to guide the bees, with which the algorithm could converge to the potential global optimal position rapidly. A series of classical benchmark functions for frequency-modulated sound waves are adopted to validate the performance of the modified ABC algorithm. Experimental results are provided to show the significant performance improvement of our proposed algorithm over the traditional version.

Design and Implementation of Routing System Using Artificial Neural Network

  • Kim, Jun-Yeong;Kim, Seog-Gyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.12
    • /
    • pp.137-143
    • /
    • 2017
  • In this paper, we propose optimal route searching algorithm using ANN(Artificial Neural Network) and implement route searching system. Our proposed scheme shows that the route using artificial neural network is almost same as the route using Dijkstra's algorithm but the time in our propose algorithm is shorter than that of existing Dijkstra's algorithm. Proposed route searching method using artificial neural network has better performance than exiting route searching method because it use several weight value in making different routes. Through simulation, we show that our proposed routing system improves the performance and reduces time to make route irrespective of the number of hidden layers.

Block-based Disparity Estimation Algorithm Using Edge information (영상의 경계 정보를 이용한 블록기반 시차 예측기법)

  • 이병진;유지상
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.2C
    • /
    • pp.121-128
    • /
    • 2003
  • In this paper, we propose a new disparity estimation method called object based block matching algorithm(OBMA) for stereoscopic images which is able to reduce the blocking artifact. In the proposed algorithm, edge information of the given image is first extracted and then we estimate the disparity of each segmented object to remove the blocking artifact. In the experimental results, it is proven that the proposed algorithm has about the same performance as the old BMA algorithm while it achieves much better subjective quality.

A Rule-Based Stereo Matching Algorithm to Obtain Three Dimesional Information (3차원 정보를 얻기 위한 Rule-Based Stereo Matching Algorithm)

  • 심영석;박성한
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.1
    • /
    • pp.151-163
    • /
    • 1990
  • In this paper, rule-based stereo algorithm is explored to obtain three dimensional information of an object. In the preprocessing of the stereo matching, feature points of stereo images must be less sensitive to noise and well linked. For this purpose, a new feature points detection algorithm is developed. For performing the stereo matching which is most important process of the stereo algorithm, the feature representation of feature points is first described. The feature representation is then used for a rule-based stereo algorithm to determine the correspondence between the input stereo images. Finally, the three dimensional information of the object is determined from the correspondence of the feature points of right and left images.

  • PDF

Scheduling Algorithm for Nonidentical Parallel Machines Problem with Rework (Rework가 존재하는 이종병렬기계에서의 일정계획 수립)

  • Kang, Yong Ha;Kim, Sung Shick;Park, Jong Hyuck;Shin, Hyun Joon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.33 no.3
    • /
    • pp.329-338
    • /
    • 2007
  • This paper presents a dispatching algorithm for nonidentical parallel machines problem considering rework, sequence dependent setup times and release times. For each pair of a machine and a job type, rework probability of each job on a machine can be known through historical data acquisition. The heuristic scheduling scheme named by EDDR (Earliest Due Date with Rework probability) algorithm is proposed in this paper making use of the rework probability. The proposed dispatching algorithm is measured by two objective function value: 1) total tardiness and 2) the number of reworked jobs, respectively. The extensive computational results show that the proposed algorithm gives very efficient schedules superior to the existing dispatching algorithms.

Multi-Person Tracking Using SURF and Background Subtraction for Surveillance

  • Yu, Juhee;Lee, Kyoung-Mi
    • Journal of Information Processing Systems
    • /
    • v.15 no.2
    • /
    • pp.344-358
    • /
    • 2019
  • Surveillance cameras have installed in many places because security and safety is becoming important in modern society. Through surveillance cameras installed, we can deal with troubles and prevent accidents. However, watching surveillance videos and judging the accidental situations is very labor-intensive. So now, the need for research to analyze surveillance videos is growing. This study proposes an algorithm to track multiple persons using SURF and background subtraction. While the SURF algorithm, as a person-tracking algorithm, is robust to scaling, rotating and different viewpoints, SURF makes tracking errors with sudden changes in videos. To resolve such tracking errors, we combined SURF with a background subtraction algorithm and showed that the proposed approach increased the tracking accuracy. In addition, the background subtraction algorithm can detect persons in videos, and SURF can initialize tracking targets with these detected persons, and thus the proposed algorithm can automatically detect the enter/exit of persons.

Adaptive Digital Predictive Peak Current Control Algorithm for Buck Converters

  • Zhang, Yu;Zhang, Yiming;Wang, Xuhong;Zhu, Wenhao
    • Journal of Power Electronics
    • /
    • v.19 no.3
    • /
    • pp.613-624
    • /
    • 2019
  • Digital current control techniques are an attractive option for DC-DC converters. In this paper, a digital predictive peak current control algorithm is presented for buck converters that allows the inductor current to track the reference current in two switching cycles. This control algorithm predicts the inductor current in a future period by sampling the input voltage, output voltage and inductor current of the current period, which overcomes the problem of hardware periodic delay. Under the premise of ensuring the stability of the system, the response speed is greatly improved. A real-time parameter identification method is also proposed to obtain the precision coefficient of the control algorithm when the inductance is changed. The combination of the two algorithms achieves adaptive tracking of the peak inductor current. The performance of the proposed algorithms is verified using simulations and experimental results. In addition, its performance is compared with that of a conventional proportional-integral (PI) algorithm.

Matching game based resource allocation algorithm for energy-harvesting small cells network with NOMA

  • Wang, Xueting;Zhu, Qi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.11
    • /
    • pp.5203-5217
    • /
    • 2018
  • In order to increase the capacity and improve the spectrum efficiency of wireless communication systems, this paper proposes a rate-based two-sided many-to-one matching game algorithm for energy-harvesting small cells with non-orthogonal multiple access (NOMA) in heterogeneous cellular networks (HCN). First, we use a heuristic clustering based channel allocation algorithm to assign channels to small cells and manage the interference. Then, aiming at addressing the user access problem, this issue is modeled as a many-to-one matching game with the rate as its utility. Finally, considering externality in the matching game, we propose an algorithm that involves swap-matchings to find the optimal matching and to prove its stability. Simulation results show that this algorithm outperforms the comparing algorithm in efficiency and rate, in addition to improving the spectrum efficiency.