• ETRI Journal
• /
• v.37 no.4
• /
• pp.743-751
• /
• 2015

Cloud gaming services are heavily dependent on the efficiency of real-time video streaming technology owing to the limited bandwidths of wire or wireless networks through which consecutive frame images are delivered to gamers. Video compression algorithms typically take advantage of similarities among video frame images or in a single video frame image. This paper presents a method for computing and extracting both graphics information and an object's boundary from consecutive frame images of a game application. The method will allow video compression algorithms to determine the positions and sizes of similar image blocks, which in turn, will help achieve better video compression ratios. The proposed method can be easily implemented using function call interception, a programmable graphics pipeline, and off-screen rendering. It is implemented using the most widely used Direct3D API and applied to a well-known sample application to verify its feasibility and analyze its performance. The proposed method computes various kinds of graphics information with minimal overhead.

• Proceedings of the Society of Korea Industrial and System Engineering Conference
• /
• 2002.05a
• /
• pp.455-460
• /
• 2002

As the transmission of 3D shape models through Internet becomes more important, the compression issue of shape models gets more critical. The issues for normal vectors have not yet been explored as much as it deserves, even though the size of the data for normal vectors can be significantly larger than its counterparts of topology and geometry. Presented in this paper is an approach to compress the normal vectors of a shape model represented in a mesh using the concept of clustering. It turns out that the proposed approach has a significant compression ratio without a serious sacrifice of the visual quality of the model.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.36-42
• /
• 1997

This paper presents a new design technique for performing high quality low bit rate image compression. A hybrid coder(HC) which combines Mean Removed Important Coefficient Selection based JPEG(MR-ICS-JPEG) and Adaptive Vector Quantization (AVQ) is proposed. A new quantization table is developed using the Important Coefficient Selection(ICS) method; the importance of each coefficient is determined using the orthonormal property of the DCT. This quantization table is applied to standard JPEG with mean removal(MR) strategy before processing. This scheme, called MR-ICS-JPEG, produces more than 2 dB enhanced performance in terms of PSNR over standard JPEG. A set of homogeneous codebooks is generated by homogeneous training vectors. Before compression, an image is uniformly divided into 8${\times}$8 blocks. Low detail regions such as backgrounds are roughly coded by AVQ while high detail regions such as edges or curves are finely coded by the proposed MR-ICS-JPEG. This hybrid coder procuces consistently about 3 dB improved performance in terms of PSNR over standard JPEG.

• Journal of Broadcast Engineering
• /
• v.17 no.2
• /
• pp.252-261
• /
• 2012

This papers proposes a motion vector coding method which selects the optimal predictive motion vector after excluding some candidate predictive motion vectors in the minimum rate-distortion sense, and prunes the candidate predictive motion vectors by a contradiction testing that operates under a predefined criterion at both encoder and decoder for reducing the signaling information. Experimental results show that the proposed method gains in BDBR by up to 1.8% compared to the H.264/AVC.

• Proceedings of the KIEE Conference
• /
• 1996.11a
• /
• pp.404-406
• /
• 1996

The objective of this paper is to present a new feature-vector extraction method for the automatic detection and classification of power quality(PQ) disturbances, where FFT, DWT(Discrete Wavelet Transform), and data compression are utilized to extract an appropriate feature vector. In particular, the proposed classifier consists of three parts: i.e., (i) automatic detection of PQ disturbances, where the wavelet transform and signal power estimation method are utilized to detect each disturbance, (ii) feature vector extraction from the detected disturbance, and (iii) automatic classification, where Multi-Layer Perceptron(MLP) is used to classify each disturbance from the corresponding extracted feature vector. To demonstrate the performance and applicability of the proposed classification algorithm, some test results obtained by analyzing 7-class power quality disturbances generated by the EMTP are also provided.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.411-418
• /
• 2009

Vector quantization algorithm based on fuzzy clustering has been widely used in the field of data compression since the use of fuzzy clustering analysis in the early stages of a vector quantization process can make this process less sensitive to its initialization. However, the process of fuzzy clustering is computationally very intensive because of its complex framework for the quantitative formulation of the uncertainty involved in the training vector space. To overcome the computational burden of the process, this paper introduces an array architecture for the implementation of fuzzy vector quantization (FVQ). The arrayarchitecture, which consists of 4,096 processing elements (PEs), provides a computationally efficient solution by employing an effective vector assignment strategy during the clustering process. Experimental results indicatethat the proposed parallel implementation providessignificantly greater performance and efficiency than appropriately scaled alternative array systems. In addition, the proposed parallel implementation provides 1000x greater performance and 100x higher energy efficiency than other implementations using today's ARMand TI DSP processors in the same 130nm technology. These results demonstrate that the proposed parallel implementation shows the potential for improved performance and energy efficiency.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2254-2263
• /
• 2000

This paper proposes an efficient predictive image-compression technique based on vector quantization of blocks of pels. In the proposed method edge contents of blocks control the selection of predictors and block shapes as well. The maximum number of bits assigned to quantizers has been in creased to 3bits/pel from 1/5bits/pel, the setting employed by forerunners in predictive vector quantization of images. This increase prevents the saturation in SNR observed in their results in high bit rates. The variable block shape is instrumental in eh reconstruction of edges. The adaptive procedure is controlled by means of he standard deviation ofp rediction errors generated by a default predictor; the standard deviation address a decision table which can be set up beforehand. eh proposed method is characterized by overall improvements in image quality over A-VQ-PE and A-DCT VQ, both of which are known for their efficient use of vector quantizers.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.8
• /
• pp.1227-1237
• /
• 1989

In this paper, we propose a lossless progressive image transmission scheme using hierarchical pyramid structure and classified vector quantizer in DCT domain. By adopting DCT to the hierarchical pyramid signals, we can reduce the spatial redundance. Moreover, the DCT coefficients can be encoded efficiently by using classified vector quantizer in DCT domain. The classifier is simply based on the variance of a subblock. Also, the mirror set of training set of images can improve the robustness of codebooks. Progressive image transmission can be achieved through following processes: from top to bottom level of planes in a pyramid, and from high to low AC variance class in a plane. Some simulation results with real images show that the proposed coding scheme yields a good performance at below 0.3 bpp and an excellent result at 0.409 bpp. The proposed coding scheme is well suited for lossless progressive image transmission as well as image data compression.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.7-11
• /
• 2007

In this paper the one of image hide method for good compression ratio and satisfactory image quality of the cover image and the embedding image based on the singular value decomposition and the vector quantization using fuzzy c-mean clustering is introduced. Experimental result shows that the embedding image has invisibility and robustness to various serious attacks.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.1
• /
• pp.41-46
• /
• 2008

With widespread use of the Internet and improvements in streaming media and compression technology, digital music, video, and image can be distributed instantaneously across the Internet to end-users. However, most conventional Digital Right Management are often not secure and fast enough to process the vast amount of data generated by the multimedia applications to meet the real-time constraints. In this paper, we propose the copyright protection using encryption of DCT coefficients and motion vector in MPEG-4 video codec of mobile device. This paper presents a new Digital Rights Management that modifies the Motion Vector of Macroblock for mobile device. Experimental results indicate that the proposed DRM can not only achieve very low cost of the encryption but also enable separable authentication to individual mobile devices such as Portable Multimedia Player and Personal Digital Assistants. The performance of the proposed methods have low complexity and low increase of bit rate in overhead.