• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.47-50
• /
• 2001

This paper took advantage of SVD (Singular value Decomposition) techniques of LSI(Latent Semantic Indexing) to grasp easily terminology distribution. Existent LSI did to static database, propose that apply to dynamic database in this paper. But, if dynamic applies LSI to database, updating problem happens. Existent updating way is Recomputing method, Folding-in method, SVD-updating method. Proposed QR decomposition method to show performance improvement than existent three methods in this paper.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.6
• /
• pp.1461-1470
• /
• 2016

In side channel analysis, signal processing techniques can be used as preprocessing to enhance the efficiency and performance of analysis by reducing the noise or compressing the dimension. As signal processing techiniques using singular value decomposition can increase the information of main signal and reduce the noise by using the variance and tendency of signal, it is a great help to improve the performance of analysis. Typical techniques of that are PCA(Principal Component Analysis), LDA(Linear Discriminant Analysis) and SSA(Singular Spectrum Analysis). PCA and LDA can compress the dimension with increasing the information of main signal, and SSA reduces the noise by decomposing the signal into main siganl and noise. When applying each one or combination of these techniques, it is necessary to compare the performance. Therefore, it needs to suggest methodology of that. In this paper, we compare the performance of the three technique and propose using Sinal-to-Noise Ratio(SNR) as the methodology. Through the proposed methodology and various experiments, we confirm the performance and efficiency of each technique. This will provide useful information to many researchers in the field of side channel analysis.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.165-170
• /
• 2013

In spatial, desired target direction of arrival estimation is to find a incidental signal direction on receive antennas. In this paper, we were an estimation a desired target direction of arrival using maximum likelihood method. Direction of arrival estimation method estimated a desired target calculating the maximum likelihood sensitivity using singular value decomposition above threshold signals among receive signals in maximum likelihood method. Through simulation, we were analysis a performance to compare existing method and proposal method. In direction of arrival estimation, proposed method is effectivity to decrease processing time because it is not doing an eigen decomposition in direction of arrival estimation, and desired target correctly estimated. We showed that proposal method improve more target estimation than general method.

• Journal of Distribution Science
• /
• v.14 no.9
• /
• pp.25-29
• /
• 2016

Purpose - Finding top K persuaders in consumer network is an important problem in marketing. Recently, a new method of computing persuasion scores, interpreted as fixed point or stable distribution for given persuasion probabilities, was proposed. Top K persuaders are chosen according to the computed scores. This research proposed a new definition of persuasion scores relaxing some conditions on the matrix of probabilities, and a method to identify top K persuaders based on the defined scores. Research design, data, and methodology - A new method of computing top K persuaders is computed by singular value decomposition (SVD) of the matrix which represents persuasion probabilities between entities. Results - By testing a randomly generated instance, it turns out that the proposed method is essentially different from the previous study sharing a similar idea. Conclusions - The proposed method is shown to be valid with respect to both theoretical analysis and empirical test. However, this method is limited to the category of persuasion scores relying on the matrix-form of persuasion probabilities. In addition, the strength of the method should be evaluated via additional experiments, e.g., using real instances, different benchmark methods, efficient numerical methods for SVD, and other decomposition methods such as NMF.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.3
• /
• pp.163-168
• /
• 2011

In this paper, we proposed non-linear gamma curve algorithm for gamma correction. The previous non-linear gamma curve algorithm is generated by the least square polynomial using the Gauss-Jordan inverse matrix. However, the previous algorithm has some weak points. When calculating coefficients using inverse matrix of higher degree, occurred truncation errors. Also, only if input sample points are existed regular interval on 10-bit scale, the least square polynomial is accurately works. To compensate weak-points, we calculated accurate coefficients of polynomial using eigenvalue and orthogonal value of mat11x from singular value decomposition (SVD) and QR decomposition of vandemond matrix. Also, we used input data part segmentation, then we performed polynomial curve fitting and merged curve fitting results. When compared the previous method and proposed method using the mean square error (MSE) and the standard deviation (STD), the proposed segmented polynomial curve fitting is highly accuracy that MSE under the least significant bit (LSB) error range is approximately $10^{-9}$ and STD is about $10^{-5}$.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2112-2115
• /
• 2005

This paper considers the synthesis of non-fragile $H_{\infty}$ state feedback controllers for singular systems and static state feedback controller with multiplicative uncertainty. The sufficient condition of controller existence, the design method of non-fragile $H_{\infty}$ controller, and the measure of non-fragility in controller are presented via LMI(linear matrix inequality) technique. Also, through singular value decomposition, some changes of variables, and Schur complements, the sufficient condition can be rewritten as LMI form in terms of transformed variables. Therefore, the obtained non-fragile $H_{\infty}$ controller guarantees the asymptotic stability and disturbance attenuation of the closed loop singular systems within a prescribed degree. Finally, a numerical example is given to illustrate the design method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.12
• /
• pp.8455-8461
• /
• 2015

In this paper, we propose new search algorithms using SVD(Singular Value Decomposition) for fast search of Raman spectrum. In the proposed algorithms, small number of the eigen vectors obtained by SVD are chosen in accordance with their respective significance to achieve computation reduction. By introducing pilot test, we exclude large number of data from search and then, we apply partial distance search(PDS) for further computation reduction. We prepared 14,032 kinds of chemical Raman spectrum as the library for comparisons. Experiments were carried out with 7 methods, that is Full Search, PDS, 1DMPS modified MPS for applying to 1-dimensional space data with PDS(1DMPS+PDS), 1DMPS with PDS by using descending sorted variance of data(1DMPS Sort with Variance+PDS), 250-dimensional components of the SVD with PDS(250SVD+PDS) and proposed algorithms, PSP and PSSP. For exact comparison of computations, we compared the number of multiplications and additions required for each method. According to the experiments, PSSP algorithm shows 64.8% computation reduction when compared with 250SVD+PDS while PSP shows 157% computation reduction.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.5
• /
• pp.2393-2399
• /
• 2013

In this paper, we proposed a method to screening of Alzheimer's disease (AD) from Raman spectra of platelet with synthesis of basis spectra using singular value decomposition (SVD). Raman spectra of platelet from AD transgenic mice are preprocessed with denoising, removal background and normalization method. The column vectors of each data matrix consist of Raman spectrum of AD and normal (NR). The matrix is factorized using SVD algorithm and then the basis spectra of AD and NR are determined by 12 column vectors of each matrix. The classification process is completed by select the class that minimized the root-mean-square error between the validation spectrum and the linear synthesized spectrum of the basis spectra. According to the experiments involving 278 Raman spectra, the proposed method gave about 97.6% classification rate, which is better performance about 6.1% than multi-layer perceptron (MLP) with extracted features using principle components analysis (PCA). The results show that the basis spectra using SVD is well suited for the diagnosis of AD by Raman spectra from platelet.

• Journal of KIISE:Software and Applications
• /
• v.36 no.2
• /
• pp.169-177
• /
• 2009

In this paper, we propose a new shot boundary detection method which is optimized for news video story parsing. This new news shot boundary detection method was designed to satisfy all the following requirements: 1) minimizing the incorrect data in data set for anchor shot detection by improving the recall ratio 2) detecting abrupt cuts and gradual transitions with one single algorithm so as to divide news video into shots with one scan of data set; 3) classifying shots into static or dynamic, therefore, reducing the search space for the subsequent stage of anchor shot detection. The proposed method, based on singular value decomposition with incremental clustering and mercer kernel, has additional desirable features. Applying singular value decomposition, the noise or trivial variations in the video sequence are removed. Therefore, the separability is improved. Mercer kernel improves the possibility of detection of shots which is not separable in input space by mapping data to high dimensional feature space. The experimental results illustrated the superiority of the proposed method with respect to recall criteria and search space reduction for anchor shot detection.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.40 no.3
• /
• pp.99-108
• /
• 2003

This paper is concerned with the problem of designing a guaranteed cost state feedback controller for singular systems with time-varying delays. The sufficient condition for the existence of guaranteed cost controller, the controller design method, and the optimization problem to get the upper bound of guaranteed cost function are proposed by LMI(linear matrix inequality), singular value decomposition, Schur complements, and change of variables. Since the obtained sufficient conditions can be changed to LMI form, all solutions including controller gain and the upper bound of guaranteed cost function can be obtained simultaneously. Moreover, the proposed controller design method can be extended to the problem of robust guaranteed cost controller design method for singular systems with parameter uncertainties and time-varying delays. The validity of the proposed design algorithm is investigated through a numerical example.