• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.1
• /
• pp.1-8
• /
• 2010

Noise removal methods for noisy images have been studied a lot in the domain of spatial and transform filtering. Low pass filtering was initially applied in the spatial domain. Recently, discrete wavelet transform has widely used for image denoising as well as image compression due to an excellent energy compaction and a property of multiresolution. In this paper, Gabor cosine and sine transform which is considered as human visual filter is applied to image denoising areas using soft thresholding technique. GCST is compared with excellent wavelet transform which uses existing soft thresholding methods from PSNR point of view. Resultant images removed noises are also visually compared. Experimental results with adding four different standard deviation levels of Gaussian distributed noises to real images show that the proposed transform has better PSNR performance of a maximum of 1.18 dB and visible perception than wavelet transform.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3C
• /
• pp.387-397
• /
• 2004

The wavelet transform providing both of the frequency and spatial information of an image is proved to be very much effective for the compression of images, and recently lot of studies on coding algorithms for images decomposed by the wavelet transform together with the multi-resolution theory are going on. This paper proposes a quadtree decomposition method of image compression applied to the images decomposed by wavelet transform by using the correlations between pixels and '0'data grouping. Since the coefficients obtained by the wavelet transform have high correlations between scales and high concentrations, the quadtree method can reduce the data quantity effectively. the experimental infrared image with 256${\times}$256 size and 8〔bit〕, was used to compare the performances of the existing and the proposed compression methods.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2005.05a
• /
• pp.342-348
• /
• 2005

This study was carried out fusion-welded butt joints in SWS 490A high strength steel subjected to tensile test that load-deflection curve. The windowed or short-time Fourier transform (WFT or SIFT) makes possible for the analysis of non-stationary or transient signals into a joint time-frequency domain and the wavelet transform (WT) is used to decompose the acoustic emission (AE) signal into various discrete series of sequences over different frequency bands. In this paper, for acoustic emission signal analysis to use a continuous wavelet transform, in which the Gabor wavelet base on a Gaussian window function is applied to the time-frequency domain. A wavelet transform is demonstrated and the plots are very powerful in the recognition of the acoustic emission features. As a result, the technique of acoustic emission is ideally suited to study variables which control time and stress dependent fracture or damage process in metallic materials.

• Journal of IKEEE
• /
• v.17 no.2
• /
• pp.119-128
• /
• 2013

This paper proposes and implements an core transform architecture, which is one of the major processes in HEVC video compression standard. The proposed core transform architecture is implemented with only adders and shifters instead of area-consuming multipliers. Shifters in the proposed core transform architecture are implemented in wires and multiplexers, which significantly reduces chip area. Also, it can process from $4{\times}4$ to $16{\times}16$ blocks with common hardware by reusing processing elements. Designed core transform architecture in 0.13um technology can process a $16{\times}16$ block with 2-D transform in 130 cycles, and its gate count is 101,015 gates.

• Economic and Environmental Geology
• /
• v.28 no.5
• /
• pp.527-533
• /
• 1995

A disadvantage of Fourier analysis is that frequency information can only be extracted for the complete duration of a signal f(t). Since the Fourier transform integral extends over all time, from $-{\infty}$ to $+{\infty}$), the information it provides arises from an average over the whole length of the signal. If there is a local oscillation representing a particular feature, this will contribute to the calculated Fourier transform $F({\omega})$, but its location on the time axis will be lost There is no way of knowing whether the value of $F({\omega})$ at a particular ${\omega}$ derives from frequencies present throughout the life of f(t) or during just one or a few selected periods. This disadvantage is overcome in wavelet analysis which provides an alternative way of breaking a signal down into its constituent parts. The main advantage of the wavelet transform over the conventional Fourier transform is that it can not only provide the combined temporal and spectral features of the signal, but can also localize the target information in the time-frequency domain simultaneously. The wavelet transform distinguishes itself from Short Time Fourier Transform for time-frequency analysis in that it has a zoom-in and zoom-out capability.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.14 no.2
• /
• pp.49-59
• /
• 2018

Encryption of digital images has been requested various fields. In the meantime, many algorithms based on a text - based encryption algorithm have been proposed. In this paper, we propose a method of encryption in wavelet transform domain to utilize the characteristics of digital image. In particular, wavelet transform is used to reduce the association between the encrypted image and the original image. Wavelet packet transformations can be decomposed into more subband images than wavelet transform, and various position permutation, numerical transformation, and visual transformation are performed on the coefficients of this subband image. As a result, this paper proposes a method that satisfies the characteristics of high encryption strength than the conventional wavelet transform and reversibility. This method also satisfies the lossless symmetric key encryption and decryption algorithm. The performance of the proposed method is confirmed by visual and quantitative. Experimental results show that the visually encrypted image is seen as a completely different signal from the original image. We also confirmed that the proposed method shows lower values of cross correlation than conventional wavelet transform. And PSNR has a sufficiently high value in terms of decoding performance of the proposed method. In this paper, we also proposed that the degree of correlation of the encrypted image can be controlled by adjusting the number of wavelet transform steps according to the characteristics of the image.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.327-334
• /
• 2016

In this paper, we propose a hardware architecture of transform and quantization for high-perfornamce HEVC(High Efficiency VIdeo Coding) encoder. HEVC transform decides the transform mode by comparing RDCost to search for the best mode of them. But, RDCost is computed using the bit-rate and distortion which is computed by transform, quantization, de-quantization, and inverse transform. Due to the many calculations and encoding time, it is hard to process high resolution and high definition image in real-time. This paper proposes the method of transform mode decision by comparing sum of coefficient after transform only. We use BD-PSNR and BD-Bitrate which is performance indicator. Based on the experimental result, We confirmed that the decision of transform mode can process images with no significant change in the image quality. We reduced hardware area by assigning different values at the same output according to the transform mode and overlapping coefficient multiplied as much as possible. Also, we raise performance by implementing sequential pipeline operation. In view of the larger process that we used compared with the process of reference paper, Our design has reduced by half the hardware area and has increased performance 2.3 times.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.3
• /
• pp.80-92
• /
• 2008

Many predominant video coding tools in terms of coding efficiency were adopted in the latest video coding standard, H.264/AVC. Regardless of development of these predominant video coding tools such as the variable block-size motion estimation/compensation, intra prediction based on various directions, and so on, the discrete cosine transform has been continuously used starting from the early video coding standards. Generally, the correlation coefficient of the residual signal is usually less than 0.5 when this residual signal is actually encoded. In this interval of correlation coefficient, the discrete cosine transform does not show the optimal coding gain, and the discrete sine transform which is a sub-optimal transform when the correlation coefficient is in the interval from -0.5 to 0.5 can be used in conjunction with the discrete cosine transform in the video coding. In this paper, an alternative transform that alternatively uses the discrete sine transform and integer cosine transform in H.264/AVC by using rate-distortion optimization is proposed. The proposed method achieves a BD-PSNR gain of up to 0.71 dB compared to H.264/AVC JM 10.2 at relatively high bitrates.

• Journal of applied mathematics & informatics
• /
• v.30 no.3_4
• /
• pp.561-570
• /
• 2012

Fourier transform is well known for trigonometric systems. It is also a very useful tool for the construction of wavelets. The method of constructing wavelets has evolved as times went by. We review some methods. Then we do some calculations on wavelets defined by its Fourier transform.

• Journal of the Korean Mathematical Society
• /
• v.42 no.5
• /
• pp.1031-1056
• /
• 2005

In this paper, we define the conditional first variation over Wiener paths in abstract Wiener space and investigate its properties. Using these properties, we also investigate relationships among first variation, conditional first variation, Fourier-Feynman transform and conditional Fourier-Feynman transforms of functions in a Banach algebra which is equivalent to the Fresnel class. Finally, we provide another method evaluating the Fourier-Feynman transform for the product of a function in the Banach algebra with n linear factors.