• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.982-987
• /
• 2007

The necessity of data compression scheme for volume data has been increased because of the increase of data capacity and the amount of network uses. Now we have various kinds of compression schemes, and we can choose one of them depending on the data types, application fields, the preferences, etc. However, the capacity of data which is produced by application scientists has been excessively increased, and the format of most scientific data is 3D volume. For 2D image or 3D moving pictures, many kinds of standards are established and widely used, but for 3D volume data, specially time-varying volume data, it is very difficult to find any applicable compression schemes. In this paper, we present a compression scheme for encoding time-varying volume data. This scheme is aimed to encoding time-varying volume data for visualization. This scheme uses MPEG's I- and P-frame concept for raising compression ratio. Also, it transforms volume data using Daubechies D4 filter before encoding, so that the image quality is better than other wavelet-based compression schemes. This encoding scheme encodes time-varying volume data composed of single precision floating-point data. In addition, this scheme provides the random reconstruction accessibility for an unit, and can be used for compressing large time-varying volume data using correlation between frames while preserving image qualities.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.3
• /
• pp.64-69
• /
• 2000

This paper proposes a novel fractal coding method for fast encoding and high compression to shorten time to take on fractal encoding by using limited search area. First. the original image is contracted respectively by half and by quarter with the scaling method and bit-plane method. And then, the corresponding domain block of the quarter-sized image which is most similar with one range block of the half-sized image is searched within the limited area in order to reduce the encoding time extremely. As the result of the evaluation, the proposed algorithm provided much shorter encoding time and better compression ratio with a little degradation of the decoded image qualify than Jacquin's method.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2012.05a
• /
• pp.343-344
• /
• 2012

With the increase of sensitive data and their secure transmission and storage, the use of encryption techniques has become widespread. The performance of encoding majorly depends on the computational time, so a system with less computational time suits more appropriate as compared to its contrary part. Double Random Phase Encoding (DRPE) is an algorithm with many sub functions which consumes more time when executed serially; the computation time can be significantly reduced by implementing important functions in a parallel fashion on Graphics Processing Unit (GPU). Computing convolution using Fast Fourier transform in DRPE is the most important part of the algorithm and it is shown in the paper that by performing this portion in GPU reduced the execution time of the process by substantial amount and can be compared with MATALB for performance analysis. NVIDIA graphic card GeForce 310 is used with CUDA C as a programming language.

• ETRI Journal
• /
• v.38 no.5
• /
• pp.807-817
• /
• 2016

A novel fast algorithm is suggested for a coding unit (CU) mode decision using pseudo rate-distortion based on a separated encoding structure in High Efficiency Video Coding (HEVC). A conventional HEVC encoder requires a large computational time for a CU mode prediction because prediction and transformation procedures are applied to obtain a rate-distortion cost. Hence, for the practical application of HEVC encoding, it is necessary to significantly reduce the computational time of CU mode prediction. As described in this paper, under the proposed separated encoder structure, it is possible to decide the CU prediction mode without a full processing of the prediction and transformation to obtain a rate-distortion cost based on a suitable condition. Furthermore, to construct a suitable condition to improve the encoding speed, we employ a pseudo rate-distortion estimation based on a Hadamard transformation and a simple quantization. The experimental results show that the proposed method achieves a 38.68% reduction in the total encoding time with a similar coding performance to that of the HEVC reference model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2C
• /
• pp.147-161
• /
• 2003

Video object segmentation is one of the core technologies for content-based real-time MPEG-4 encoding system. For real-time requirement, the segmentation algorithm should be fast and accurate but almost all existing algorithms are computationally intensive and not suitable for real-time applications. The MPEG-4 VM(Verification Model) has provided basic algorithms for MPEG-4 encoding but it has many limitations in practical software development, real-time camera input system and compression efficiency. In this paper, we implemented the preprocessing system for real-time camera input and VOP extraction for content-based video coding and also implemented motion detection to achieve the 180 : 1 compression rate for real-time and high compression MPEG-4 encoding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2789-2800
• /
• 1996

Real time fractal coding for successive QCIF 144*176 luminance images has been implemented on a 50MHz IBM 486 personal computer. To satisfy the frame encoding speed and data compression ratio, following algorithms are adopted. In order to minimize encoding time, extension SAS being not searching of domain blocks is used. for reducing the bits per pixel, conventioal 4*4 range block is extended to 8*8 range block. and range block extension decrease quality of decoded image. For improvement quality of decoded image, the paper apply quad-tree partition mothod. In order to divide **8 range block, self-simiarity is compared 8*8 range block with spatial contractive transformed 8*8 domain block. According to self-simiarity, the block is partitioned and owing to block partition, increased encoding time is minimized. According to self-simiarity of 8*8 range block and spatial contractive transformed 8*8 domain block, number of fractal factor is varied. Simultaneously with minimizing the decrement of decoded image's quality, transmittion rate and encoding time is shorted. The results enable us to process the real-time fractal coding. For the claire test image, the average PSNR was 32.4dB, 0.12 bit rates and 33ms coding time per frame.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.923-926
• /
• 1998

비디오 스트림과 오디오 스트림 그리고 제어신호등의 서로 다른 종류의 digital data 들을 저장 또는 전송하기 위해서는 하나의 스트림으ㅗ 통합하기 위해 다중화 과정을 거쳐야 한다. 이러한 다중화 과정에서 가장 중요한 문제점은 하나로 묶여진 일련의 스트림을 원래의 순차대로 복원해주는 동기화 문제이고, DVD-Video에서는 MPEG2 system를 이용한 동기방식을 사용한다. 본 논문은 DVD 규격에 맞추어 Microsoft의 Visual C++5.0을 이용하여 software로 VOB를 구현하였다. 입력 스트림은 MPEG2로 압축된 비디오스트림과 최대 8개의 5.1채널 AC3 오디오스트림이고 각 스트림은 frame단위로 구성이 된다. 이 frame들을 단위로 time stamp가 부여되며 time stamp의 비교에 의해 우선 순위를 부여하여 encoding을 하게된다. 그리고 같은 time stamp를 가졌을 경우 발생하는 encoding 순서의 문제는 스트림별로 미리 우선 순위를정함으로써 해결했다.

• Nuclear Engineering and Technology
• /
• v.52 no.10
• /
• pp.2339-2345
• /
• 2020

Radiation imaging systems consisting of a large number of channels greatly benefit from multiplexing methods to reduce the number of channels with minimizing the system complexity and development cost. In conventional pixelated radiation detector modules, such as anger logic, is used to reduce a large number of channels that transmit signals to a data acquisition system. However, these methods have limitations of electrical noise and distortion at the detector edge. To solve these problems, a multiplexing concept using a digital signal encoding technique based on a time delay method for signals from detectors was developed in this study. The digital encoding multiplexing (DEM) method was developed based on the time-over-threshold (ToT) method to provide more information including the activation time, position, and energy in one-bit line. This is the major advantage of the DEM method as compared with the traditional ToT method providing only energy information. The energy was measured and calibrated by the ToT method. The energy resolution and coincidence time resolution were observed as 16% and 2.4 ns, respectively, with DEM. The position was successfully distributed on each channel. This study demonstrated the feasibility that DEM was useful to reduce the number of detector channels.

• Journal of the Korea Computer Graphics Society
• /
• v.6 no.3
• /
• pp.35-40
• /
• 2000

There are two problems in H.26X compression technique. One is compressing time in encoding process and the other is degradation of the decoded video quality due to high compression rate. For transferring moving pictures in real-time, it is required to adopt massively high compression. In this case, there are a lot of losses of an original video data and that results in degradation of quality. Especially degradation called by blocking artifact may be produced. The blocking artifact effect is produced by DCT-based coding techniques because they operate without considering correlation between pixels in block boundaries. So it represents discontinuity between adjacent blocks. This paper describes methods of quality compensation for H.26x decoded data and enhancing encoding speed for real-time operation. Our goal of the quality compensation is not to make the decoded video identical to a original video but to make it perceived better through human eyes. We suggest an algorithm that reduces block artifact and clears decoded video in decoder. To enhance encoding speed, we adopt new four-step search algorithm. As shown in the experimental result, the quality compensation provides better video quality because of reducing blocking artifact. And then new four-step search algorithm with $MMX^{TM}$ implementation improves encoding speed from 2.5 fps to 17 fps.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.86-91
• /
• 1991

A capability of performing the optical logic and arithmetic operations is followed by an effective encoding technique. In this paper, we proposed the color light encoding technique. By using this encoding technique, the space bandwidth product(SBP) is minimized in the output plane. In addition, we proposed the pre-operation pro-carry processing method that performs faster than the same time operation and carry processing method in optical computing. We proposed that the color liquid crystal device(CLCD) is used as the encoded color light input source.