• JSTS:Journal of Semiconductor Technology and Science
• /
• 제16권4호
• /
• pp.497-505
• /
• 2016

The two-dimensional (2D) Discrete Cosine Transform (DCT) is used widely in image and video processing systems. The perception of human visualization permits us to design approximate rather than exact DCT. In this paper, we propose a digital implementation of 16-point approximate 2D DCT architecture based on one-dimensional (1D) DCT and Modified Gate Diffusion Input (MGDI) technique. The 8-point 1D Approximate DCT architecture requires only 12 additions for realization in digital VLSI. Additions can be performed using the proposed 8 transistor (8T) MGDI Full Adder which reduces 2 transistors than the existing 10 transistor (10T) MGDI Full Adder. The Approximate MGDI 2D DCT using 8T MGDI Full adders is simulated in Tanner SPICE for $0.18{\mu}m$ CMOS process technology at 100MHZ.The simulation result shows that 13.9% of area and 15.08 % of power is reduced in the 8-point approximate 2D DCT, 10.63 % of area and 15.48% of power is reduced in case of 16-point approximate 2D DCT using 8 Transistor MGDI Full Adder than 10 Transistor MGDI Full Adder. The proposed architecture enhances results in terms of hardware complexity, regularity and modularity with a little compromise in accuracy.

• Korean Journal of Mathematics
• /
• 제27권1호
• /
• pp.221-267
• /
• 2019

In the five first sections of this paper we define and study the hypergeometric transmutation operators $V^W_k$ and $^tV^W_k$ called also the trigonometric Dunkl intertwining operator and its dual corresponding to the Heckman-Opdam's theory on ${\mathbb{R}}^d$. By using these operators we define the hypergeometric translation operator ${\mathcal{T}}^W_x$, $x{\in}{\mathbb{R}}^d$, and its dual $^t{\mathcal{T}}^W_x$, $x{\in}{\mathbb{R}}^d$, we express them in terms of the hypergeometric Fourier transform ${\mathcal{H}}^W$, we give their properties and we deduce simple proofs of the Plancherel formula and the Plancherel theorem for the transform ${\mathcal{H}}^W$. We study also the hypergeometric convolution product on W-invariant $L^p_{\mathcal{A}k}$-spaces, and we obtain some interesting results. In the sixth section we consider a some root system of type $BC_d$ (see [17]) of whom the corresponding hypergeometric translation operator is a positive integral operator. By using this positivity we improve the results of the previous sections and we prove others more general results.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• 제55권3호
• /
• pp.116-122
• /
• 2006

The underground transmission lines is continuously expanded in power systems. Therefore the fault of underground transmission lines are increased every year because of the complication of systems. However the studies dealing with fault location in the case of the underground transmission lines are rarely reported except for few papers using traveling wave method and calculating underground cable impedance. This paper describes the algorithm using fuzzy system and travelling wave method in the underground transmission line. Fuzzy inference is used for fault discrimination. To organize fuzzy algorithm, it is important to select target data reflecting various underground transmission line transient states. These data are made of voltage and average of RMS value on zero sequence current within one cycle after fault occurrence. Travelling wave based on wavelet transform is used for fault location. In this paper, a variety of underground transmission line transient states are simulated by EMTP/ATPDraw and Matlab. The input which is used to fault location algorithm are Detail 1(D1) coefficients of differential current. D1 coefficients are obtained by wavelet transform. As a result of applying the fuzzy inference and travelling wave based on wavelet transform, fault discrimination is correctly distinguished within 1/2 cycle after fault occurrence and fault location is comparatively correct.

• Korean Journal of Remote Sensing
• /
• 제29권5호
• /
• pp.569-579
• /
• 2013

In this study, land-cover classification was implemented using features extracted from multi-temporal SAR data through 3D wavelet transform and the applicability of the 3D wavelet transform as a feature extraction approach was evaluated. The feature extraction stage based on 3D wavelet transform was first carried out before the classification and the extracted features were used as input for land-cover classification. For a comparison purpose, original image data without the feature extraction stage and Principal Component Analysis (PCA) based features were also classified. Multi-temporal Radarsat-1 data acquired at Dangjin, Korea was used for this experiment and five land-cover classes including paddy fields, dry fields, forest, water, and built up areas were considered for classification. According to the discrimination capability analysis, the characteristics of dry field and forest were similar, so it was very difficult to distinguish these two classes. When using wavelet-based features, classification accuracy was generally improved except built-up class. Especially the improvement of accuracy for dry field and forest classes was achieved. This improvement may be attributed to the wavelet transform procedure decomposing multi-temporal data not only temporally but also spatially. This experiment result shows that 3D wavelet transform would be an effective tool for feature extraction from multi-temporal data although this procedure should be tested to other sensors or other areas through extensive experiments.

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(4)
• /
• pp.89-92
• /
• 2000

In this paper, an effective image restoration using Genetic Algorithm(GA) in wavelet transform region is proposed. First, a wavelet transform is used for decomposition of a blurred image with white Gaussian noise as a preprocessing of the proposed method. The wavelet transform decomposes a degraded image into a wavelet subband coefficient planes. In this wavelet transformed subband coefficient planes, three highest subbands is composed entirely of noise elements on a degraded image. So, these subbands are removed. And remained subbands except for the lowest subband are individually applied to GA. For the performance evaluation, the proposed method is compared with a conventional single GA algorithm and a conventional hybrid method of wavelet transform and GA for a Lenna image and a boat image. As an experimental result, the proposed algorithm is prior to a conventional methods as each PSNR 3.4dB, 1.3dB.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• 제48권12호
• /
• pp.1527-1536
• /
• 1999

In this paper, a triply-encoded Hadamard transform imaging spectrometer is proposed by applying the grill spectrometer to the Hadamard transform imaging spectrometer. The proposed system encodes the input radiation triply ; once through the input image mask and twice through the two masks in the grill spectrometer. We use an electro-optical mask in the grill spectrometer which is controlled by a left-cyclic simplex matrix. Then we modeled the system using $D^{-1}$ method. In this paper, the average mean square error associated with a recovered estimate is considered for performance evaluation. The relative performance is compared with those of the other conventional systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제21권1호
• /
• pp.1-16
• /
• 1996

In this paper, by combining the motion compensated transform coding with the sub-band decomposition technique, we present a motion compensated sub-band coding technique(MCSBC) for image sequence coding. Several problems related to the MCSBC, such as a scheme for motion compensation in each sub-band and the efficient VWL coding of the DCT coefficients in each sub-band are discussed. For an efficient coding, the motion estimation and compensation is performed only on the LL sub-band, but the discrete cosine transform(DCT) is employed to encode all sub-bands in our approach. Then, the transform coefficients in each sub-band are scanned in a different manner depending on the energy distributions in the DCT domain, and coded by using separate 2-D Huffman code tables, which are optimized to the probability distributions in the DCT domain, and coded by using separate 2-D Huffman code tables, which are optimized to the probability distribution of each sub-band. The performance of the proposed MCSBC technique is intensively examined by computer simulations on the HDTV image sequences. The simulation results reveal that the proposed MCSBC technique outperforms other coding techniques, especially the well-known motion compensated transform coding technique by about 1.5dB, in terms of the average peak signal to noise ratio.

• Journal of the Optical Society of Korea
• /
• 제20권1호
• /
• pp.42-54
• /
• 2016

A hybrid color and grayscale images encryption scheme based on the quaternion Hartley transform (QHT), the two-dimensional (2D) logistic map, the double random phase encoding (DRPE) in gyrator transform (GT) domain and the three-step phase-shifting interferometry (PSI) is presented. First, we propose a new color image processing tool termed as the quaternion Hartley transform, and we develop an efficient method to calculate the QHT of a quaternion matrix. In the presented encryption scheme, the original color and grayscale images are represented by quaternion algebra and processed holistically in a vector manner using QHT. To enhance the security level, a 2D logistic map-based scrambling technique is designed to permute the complex amplitude, which is formed by the components of the QHT-transformed original images. Subsequently, the scrambled data is encoded by the GT-based DRPE system. For the convenience of storage and transmission, the resulting encrypted signal is recorded as the real-valued interferograms using three-step PSI. The parameters of the scrambling method, the GT orders and the two random phase masks form the keys for decryption of the secret images. Simulation results demonstrate that the proposed scheme has high security level and certain robustness against data loss, noise disturbance and some attacks such as chosen plaintext attack.

• The Journal of the Acoustical Society of Korea
• /
• 제14권1E호
• /
• pp.46-55
• /
• 1995

In this paper, we present a new wavelet transform-based CELP coder, called band selection wavelet transform CELP (BS-WTCELP) operated at 4.8 kbps. The proposed algorithm uses a band selection scheme of frequency bands of wavelet transform and selective vector quantization (VQ). The band selection and selective VQ structure is implemented by using a classified VQ structure. The proposed algorithm has about 0.5-1.0 dB improvement in segmental SNR compared with the conventional CELP that uses the random codebook search, while is has significantly reduced computational and storage complexity. Many experimental results have shown that the proposed algorithm is more suitable for most real-applications than the conventional CELP and wavelet transform CELP.

• Bulletin of the Korean Mathematical Society
• /
• 제51권2호
• /
• pp.373-386
• /
• 2014

Let (R,m) be a commutative Noetherian local ring. In this paper we show that a finitely generated R-module M of dimension d is Cohen-Macaulay if and only if there exists a proper ideal I of R such that depth($M/I^nM$) = d for $n{\gg}0$. Also we show that, if dim(R) = d and $I_1{\subset}\;{\cdots}\;{\subset}I_n$ is a chain of ideals of R such that $R/I_k$ is maximal Cohen-Macaulay for all k, then $n{\leq}{\ell}_R(R/(a_1,{\ldots},a_d)R)$ for every system of parameters $a1,{\ldots},a_d$ of R. Also, in the case where dim(R) = 2, we prove that the ideal transform $D_m(R/p)$ is minimax balanced big Cohen-Macaulay, for every $p{\in}Assh_R$(R), and we give some equivalent conditions for this ideal transform being maximal Cohen-Macaulay.