• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.1
• /
• pp.20-26
• /
• 2013

Image noise reduction in the frequency domain by thresholding is simple, but quite effective. Wavelet domain thresholding has been an active area of research but relatively little work has been published on DCT domain denoising. A novel method for determining the hard threshold for the DCT domain denoising is proposed. The low amplitude DCT coefficients are discarded until the cumulative sum of the discarded signal energy is comparable to that of noise in each DCT block. Cycle spinning is also applied to reduce block artifacts. The proposed method is quite effective and simple enough to be used in portable devices.

• Journal of Korea Multimedia Society
• /
• v.8 no.8
• /
• pp.1069-1079
• /
• 2005

Though there have been many methods to detect features in spatial domain, in the case of a compressed image it has to be decoded, processed and encoded again. Alternatively, we can manipulate a compressed image directly in the Discrete Cosine Transform (DCT) domain that has been used for compressing videos or images in the standards like MPEG and JPEG. In our previous work we proposed a model-based discontinuity evaluation technique in the DCT domain that had problems in the rotated or non-ideal discontinuities. In this paper, we propose a fuzzy filtering technique that consists of height fuzzification, direction fuzzification, and forty filtering of discontinuities. The enhancement achieved by the fuzzy tittering includes the linking, thinning, and smoothing of discontinuities in the DCT domain. Although the detected discontinuities are rough in a low-resolution image for the size (8${\times}$8 pixels) of the DCT block, experimental results show that this technique is fast and stable to enhance the qualify of discontinuities.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.4
• /
• pp.683-688
• /
• 2010

The ability to navigate autonomously in off-road terrain is the most critical technology needed for Unmanned Ground Vehicles(UGV). In this paper, we present a method for vision-based terrain cover classification using DCT features. To classify the terrain, we acquire image from a CCD sensor, then the image is divided into fixed size of blocks. And each block transformed into DCT image then extracts features which reflect frequency band characteristics. Neural network classifier is used to classify the features. The proposed method is validated and verified through many experiments and we compare it with wavelet feature based method. The results show that the proposed method is more efficiently classify the terrain-cover than wavelet feature based one.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1329-1336
• /
• 1996

In many image compression applications, the discrete cosine transform (DCY) is well known for is highly efficient coding performance. However, it produces undesirable block artifacts in low-bit rate coding. In addition, in many practical applications, faster computation and easier VLST implementation of DCT coefficients are also important issues. The removal of the block artifacts and faster DCT computation are therefor of practical interest. In this paper, a modified DCTcomputation scheme was investigated, which provides a simple efficient solution to the reduction of the block artifacts while achieving faster computation. We have applied the new ap-proach to the low-bit rate coding and decoding of images. Simulation results on real images have verified the improved performance of the proposed method over the standar d method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1860-1868
• /
• 1998

A simple postprocessing algorithm is proposed to reduce the blocky artifacts of Block Discrete Cosine Transform (BDCT) coded images. Since the block noise is mostly antisymmetric relative to the block boundaries, we model the blocky noise as one-dimensional antisymmertric functions made by superposing DCT basis functions. observing the frequency characteristics of the noies model, we approximate its high frequency components as those of step functions. Then the proposed postprocessing algorithm eliminates the carefully selected high frequency components of step functions in the one-dimensional sN-point DCT domain, when the encoding block size is $N\;{\times}\;N$. It is shown that the proposed algorithm can also be performed in the spatial domain without computational burden of transforms. The experimental results show that the proposed algorithm well reduces the blocky artifacts in both subjective and objectie viewpoints.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.3
• /
• pp.23-32
• /
• 2007

The H.264/AVC video coding standard uses rate distortion optimization (RDO) method to improve the compression performance in the intra prediction. The complexity and computational load are increased more than previous standard by using this method, even though this standard selects the best coding mode for the current macroblock. This paper proposes a fast intra mode decision algorithm for H.264/AVC encoder based on dominant edge direction (DED). To apply the idea, this algorithm uses the approximation of discrete cosine transform (DCT) coefficient. By detecting the DED, 3 modes instead of 9 modes are chosen for RDO calculation to decide the best mode in the $4{\times}4$ luma block. As for the $16{\times}16$ luma and $8{\times}8$ chroma block, instead of 4 modes, only 2 modes are searched. Experimental results show that the computation time of the proposed algorithm is decreased to about 72% of the full search method with negligible quality loss.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1228-1231
• /
• 2002

Digital image watermarking scheme using adaptive block division is proposed. To increase the perceptual invisibility, the image is divided into blocks by local properties and the human visual system (HVS), then the significant blocks are selected in the divided blocks. The significant coefficient is determined by Weber's law in these blocks. To increase the robustness, low frequency domains of the discrete cosine transform (DCT) and the discrete wavelet transform (DWT) are used. The watermark is embedded into the selected significant blocks of the DCT's and DWT's low frequency domains with adaptive watermark strengths. The watermark strength is determined by the variance and the local properties of the significant block. The experimental results prove that the proposed scheme has a good robustness against several image processing operations (e.g. median filtering, cropping, scaling, JPEG, JPEG2000, etc.) without significant degradation of the watermarked image.

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

• 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 Korea Multimedia Society
• /
• v.4 no.5
• /
• pp.423-429
• /
• 2001

In this paper, we propose the improved method for retrieving images with DC element of DCT that is used in image compression such as JPEG/MPEG. The existing method retrieves images with DC of fixed block size DCT. In this method, the increase in the block size results in faster retrieving speed, but it lessens the accuracy. The decrease in the block size improves the accuracy, however, it degrades the retrieving speed. In order to solve this problem, the proposed method utilizes the variable block size DCT. This method first determines the existence of object regions within each block, and then creates an image region table. Based on this table, it determines the size of each block, following a simple rule; decrease the block size in the object regions, and increase the block size in the background regions. The proposed method using variable block size DCT improves about 15% in terms of the accuracy. Additionally, when there rarely exist images of same pattern, it is able to retrieve faster only by comparing the image region patterns.