• The Journal of the Acoustical Society of Korea
• /
• v.20 no.3
• /
• pp.34-41
• /
• 2001

In an IMBE (Improved Multi-band Excitation) speech coder, initial pitch estimation occupies most of the total computing time for the coder due to complex cost function and exhaustive search over candidate pitches. Future frames in initial pitch estimation cause inevitable time delay. Therefore, it is difficult to implement a real-time coder. Furthermore, unvoiced frames use the unnecessary pitch estimation as in the voiced frames. In this paper, each frame is determined voiced or unvoiced by Dyadic Wavelet Transform (DyWT) and, then, initial pitch estimation is performed only for voiced frame. Therefore different pitch estimation algorithms are employed between voiced and unvoiced frames incurring reduced time delay at transmitter and receiver. Simulation result show that the relative complexity of initial pitch estimation is reduced by 23％, and the processing time decreases down to 1/10 ∼ 1/1l of the IMBE coder while speech quality is almost maintained.

• 한국데이터정보과학회:학술대회논문집
• /
• 2002.06a
• /
• pp.75-84
• /
• 2002

This paper compares long-run returns of privatization initial public offerings to those of domestic stock markets of respective countries using a sample of 196 privatization initial public offerings from 39 countries. The evidence indicates that the privatization initial public offerings (IPOs) significantly outperform their domestic stock markets. There are substantial differences in the long-run performance of privatization IPOs depending on the return estimation techniques, however. Evidence indicates that the inference based either on conventional t or on skewness-adjusted t statistics may yield misspecified test statistics. The quality of estimation tends to be improved by simply eliminating the outliers from the sample, especially for the buy-and-hold abnormal return technique.

• Journal of Biomedical Engineering Research
• /
• v.10 no.2
• /
• pp.114-116
• /
• 1989

A method has been proposed for the fully automatic detection of left ventricular endocardial boundary in 2D short axis echocardiogram using geometric model. The procedure has the following three distinct stages. First, the initial center is estimated by the initial center estimation algorithm which is applied to decimated image. Second, the center estimation algorithm is applied to original image and then best-fit elliptic model estimation is processed. Third, best-fit boundary is detected by the cost function which is based on the best-fit elliptic model. The proposed method shows effective result without manual intervention by a human operator.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1219-1223
• /
• 2010

This paper proposes a fast motion estimation algorithm based on motion speed and multiple initial center points. The proposed method predicts initial search points by means of the spatio-temporal neighboring motion vectors. A dynamic search pattern based on the motion speed and the predicted initial center points is proposed to quickly obtain the motion vector. Due to the usage of the spatio-temporal information and the dynamic search pattern, the proposed method greatly accelerates the search speed while keeping a good predicted image quality. Experimental results show that the proposed method has a good predicted image quality in terms of PSNR with less searching time comparing with the Full Search, New Three-Step Search, and Four-Step Search.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.10 no.2
• /
• pp.124-129
• /
• 2005

This paper presents an advanced method for an initial pole position estimation of a Permanent Magnet Linear Synchronous Motor(PMLSM) that has an accurate incremental encoder for servo applications but does not have Hall sensors as a magnetic pole sensor. By appropriately using the secant method as a numerical method the proposed algorithm finds either of two zero force positions and then the correct d-axis by applying a q-axis test current. It only requires the tuned current controller and the relative position information md so it can be simply applicable to a rotary PMSM. The experimental results show the validity of the proposed method, which has an excellent performance with respect to an accurate pole position estimation under the minimal moving distance(average of about 85㎛) during the estimation process.

• Proceedings of the KIEE Conference
• /
• 1996.11a
• /
• pp.182-185
• /
• 1996

The purpose of slate estimation in power system is to estimate the best-fit Slate variables from the measurements contaminated by various kind of noise. But because the majority of state estimation modules in EMS lack the convergence characteristics, sometimes the desirable outputs can't be obtained. So, in this paper, the new algorithm using the load now output as initial values in the state estimation calculation is proposed to guarantee the convergence. And if the load now outputs were used as the initial values in the calculation, the change in each step would be small compared to the original method using the flat start point. And the Inverse Lemma is used in the algorithm to calculate the new stale in each iteration step for reducing the calculation time. The proposed algorithm was tested on the IEEE 14, 30, 118 bus systems. Eventually, we were able to verity that the differences between the results obtained by the original method and proposed method were relatively small, and the effectiveness of the proposed algorithm increased when applied to the bigger systems.

• Journal of Ocean Engineering and Technology
• /
• v.19 no.6 s.67
• /
• pp.78-85
• /
• 2005

Initial alignment and localization are important topics in inertial navigation systems, since misalignment and initial position error wholly propagate into the navigation systems and deteriorate the performance of the systems. This paper presents the error convergence characteristics of the hybrid navigation system for underwater vehicles initial position, which is based on an inertial measurement unit (IMU) accompanying a range sensor. This paper demonstrates the improvement on the navigational performance oj the hybrid system with the range information, especially focused on the convergence of the estimation of underwater vehicles initial position error. Simulations are performed with experimental data obtained from a rotating ann test with a fish model. The convergence speed and condition of the initial error removal for random initial position errors are examined with Monte Carlo simulation. In addition, numerical simulation is conducted with an AUV model in lawn-mowing survey mode to illustrate the error convergence of the hybrid navigation System for initial position error.

• Journal of information and communication convergence engineering
• /
• v.8 no.5
• /
• pp.519-523
• /
• 2010

In Gen-2 RFID system, the initial value of $Q_{fp}$, which is the slot-count parameter of Q-algorithm, is not defined in the standard. In this case, if the number of tags within the reader's identification range is small and we let the initial $Q_{fp}$ be large, the number of empty slot will be large. On the other hand, if we let the initial $Q_{fp}$ be small in spite of many tags, almost all the slots will be collided. As a result, the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we propose a scheme to allocate the optimal initial $Q_{fp}$ through the tag number estimation before the query round begins. Through computer simulations, it is demonstrated that the proposed scheme achieves more stable performance than Gen-2 Q-algorithm.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.8
• /
• pp.54-63
• /
• 1993

This paper proposes a method for improving the performances of the neural network for optimization by an optimal estimation of initial states. The optimal initial state that leads to the global minimum is estimated by using the stochastic approximation. And then the update rule of Hopfield model, which is the high speed deterministic algorithm using the steepest descent rule, is applied to speed up the optimization. The proposed method has been applied to the tavelling salesman problems and an optimal task partition problems to evaluate the performances. The simulation results show that the convergence speed of the proposed method is higher than conventinal Hopfield model. Abe's method and Boltzmann machine with random initial neuron output setting, and the convergence rate to the global minimum is guaranteed with probability of 1. The proposed method gives better result as the problem size increases where it is more difficult for the randomized initial setting to give a good convergence.

• Communications for Statistical Applications and Methods
• /
• v.7 no.1
• /
• pp.65-86
• /
• 2000

The estimates from an EM when it is applied to a large causal model of 10 or more categorical variables are often subject to the initial values for the estimates. This phenomenon becomes more serious as the model structure becomes more serious as the model structure becomes more complicated involving more variables. In this regard Wu(1983) recommends among others that EMs are implemented several times with different sets of initial values to obtain more appropriate estimates. in this paper a new approach for initial values is proposed. The main idea is that we use initials that are calibrated to data. A simulation result strongly indicates that the calibrated initials give rise to the estimates that are far closer to the true values than the initials that are not calibrated.