• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.1
• /
• pp.41-47
• /
• 2002

Fractal image compression can reduce the size of image data by the contractive mapping that is affine transformation to find the block(called as range block) which is the most similar to the original image. Even though fractal image compression is regarded as an efficient way to reduce the data size, it has high distortion rate and requires long encoding time. In this paper, we presented a hybrid fractal image compression system with the modified SOFM Vector Quantizer which uses improved competitive learning method. The simulation results showed that the VQ hybrid fractal using improved competitive loaming SOFM has better distortion rate than the VQ hybrid fractal using normal SOFM.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.673-676
• /
• 1998

Future land remote sensing satellite systems will kikely be constrained in terms of communication band-width. To alleviate this limitation, the data must be compressed. Image data obtained from satellite exhibit a high degree of spatial and spectral correlations that must be properly exploited. In this paper we propose multispectral image data compression using wavelet transform and selective predicted vector quantization. Th eproposed method is based on accuratly predicting other band from reference band and reducing bit rate through threshold map. we can achieve better compression effeciency than conventional methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.2
• /
• pp.48-56
• /
• 2009

We propose a fast intra mode skip decision algorithm for H.264/AVC video encoding. Although newly added MB encoding algorithms based on various prediction methods increase compression ratio, they require a significant increase in the computational complexity because we calculate rate-distortion(RD) cost for all possible MB coding modes and then choose the best one. In this paper, we propose a fast mode decision algorithm based on an adaptive motion vector map(AMVM) method for H.264/AVC video encoding to reduce the processing time for the inter frame. We verify that the proposed algorithm generates generally good performances in PSNR, bit rates, and processing time.

• Journal of Broadcast Engineering
• /
• v.27 no.1
• /
• pp.56-68
• /
• 2022

In this paper, we propose a compression method for multi-resolution feature maps for VCM. The proposed compression method removes the redundancy between the channels and resolution levels of the multi-resolution feature map through PCA-based transformation. According to each characteristic, the basis vectors and mean vector used for transformation, and the transformation coefficient obtained through the transformation are compressed using a VVC-based coder and DeepCABAC. In order to evaluate performance of the proposed method, the object detection performance was measured for the OpenImageV6 and COCO 2017 validation set, and the BD-rate of MPEG-VCM anchor and feature map compression anchor proposed in this paper was compared using bpp and mAP. As a result of the experiment, the proposed method shows a 25.71% BD-rate performance improvement compared to feature map compression anchor in OpenImageV6. Furthermore, for large objects of the COCO 2017 validation set, the BD-rate performance is improved by up to 43.72% compared to the MPEG-VCM anchor.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.6
• /
• pp.1419-1427
• /
• 2007

In this paper, we propose an algorithm which implements a multi-sided side match finite-state vector quantization(MSMVQ). After extracting the edge information from an image and classifying the image into edge blocks or non-edge blocks, we construct an edge map. We subdivide edge blocks into sixteen classes using discrete cosine transform(DCT) AC coefficients. Based on edge map information, a state codebook is made from the master codebook, and side match calculation is done for two-sided or three-sided current block of image. For reducing transmitted bits, a decision is made whether or not to encode the non-edge blocks among the pre-coded blocks by using the master codebook. Also for reducing allocation bits of codeword indices to decoder, a variable length coder is used. Considering the comparison with side match finite-state vector quantization(SMVQ) and two-sided SMVQ(TSMVQ) algorithm about Zelda, Lenna, Bridge and Peppers image, the new algorithm shows better picture quality than SMVQ and TSMVQ respectively.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.11a
• /
• pp.147-149
• /
• 2011

사용자에게 편리한 인터페이스를 제공하는 IT 기기가 널리 보급되면서 직관적인 인터페이스 기술에 대한 관심이 높아지고 있다. 이미지 센서로 입력된 사람의 손 모양이나 움직임을 이용하는 인터페이스가 그 중 하나이다. 한 편 이미지 센서 영상을 저장하기 위하여 H.264/AVC와 같은 영상 압축 기술이 사용된다. 영상을 압축하기 위해 부호기는 모든 Macroblock에서 움직임 추정을 수행한다. 추정된 움직임 정보는 손 움직임을 인식하는데 사용될 수 있고 이를 통해 전자 기기에 명령을 내리는 인터페이스 기술의 한 부분을 구현하는 것이 가능하다. 본 논문은 H.264/AVC 부호기의 Motion Vector를 이용하는 손 추적 알고리즘을 제시한다. 제시된 알고리즘은 손 움직임 추적의 정확도를 향상시키기 위하여 Motion Vector보다 신뢰도가 높은 Motion Density Map 정보를 사용한다. 이 정보를 이용하여 이동한 손을 포함하는 손 윈도우를 결정한다. 실험 결과를 통하여 제시된 알고리즘이 손의 움직임을 추적하는 것을 확인할 수 있다.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.8
• /
• pp.3295-3311
• /
• 2020

With the wide application of hyperspectral images, it becomes more and more important to compress hyperspectral images. Conventional recursive least squares (CRLS) algorithm has great potentiality in lossless compression for hyperspectral images. The prediction accuracy of CRLS is closely related to the correlations between the reference bands and the current band, and the similarity between pixels in prediction context. According to this characteristic, we present an improved CRLS with adaptive band selection and adaptive predictor selection (CRLS-ABS-APS). Firstly, a spectral vector correlation coefficient-based k-means clustering algorithm is employed to generate clustering map. Afterwards, an adaptive band selection strategy based on inter-spectral correlation coefficient is adopted to select the reference bands for each band. Then, an adaptive predictor selection strategy based on clustering map is adopted to select the optimal CRLS predictor for each pixel. In addition, a double snake scan mode is used to further improve the similarity of prediction context, and a recursive average estimation method is used to accelerate the local average calculation. Finally, the prediction residuals are entropy encoded by arithmetic encoder. Experiments on the Airborne Visible Infrared Imaging Spectrometer (AVIRIS) 2006 data set show that the CRLS-ABS-APS achieves average bit rates of 3.28 bpp, 5.55 bpp and 2.39 bpp on the three subsets, respectively. The results indicate that the CRLS-ABS-APS effectively improves the compression effect with lower computation complexity, and outperforms to the current state-of-the-art methods.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.3
• /
• pp.184-193
• /
• 2010

This paper proposes a biological iridescence BRDF(Bidirectional Reflectance Distribution Function) compression and rendering method. In the graphics technology, iridescence sometimes is named structure colors. The main features of these symptoms are shown transform of color and brightness by varying viewpoint. Graphics technology to render this is the BRDF technology. The BRDF methods enable realistic representation of varying view direction, but it requires a lot of computing power because of large data. In this paper, we obtain reflection map from iridescence BRDF, analyze color of reflection map and propose representation method by several colorfully concentric circle. The one concentric circle represents beam width of reflection ray by one normal vector. In this paper, we synthesize rough concentric by using several virtually optical normal vectors. And we obtain spectrum information from concentric circles passing through the center point. The proposed method enables IBR(image based rendering) technique which results is realistic illuminance and spectrum distribution by one texture from reduced BRDF data within spectrum.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.11
• /
• pp.2375-2380
• /
• 1997

The need for developing effective coding techniques for various multimedia services is increasing in order to meet the demand for image data. In this paper, a zeroblock coding algorithm is proposed for progressive transmission of images. The zeroblock coding algorithm is constructed as an embedded coding so that the encoding and decoding process can be terminated at any point and allowing reasonable image quality. Some features of zeroblock coding algorithm are 1) coding of subband images by prediction of the insignificance of blocks across subband leels, 2) aset of sate transition rules for representing the significance map of blocks, and 3) block coding by vector quantization using a multiband codebook consisting of several subcodebooks dedicated for each subband at a given threshold.