• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1003-1006
• /
• 2002

In the communications systems with diversity, we are commonly faced on needing of new source coding technique, error resilient coding. The error resilient coding addresses the coding algorithm that has the robustness to unreliability of communications channel. In recent years, many error resilient coding techniques were proposed such as data partitioning, resynchronization, error detection, concealment, reference picture selection and multiple description coding (MDC). Especially, the MDC using correlating transform explicitly adds correlation between two descriptions to enable the estimation of one set from the other. However, in the conventional correlating transform method, there is a critical problem that decoder must know statistics of original image. In this paper, we propose an enhanced method, the MDC using whitening transform that is not necessary additional statistical information to decode image because the DCT coefficients to apply whitening transform to an image have uni-variance statistics. Our experimental results show that the proposed method achieves a good trade-off between the coding efficiency and the reconstruction quality. In the proposed method, the PSNR of images reconstructed from two descriptions is about 0.7dB higher than conventional method at the 1.0 BPP and from only one description is about 1,8dB higher at the same rate.

• Journal of IKEEE
• /
• v.6 no.1 s.10
• /
• pp.80-86
• /
• 2002

This paper presents a fast hardware architecture to implement a 2-D DWT(Discrete Wavelet Transform) computed by lifting scheme framework. The conventional 2-D DWT hardware architecture has problem in internal memory, hardware resource, and latency. The proposed architecture was based on the 4-way partitioned data set. This architecture is configured with a pipelining parallel architecture for 4-way partitioning method. Due to the use of this architecture, total latency was improved by 50%, and memory size was reduced by using lifting scheme.

• The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
• /
• v.4 no.1
• /
• pp.20-27
• /
• 1993

In this paper, a model of TCM / M-PSK with set partitioning and a model of the combined M-ary PSK system with pragmatic coding for digital radio communication are realized. The equations of error probability for TCM / M-PSK system and the combined M-ary PSK system with pragmatic coding are derived on the conditions of the Rayleigh fading with the AWGN. It is found that the combined M-ary PSK systemwith pragmatic coding in the AWGN channel can not be applied to the fading channel since uncoded bits cause parallel:parallel paths in the trellis diagram to degrade the performance of the system. However, the use of pragmatic coding in the AWGN channel could simplify the given system since single convolutional encoder / decoder is required.

• Convergence Security Journal
• /
• v.6 no.2
• /
• pp.53-60
• /
• 2006

In the applications such as CAD or image processing, a variety of geometric objects are manipulated. A polygon in which all the edges are parallel to x- or y-axis is decomposed into simple rectangles for efficient handling. But, depending on the partitioning algorithms, the same region can be decomposed into a completely different set of rectangles in the number, size and shape of rectangles. So, it is necessary an algorithm that compares two sets of rectangles extracted from two scenes such as CAD or image to see if they represent the same region. This paper proposes an efficient algorithm that compares two sets of rectangles. The proposed algorithm is not only simpler than the algorithm based on sweeping method, but also reduces the number $O(n^2)$ of overlapped rectangles from the algorithm based on a balanced binary tree to O(nlogn).

• Journal of Educational Research in Mathematics
• /
• v.22 no.3
• /
• pp.311-329
• /
• 2012

This study analyzed third graders' understanding on the part-whole fraction concept in both the continuous and the discrete contexts. A set of problems were developed as an equivalent form to compare and contrast students' understanding of fraction in the two contexts. Unexpectedly, the results of this study showed that students' performance in the continuous contexts was slightly lower than their performance in the discrete contexts. Students tended to use different strategies depending on the contexts and they had difficulties in applying what they knew in the new contexts. On the basis of the detailed analyses about students' difficulties and their sources, this paper provides information on how to construct curricular materials and how to teach the basic concepts related to the part-whole fraction.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.6
• /
• pp.515-520
• /
• 2004

Core-based system-on-a-chip (SoC) designs present a number of test challenges. Two major problems that are becoming increasingly important are long application time during manufacturing test and high volume of test data. Highly efficient compression techniques have been proposed to reduce storage and application time for high volume data by exploiting the repetitive nature of test vectors. This paper proposes a new test data compression technique for SoC testing. In the proposed technique, compression is achieved by partitioning the test vector set and removing repeating segment. This process has $O(n^{-2})$ time complexity for compression with a simple hardware decoding circuitry. It is shown that the efficiency of the proposed compression technique is comparable with sophisticated software compression techniques with the advantage of easy and fast decoding.

• The KIPS Transactions:PartB
• /
• v.10B no.5
• /
• pp.575-578
• /
• 2003

SPIHT algorithm is a wavelet based fast and effective technique for image compression. It uses a list structure to store status information which is generated during set-partitioning of zero-tree. Usually, this requires lots of additional memory depending on how high the bit-rate is. Therefore, in this paper, we propose a new technique called MZP-DFS, which needs no additional memory when running SPIHT algorithm. It traverses a spatial-tree according to DFS and eliminates additional memory as it uses test-functions for encoding and LSB bits of coefficients for decoding respectively. This method yields nearly the same performance as SPIHT. This may be desirable in hardware implementation because no additional memory is required. Moreover. it exploits parallelism to process each spatial-tree that it can be applied well in real-time image compression.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.46
• /
• pp.33-49
• /
• 1998

In order to improve the performance of relational databases, one has to reduce the number of disk accesses necessary to transfer data from disk to main memory. The paper proposes to reduce the number of disk I/O accesses by vertically partitioning relation into fragments and allowing attribute replication to fragments if necessary. When zero-one integer programming model is solved by the branch-and-bound method, it requires much computing time to solve a large sized problem. Therefore, heuristic solutions using genetic algorithm(GA) are presented. GA in this paper adapts a few ideas which are different from traditional genetic algorithms, for examples, a rank-based sharing fitness function, elitism and so on. In order to improve performance of GA, a set of optimal parameter levels is determined by the experiment and makes use of it. As relations are vertically partitioned allowing attribute replications and saved in disk, an attribute replicating vertical partition method by GA can attain less access cost than non-attribute-replication one and require less computing time than the branch-and-bound method in large-sized problems. Also, it can acquire a good solution similar to the optimum solution in small-sized problem.

• Journal of Information Processing Systems
• /
• v.13 no.1
• /
• pp.40-56
• /
• 2017

Since the progress of digital medical imaging techniques, it has been needed to compress the variety of medical images. In medical imaging, reversible compression of image's region of interest (ROI) which is diagnostically relevant is considered essential. Then, improving the global compression rate of the image can also be obtained by separately coding the ROI part and the remaining image (called background). For this purpose, the present work proposes an efficient reversible discrete cosine transform (RDCT) based embedded image coder designed for lossless ROI coding in very high compression ratio. Motivated by the wavelet structure of DCT, the proposed rearranged structure is well coupled with a lossless embedded zerotree wavelet coder (LEZW), while the background is highly compressed using the set partitioning in hierarchical trees (SPIHT) technique. Results coding shows that the performance of the proposed new coder is much superior to that of various state-of-art still image compression methods.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.321-327
• /
• 2004

SPIHT algorithm is a wavelet based fast and effective technique for image compression. It uses a list structure to store status information which is generated during set-partitioning of toro-tree. Usually, this requires lots of additional memory depending on how high the bit-rate is. Therefore, in this paper, we propose a new technique called MZC-BFS, which needs no additional memory when running SPIHT algorithm. It explicitly performs a breadth first search of the spatial-tree using peano-code and eliminates additional memory as it uses pre-status significant test for encoding and LSB bits of some coefficients for decoding respectively. This method yields nearly the same performance as SPIHT. This may be desirable in fast and simple hardware implementation and reduces the cost of production because no lists and additional memory are required.