• 한국자동차공학회논문집
• /
• 제11권5호
• /
• pp.210-218
• /
• 2003

MDO (multidisciplinary design optimization) technology has been proposed and applied to solve large and complex optimization problems where multiple disciplinaries are involved. In this research. an MDO problem is defined for automobile design which has crashworthiness analyses. Crash model which are consisted of airbag, belt integrated seat (BIS), energy absorbing steering system .and safety belt is selected as a practical example for MDO application to vehicle system. Through disciplinary analysis, vehicle system is decomposed into structure subspace and occupant subspace, and coupling variables are identified. Before subspace optimization, values of coupling variables at given design point must be determined with system analysis. The system analysis in MDO is very important in that the coupling between disciplines can be temporary disconnected through the system analysis. As a result of system analysis, subspace optimizations are independently conducted. However, in vehicle crash, system analysis methods such as Newton method and fixed-point iteration can not be applied to one. Therefore, new system analysis algorithm is developed to apply to crashworthiness. It is conducted for system analysis to determine values of coupling variables. MDO algorithm which is applied to vehicle crash is MDOIS (Multidisciplinary Design Optimization Based on Independent Subspaces). Then, structure and occupant subspaces are independently optimized by using MDOIS.

• 대한수학회논문집
• /
• 제33권1호
• /
• pp.157-164
• /
• 2018

A $C_0$-semigroup ${\tau}=(T_t)_{t{\geq}0}$ on a Banach space X is called subspace-supercyclic for a subspace M, if $\mathbb{C}Orb({\tau},x){\bigcap}M=\{{\lambda}T_tx\;:\;{\lambda}{\in}\mathbb{C},\;t{\geq}0\}{\bigcap}M$ is dense in M for a vector $x{\in}M$. In this paper we characterize the notion of subspace-supercyclic $C_0$-semigroup. At the same time, we also provide a subspace-supercyclicity criterion $C_0$-semigroup and offer two equivalent conditions of this criterion.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -1
• /
• pp.698-701
• /
• 2002

Subspace analysis (which includes PCA) seeks for feature subspace (which corresponds to the eigenspace), given multivariate input data and has been widely used in computer vision and pattern recognition. Typically data space belongs to very high dimension, but only a few principal components need to be extracted. In this paper I present a fast sequential algorithm for subspace analysis or tracking. Useful behavior of the algorithm is confirmed by numerical experiments.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2002년도 가을 학술발표논문집 Vol.29 No.2 (2)
• /
• pp.301-303
• /
• 2002

Subspace analysis is a popular method for multivariate data analysis and is closely related to factor analysis and principal component analysis (PCA). In the context of image processing (especially positron emission tomography), all data points are nonnegative and it is expected that both basis images and factors are nonnegative in order to obtain reasonable result. In this paper We present a sequential EM algorithm for rectified subspace analysis (subspace in nonnegativity constraint) and apply it to dynamic PET image analysis. Experimental results show that our proposed method is useful in dynamic PET image analysis.

• 대한의용생체공학회:의공학회지
• /
• 제31권6호
• /
• pp.456-463
• /
• 2010

In the present study, we proposed a new subspace scanning algorithm to enhance the spatial resolution of electroencephalography (EEG) and magnetoencephalography(MEG) source localization. Subspace scanning algorithms, represented by the multiple signal classification (MUSIC) algorithm and the first principal vector (FINE) algorithm, have been widely used to localize asynchronous multiple dipolar sources in human cerebral cortex. The conventional MUSIC algorithm used principal component analysis (PCA) to extract the noise vector subspace, thereby having difficulty in discriminating two or more closely-spaced cortical sources. The FINE algorithm addressed the problem by using only a part of the noise vector subspace, but there was no golden rule to determine the number of noise vectors. In the present work, we estimated a non-orthogonal signal vector set using independent component analysis (ICA) instead of using PCA and performed the source scanning process in the signal vector subspace, not in the noise vector subspace. Realistic 2D and 3D computer simulations, which compared the spatial resolutions of various algorithms under different noise levels, showed that the proposed ICA-MUSIC algorithm has the highest spatial resolution, suggesting that it can be a useful tool for practical EEG/MEG source localization.

• Structural Engineering and Mechanics
• /
• 제59권1호
• /
• pp.187-207
• /
• 2016

Practical ambient excitations of engineering structures usually do not comply with the stationary-white-noise assumption in traditional operational modal analysis methods due to heavy traffic, wind guests, and other disturbances. In order to eliminate spurious modes induced by non-white noise inputs, the improved stochastic subspace identification based on a delay index is proposed in this paper for a representative kind of stationary non-white noise ambient excitations, which have nonzero autocorrelation values near the vertical axis. It relaxes the stationary-white-noise assumption of inputs by avoiding corresponding unqualified elements in the Hankel matrix. Details of the improved stochastic subspace identification algorithms and determination of the delay index are discussed. Numerical simulations on a four-story frame and laboratory vibration experiments on a simply supported beam have demonstrated the accuracy and reliability of the proposed method in eliminating spurious modes under non-white noise ambient excitations.

• 한국음향학회지
• /
• 제27권7호
• /
• pp.372-378
• /
• 2008

음성 검출기 (VAD, Voice Activity Detector)는 이동 통신이나 음성신호처리 등에 매우 중요한 기법으로 사용된다. 일반적인 음성 검출방식은 이산 푸리에 변환 (DFT, Discrete Fourier Transform)영역에서 통계적인 모델을 기반으로 하여 우도비검정 (LRT, Likelihood Ratio Test)을 하게 된다. 그리고 이 값을 임계값과 비교하며 음성인지 아닌지 판단하게 된다. 본 논문에서는 신호 준공간 (Signal Subspace)에 기반한 새로운 통계적 음성 검출 기법을 제안하다. 확률적인 주성분 분석 (PPCA, Probabilistic Principal Component Analysis)은 신호 준공간 방법에서 잡음신호에 대한 확률적인 모델을 얻기 위해 사용된다. 제안된 기법은 신호 준공간 영역에서 우도비검정에 기반을 두는 결정규칙을 적용하였다. 음성 검출 실험 결과는 신호 준공간 모델에 근거한 음성 검출기 기법이 주파수 영역에 기반한 가우시안 (Gaussian) 음성 검출기 보다 향상된 검출 결과를 보여준다.

• 로봇학회논문지
• /
• 제3권4호
• /
• pp.300-307
• /
• 2008

This paper is concerned with face recognition for human-robot interaction (HRI) in robot environments. For this purpose, we use Tensor Subspace Analysis (TSA) to recognize the user's face through robot camera when robot performs various services in home environments. Thus, the spatial correlation between the pixels in an image can be naturally characterized by TSA. Here we utilizes face database collected in u-robot test bed environments in ETRI. The presented method can be used as a core technique in conjunction with HRI that can naturally interact between human and robots in home robot applications. The experimental results on face database revealed that the presented method showed a good performance in comparison with the well-known methods such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) in distant-varying environments.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2004년도 춘계학술대회논문집
• /
• pp.784-787
• /
• 2004

Modified version of subspace iteration method using accelerated starting vectors is proposed to efficiently calculate free vibration modes of structures. Proposed method employs accelerated Lanczos starting vectors that can reduce the number of iterations in the subspace iteration method. Proposed method is more efficient than the conventional method when the number of required modes is relatively small. To verify the efficiency of proposed method, two numerical examples are presented.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2003년도 가을 학술발표회 논문집
• /
• pp.503-508
• /
• 2003

This paper proposes modified subspace iteration method for efficient frequency analysis of structures. Proposed method uses accelerated Lanczos vectors as starting vectors in order to reduce the number of iterations in the subspace iteration method. Proposed method has better computing efficiency than the conventional method when the number of desired frequencies is relatively small. The efficiency of proposed method is verified through numerical examples.