• Title/Summary/Keyword: Information input algorithm

Search Result 2,444, Processing Time 0.03 seconds

A High-Speed Thinning Processor for Character Recognition System (문자인식 시스템을 위한 고속 세선화 장치)

  • 김용섭;김민석;주양성;김수원
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.2
    • /
    • pp.153-158
    • /
    • 1992
  • We propose, in this paper, a new thinning algorithm and demonstrate Its effectiveness with some concrete experimental results. This new thinning process can solve the problems of disconnectivity and end point reduction explored in one-Pass algorithm Furthermore, this algorithm is proven effective particularly In high speed operation. A processor for this algorithm that is capable of hand-ling Input Image width(between 25 and 4t) bits ) and also operates on pipelining, is implemented and tested. Flexibility and high speed operation of this thinning processor should find excellent applicability in various areas.

  • PDF

Approximation Algorithms for Scheduling Parallel Jobs with More Machines

  • Kim, Jae-Hoon
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.4
    • /
    • pp.471-474
    • /
    • 2011
  • In parallel job scheduling, each job can be executed simultaneously on multiple machines at a time. Thus in the input instance, a job $J_i$ requires the number $m_i$ of machines on which it shall be processed. The algorithm should determine not only the execution order of jobs but also the machines on which the jobs are executed. In this paper, when the jobs have deadlines, the problem is to maximize the total work of jobs which is completed by their deadlines. The problem is known to be strongly NP-hard [5] and we investigate the approximation algorithms for the problem. We consider a model in which the algorithm can have more machines than the adversary. With this advantage, the problem is how good solution the algorithm can produce against the optimal algorithm.

Fuzzy-based ABR Traffic Control Algorithm in VS/VD Switch (VS/VD 구조의 퍼지 기반 ABR 트래픽 제어에 관한 연구)

  • Park, Hyun;Jeong, Kwang-Il;Cheong, Myung-Soo;Chung, Kyung-Taek;Chon, Byoung-Sil
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.8
    • /
    • pp.7-13
    • /
    • 2002
  • In this paper, we propose an traffic control algorithm for efficient link utilization of ATM-ABR service based on fuzzy logic. The proposed algorithm, controls transmission rates of source according to switch buffer size and input cell tate by using the fuzzy rate . For this method we developed a model and algorithm of fuzzy traffic control method and fuzzy traffic controller which based on ER of VS/VD. For the fuzzy traffic controller, we also designed a membership function, fuzzy control rules, and a max-min inferencing method.

An Approximated RLS Algorithm for Adaptive Parameter Estimation (적응 파라미터 예측을 위한 근사화된 RLS 알고리즘)

  • Ahn, Bong-Man;Hwang, Jee-Won;Ryoo, Jung-Rae;Cho, Ju-Phil
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.922-928
    • /
    • 2007
  • This paper presents the fast adaptive algorithm which applies an approximation scheme into RLS algorithm. The proposed algorithm(D-RLS) derives a QRD RLS algorithm derivation process from RLS algorithm recursively. D-RLS has the similar pattern as the algorithm having the approximation that input signals are separated respectively. Computational complexity of D-RLS is O(N), fewer than $O(N^2)$. To evaluate performance of proposed algorithm, we use the system identification method of FIR and Volterra system. And, finally, we can show D-RLS has an excellent performance.

Fog Rendering Using Distance-Altitude Scattering Model on 2D Images

  • Lee, Ho-Chang;Jang, Jaeni;Yoon, Kyung-Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.12
    • /
    • pp.1528-1535
    • /
    • 2011
  • We present a fog generation algorithm in 2D images. The proposed algorithm provides a scattering model for the approximated calculation of fog density. The scattering model needs parameters of distance and altitude information. However, 2D images do not include that information, so that we calculate them from the depth information generated in an interactive manner, and estimate the scattering factor by using the scattering model. Then we generate fog effect on an input image using the scattering factor by distance-oriented selection blur and color blending. With the algorithm, we can easily create the fog-effected images and fog generated animation from 2D images.

Correlation Analysis of the Frequency and Death Rates in Arterial Intervention using C4.5

  • Jung, Yong Gyu;Jung, Sung-Jun;Cha, Byeong Heon
    • International journal of advanced smart convergence
    • /
    • v.6 no.3
    • /
    • pp.22-28
    • /
    • 2017
  • With the recent development of technologies to manage vast amounts of data, data mining technology has had a major impact on all industries.. Data mining is the process of discovering useful correlations hidden in data, extracting executable information for the future, and using it for decision making. In other words, it is a core process of Knowledge Discovery in data base(KDD) that transforms input data and derives useful information. It extracts information that we did not know until now from a large data base. In the decision tree, c4.5 algorithm was used. In addition, the C4.5 algorithm was used in the decision tree to analyze the difference between frequency and mortality in the region. In this paper, the frequency and mortality of percutaneous coronary intervention for patients with heart disease were divided into regions.

An Efficient IP address Lookup Algorithm Using a Priority-Trie (IP 주소 검색을 위한 Priority Trie)

  • Lim, Hye-Sook;Mun, Ju-Hyoung
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.3-4
    • /
    • 2006
  • Fast IP address lookup in routers is essential to achieve packet forwarding in wire-speed. The longest prefix matching for IP address lookup is more complex than exact matching because of its dual dimensions, length and value. By thoroughly studying the current proposals for IP address lookup, we find out that the binary search could be a low-cost solution while providing high performance. Most of the existing binary search algorithms based on trie have simple data structures which can be easily implemented, but they have some problems because of empty internal nodes. The proposed algorithm is based on trie structure, but empty internal nodes are replaced by priority prefixes. The best-matching-prefix search in the proposed algorithm is more efficiently performed since search can be finished earlier when input is matched with a priority prefix. The performance evaluation results show that the constructed priority-trie has very good performance in the lookup speed and the scalability.

  • PDF

Physiological Neuro-Fuzzy Learning Algorithm for Face Recognition

  • Kim, Kwang-Baek;Woo, Young-Woon;Park, Hyun-Jung
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.1
    • /
    • pp.50-53
    • /
    • 2007
  • This paper presents face features detection and a new physiological neuro-fuzzy learning method by using two-dimensional variances based on variation of gray level and by learning for a statistical distribution of the detected face features. This paper reports a method to learn by not using partial face image but using global face image. Face detection process of this method is performed by describing differences of variance change between edge region and stationary region by gray-scale variation of global face having featured regions including nose, mouse, and couple of eyes. To process the learning stage, we use the input layer obtained by statistical distribution of the featured regions for performing the new physiological neuro-fuzzy algorithm.

Self-organized Learning in Complexity Growing of Radial Basis Function Networks

  • Arisariyawong, Somwang;Charoenseang, Siam
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.30-33
    • /
    • 2002
  • To obtain good performance of radial basis function (RBF) neural networks, it needs very careful consideration in design. The selection of several parameters such as the number of centers and widths of the radial basis functions must be considered carefully since they critically affect the network's performance. We propose a learning algorithm for growing of complexity of RBF neural networks which is adapted automatically according to the complexity of tasks. The algorithm generates a new basis function based on the errors of network, the percentage of decreasing rate of errors and the nearest distance from input data to the center of hidden unit. The RBF's center is located at the point where the maximum of absolute interference error occurs in the input space. The width is calculated based on the standard deviation of distance between the center and inputs data. The steepest descent method is also applied for adjusting the weights, centers, and widths. To demonstrate the performance of the proposed algorithm, general problem of function estimation is evaluated. The results obtained from the simulation show that the proposed algorithm for RBF neural networks yields good performance in terms of convergence and accuracy compared with those obtained by conventional multilayer feedforward networks.

  • PDF

Iterative Channel Estimation Algorithm for Anti-jamming in MIMO Communication Systems (MIMO 통신 시스템에서 항재밍을 위한 반복적인 채널 추정 알고리즘)

  • Jung, Jun Hee;Hwang, Yu Min;Cha, Kyung Hyun;Lee, Jae Seang;Shin, Yoan;Kim, Jin Young
    • Journal of Satellite, Information and Communications
    • /
    • v.11 no.3
    • /
    • pp.32-36
    • /
    • 2016
  • In wireless communication systems, jamming attack is a critical threat. Especially, reactive jamming can jam when the sender and receiver are communicating, which can maximize the attack efficiency of jamming. In this paper, we use the property of multi-input multi-output (MIMO) technology to achieve jamming resilient orthogonal frequency-division multiplexing (OFDM) communications. In particular, we use MIMO interference cancellation to remove the jamming signals strategically. We first investigate the reactive jamming attack model and their impacts on the MIMO-OFDM systems. We then present an iterative channel estimation algorithm that exploits MIMO interference cancellation. Our simulations show various anti-jamming methods and demonstrate the efficiency of our proposed algorithm under the reactive jamming attack.