• Proceedings of the KOSOMBE Conference
• /
• v.1997 no.05
• /
• pp.230-234
• /
• 1997

The matching pursuit (MP) algorithm developed by S. Mallat and Z. Zhang is applied to magnetic resonance (MR) imaging. Since matching pursuit is a greedy algorithm to find waveforms which are the best match for an object-signal, the signal can be decomposed with a few iterations. In this paper, we propose an application of the MP algorithm to the MR imaging to reduce imaging time. Inner products of residual signals and selected waveforms in the MP algorithm are derived from the MR signals by excitation of RF pulses which are fourier transforms of selected waveforms. Results from computer simulations demonstrate that the imaging time is reduced by using the MP algorithm and further a progressive reconstruction can be achieved.

• Communications for Statistical Applications and Methods
• /
• v.22 no.2
• /
• pp.121-135
• /
• 2015

We consider testing equality of mean functions from two samples of functional data. A novel test based on the adaptive Neyman methodology applied to the Hotelling's T-squared statistic is proposed. Under the enlarged null hypothesis that the distributions of the two populations are the same, randomization methods are proposed to find a null distribution which gives accurate significance levels. An extensive simulation study is presented which shows that the proposed test works very well in comparison with several other methods under a variety of alternatives and is one of the best methods for all alternatives, whereas the other methods all show weak power at some alternatives. An application to a real-world data set demonstrates the applicability of the method.

• Communications for Statistical Applications and Methods
• /
• v.24 no.6
• /
• pp.651-662
• /
• 2017

We propose an alternative procedure to select penalty parameter in $L_1$ penalized robust regression. This procedure is based on marginalization of prior distribution over the penalty parameter. Thus, resulting objective function does not include the penalty parameter due to marginalizing it out. In addition, its estimating algorithm automatically chooses a penalty parameter using the previous estimate of regression coefficients. The proposed approach bypasses cross validation as well as saves computing time. Variable-wise penalization also performs best in prediction and variable selection perspectives. Numerical studies using simulation data demonstrate the performance of our proposals. The proposed methods are applied to Boston housing data. Through simulation study and real data application we demonstrate that our proposals are competitive to or much better than cross-validation in prediction, variable selection, and computing time perspectives.

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.2E
• /
• pp.100-106
• /
• 2010

Multiple-model speech recognizer has been shown to be quite successful in noisy speech recognition. However, its performance has usually been tested using the general speech front-ends which do not incorporate any noise adaptive algorithms. For the accurate evaluation of the effectiveness of the multiple-model frame in noisy speech recognition, we used the state-of-the-art front-ends and compared its performance with the well-known multi-style training method. In addition, we improved the multiple-model speech recognizer by employing N-best reference HMMs for interpolation and using multiple SNR levels for training each of the reference HMM.

• Journal of Korean Society for Quality Management
• /
• v.39 no.2
• /
• pp.329-336
• /
• 2011

The purpose of Phase I clinical trial is to identify the maximum tolerated dose with specific toxicity rate. The standard TER design does not guarantee the pre-specified toxicity rate. It depends on the dose-toxicity curves. Therefore it is necessary to check the expected toxicity rate of various dose-toxicity curves before we conduct clinical trials. We developed TERAplusB library to help this situation, especially in cancer research. This package will help design the cancer clinical trial. We can compare the expected toxicity rates, the expected number of patients, and the expected times calculated with various dose-toxicity curves. This process will help find the best clinical trial design of the proposed drug.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.1
• /
• pp.44-53
• /
• 2000

In this paper, we propose a multicarrier CDMA system with an adaptive subchannel allocation method for forward links. In the proposed system, instead of transmitting identical DS waveforms over a number of subchannels in parallel, each user's DS waveform is transmitted over the user's favorite subchannel which has the largest fading amplitude among all the subchannels. The proposed system is shown to have performance gain over the conventional multicarrier DS/CDMA system. We also investigate how the performance is influenced when the signal is not perfectly allocated into the best subchannel.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.20 no.4
• /
• pp.412-418
• /
• 2011

Reliability-based Topology optimization(RBTO) is to get an optimal design satisfying uncertainties of design variables. Although RBTO based on homogenization and density distribution method has been done, RBTO based on BESO has not been reported yet. This study presents a reliability-based topology optimization(RBTO) using bi-directional evolutionary structural optimization(BESO). Topology optimization is formulated as volume minimization problem with probabilistic displacement constraint. Young's modulus, external load and thickness are considered as uncertain variables. In order to compute reliability index, four methods, i.e., RIA, PMA, SLSV and ADL(adaptive-loop), are used. Reliability-based topology optimization design process is conducted to obtain optimal topology satisfying allowable displacement and target reliability index with the above four methods, and then each result is compared with respect to numerical stability and computing time. The results of this study show that the RBTO based on BESO using the four methods can effectively be applied for topology optimization. And it was confirmed that DLSV and ADL had better numerical efficiency than SLSV. ADL and SLSV had better time cost than DLSV. Consequently, ADL method showed the best time efficiency and good numerical stability.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1985.10a
• /
• pp.87-94
• /
• 1985

In this paper, enhancement of speech corrupted by additive white or colored noise is stuided. The nuconstrained frequency-domain block least-mean-square (UFBLMS) adaptation algorithm and its frequency-weighted version are newly applied to speech enhancement. For enhancement of speech degraded by white noise, the performance of the UFBLMS algorithm is superior to the spectral subtraction method or Wiener filtering technique by more than 3 dB in segmented frequency-weighted signal-to-noise ratio(FWSNERSEG) when SNR of speech is in the range of 0 to 10 dB. As for enhancement of noisy speech corrupted by colored noise, the UFBLMS algorithm is superior to that of the spectral subtraction method by about 3 to 5 dB in FWSNRSEG. Also, it yields better performance by about 2 dB in FWSNR and FWSNRSEG than that of time-domain least-mean-square (TLMS) adaptive prediction filter(APF). In view of the computational complexity and performance improvement in speech quality and intelligibility, the frequency-weighted UFBLMS algorithm appears to yield the best performance among various algorithms in enhancing noisy speech corrupted by white or colored noise.

• Phonetics and Speech Sciences
• /
• v.1 no.2
• /
• pp.3-8
• /
• 2009

In an effort to improve speech recognition, we investigated the effect of the number of clusters. In usual LBG clustering, the number of codebook clusters is doubled on each bifurcation and hence cannot be chosen arbitrarily in a natural way. To have the number of clusters at our control, we combined adaptive resonance theory (ART2) with LBG and perform the clustering in two stages. The codebook thus formed was used in subsequent processing of fuzzy vector quantization (FVQ) and HMM for speech recognition tests. Compared to conventional LBG, our method was shown to reduce the best recognition error rate by 0${\sim$}0.9% depending on the vocabulary size. The result also showed that between 400 and 800 would be the optimal number of clusters in the limit of small and large vocabulary speech recognitions of isolated words, respectively.

• Journal of KIISE:Software and Applications
• /
• v.26 no.1
• /
• pp.118-118
• /
• 1999

In this paper, we propose an agent negotiation algorithm of an intelligent agent system for an active and adaptive multimedia data services in the distributed environment. We describe theEARTS-II system that performs automatic job seeking and job offering operations using intelligentagents without user's intervention. EARTS-II offers best candidate lists as the results to usersthrough negotiation among agents considering conditions given by the users. And according to theresults, the EARTS-II supports real processes of employment, The negotiation algorithm tries tosatisfy all agents in the job market. To test the performance of the algorithm, simulation results arepresented.