• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.3
• /
• pp.639-646
• /
• 1995

The objective of this study is to minimize the weight of a damped anisotropic roto-bearing system considering whirl natural frequency and stability. The system is modeled as an assemblage of rigid disks, flexible shafts and discrete bearings. The system design variables are the crosssectional areas of shaft elements and the properties of bearings. To analyze the system, the polynomial method which is derived by rearranging the calculations performed by a transfer matrix method is adopted. For the optimization, the optimization software IDOL (Integrated Design Optimization Library) which is based on the Augmented Lagrange Multiplier (ALM) method is employed. Also, an analytical design sensitivity analysis of the system is used for high accuracy and efficiency. To demonstrate the usefulness of the proposed optimal design program incorporating analysis, design sensitivity analysis, and optimization modules, a damped anisotropic rotor-bearing system is optimized to obtain 34$ weight reduction.

• The Journal of the Acoustical Society of Korea
• /
• v.27 no.1
• /
• pp.40-46
• /
• 2008

Weak target detection and localization in the presence of loud surface ship noise is a critical problem for matched field processing (MFP) in shallow water. For stationary sources, each signal component of received signal can be separated and interference can be suppressed using eigen space analysis schemes. However, source motion, in realistic cases, causes spreading of signal energies in their subspace. In this case, eigenvalues of target and interfere signal components are mixed and hard to be separated with usual phone space eigenvector decomposition (EVD) approaches. Our technique is based on mode space and utilizes the difference in their physical characteristics of surface and submerged sources. Performing EVD for modal cross spectral density matrix, interference components in the mode amplitude subspace can be classified and eliminated. This technique is demonstrated with synthetic data, and results are discussed.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.4
• /
• pp.30-39
• /
• 2010

Since Diffusion tensor from Diffusion Tensor Magnetic Resonance Imaging(DT-MRI) is so sensitive to noise, the principle eigenvector(PEV) calculated from Diffusion tensor could be erroneous. Tractography obtained from PEV could be deviated from the real fiber tract. Therefore regularization process is needed to eliminate noise. In this paper, to reduce noise in DT-MRI measurements, the Dyadic Sorting(DS) method as regularization of the eigenvalue and the eigenvector is applied in the tractography. To resort the eigenvalues and the eignevectors, the DS method uses the intervoxel overlap function which can measure the overlap between eigenvalue-eigenvector pairs in the $3\times3$ pixel. In this paper, we applied the DS method to the three-dimensional volume. We discuss the error analysis and numerical study to the synthetic and the experimental data. As a result, we have shown that the DS method is more efficient than the median filtering methods as much as 79.97%~83.64%, 85.62%~87.76% in AAE, AFA respectively for the corticospinal tract of the experimental data.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.16 no.5 s.110
• /
• pp.470-478
• /
• 2006

An efficient method for change of eigenvectors and eigenvalues due to the modifying proportional damping structure using sensitivity coefficients is presented. Sensitivity coefficients are determined by iteration with eigenvalue and eigenvectors before modification of system. The proposed method is applied to examples of 3 degrees of freedom system and plate by modifying mass and stiffness. The predicted change of eigenvectors and eigenvalues are in a good agreement with these from the structural re-analysis after modification of mass and stiffness.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1583-1591
• /
• 1998

In this paper, we consider the quasi maximum likelihood(quasi-ML) detector which uses antenna arrays in asynchronous time-varing channels. It is shown that the proposed quasi-ml detector can be regarded as a beamformer followed by a decorrelator: a method based on the eigendecomposition of the correlation matrix of the inverse-filtered signal is proposed to estimate the channel vectors. We also show that the proposed algorithm estimates the channel vector within small mismatch loss in severe propagation environment through computer simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9C
• /
• pp.887-895
• /
• 2009

This paper proposes a cooperative power allocation with the use of partial channel information (e.g., the average signal-to-noise ratio (SNR) and transmit correlation) in multi-cell dual-hop multi-input single-output (MISO) relay systems. In a dual-hop MISO relay channel, it is desirable to allocate the transmit power between dual-hop links to maximize the end-to-end capacity. We consider the maximization of the end-to-end capacity of a dual-hop MISO relay channel under sum-power constraint. The proposed scheme adaptively allocates the transmit power considering the average channel gain of the target relay and the transmit correlation of the desired and inter-relay interference channel from adjacent relays. It is shown by means of upper-bound analysis that the end-to-end capacity can be maximized by making the angle difference of the principal eigenvectors of the desired and inter-relay interference channel orthogonal in highly-correlated channel environments. Finally, the performance of the proposed scheme is verified by computer simulation.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.7
• /
• pp.19-26
• /
• 2010

In this paper, we suggest a efficient handwritten character verification method in on-line environments which automatically analyses two input character string and computes their similarity degrees. The proposed algorithm first applies the circular projection method to input handwritten strings and extracts their representative features including shape, directions, etc. It then calculates the similarity between two character strings by using an improved dynamic time warping (DTW) algorithm. We improved the conventional DTW algorithm efficiently through adopting the branch-and-bound policy to the existing DTW algorithm which is well-known to produce good results in the various optimization problems. The experimental results to verify the performance of the proposed system show that the suggested handwritten character verification method operates more efficiently than the existing DTW and DDTW algorithms in terms of the speed.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.6
• /
• pp.609-616
• /
• 2017

In this paper, we propose an algorithm to obtain more stable and high recognition rate by using left and right rotation information of input image in order to obtain a stable recognition rate in face recognition. The proposed algorithm uses the facial image as the input information in the web camera environment to reduce the size of the image and normalize the information about the brightness and color to obtain the improved recognition rate. We apply Principal Component Analysis (PCA) to the detected candidate regions to obtain feature vectors and classify faces. Also, In order to reduce the error rate range of the recognition rate, a set of data with the left and right $45^{\circ}$ rotation information is constructed considering the directionality of the input face image, and each feature vector is obtained with PCA. In order to obtain a stable recognition rate with the obtained feature vector, it is after scattered in the eigenspace and the final face is recognized by comparing euclidean distant distances to each feature. The PCA-based feature vector is low-dimensional data, but there is no problem in expressing the face, and the recognition speed can be fast because of the small amount of calculation. The method proposed in this paper can improve the safety and accuracy of recognition and recognition rate faster than other algorithms, and can be used for real-time recognition system.