• Korean Journal of Optics and Photonics
• /
• v.4 no.4
• /
• pp.363-372
• /
• 1993

An optimization technique with variable orthogonalization and SVD(singular value decomposition) is examined in a double-Gauss type photographic lens design and its convergence and stability are compared with ordinary least squares and DLS(damped least squares) method. It is known that there are close relationship between the stability of optimization and condition number of nomal equation, the ratio between maximum and minimum of eigenvalues. In this study, the stability is greatly improved by limiting the condition number, the SVD, as expeded. The case of DLS with small damping, orthogonalization and SVD shows the most rapid convergence and stability. It means that the unstability of DLS method with small damping is overcome by using the variable orthogonalization and SVD.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.2
• /
• pp.49-57
• /
• 2010

This paper proposes a Korean document. categorization algorithm using Back Propagation Neural Network(BPNN) with Singular Value Decomposition(SVD). BPNN makes a network through its learning process and classifies documents using the network. The main difficulty in the application of BPNN to document categorization is high dimensionality of the feature space of the input documents. SVD projects the original high dimensional vector into low dimensional vector, makes the important associative relationship between terms and constructs the semantic vector space. The categorization algorithm is tested and compared on HKIB-20000/HKIB-40075 Korean Text Categorization Test Collections. Experimental results show that BPNN algorithm with SVD achieves high effectiveness for Korean document categorization.

• Journal of KIISE:Software and Applications
• /
• v.29 no.4
• /
• pp.248-257
• /
• 2002

Clustering is a method for grouping objects with similar properties into a same cluster. SVD(Singular Value Decomposition) is known as an efficient preprocessing method for clustering because of dimension reduction and noise elimination for a high dimensional and sparse data set like E-Commerce data set. However, it is hard to evaluate the worth of original attributes because of information loss of a converted data set by SVD. This research proposes a cluster feature selection method, called ENTROPY-SVD, to find important attributes for each cluster based on entropy weighting and SVD. Using SVD, one can take advantage of the latent structures in the association of attributes with similar objects and, using entropy weighting one can find highly dense attributes for each cluster. This paper also proposes a model-based collaborative filtering recommendation system with ENTROPY-SVD, called CFS-CF and evaluates its efficiency and utilization.

• 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.

• Biomedical Science Letters
• /
• v.11 no.2
• /
• pp.129-134
• /
• 2005

Three different deconvolution techniques for quantifying cerebral blood flow (CBF) from whole brain $T2^{\ast}-weighted$ bolus tracking images were implemented (parametric Fourier transform P-FT, parametric single value decomposition P-SVD and nonparametric single value decomposition NP-SVD). The techniques were tested on 206 regions from 38 hyperacute stroke patients. In the P-FT and P-SVD techniques, the tissue and arterial concentration time curves were fit to a gamma variate function and the resulting CBF values correlated very well $(CBF_{P-FT}\;=\;1.02{\cdot}CBF_{p-SVD},\;r^2\;=\;0.96)$. The NP-SVD CBF values correlated well with the P-FT CBF values only when a sufficient number of time series volumes were acquired to minimize tracer time curve truncation $(CBF_{P-FT}\;=\;0.92{\cdot}CBF_{NP-SVD},\;r^2\;=\;0.88)$. The correlation between the fitted CBV and the unfitted CBV values was also maximized in regions with minimal tracer time curve truncation $(CBV_{fit}\;=\;1.00{\cdot}CBV_{ Unfit},\;^r^2\;=\;0.89)$. When a sufficient number of time series volumes could not be acquired (due to scanner limitations) to avoid tracer time curve truncation, the P-FT and P-SVD techniques gave more reliable estimates of CBF than the NP-SVD technique.

• Journal of Broadcast Engineering
• /
• v.21 no.2
• /
• pp.149-156
• /
• 2016

We proposed a blind watermarking scheme using singular vectors based on Discrete Wavelet Transform (DWT) and Redundant Discrete Wavelet Transform (RDWT) combined with Singular Value Decomposition (SVD) for copyright protection application. We replaced the 1st left and right singular vectors decomposed from cover image with the corresponding ones from watermark image to overcome the false-positive problem in current watermark systems using SVD. The proposed scheme realized the watermarking system without a false positive problem, and shows high fidelity and robustness.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.4
• /
• pp.413-419
• /
• 1998

A novel order-reduction technique for model predictive control(MPC) is proposed based on the singular value decomposition(SVD) of a pulse response circulant matrix(PRCM) of a concerned system. It is first investigated that the PRCM (in the limit) contains a complete information of the frequency response of a system and its SVD decomposes the information into the respective principal directions at each frequency. This enables us to isolate the significant modes of the system and to devise the proposed order-reduction technique. Though the primary purpose of the proposed technique is to diminish the required computation in MPC, the clear frequency decomposition of the SVD of the PRCM also enables us to improve the robustness through selective excitation of frequency modes. Performance of the proposed technique is illustrated through two numerical examples.

• Journal of the Korean Magnetic Resonance Society
• /
• v.4 no.2
• /
• pp.116-124
• /
• 2000

Singular value decomposition (SVD) has been used during past few decades in the advanced NMR data processing and in many applicable areas. A new modified SVD, piecewise polynomial truncated SVD (PPTSVD) was developed far the large solvent peak suppression and noise elimination in U signal processing. PPTSVD consists of two algorithms of truncated SVD (TSVD) and L$_1$ problems. In TSVD, some unwanted large solvent peaks and noises are suppressed with a certain son threshold value while signal and noise in raw data are resolved and eliminated out in L$_1$ problem routine. The advantage of the current PPTSVD method compared to many SVD methods is to give the better S/N ratio in spectrum, and less time consuming job that can be applicable to multidimensional NMR data processing.

• Bulletin of the Korean Chemical Society
• /
• v.24 no.7
• /
• pp.971-974
• /
• 2003

By utilizing singular value decomposition (SVD) and shift averaged Harr wavelet transform (WT) with a set of Daubechies wavelet coefficients (1/2, -1/2), a method that can simultaneously eliminate an unwanted large solvent peak and noise peaks from NMR data has been developed. Noise elimination was accomplished by shift-averaging the time domain NMR data after a large solvent peak was suppressed by SVD. The algorithms took advantage of the WT, giving excellent results for the noise elimination in the Gaussian type NMR spectral lines of NMR data pretreated with SVD, providing superb results in the adjustment of phase and magnitude of the spectrum. SVD and shift averaged Haar wavelet methods were quantitatively evaluated in terms of threshold values and signal to noise (S/N) ratio values.

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

This paper describes an implementation of inverse filter using SVD in order to recover the input in multi-channel system. The matrix formulation in SISO system is extended to MIMO system. In time and frequency domain we investigates the inversion of minimum phase system and non-minimum phase system. To execute an effective inversion of non-minimum phase system, SVD is introduced. First of all we computes singular values of system matrix and then investigates the phase property of system. In case of overall system is non-minimum phase, system matrix has one (or more) very small singular value (s). The very small singular value (s) carries information about phase properties of system. Using this property, approximate inverse filter of overall system is founded. The numerical simulation shows potentials in use of the inverse filter.