• The Bulletin of The Korean Astronomical Society
• /
• v.42 no.2
• /
• pp.56.2-56.2
• /
• 2017

We in the Korea Institute for Advanced Study are preparing the fifth Horizon Run in a series of large-scale cosmological simulations. For the first time we will include full hydrodynamics and astrophysical processes using a RAMSES code. I will discuss the impact of large-scale structures on smaller scale properties in cosmological hydrodynamic simulation to justify our choice of simulation boxsize, whose one side length is up to 1 Gpc.

• IE interfaces
• /
• v.11 no.2
• /
• pp.79-92
• /
• 1998

For the PCB inspection by computer vision, in some cases, the MRLC file should prepared. The MRLC file contains a RLC(Run Length Code) and a direction flag. In this paper, a generating method of MRLC is described. It is composed of two procedure as followings; (i) rasterizing Gerber file which is a vectorized image of PCB panel, and (ii) calculating a MRLC that is useful for the inspection as a template image. The suggested procedures are written in C-language and executable on Windows 95 and Windows NT.

• The Journal of the Korea Contents Association
• /
• v.5 no.4
• /
• pp.188-196
• /
• 2005

This paper presents a new test data compression and low power scan test method that can reduce test time and power consumption. A proposed method can reduce the scan-in power and test data volume using a modified scan cell reordering algorithm and hybrid adaptive encoding method. Hybrid test data compression method uses adaptively the Golomb codes and run-length codes according to length of runs in test data, which can reduce efficiently the test data volume compare to previous method. We apply a scan cell reordering technique to minimize the column hamming distance in scan vectors, which can reduce the scan-in power consumption and test data. Experimental results for ISCAS 89 benchmark circuits show that reduced test data and low power scan testing can be achieved in all cases. The proposed method showed an about a 17%-26% better compression ratio, 8%-22% better average power consumption and 13%-60% better peak power consumption than that of previous method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1939-1947
• /
• 1999

This paper proposes new line code BIM (Bit Insertion and Manipulation) that is designed to overcome the problems of existing line codes. The block code, one of typical existing line code, has good transmission performance but difficulty in implementation. The other typical existing line code, bit insertion code, is easy to implementation but has bad transmission performance. BIM code in this paper could provide not only good performance but also provides simplicity in the implementation by combining the good points of block code into it of bit insertion code properly. In this paper, 5B6B type BIM code is designed. Designed 5B6B BIM code shows good transmission performance such $\pm$2 DSV, 0 RSD, 7 maximum run length and also it can be implemented under 2000 gates and need only 1 bit redundancy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1104-1114
• /
• 2007

Digital video compression technique has played an important role that enables efficient transmission and storage of multimedia data where bandwidth and storage space are limited. The new video coding standard, H.264/AVC, developed by Joint Video Team(JVT) significantly outperforms previous standards in compression performance. Especially, variable length code(VLC) plays a crucial pun in video and image compression applications. H.264/AVC standard adopted Context-based Adaptive Variable Length Coding(CAVLC) as the entropy coding method. CAVLC of H.264/AVC requires a large number of the memory accesses. This is a serious problem for applications such as DMB and video phone service because of the considerable amount of power that is consumed in accessing the memory. In order to overcome this problem in this paper, we propose a variable length technique that implements memory-free coeff_token, level, and run_before decoding based on arithmetic operations and using only 70% of the required memory at total_zero variable length decoding.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.5
• /
• pp.1015-1022
• /
• 2012

This paper deals with hardware design which unifies MD5 and HAS-160 hash algorithms. Two algorithms get a message with arbitrary length and process message blocks divided into 512 bits each time and output a hash code with a fixed length. MD5 ouputs a hash code of 128 bits and HAS-160 a hash code of 160 bits. The unified hash core designed has 32% of slices overhead compared to HAS-160 core. However, there is only a fixed message buffer space used. The unified hash core which run a step in one clock cycle operates at 92MHz and has performance which digests a message in the speed of 724Mbps at MD5 and 581Mbps at HAS-160 hash mode. The unified hash core which is designed can be applicable to the areas such as E-commerce, data integrity and digital signature.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.5
• /
• pp.390-399
• /
• 1988

A conventional BTC has the merit of real time processing and simple computation, but has the problem that its compression rate is low. In this paper, a modified BTC using the Quad Tree which is frequently used in binary image is proposed. The method results in the low compression rate by decreasing the total number of subblocks by mean of making the size of a subblock large in the small variation area of graty level and the size af a subblock small in the large variation area of gary level. For the effective transmission of bit plane, the Huffman run-lengh code for the large size of a subblock and the lookup table for tha small size of a subblock are used. The proposed BTC method show the result of coding 256 level image at the average data rate of about 0.8 bit/pixel.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.556-558
• /
• 1998

이미지 분석이나 데이터 베이스 인덱싱 또는 종이 문서를 전자 문서화 하는 문제는컴퓨터 비젼 응용분야에서 중요 관심사가 되어왔다. 이러한 문제들을 처리하기 위해서는 제일 먼저 이미지와 문자가 혼합되어 있는 문서에서 자동으로 문자와 이미지들을 분리해 내는 과정이 필수 적이다. 본 논문에서는 신문이나 광고등에서 볼 수 있는 이미지, 음각 문자와 양각 문자가 섞여 있는 문서에서 문자만을 추출하는 알고리즘을 제안한다. 이 알고리즘은 Run-length code를 이용하여 문자나 이미지의 경계선(bound) 모양의 특징을 추출하여 음각 문자와 이미지, 양각 문자를 구분한다. 그리고 추출된 글자들을 3차원 공간상에 매핑한 후 3차원 면적 가중치 그래프를 이용하여 관련된 단어들로 묶어주는 3차원 그룹핑 알고리즘을 제시한다. 실험결과로는 추출된 문자와 그룹핑된 결과를 보여준다.

• International Journal of Contents
• /
• v.10 no.4
• /
• pp.11-17
• /
• 2014

The influence of acquisition environment on music score images captured by a camera has not yet been seriously examined. All existing Optical Music Recognition (OMR) systems attempt to recognize music score images captured by a scanner under ideal conditions. Therefore, when such systems process images under the influence of distortion, different viewpoints or suboptimal illumination effects, the performance, in terms of recognition accuracy and processing time, is unacceptable for deployment in practice. In this paper, a novel, lightweight but effective approach for dealing with the issues caused by camera based music scores is proposed. Based on the staff line information, musical rules, run length code, and projection, all regions of interest are determined. Templates created from inverse filter are then used to recognize the music symbols. Therefore, all fragmentation and deformation problems, as well as missed recognition, can be overcome using the developed method. The system was evaluated on a dataset consisting of real images captured by a smartphone. The achieved recognition rate and processing time were relatively competitive with state of the art works. In addition, the system was designed to be lightweight compared with the other approaches, which mostly adopted machine learning algorithms, to allow further deployment on portable devices with limited computing resources.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.2
• /
• pp.162-171
• /
• 1991

This paper presents an algorithm for compressing image data by separating the image into two parts. I.e. edge image containing high-frequency components and non-edge image containing low-frequency components of image. The edge image is extracted by using 8 level compass gradient masks and the non-edge image is obtained by removing the edge image from the original image. The edge image is coded by Huffman run-length code and the non edge image is transformed first by DCT and the transformed images is coded next by a quantized bit allocation table. For an example image. GIRL. the proposed algorithm shows bit rate of 0.52 bpp with PSNR of 36dB.