• The Journal of the Acoustical Society of Korea
• /
• v.18 no.7
• /
• pp.23-32
• /
• 1999

This paper presents a stochastic convergence analysis of LMS algorithm and VS-LMS algorithm for IIR filters using equation error formulation. Under the assumption that the signal is white Gaussian, theoretical equations that characterize the mean and mean-squared behaviors of the algorithms are derived. Computer simulation results show fairly good agreements between the theoretical and the empirical behaviors of the algorithms.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.5
• /
• pp.438-443
• /
• 2008

In this paper, segmenting and classifying low contrast defects on flat panel display is one of the key problems for automatic inspection system in practice. Problems become more complicated when the quality of acquired image is degraded by the illumination irregularity. Many algorithms are developed and implemented successfully for the defects segmentation. However, vision algorithms are inherently prone to be dependent on parameters to be set manually. In this paper, one morphological segmentation algorithm is chosen and a technique using frequency domain analysis of input images is developed for automatically selection the morphological parameter. An extensive statistical performance analysis is performed to compare the developed algorithms.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2355-2358
• /
• 2003

The purpose of this paper is to investigate two major feature extraction techniques based on generic modular face recognition system. Detailed algorithms are described for principal component analysis (PCA) and independent component analysis (ICA). PCA and ICA ate statistical techniques for feature extraction and their incorporation into a face recognition system requires numerous design decisions. We explicitly state the design decisions by introducing a modular-based face recognition system since some of these decision are not documented in the literature. We explored different implementations of each module, and evaluate the statistical feature extraction algorithms based on the FERET performance evaluation protocol (the de facto standard method for evaluating face recognition algorithms). In this paper, we perform two experiments. In the first experiment, we report performance results on the FERET database based on PCA. In the second experiment, we examine performance variations based on ICA feature extraction algorithm. The experimental results are reported using four different categories of image sets including front, lighting, and duplicate images.

• Proceedings of the KSRS Conference
• /
• v.1
• /
• pp.450-453
• /
• 2006

Hydrographic data including particulate organic carbon (POC) from the Northeastern Gulf of Mexico (NEGOM) study were used along with remotely sensed data obtained from NASA's Sea-viewing Wide Field-of-view Sensor (SeaWiFS) to develop POC algorithms to estimate POC concentration based on empirical and model-based principal component analysis (PCA) methods. In Case I and II waters empirical maximized simple ratio (MSR) and model-based PCA algorithms using full wavebands (blue, green and red wavelengths) provide more robust estimates of POC. The predicted POC concentrations matched well the spatial and seasonal distributions of POC measured in situ in the Gulf of Mexico. The ease in calculating the MSR algorithm compared to PCA analysis makes MSR the preferred algorithm for routine use. In order to determine the inter-annual variations of POC, MSR algorithms applied to calculate 100 monthly mean values of POC concentrations (September 1997-December 2005). The spatial and temporal variations of POC and sea surface temperature (SST) were analyzed with the empirical orthogonal function (EOF) method. POC estimates showed inter-annual variation in three different locations and may be affected by El $Ni{\tilde{n}}o/Southern$ Oscillation (ENSO) events.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.5 s.176
• /
• pp.1215-1230
• /
• 2000

Parallel Approaches using Cray T3E which is NIPP (Massively Parallel Processors) machine are presented for the efficient computation of the finite element analysis of 3-D shape rolling processes. D omain decomposition method coupled with parallel linear equation solver is used. Domain decomposition is applied for obtaining element tangent stifffiess matrices and residual vectors. Direct and iterative parallel algorithms are used for solving the linear equations. Direct algorithm is_parallel version of direct banded matrix solver. For iterative algorithms, the well-known preconditioned conjugate gradient solver with Jacobi preconditioner is also employed. Moreover a new effective iterative scheme with block inverse matrix preconditioner, which is named by present authors, is presented and its results are compared with the one using Jacobi preconditioner. PVM and MPI are used for message passing and synchronization between processors. The performance and efficiency of each algorithm is discussed and comparisons are made among different algorithms.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.779-782
• /
• 2002

본 논문에서는 주성분분석(principal component analysis; 이하 PCA) 및 첨도(Kurtosis)에서의 그레이 블록 거리 알고리즘(grey block algorithms; 이하 GBD)을 이용, 영상간의 거리를 측정하여 어느 정도 영상간의 상대적 식별을 용이하게 하여 영상 분류가 되는지 모의실험을 통하여 확인하고자 한다. 모의실험 결과로부터, PCA에서는 k가 9에서 상대적 식별이 불가능함을 보였고, 첨도에서는 k가 4까지만 블록을 택할 할 수 있음을 모의실험을 통하여 확인할 수 있었다.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.5
• /
• pp.711-720
• /
• 2004

There are conversion of expression motion and assignment motion inclusive espression motion in techniques that optimized program computationally and livelly. In this paper, I suggest that an algorithms of reconstruct unnecessary code motion which is improves Knoop's algorithms that have ambiguous. It is occurred by mixing the node level analysis and the instruction level analysis. This algorithm improves runtime and efficiency of a program by avoiding the unnecessary recalculations and reexecutions of expressions and assignment statements.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.96-102
• /
• 1995

This paper presents the VHSIC Hardware Description Language(VHDL) implementation of the Fixed Point Covariance Lattice(FLAT) algorithm for an Linear Predictive Coding(LPC) analysis and its related algorithms, such as the forth order high pass Infinite Impulse Response(IIR) filter, covariance matrix calculation, and Spectral Smoothing Technique(SST) in the Vector Sum Exited Linear Predictive(VSELP) speech coder that has been Selected as the standard speech coder for the North America and Japanese digital cellular. Existing Digital Signal Processor(DSP) chips used in digital cellular phones are derived from general purpose DSP chips, and thus, these DSP chips may not be optimal and effective architectures are to be designed for the above mentioned algorithms. Then we implemented the VHDL code based on the C code, Finally, we verified that VHDL results are the same as C code results for real speech data. The implemented VHDL code can be used for performing logic synthesis and for designing an LPC Application Specific Integrated Circuit(ASOC) chip and DsP chips. We first developed the C language code to investigate the correctness of algorithms and to compare C code results with VHDL code results block by block.

• Proceedings of the KSME Conference
• /
• 2003.04a
• /
• pp.1639-1644
• /
• 2003

A hybrid genetic algorithm is developed for estimating the wall emissivities for an absorbing, emitting, and scattering media in a two-dimensional irregular geometry with diffusely emitting and reflecting opaque boundaries by minimizing an objective function, which is expressed by the sum of square errors between estimated and measured temperatures at only four data positions. The finite-volume method was employed to solve the radiative transfer equation for a two-dimensional irregular geometry. The results show that a developed hybrid genetic algorithms reduce the effect of genetic parameters on the performance of genetic algorithm and that the wall emissivities are estimated accurately without measurement errors.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.4
• /
• pp.331-341
• /
• 1991

The discrete cosine transform (DCT) is widely used in many signal processing areas, including image and speech data compression. In this paper, we investigate a fixed-point error analysis for fast DCT algorithms, namely, Lee [6], Hou [7] and Vetterli [8]. A statistical model for fixed-point error is analyzed to predict the output noise due to the fixed-point implementation. This paper deals with two's complement fixed-point data representation with truncation and rounding. For a comparison purpose, we also investigate the direct form DCT algorithm. We also propose a suitable scaling model for the fixed-point implementation to avoid an overflow occurring in the addition operation. Computer simulation results reveal that there is a close agreement between the theoretical and the experimental results. The result shows that Vetterli's algorithm is better than the other algorithms in terms of SNR.