• Journal of Information Processing Systems
• /
• v.13 no.1
• /
• pp.114-127
• /
• 2017

This paper proposes a color image coding algorithm based on shape-adaptive all phase biorthogonal transform (SA-APBT). This algorithm is implemented through four procedures: color space conversion, image segmentation, shape coding, and texture coding. Region-of-interest (ROI) and background area are obtained by image segmentation. Shape coding uses chain code. The texture coding of the ROI is prior to the background area. SA-APBT and uniform quantization are adopted in texture coding. Compared with the color image coding algorithm based on shape-adaptive discrete cosine transform (SA-DCT) at the same bit rates, experimental results on test color images reveal that the objective quality and subjective effects of the reconstructed images using the proposed algorithm are better, especially at low bit rates. Moreover, the complexity of the proposed algorithm is reduced because of uniform quantization.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.5
• /
• pp.417-425
• /
• 2003

H.264, which is the latest video coding standard of both ITU-T(International Telecommunication Union-Telecommunication standardization sector) and MPEG(Moving Picture Experts Group), adopts new video coding tools such as variable block size motion estimation, multiple reference frames, quarter-pel motion estimation/compensation(ME/MC), 4${\times}$4 Integer DCT(Discrete Cosine Transform), and Rate-Distortion Optimization, etc. These new video coding tools provide good coding of efficiency compared with existing video coding standards as H.263, MPEG-4, etc. However, these new coding tools require the increase of encoder complexity. Therefore, in order to apply H.264 to many real applications, fast algorithms are required for H.264 coding tools. In this paper, when encoder MacroBlock(MB) mode is decided by rate-distortion optimization tool, fast mode decision algorithm by skipping variable block size ME/MC and spatial-predictive coding, which occupies most encoder complexity, is proposed. In terms of computational complexity, the proposed method runs about 4 times as far as JM(Joint Model) 42 encoder of H.264, while the PSNR(peak signal-to-noise ratio)s of the decoded images are maintained.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.4
• /
• pp.31-43
• /
• 1999

The main goal of this paper is to design a high performance SVP(Stack based Video Processor) for network applications. The SVP is a comprehensive scheme; 'better' in the sense that it is an optimal selection of previously proposed enhancements of a stack machine and a video processor. This can process effectively object-based video data using a S-RISC(Stack-based Reduced Instruction Set Computer) with a semi -general-purpose architecture having a stack buffer for OOP(Object-Oriented Programming) with many small procedures at running programs. And it includes a vector processor that can improve the MPEG coding speed. The vector processor in the SVP can execute advanced mode motion compensation, motion prediction by half pixel and SA-DCT(Shape Adaptive-Discrete Cosine Transform) of MPEG-4. Absolutors and halfers in the vector processor make this architecture extensive to a encoder. We also designed a VLSI stack-oriented video processor using the proposed architecture of stack-oriented video decoding. It was designed with O.5$\mu\textrm{m}$ 3LM standard-cell technology, and has 110K logic gates and 12 Kbits SRAM internal buffer. The operating frequency is 50MHz. This executes algorithms of video decoding for QCIF 15fps(frame per second), maximum rate of VLBV(Very Low Bitrate Video) in MPEG-4.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1296-1302
• /
• 2009

We propose an efficient coding method of digital holograms using MCTF and standard compression tools for video. The hologram is generated by a computer-generated hologram (CGH) algorithm with both an object image and its depth information. The proposed coding consists of localization by segmenting a hologram, frequency transform using $64\times64$ segment size, 2-D discrete cosine transform DCT for extracting redundancy, motion compensated temporal filtering (MCTF), segment scanning the segmented hologram to form a video sequence, and video coding, which uses H.264/AVC. The proposed algorithm illustrates that it has better properties for reconstruction, 10% higher compression rate than previous research in case of object.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1A
• /
• pp.89-97
• /
• 2002

This paper proposes the adaptive digital watermarking method for the ownership protection of images. The watermarks are inserted to a selected area rather than a whole area. The proposed method reduces the distortion caused by the watermarking process. To select the regions, roughness of the image should be considered because the watermarks in the smooth regions are easily detected through the human eyes. To find the rough regions, Discrete Cosine Transform (DCT) method is used. Generally, the high frequency regions of images are lost by the compression process such as JPEG. So, the watermarks are inserted to the low frequency regions of a selected area by using the proposed method. The proposed method reduce the image loss or distortion brought by the image processing, such as compression, filtering, scaling, addition of noise, cropping, and wavelet transform.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1391-1406
• /
• 2020

A zero-watermarking algorithm in transform domain based on RGB channel and voting strategy is proposed. The registration and identification of ownership have achieved copyright protection for color images. In the ownership registration, discrete wavelet transform (DWT), discrete cosine transform (DCT), and singular value decomposition (SVD) are used comprehensively because they have the characteristics of multi-resolution, energy concentration and stability, which is conducive to improving the robustness of the proposed algorithm. In order to take full advantage of the characteristics of the image, we use three channels of R, G, and B of a color image to construct three master shares, instead of using data from only one channel. Then, in order to improve security, the master share is superimposed with the copyright watermark encrypted by the owner's key to generate an ownership share. When the ownership is authenticated, copyright watermarks are extracted from the three channels of the disputed image. Then using voting decisions, the final copyright information is determined by comparing the extracted three watermarks bit by bit. Experimental results show that the proposed zero watermarking scheme is robust to conventional attacks such as JPEG compression, noise addition, filtering and tampering, and has higher stability in various common color images.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.880-894
• /
• 1997

In this paper,we propose a new algorithm to perform DCT(Discrete Cosine Transform) withn the area reduced by prdeicting position of quantization coefficients to be zero.This proposed algorithm not only decreases the enoding time and the decoding time by reducing computation amount of FDCT(Forward DCT)and IDCT(Inverse DCT) but also increases comprossion ratio by performing each diffirent horizontal- vereical zig-zag scan assording to the calssified block size for each block on the huffiman coeing.Traditional image coding method performs the samd DCT computation and zig-zag scan over all blocks,however this proposed algorthm reduces FDCT computation time by setting to zero insted of computing DCT for quantization codfficients outside classfified block size on the encoding.Also,the algorithm reduces IDCT computation the by performing IDCT for only dequantization coefficients within calssified block size on the decoding.In addition, the algorithm reduces Run-Length by carrying out horizontal-vertical zig-zag scan approriate to the slassified block chraateristics,thus providing the improverment of the compression ratio,On the on ther hand,this proposed algorithm can be applied to 16*16 block processing in which the compression ratio and the image resolution are optimal but the encoding time and the decoding time take long.Also,the algorithm can be extended to motion image coding requirng real time processing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1558-1566
• /
• 1999

While high resolution images are required for various applications, aliased low-resolution images are only available due to the physical limitations of sensors. In this paper, we propose an algorithm to reconstruct a high resolution image from multiple aliased low-resolution images, which is based on the generalized multichannel deconvolution technique. The conventional approaches are based on the discrete Fourier transform (DFT) since the aliasing effect is easily analyzed in the frequency domain. However, the useful solution may not be available in many cases, i.e., the underdetermined cases or the insufficient subpixel information cases. In order to compensate for such ill-posedness, the generalized multichannel regularization was adopted in the spatial domain. Furthermore, the usage of the discrete cosine transform instead of the DFT leads to the computationally efficient reconstruction algorithm. The validity of the proposed algorithm is both theoretically and experimentally demonstrated in this paper. It is also shown that the effect of inaccurate motion information is reduced by regularization.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.2
• /
• pp.104-111
• /
• 2010

This paper presents an adaptive image enhancement method using the spatial frequency property in the DCT(discrete cosine transform) compressed domain. The dc coefficients, the illumination components of image, are adjusted to compress the dynamic range of image, and the ac coefficients are modified to enhance the contrast by using the human visual system(HVS) and the spatial frequency property. The ac coefficients are separated into vertical direction, horizontal direction, and mixed spatial frequency components, and adaptively modified to minimize the block artifacts that possibly occur in the image enhancement. The proposed method using dynamic range compression and adaptive contrast enhancement shows the advanced performance without the block artifact compared with existing method.

• Journal of Broadcast Engineering
• /
• v.5 no.2
• /
• pp.239-246
• /
• 2000

An efficient control parameter extraction scheme required for auto-focusing control of a stereo camera is proposed. Without loss of generality, it is assumed that an interesting object exists in the center of a captured image by a stereo camera. In such a case. we apply a 2-dimensional wavelet transform to the center area with specific image size in the captured image. Next, we extract required focus control parameters using an Ll-norm for doubly high-pass filtered components. Experimental results show that the proposed scheme is effectively applicable to the auto-focusing for a stereo camera compared to the conventional control scheme using discrete cosine transform (DCT).