• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.7
• /
• pp.99-106
• /
• 1995

Frequency response functions are of great use in dynamic analysis of structural systems. The present paper proposes an efficient method for computation of the frequency rewponse functions of linear structural dynamic models with a sparse, non-proportional damping matrix. An exact condensation procedure is proposed which enables the present method to condense the matrices without resulting in any errors. Also, an iterative scheme is proposed to be able to avoid matrix inversion in computing frequency response matrix. The proposed method is illustrated through a numerical example.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.10
• /
• pp.2252-2258
• /
• 2013

In this paper, parallel orthogonal matching pursuit (POMP) is proposed to supplement the simultaneous orthogonal matching pursuit (S-OMP) which has been widely used as a greedy algorithm for sparse signal recovery for multiple measurement vector (MMV) problem. The process of POMP is simple but effective: (1) multiple indexes maximally correlated with the observation vector are chosen at the first iteration, (2) the conventional S-OMP process is carried out in parallel for each selected index, (3) the index set which yields the minimum residual is selected for reconstructing the original sparse signal. Empirical simulations show that POMP for MMV outperforms than the conventional S-OMP both in terms of exact recovery ratio (ERR) and mean-squared error (MSE).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.8
• /
• pp.1784-1789
• /
• 2013

In this paper, parallel orthogonal matching pursuit (POMP) is proposed to supplement the orthogonal matching pursuit (OMP) which has been widely used as a greedy algorithm for sparse signal recovery. The process of POMP is simple but effective: (1) multiple indexes maximally correlated with the observation vector are chosen at the firest iteration, (2) the conventional OMP process is carried out in parallel for each selected index, (3) the index set which yields the minimum residual is selected for reconstructing the original sparse signal. Empirical simulations show that POMP outperforms than the existing sparse signal recovery algorithms in terms of exact recovery ratio (ERR) for sparse pattern and mean-squared error (MSE) between the estimated signal and the original signal.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.8
• /
• pp.1452-1459
• /
• 2016

Compressed sensing is a signal processing technique for efficiently acquiring and reconstructing in and under Nyquist rate representation. Generally, the measurement prediction usually works well with a small block while the quality of recovery is known to be better with a large block. In order to overcome this dilemma, conventional research works use a structural measurement matrix with which compressed sensing is done in a small block size but recovery is performed in a large block size. In this way, both prediction and recovery are made to be improved at same time. However, the conventional researches did not compare the performances of the structural measurement matrix, affected by the block size. In this paper, by expanding a structural measurement matrix of conventional works, their performances are compared with different block sizes. Experimental results show that a structural measurement matrix with $4{\times}4$ Hadamard transform matrix provides superior performance in block size 4.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1557-1564
• /
• 2014

In this paper, we propose a signal detection technique based on the parallel orthogonal matching pursuit (POMP) is proposed for generalized shift space keying (GSSK) systems, which is a modified version of the orthogonal matching pursuit (OMP) that is widely used as a greedy algorithm for sparse signal recovery. The signal recovery problem in the GSSK systems is similar to that in the compressed sensing (CS). In the proposed POMP technique, multiple indexes which have the maximum correlation between the received signal and the channel matrix are selected at the first iteration, while a single index is selected in the OMP algorithm. Finally, the index yielding the minimum residual between the received signal and the M recovered signals is selected as an estimate of the original transmitted signal. POMP with Quantization (POMP-Q) is also proposed, which combines the POMP technique with the signal quantization at each iteration. The proposed POMP technique induces the computational complexity M times, compared with the OMP, but the performance of the signal recovery significantly outperform the conventional OMP algorithm.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.5
• /
• pp.999-1011
• /
• 2013

In this research, we propose a document recommendation method which can find documents that are relatively important to a specific document based on citation information. The key idea is parameter tuning in the Neumann kernal which is an intermediate between a measure of importance (HITS) and of relatedness (co-citation). Our method properly selects the tuning parameter ${\gamma}$ in the Neumann kernal minimizing the prediction error in future citation. We also discuss some comutational issues needed for analysing large citation data. Finally, results of analyzing patents data from the US Patent Office are given.

• Journal of Korea Society of Industrial Information Systems
• /
• v.21 no.3
• /
• pp.21-28
• /
• 2016

Compressed sensing is a signal processing technique for efficiently acquiring and reconstructing in an under-sampled (i.e., under Nyquist rate) representation. Specially, a block compressed sensing with Smoothed Projected Landweber (BCS-SPL) framework is one of the most widely used schemes. Currently, a variety of BCS-SPL schemes have been actively studied. However, when restoring, block sizes have effects on the reconstructed visual qualities, and in this paper, both a basic scheme of BCS-SPL and several modified schemes of BCS-SPL with structured measurement matrix are analyzed for the effects of the block sizes on the performances of reconstructed image qualities. Through several experiments, it is shown that a basic scheme of BCS-SPL provides superior performance in block size 4.

• The Korean Journal of Applied Statistics
• /
• v.35 no.2
• /
• pp.327-333
• /
• 2022

Principal component analysis (PCA) is the most widely used technique in dimension reduction, however, it is very sensitive to outliers. A robust version of PCA, called robust PCA, was suggested by two seminal papers by Candès et al. (2011) and Chandrasekaran et al. (2011). The robust PCA is an essential tool in the artificial intelligence such as background detection, face recognition, ranking, and collaborative filtering. Also, the robust PCA receives a lot of attention in statistics in addition to computer science. In this paper, we introduce recent algorithms for the robust PCA and give some illustrative examples.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.5A
• /
• pp.861-872
• /
• 2006

The element free Galerkin method is extended by the local partition of unity method to model the cohesive cracks in two dimensional continuum. The shape function of a particle whose domain of influence is completely cut by a crack is enriched by the step enrichment function. If the domain of influence contains a crack tip inside, it is enriched by a branch enrichment function which does not have the LEFM stress singularity. The discrete equations are obtained directly from the standard Galerkin method since the enrichment is only for the displacement field, which satisfies the local partition of unity. Because only particles whose domains of influence are influenced by a crack are enriched, the system matrix is still sparse so that the increase of the computational cost is minimized. The condition for crack growth in dynamic problems is obtained from the material instability; when the acoustic tensor loses the positive definiteness, a cohesive crack is inserted to the point so as to change the continuum to a discontiuum. The crack speed is naturally obtained from the criterion. It is found that this method is more accurate and converges faster than the classical meshless methods which are based on the visibility concept. In this paper, several well-known static and dynamic problems were solved to verify the method.