• The Journal of the Korea Contents Association
• /
• v.8 no.7
• /
• pp.53-57
• /
• 2008

The discretized saw-tooth map with the 16-bit finite precision which is one of the 1-dimensional chaotic maps is designed, and the circuit of chaotic binary sequence generator using the discretized saw-tooth map is presented also in this brief. The real implementation of designed chaotic map is accomplished by connecting the input and output lines exactly according to the simplified Boolean functions of output variables obtained from truth table which is discretized. The random binary output sequences generated by mLFSR generator were used for the inputs of descretized saw-tooth map, and, by the descretized map, chaotic binary sequence which has more long period of 16 times minimally is generated as a results.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.10
• /
• pp.1349-1355
• /
• 1999

A power distribution facility map is drawn on cadastral map. Besides, grid lines are added on the map for sectionalization. For automatic recognition of the map, we first extract recognizing regions. In this paper, we propose an extraction method of recognizing regions by partially extending thinned image. The proposed method is consist of three phases, binarization phase, thinning phase and partial extending phase. The first phase generate a binary image using threshold value which is obtained by histogram analysis. The binary image contains many part of recognizing regions, but not all. The second phase generate thinned image which is generated by appling thinning operator to the binary image. And the third phase extends thinned image from terminal point until satisfying termination condition. The proposed method is tested on several power distribution facility maps, and the results are presented.

• Journal of Institute of Control, Robotics and Systems
• /
• v.2 no.2
• /
• pp.108-114
• /
• 1996

We present proofs of the stability and convergence of Self-organizing feature map (SOFM) neural network with time-invarient learning rate and binary reinforcement function. One of the major problems in Self-organizing feature map neural network concerns with learning rate-"Kalman Filter" gain in stochsatic control field which is monotone decreasing function and converges to 0 for satisfying minimum variance property. In this paper, we show that the stability and convergence of Self-organizing feature map neural network with time-invariant learning rate. The analysis of the proposed algorithm shows that the stability and convergence is guranteed with exponentially stable and weak convergence properties as well.s as well.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.180-188
• /
• 1995

A modified Kohonen's self-organizing feature map (SOFM) algorithm which has binary reinforcement function and a constant learning rate is proposed. In contrast to the time-varing adaptaion gain of the original Kohonen's SOFM algorithm, the proposed algorithm uses a constant adaptation gain, and adds a binary reinforcement function in order to compensate for the lowered learning ability of SOFM due to the constant learning rate. Since the proposed algorithm does not have the complicated multiplication, it's digital hardware implementation is much easier than that of the original SOFM.

• The Journal of the Korea Contents Association
• /
• v.8 no.4
• /
• pp.86-91
• /
• 2008

To present the design procedure of discretized 8-bit tent map executing the transformation of tent function which is one of the chaotic functions, first, the truth table of discretized tent map was written, and then according to the simplified Boolean algebra equations obtained from the truth table, the discretized map is implemented with the exclusive logic gate as a real hardware. The discretized tent map circuit which provides the feedback circuit for generating the period-8 states relevant to the 8-bit finite precision is also designed and presented in this paper. Furthermore, it might be used stream cipher system with a new key-stream circuit for generate of chaotic binary sequence.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.2
• /
• pp.171-179
• /
• 2010

A fundamental technology of UGV(Unmanned Ground Vehicle) to perform a given mission with success in various environment is a path planning method which generates a safe and optimal path to the goal. In this paper, we suggest a local path-planning method of UGV based on the binary map using world model data which is gathered from terrain perception sensors. In specially, we present three core algorithms such as shortest path computation algorithm, path optimization algorithm and path smoothing algorithm those are used in the each composition module of LPP component. A simulation is conducted with M&S(Modeling & Simulation) system in order to verify the performance of each core algorithm and the performance of LPP component with scenarios.

• Journal of Korea Multimedia Society
• /
• v.14 no.2
• /
• pp.210-218
• /
• 2011

Generally, GIS digital map has been represented and transmitted by ASCII and Binary data forms. Among these forms, Binary form has been widely used in many GIS application fields for the transmission of mass map data. In this paper, we present a hierarchical compression technique of polyline and polygon components for effective storage and transmission of vector map with various degree of decision. These components are core geometric components that represent main layers in vector map. The proposed technique performs firstly the energy compaction of all polyline and polygon components in spatial domain for the lossless compression of detailed vector map and compress independently integer parts and fraction parts of 64bit floating points. From experimental results, we confirmed that the proposed technique has superior compressive performance to the conventional data compression of 7z, zip, rar and gz.

• Journal of the Semiconductor & Display Technology
• /
• v.18 no.4
• /
• pp.110-115
• /
• 2019

Blur detection and segmentation play vital role in many computer vision applications. Among various methods, local binary pattern based methods provide reasonable blur detection results. However, in conventional local binary pattern based methods, the blur map is computed by using a fixed threshold irrespective of the type and level of blur. It may not be suitable for images with variations in imaging conditions and blur. In this paper we propose an effective method based on local binary pattern with adaptive threshold for blur detection. The adaptive threshold is computed based on the model learned through the multinomial logistic regression. The performance of the proposed method is evaluated using different datasets. The comparative analysis not only demonstrates the effectiveness of the proposed method but also exhibits it superiority over the existing methods.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.388-389
• /
• 2008

이중 이진 (double binary) 터보 디코더는 오류 정정 코드 중 하나로써, 높은 오류 정정 성능으로 인해 IEEE 802.16 표준 (WiMAX)에서 사용되고 있다. Maximum ${\alpha}$ posteriori probability (MAP) 디코딩 블록은 이중 이진 터보 디코더의 가장 핵심적인 블록으로, 본 논문은 이를 구현하기 위한 알고리즘 중 하나인 improved Max-Log-MAP 알고리즘에 대한 효율적인 하드웨어 구조를 제안한다. 제안하는 하드웨어 구조는 기존의 하드웨어 구조와 비교하였을 때, 오류 정정 성능은 동일만 반면, 구떤 복잡도는 감소한다. 0.13um 공정에서 입력 비트폭을 8비트로 가정하고 시뮬레이션 한 결과, 속도와 칩 면적, 그리고 소비전력 측면에서 각각 8.92%, 1845%, 그리고 29.93%의 향상을 보인다. 제안하는 구조를 WIMAX 설계에 적용하여 성능 개선을 이끌어낼 수 있다.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.4
• /
• pp.11-19
• /
• 2007

This paper proposes RCB(Reduced Compact Binary) tie to correct faults of both CB(Compact Binary) tie and HCB(Hierarchical Compact Binary) trie. First, in the case of CB trie, a compact structure was tried for the first time, but as the amount of data was increasing, that of inputted data gained and much difficulty was experienced in insertion due to the dummy nods used in balancing trees. On the other hand, if the HCB trie realized hierarchically, given certain depth to prevent the map from increasing on the right, reached the depth, the method for making new trees and connecting to them was used. Eventually, fast progress could be made in the inputting and searching speed, but this had a disadvantage of the storage space becoming bigger because of the use of dummy nods like CB trie and of many tree links. In the case of RCB trie in this thesis, the tree-map could be reduced by about 35% by completely cutting down dummy nods and the whole size by half, compared with the HCB trie.