• The Korean Journal of Applied Statistics
• /
• v.24 no.5
• /
• pp.963-977
• /
• 2011

PCA(Principal Component Analysis) is a well-studied statistical technique and an important tool for handling multivariate data. Although many algorithms exist for PCA, most of them are unsuitable for real time applications or high dimensional problems. Since it is desirable to avoid extensive matrix operations in such cases, alternative solutions are required to calculate the eigenvalues and eigenvectors of the sample covariance matrix. Erdogmus et al. (2004) proposed Recursive PCA(RPCA), which is a fast adaptive on-line solution for PCA, based on the first order perturbation theory. It facilitates the real-time implementation of PCA by recursively approximating updated eigenvalues and eigenvectors. However, the performance of the RPCA method becomes questionable as the size of newly-added data increases. In this paper, we modified the RPCA method by taking advantage of the mathematical relation of eigenvalues and eigenvectors of sample covariance matrix. We compared the performance of the proposed algorithm with that of RPCA, and found that the accuracy of the proposed method remarkably improved.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.4
• /
• pp.61-68
• /
• 2019

Currently many companies are interested in reduction of the carbon emissions associated with their supply chain activities such as transportation and operations. Operational decisions, such as modifications in order quantities could an effective way in reducing carbon emissions in the supply chain. Cap-and-trade regulation, sometimes called emissions trading, is a market-based tool to limit greenhouse gas emissions. Under cap-and-trade regulation, emission credits are allocated to the firms and the firms trades emissions under cap-and-trade schemes. In this paper, we propose a single-manufacturer single-buyer two-echelon supply chain problem under the cap-and-trade mechanism incorporating the carbon emissions caused by transportation and warehousing activities where a single manufacturer produces a family of items in order to deliver a family of items to a single buyer at a fixed interval of time for effective implementation of Just-In-Time (JIT) Purchasing. An integrated multi-product lot-splitting model of facilitating multiple shipments in small lots between buyer and manufacturer is developed in a JIT Purchasing environment. Also, an iterative heuristic algorithm is developed to derive the common order interval, the number of intervals for each product and the number of shipments between the buyer and the manufacturer during the common interval. A numerical example is given to illustrate the savings in reduction of total cost and carbon emissions by the inventory model incorporating cap-and-trade mechanism compared to the classical inventory model. The proposed inventory model could be useful for the practical solution of two-echelon supply chain inventory problem under cap-and-trade mechanism.

• Journal of the Society of Naval Architects of Korea
• /
• v.36 no.1
• /
• pp.30-36
• /
• 1999

A surface panel method for the analysis of ducted propellers in both uniform and non-uniform onset inflow is developed. A low order, perturbation potential based panel method with an efficient numerical Kutta condition is used. The boundary surface is discretized with hyperboloidal panels and the boundary condition is applied at the panel centroids. The unsteady analysis is based on a time-step algorithm in time domain. Numerical implementation is employed into both steady and unsteady problems. The results with the resent method are shown to have good convergence on the circumferential distribution of circulation on the duct. The effect of the propeller tip clearance on the circumferential circulation on the duct is also presented Numerical results on forces and moments of the propeller and the duct are compared with other numerical results and experimental data.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.4
• /
• pp.279-285
• /
• 2007

The objective of the research is two fold. The first is to design and propose a stable and robust learning control algorithm. The controller is CMAC Learning Controller which consists of a model-based controller, such as LQR or PID, as a reference control and a CMAC. The second objective is to implement a reference control and CMAC at two different sampling rates. Generally, a conventional controller is designed based on a mathematical plant model. However, increasing complexity of the plant and accuracy requirement on mathematical models nearly prohibits the application of the conventional controller design approach. To avoid inherent complexity and unavoidable uncertainty in modeling, biology mimetic methods have been developed. One of such attempts is Cerebellar Model Articulation Computer(CMAC) developed by Albus. CMAC has two main disadvantages. The first disadvantage of CMAC is increasing memory requirement with increasing number of input variables and with increasing accuracy demand. The memory needs can be solved with cheap memories due to recent development of new memory technology. The second disadvantage is a demand for processing powers which could be an obstacle especially when CMAC should be implemented in real-time. To overcome the disadvantages of CMAC, we propose CMAC learning controller with multiple sampling rates. With this approach a conventional controller which is a reference to CMAC at high enough sampling rate but CMAC runs at the processor's unoccupied time. To show efficiency of the proposed method, an inverted pendulum controller is designed and implemented. We also demonstrate it's possibility as an industrial control solution and robustness against a modeling uncertainty.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.2
• /
• pp.129-134
• /
• 2003

In this paper, we efficiently implement the AMR speech coder by reducing the complexity of algebraic codebook search. To reduce the computational complexity of the algebraic codebook search, we propose a fast algebraic codebook search method that improves conventional depth first tree search method used in AMR speech coder algorithm. The proposed method reduces the search complexity by pruning the trees which are less possible to be selected as an optimum excitation. This method needs no additional computation for selecting the trees to be pruned and reduces the computational complexity considerably compared to the original depth first tree search method with slightly degradation or speech qualify. Applying our method to the implementation or AMR speech coder with 12.2 kbps mode by using the TeakLite DSP, we reduce the search complexity about 40% compared to the conventional method.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.7
• /
• pp.603-611
• /
• 2003

This paper proposes an effective feature compensation scheme based on speech model for achieving robust speech recognition. Conventional model-based method requires off-line training with noisy speech database and is not suitable for online adaptation. In the proposed scheme, we can relax the off-line training with noisy speech database by employing the parallel model combination technique for estimation of correction factors. Applying the model combination process over to the mixture model alone as opposed to entire HMM makes the online model combination possible. Exploiting the availability of noise model from off-line sources, we accomplish the online adaptation via MAP (Maximum A Posteriori) estimation. In addition, the online channel estimation procedure is induced within the proposed framework. For more efficient implementation, we propose a selective model combination which leads to reduction or the computational complexities. The representative experimental results indicate that the suggested algorithm is effective in realizing robust speech recognition under the combined adverse conditions of additive background noise and channel distortion.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.3
• /
• pp.45-55
• /
• 2000

In this paper, we proposed the hardware architecture of wavelet transform digital filter for an image processing. Filter bank pyramid algorithm is used for wavelet transform and each fillet is implemented by the FIR filter. For DWT computation, because the memory controller is implemented by hardware, we can efficiently process the multisolution decomposition of the image data only input the parameter. As a result of the image Processing in this paper, 33㏈ PSNR has been obtained on 512$\times$512 B/W image due to 11-bit mantissa processing in FPGA Implementation. And because of using QMF( Quadrature Mirror Filter) properties, it reduces half number of the multiplier needed DWT(Discrete Wavelet Transform) computation so the hardware size is reduced largely. The proposed scheme can increase the efficiency of an image Processing as well as hardware size reduced. The hardware design proposed of DWT fillet bank is synthesized by VHDL coding and then the test board is manufactured, the operating Program and the application Program are implemented using MFC++ and C++ language each other.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.2
• /
• pp.102-113
• /
• 2014

This paper suggests a novel hardware architecture of a real-time rectification which is to remove vertical parallax of an image occurred in the pre-processing stage of stereo matching. As an off-line step, Matlab Toolbox which was designed by J.Y Bouguet, was used to calculate calibration parameter of the image. Then, based on the Heikkila and Silven's algorithm, rectification hardware was designed. At this point, to enhance the precision of the rectified image, floating-point unit was generated by using Xilinx Core Generator. And, we confirmed that proposed hardware design had higher precision compared to other designs while having the ability to do rectification in real-time.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.1
• /
• pp.66-70
• /
• 2017

Radioactive materials are used in medicine, non-destructive testing, and nuclear plants. Source localization is especially important during nuclear decommissioning and decontamination because the actual location of the radioactive source within nuclear waste is often unknown. The coded-aperture imaging technique started with space exploration and moved into X-ray and gamma ray imaging, which have imaging process characteristics similar to each other. In this study, we simulated $21{\times}21$ and $37{\times}37$ coded aperture collimators based on a modified uniformly redundant array (MURA) pattern to make a gamma imaging system that can localize a gamma-ray source. We designed a $21{\times}21$ coded aperture collimator that matches our gamma imaging detector and did feasibility experiments with the coded aperture imaging system. We evaluated the performance of each collimator, from 2 mm to 10 mm thicknesses (at 2 mm intervals) using root mean square error (RMSE) and sensitivity in a simulation. In experimental results, the full width half maximum (FWHM) of the point source was $5.09^{\circ}$ at the center and $4.82^{\circ}$ at the location of the source was $9^{\circ}$. We will continue to improve the decoding algorithm and optimize the collimator for high-energy gamma rays emitted from a nuclear power plant.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.7 no.4
• /
• pp.163-172
• /
• 2012

A driver assistance system is critical to improve a convenience and stability of vehicle driving. Several systems have been already commercialized such as adaptive cruise control system and forward collision warning system. Efficient vehicle detection is very important to improve such driver assistance systems. Most existing vehicle detection systems are based on a radar system, which measures distance between a host and leading (or oncoming) vehicles under various weather conditions. However, it requires high deployment cost and complexity overload when there are many vehicles. A camera based vehicle detection technique is also good alternative method because of low cost and simple implementation. In general, night time vehicle detection is more complicated than day time vehicle detection, because it is much more difficult to distinguish the vehicle's features such as outline and color under the dim environment. This paper proposes a method to detect vehicles at night time using analysis of a captured color space with reduction of reflection and other light sources in images. Four colors spaces, namely RGB, YCbCr, normalized RGB and Ruta-RGB, are compared each other and evaluated. A suboptimal threshold value is determined by Otsu algorithm and applied to extract candidates of taillights of leading vehicles. Statistical features such as mean, variance, skewness, kurtosis, and entropy are extracted from the candidate regions and used as feature vector for SVM(Support Vector Machine) classifier. According to our simulation results, the proposed statistical feature based SVM provides relatively high performances of leading vehicle detection with various distances in variable nighttime environments.