• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.8
• /
• pp.1031-1036
• /
• 1999

A Hierarchical vector Quantization scheme is implemented and an optimal thresholding technique of quadtree segmentation for performing high quality low bit rate image compression is proposes. A mathematical model is constructed under the assumption that the standard deviations of sub-blocks are larger than or equal to the standard deviation of the upper level block which is generated by merging of sub-blocks. This thresholding technique based on the mathematical modeling allows producing about 1 dB improved performance in terms of PSNR at most ranges of bit rates over the quadtree coder, which is based on MSE for quadtree segmentation.

• 전자공학회논문지 IE
• /
• v.43 no.4
• /
• pp.37-42
• /
• 2006

This paper proposes a adaptive video watermarking algorithm according to bitrate and motion vector size in MPEG2 system. The watermark strength in the I-frames is adapted for quantization step size and the strength in the P-B-frames is adapted for quantization step size and motion vector of macroblock to make the watermark more robust against the accompanying degradation due to aggressively compression. A realtime watermark extraction is done directly in the DCT domain during MPEG decoding without full decoding of MPEG video. The experimental simulations show that the video quality results almost invisible difference between the watermarked frames and the original frames and the watermark is resistant to frame dropping, MPEG compression, GoP conversion and low pass filter attacks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.120-127
• /
• 2000

In this paper, we propose multispectral image compression using classified interband prediction and vector quantization in wavelet domain. This method classifies each region considering reflection characteristics of each band in image data. In wavelet domain, we perform the classified intraband VQ to remove intraband redundancy for a reference band image that has the lowest spatial variance and the best correlation with other band. And in wavelet domain, we perform the classifled interband prediction to remove interband redundancy for the remaining bands. Then error wavelet coefficients between original image and predicted image are intraband vector quantized to reduce prediction error. Experiments on remotely sensed satellite image show that coding efficiency of theproposed method is better than that of the conventional method.

• The Journal of the Korea Contents Association
• /
• v.9 no.7
• /
• pp.37-44
• /
• 2009

Digital watermarking is a technology for preventing illegal copying, for protecting intellectual property rights and copyrights, and for suggesting grounds of the ownership by inserting watermarks into digital contents. Generally speaking, watermarking techniques cannot escape from data distortion and quality degradation due to the watermark insertion. In order to overcome the shortcoming, zero-watermarking techniques which do not change the original data have been proposed recently. This paper proposes CSMVQ(Chaotic SMVQ), a zero-watermarking system for SMVQ(Side Match Vector Quantization) which shows better compression ratio and quality and less blocking effect than VQ(Vector Quantization). In SMVQ, compression progresses from left top to right bottom in order to use the information of the two neighbor blocks, so it is impossible to insert watermarks chaotically. In the process of encoding, CSMVQ dynamically considers the information of the (1 to 4) neighbor blocks already encoded. Therefore, watermark can be inserted into digital contents in chaotic way. Experimental results show that the image quality compressed by CSMVQ is better than that of SMVQ and the inserted watermark is robust against some common attacks.

• 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.

• Korean Chemical Engineering Research
• /
• v.48 no.4
• /
• pp.450-456
• /
• 2010

This study was conducted in order to design a piston, part of a shock absorber, and the findings after examining the features of the velocity distribution and the static pressure distribution of oil on a low-velocity piston are as follow. The compression speed of oil passing through an 0.9 mm orifice was 0.0156~0.0642 m/s, and the velocity vector of the velocity distribution and the static pressure distribution had a greater tendency to rotate when the velocity increased. In case of the velocity vector of the velocity distribution and the static pressure distribution with an 0.8mm orifice, the speed changed secondarily, the second pressure-drop was observed and as for the distribution of the streamline around the orifice, a vortex was produced around the center. As for the velocity distribution of oil passing from the compression cylinder to the compact pipe, the velocity was greater in orifice of small diameter. Also, the greater the pressure difference was between the compression cylinder and the compact cylinder, the greater the force it was upon the piston.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.2
• /
• pp.109-117
• /
• 2007

Three-dimensional mesh models have been widely used in various applications such as simulations, animations, and e-catalogs. In such applications the normal vectors of mesh models are used mainly for shading and take up the major portion of data size and transmission time paper over networks. Therefore a variety of techniques have been developed to compress them efficiently. In this paper, we propose the MOEC (Modified Octree Encoding Compression) algorithm, which allow multi lever compression ratios for 3D mesh models. In the algorithm, a modified octree has nodes representing their own positions and supporting a depth of the tree so that the normal vectors are compressed up to levels where the shading is visually indistinguishable. This approach provides efficient in compressing normals with multi-level ratios, without additional encoding when changing in compression ratio is required.

• Proceedings of the KOSOMBE Conference
• /
• v.1992 no.11
• /
• pp.29-33
• /
• 1992

We examine the compression performance of two irreversible (lossy) compression techniques, ADCT-VQ (Adaptive Discrete Cosine Trandform - Vector Quantization) and JPEG (Joint Photographic Experts group) which are basis of medical image information systems. Under the same compression ratio, MSE(Mean Square Error) is 0.578 lower in JPEG than in ADCT-VQ while SNR(Signal to Noise Ratio) is 1.236 dB higher in JPEG than in ADCT-VQ.

• Journal of the Korean Mathematical Society
• /
• v.34 no.3
• /
• pp.633-651
• /
• 1997

For a non-degenerate symmetric bilinear form $\sigma$ on a finite dimensional vector space E, the Jordan algebra of $\sigma$-symmetric operators has a symmetric cone $\Omega_\sigma$ of positive definite operators with respect to $\sigma$. The cone $C_\sigma$ of elements (x,y) \in E \times E with \sigma(x,y) \geq 0$ gives the compression semigroup. In this work, we show that in the sutomorphism group of the tube domain over $\Omega_\sigma$, this semigroup has a UDL and Ol'shanskii decompositions and is exactly the compression semigroup of $\Omega_sigma$.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.9
• /
• pp.80-87
• /
• 1996

This paper proposes an image compression algorithm that adopts projection scheme on wavelet transform domain of image signal. Wavelet decomposed image is encoded by the result of projection along one direction out of eight which approximates the coefficients most closely to the originally transformed coefficients. These projectrion data are vector quantized using separate codebooks depending on the decomposition level and orientation of decomposed of image. Experimental results reveals that proposed scheme shows excellent performance in PSNR manner and also shows good subjective quality.