• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.3
• /
• pp.597-605
• /
• 1999

In this paper, we propose a cardioangiography sequence image coding scheme which use a subtraction between initial image and current frame inserted contrast dye. Stable regions are obtained by the multithreshold and meaningful region is extracted by the images with stable region. The image with meaningful region is classified into contour and texture information. Contour information is coded by contour coding. And texture information is approximated by two-dimensional polynomial function and each coefficients is coded. Experimental results confirm that the sequence of cardioangiography are well reconstructed at the low bit rate (0.02∼0.04 bpp) and high compression ratio.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.11
• /
• pp.2264-2275
• /
• 1994

In this paper, image compression based on neural networks is presented with block classification and coding. Multilayer neural networks with error back-propagation learning algorithm are used to transform the normalized image date into the compressed hidden values by reducing spatial redundancies. Image compression can basically be achieved with smaller number of hidden neurons than the numbers of input and output neurons. Additionally, the image blocks can be grouped for adaptive compression rates depending on the characteristics of the complexity of the blocks in accordance with the sensitivity of the human visual system(HVS). The quantized output of the hidden neuron can also be entropy coded for an efficient transmission. In computer simulation, this approach lie in the good performances even with images outside the training set and about 25:1 compression rate was achieved using the entropy coding without much degradation of the reconstructed images.

• Journal of KIISE:Software and Applications
• /
• v.31 no.12
• /
• pp.1628-1636
• /
• 2004

Data compression techniques have been studied for decades because they saved space and time to reduce costs. The Lempel-Ziv 77 (LZ77) is a dictionary-based, lossless compression algorithm. The dictionary size of the LZ77 algorithm is fixed, and the performance of the algorithm is highly dependent on its dictionary size. In this paper, we suggest a dynamic LZ77 algorithm that changes its dictionary size during compression, and also we suggest a genetic algorithm to evolve the dictionary-resizing strategies. The suggested algorithm outperformed the original version up to about 16%.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.225-236
• /
• 2003

MOLAP systems store data in a multidimensional away called a 'cube' and access them using way indexes. When a cube is placed into disk, it can be Partitioned into a set of chunks of the same side length. Such a cube storage scheme is called the chunk-based MOLAP cube storage scheme. It gives data clustering effect so that all the dimensions are guaranteed to get a fair chance in terms of the query processing speed. In order to achieve high space utilization, sparse chunks are further compressed. Due to data compression, the relative position of chunks cannot be obtained in constant time without using indexes. In this paper, we propose a bitmap index for chunk-based MOLAP cubes. The index can be constructed along with the corresponding cube generation. The relative position of chunks is retained in the index so that chunk retrieval can be done in constant time. We placed in an index block as many chunks as possible so that the number of index searches is minimized for OLAP operations such as range queries. We showed the proposed index is efficient by comparing it with multidimensional indexes such as UB-tree and grid file in terms of time and space.

• Journal of KIISE:Databases
• /
• v.29 no.4
• /
• pp.262-273
• /
• 2002

MOLAP is a technology that accelerates multidimensional data analysis by storing data in a multidimensional array and accessing them using their position information. Depending on a mapping scheme of a multidimensional array onto disk, the sliced of MOLAP operations such as slice and dice varies significantly. [1] proposed a MOLAP cube storage scheme that divides a cube into small chunks with equal side length, compresses sparse chunks, and stores the chunks in row-major order of their chunk indexes. This type of cube storage scheme gives a fair chance to all dimensions of the input data. Here, we developed a variant of their cube storage scheme by placing chunks in a different order. Our scheme accelerates slice and dice operations by aligning chunks to physical disk block boundaries and clustering neighboring chunks. Z-indexing is used for chunk clustering. The efficiency of the proposed scheme is evaluated through experiments. We showed that the proposed scheme is efficient for 3~5 dimensional cubes that are frequently used to analyze business data.

• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.553-560
• /
• 2003

A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the selected cells of an OLAP data cube where target cells are decided by specified query ranges. The direct method to access the data cube itself forces too many cells to be accessed, therefore it incurs severe overheads. The prefix-sum cube was proposed for the efficient processing of range-sum queries in OLAP environments. However, the prefix-sum cube has been criticized due to its space requirement. In this paper, we propose a lossless compression method called the overlapped-subcube that is developed for the purpose of compressing prefix-sum cubes. A distinguished feature of the overlapped-subcube is that searches can be done without decompressing. The overlapped-subcube reduces the space requirement for storing prefix-sum cubes, and improves the query performance.

• Journal of KIISE:Software and Applications
• /
• v.33 no.6
• /
• pp.580-587
• /
• 2006

As PDA, IMT-2000, and e-Book are developed and popular in these days, the number of users who use these products has been increasing. However, available memory size of these machines is still smaller than that of desktop PCs. In these products, TrueType fonts have been increased in demand because the number of users who want to use good quality fonts has increased, and TrueType fonts are of great use in Windows CE products. However, TrueType fonts take a large portion of available device memory, considering the small memory sizes of mobile devices. Therefore, it is required to reduce the size of TrueType fonts. In this paper, two-phase compression techniques are presented for the purpose of reducing the sire of hangul bitmap data embedded in TrueType fonts. In the first step, each character in bitmap is divided into initial consonant, medial vowel, and final consonant, respectively, then the character is recomposed into the composite bitmap. In the second phase, if any two consonants or vowels are determined to be the same, one of them is removed. The TrueType embedded bitmaps in Hangeul Wanseong (pre-composed) and Hangul Johab (pre-combined) are used in compression. By using our compression techniques, the compression rates of embedded bitmap data for TrueType fonts can be reduced around 35% in Wanseong font, and 7% in Johab font. Consequently, the compression rate of total TrueType Wanseong font is about 9.26%.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1998.05b
• /
• pp.783-788
• /
• 1998

발전소 운영자는 운전 시작시점에서 수명 종료시점까지 발전소 과도상태 종류별 횟수가 설계 제한치를 넘지 않도록 감시하여야 하며 이를 위해서는 발전소 운전 과도상태 기록유지가 필요하다. 그러나 현재와 같은 발전소 운전 Strip Chart나 Log Sheet를 이용하는 방식으로는 과도상태 발생여부 판단이 어려울 뿐만 아니라 카운팅 자체에도 많은 시간이 소요되어 좀더 편리한 방법의 도입이 필요하다. 본 연구에서는 발전소 주전산기의 운전 데이타를 이용한 과도상태 데이터 수집 및 지능형 과도상태 판단방법을 개발하여 시범 적용하였다. 과도상태 데이터 수집은 전송되는 데이터와 이전 데이터를 비교하여 변화가 있을 시에만 데이터 압축방식을 이용하여 저장하였고, 최대/최소온도, 최대/최소압력, 온도/압력기울기 등의 운전 데이타를 기 설정된 과도상태의 전체 변수와 비교하여 오차율 범위내에 들면 동일한 과도상태로 판단하였다. 원자로 냉각재 계통의 온도 및 압력과 같이 계기 오차가 비교적 작은($\pm$1$^{\circ}C$) 운전변수는 과도상태 판단이 용이하나 오차가 큰 운전변수의 경우에는 과도상태 판단을 위한 보다 상세한 알고리즘의 개발이 필요하다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.1
• /
• pp.197-208
• /
• 1999

In this paper, we proposed a multimedia hardware architecture for video-conferencing in view of the multimedia data flow. By simulating the architecture model, we analyzed the bottleneck of multimedia data flow, varying video size, frame rate, number of participants, and video data compression rate. To confirm the simulation results, we also implemented and tested the architecture that almost includes the analyzed requirements for video- conferencing. From the analysis of I/O system, we found the considerations in designing a multimedia I/O system.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.3
• /
• pp.608-616
• /
• 1996

In this paper, we propose a multimedia hardware architecture for desktop video-conferencing in view of the multimedia data flow and analyze system operation using queueing model. We analyze the bottleneck of multimedia data flow for video- conferencing by simulation, varying the video size, frame rate, the number of participants, and video data compression rate, And we also implement and test the archiecture, that almost includes the analyzed requirements for video-conferencing, to confirm the simulation results. This paper describes the considerations in designing a multimedia I/O system.