• Journal of the Korean Society for Nondestructive Testing
• /
• v.29 no.6
• /
• pp.579-585
• /
• 2009

The multifrequency eddy current testing(ECT) have been proposed various frequency mixing algorithms. In this study, we compare these approaches to frequency mixing of ECT signals from steam generator tubes; time-domain optimization, discrete cosine transform-domain optimization. Specifically, in this study, two different frequency mixing algorithms, a time-domain optimization method and a discrete cosine transform(DCT) optimization method, are investigated using the experimental signals captured from the ASME standard tube. The DCT domain optimization method is computationally fast but produces larger amount of residue.

• Journal of Information Processing Systems
• /
• v.12 no.3
• /
• pp.392-409
• /
• 2016

The aim of this paper is to examine the effectiveness of combining three popular tools used in pattern recognition, which are the Active Appearance Model (AAM), the two-dimensional discrete cosine transform (2D-DCT), and Kernel Fisher Analysis (KFA), for face recognition across age variations. For this purpose, we first used AAM to generate an AAM-based face representation; then, we applied 2D-DCT to get the descriptor of the image; and finally, we used a multiclass KFA for dimension reduction. Classification was made through a K-nearest neighbor classifier, based on Euclidean distance. Our experimental results on face images, which were obtained from the publicly available FG-NET face database, showed that the proposed descriptor worked satisfactorily for both face identification and verification across age progression.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2471-2474
• /
• 2003

The modified discrete cosine transform (MDCT) and its inverse transform (IMDCT) are employed in subband/transform coding schemes as the analysis/synthesis filter bank based on time domain aliasing cancellation (TDAC). And they are the most computational intensive operations in layer III of the MPEG audio coding standard. In this paper, we propose a new efficient algorithm for the MDCT/IMDCT computation. It is based on the MDCT/IMDCT computation algorithm using the discrete cosine transforms (DCTs), and it employs two discrete cosine transform of type II(DCT-II) to compute the MDCT/IMDCT. In addition to, it takes advantage of ability in calculating the MDCT/IMDCT computation, where the length of a data block is divisible by 4. The proposed algorithm in this paper requires less calculation complexity than the existing methods. Also, it can be implemented by the parallel structure,, and its structure is particularly suitable for VLSI realization.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.326-329
• /
• 2009

This paper proposes a new video compression algorithm using an adaptive transform that is adjusted depending on the frequency contents of the input signals. The adaptive transform is based on the warped discrete cosine transform (WDCT) which is shown to provide better performance than the DCT at high bit rates, when applied to JPEG compression scheme [1, 2, 3]. The WDCT is applied to the video compression in this paper, as a new feature in the H.264/AVC. The proposed method shows the coding gain over the H.264/AVC at high bit rates. The coding gain is shown over the 35dB PSNR quality, and the gain increases as the bit rate increases. (about 1.0dB at 45dB PSNR quality at maximum)

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2365-2371
• /
• 1998

Discrete cosine transform (DCT) has wide applications in speech and image coding. In this paper, we propose a novel fast dCT scheme with the property of reduced multiplication stages and the smaller number of additions and multiplications. This exploits the symmetry property of the DCT kernel to decompose the N-point dCT to N/2 point, and can be generally applied recursively to $2^{m}$-point. The proposed algorithm has a structure that most of multiplications tend to be performed at final stage, and this reduces propagation of truncation error which could occur in the fixed-point computation. Also the minimization of the multiplication stages further decreases the error.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.383-391
• /
• 2005

In this paper, a new anisotropic diffusion based on Alvarez, Lions, and Morel (ALM) diffusion model is proposed for the suppression of blocking artifact caused by discrete cosine transform (DCT) based image compression. The proposed diffusion model, which incorporates a 'rate control parameter' (RCP), makes it possible to reduce blocking artifacts while to preserve the edge. The RCP controls the rate between isotropic and anisotropic diffusion. Isotropic diffusion is encouraged to eliminate the blocking artifacts in a block boundary of a smooth region, while anisotropic diffusion is encouraged to keep the edge or texture sharp in edge and a block boundary within an edge region. Additionally, to avoid oversmoothness of the texture region, a 'speed control parameter' (SCP), which makes diffusion process slow in the texture region, is employed.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1996.06a
• /
• pp.472-476
• /
• 1996

• Journal of Computing Science and Engineering
• /
• v.11 no.4
• /
• pp.152-159
• /
• 2017

Three-dimensional (3D) printing is applied to many areas of life, but 3D printing models are stolen by pirates and distributed without any permission from the original providers. Moreover, some special models and anti-weapon models in 3D printing must be secured from the unauthorized user. Therefore, 3D printing models must be encrypted before being stored and transmitted to ensure access and to prevent illegal copying. This paper presents a selective encryption algorithm for 3D printing models based on clustering and the frequency domain of discrete cosine transform. All facets are extracted from 3D printing model, divided into groups by the clustering algorithm, and all vertices of facets in each group are transformed to the frequency domain of a discrete cosine transform. The proposed algorithm is based on encrypting the selected coefficients in the frequency domain of discrete cosine transform to generate the encrypted 3D printing model. Experimental results verified that the proposed algorithm is very effective for 3D printing models. The entire 3D printing model is altered after the encryption process. The decrypting error is approximated to be zero. The proposed algorithm provides a better method and more security than previous methods.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.7
• /
• pp.47-54
• /
• 2001

In this paper, we present a variable dimension vector quantization for spectral magnitudes. Espectially, spectral magnitudes of the Harmonic coder, need variable dimension quantizer because those are not fixed dimension. So, this paper present efficient quantization methods. These methods use variable Discrete Cosine Transform(DCT) for spectral magnitude parameters and NSTVQ which is combined odd/even, split and multi-stage structure, proposed quantization methods use Spectral Distortion(SD) for performance measure. Consequently, Multi-Stage Nonsquare Transform Vector Quantization(MSNSTVQ) is the best in performance measure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.10 no.3
• /
• pp.130-134
• /
• 1985

In two-dimensional discrete cosine transform(DCT) coding, the measurements of the distributions of the transform coefficients are important because a better approximation yields a smaller mean square distorition. This paper presents the results of distribution tests which indicate that the statistics of the AC coefficients are well approximated to a generalized Gaussian distribution whose shape parameter is 0.6. Furthermore, from a simulation of the DCT coding, it was shown that the above approximation yields a higher experimental SNR and a better agreement between theory and simulation than the Gaussian or Laplacian assumptions.