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

In this paper, we propose a new post-processing method which can solve a problem of MSDS(Mean Squared Difference of Slope) method. Using that method the blocking artifacts can significantly be reduced without any restriction, which is a major drawback of block-based DCT compression method. In this approach, the OSLD(Overlapped Sub-Laplacian Distribution) of dequantized block boundary pixel difference values is defined and used to categorize each block of an image into one of four types. Those types are also classified into one of two classes: an edge and a non-edge classes. A slope across the block boundary is used to quantify discontinuity of the image. If an absolute estimated quantization error value of a DCT coefficient is greater than the corresponding quantization step size, it is saturated to the step size in the edge class. The proposed post-processing method can improve not only the PSNR value up to 0.1~O.3 dB but visual quality without any constraints determined by ad-hoc manner.

• Journal of Broadcast Engineering
• /
• v.9 no.4 s.25
• /
• pp.446-454
• /
• 2004

With the growth of multimedia systems, compressing image data has become more important in the area of multimedia services. Since a compressed image bitstream can often be seriously distorted by various types of channel noise, an error concealment algorithm becomes a very important issue. In order to solve this problem, Hsia proposed the error concealment algorithm where he recovered lost block data using 1D boundary matching vectors. His algorithm, however, requires high computational complexity since each matching vector needs MAD (Mean Absolute Difference) values of all pixels, which is either a boundary line top or a boundary line bottom of a damaged block. We propose a hierarchical search-based fast error concealment scheme as well as its approximated version to reduce computational time. In the proposed scheme, a hierarchical search is applied to reduce the number of checking points for searching a vector. The error concealment schemes proposed in this paper can be about 3 times faster than Hsia's with keeping visual quality and PSNR.

• Journal of Broadcast Engineering
• /
• v.5 no.2
• /
• pp.290-299
• /
• 2000

In this paper, we introduce a watermarking technique using a block-based wavelet transform. Our objective is to achieve the invisibility of the watermark embedded into an image. That is, the difference between the original image and the watermarked image is perceptually invisible. Also, we propose a scheme that is robust to common Image processing by embedding the watermark into ail frequencies. Especially, we certified that the proposed watermarking algorithm was robust to JPEG compression and noise. In addition, our detection scheme can detect the manipulated area for the purpose of authentication. From the experimental results, we conclude that the proposed watermarking system satisfied the objectives proposed in this paper.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.9
• /
• pp.1-6
• /
• 2019

One method for image recognition is template matching. In conventional template matching, the block matching algorithm (BMA) is performed while changing the two-dimensional translational displacement of the template within a given matching image. The template size and shape do not change during the BMA. Since only two-dimensional translational displacement is considered, the success rate decreases if the size and direction of the object do not match in the template and the matching image. In this paper, a variable is added to adjust the two-dimensional direction and size of the template, and the optimal value of the variable is automatically calculated in the block corresponding to each two-dimensional translational displacement. Using the calculated optimal value, the template is automatically transformed into an optimal template for each block. The matching error value of each block is then calculated based on the automatically deformed template. Therefore, a more stable result can be obtained for the difference in direction and size. For ease of use, this study focuses on designing the algorithm in a closed form that does not require additional information beyond the template image, such as distance information.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.62-76
• /
• 1994

In this paper, a segmentation-based coding technique as applied to video sequences is proposed. A proposed method separates an image into contour and texture parts, then the visually-sensitive contour part is represented by chain codes and the visually-insensitive texture part is reconstructed by a representative motion vector of a region and mean of the segmented frame difference. It uses a change detector to find moving areas and adopts variable blocks to represent different motions correctly. For better quality of reconstructed images, the displaced frame difference between the original image and the motion compensated image reconstructed by the representative motion vector is segmented. Computer simulation with several video sequences shows that the proposed method gives better performance than the conventional ones in terms of the peak signal to noise ratio(PSNR) and compression ration.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.2
• /
• pp.268-274
• /
• 2010

A steganographic method using three directional data embedding for gray images is presented in this paper. Cover image is divided into non-overlapping $2\times2$ sub-blocks and the basis pixel is selected to calculate the three different values of each sub-block. Difference values are replaced by embedding the number of secret bits that is referenced by the range table. For the three pixel pairs in the sub-block, the optimal pixel adjustment is preceded to reduce the distortion of visual quality. The experimental results show that the proposed method achieves a good visual quality and high capacity.

• Journal of Korea Multimedia Society
• /
• v.16 no.11
• /
• pp.1250-1260
• /
• 2013

The contrast enhancement techniques based on Laplacian pyramid image fusion have a benefit that they can faithfully describe the image information because they combine the multiple resource images by selecting the desired pixel in each image. However, they also have some problem that the output image may contain noise, because the methods evaluate the visual information on the basis of each pixel. In this paper, an improved contrast enhancement method, which effectively suppresses the noise, using image fusion is proposed. The proposed method combines the resource images by making Laplacian pyramids generated from weight maps, which are produced by measuring the difference between the block-based local well exposedness and local homogeneity for each resource image. We showed the proposed method could produce less noisy images compared to the conventional techniques in the test for various images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1484-1489
• /
• 2004

Given a video frame in terms of its 8${\times}$8 block-DCT coefncients, we wish to obtain a downsized or upsized version of this Dame also in terms of 8${\times}$8 block DCT coefficients. The DCT being a linear unitary transform is distributive over matrix multiplication. This fact has been used for downsampling video frames in the DCT domains in Dugad's, Mukherjee's, and Park's methods. The downsampling and upsampling schemes combined together preserve all the low-frequency DCT coefficients of the original image. This implies tremendous savings for coding the difference between the original frame (unsampled image) and its prediction (the upsampled image).This is desirable for many applications based on scalable encoding of video. In this paper, we extend the earlier works to various DCT sizes, when we downsample and then upsample of an image by a factor of two. Through experiment, we could improve the PSM values whenever we increase the DCT block size. However, because the complexity will be also increase, we can say there is a tradeoff. The experiment result would provide important data for developing fast algorithms of compressed-domain image/video resizing.

• Korean Journal of Remote Sensing
• /
• v.32 no.5
• /
• pp.471-482
• /
• 2016

This paper presents an extraction method for water body which uses block-based image partitioning and extension of water body boundaries to improve the performance of supervised classification for water body extraction. The Mahalanobis distance image is created by computing the spectral information of Normalized Difference Water Index (NDWI) and Near Infrared (NIR) band images over a training site within the water body in order to extract an initial water body area. To reduce the effect of noise contained in the Mahalanobis distance image, we apply mean curvature diffusion to the image, which controls diffusion coefficients based on connectivity strength between adjacent pixels and then extract the initial water body area. After partitioning the extracted water body image into the non-overlapping blocks of same size, we update the water body area using the information of water body belonging to water body boundaries. The update is performed repeatedly under the condition that the statistical distance between water body area belonging to water body boundaries and the training site is not greater than a threshold value. The accuracy assessment of the proposed algorithm was tested using KOMPSAT-2 images for the various block sizes between $11{\times}11$ and $19{\times}19$. The overall accuracy and Kappa coefficient of the algorithm varied from 99.47% to 99.53% and from 95.07% to 95.80%, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1487-1504
• /
• 1997

In this paper, the two-stage variable block-size multiresolution motion algorithm is proposed for an interframe coding scheme in the wavelet decomposition. An optimal bit allocagion between motion vectors and the prediction error in sense of minimizing the total bit rate is obtained by the proposed algorithm. The proposed algorithm consists of two stages for motion estimatation and only the first stage can be separated and run on its own. The first stage of the algorithm introduces a new method to give the lower bit rate of the displaced frame difference as well as a smooth motion field. In the second stage of the algorithm, the technique is introduced to have more accurate motion vectors in detailed areas, and to decrease the number of motion vectors in uniform areas. The algorithm aims at minimizin gthe total bit rate which is sum of the motion vectors and the displaced frame difference. The optimal bit allocation between motion vectors and displaced frame difference is accomplished by reducing the number of motion vectors in uniform areas and it is based on a botom-up construction of a quadtree. An entropy criterion aims at the control of merge operation. Simulation resuls show that the algorithm lends itself to the wavelet based image sequence coding and outperforms the conventional scheme by up to the maximum 0.28 bpp.