• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.59-67
• /
• 2013

In this paper, we propose the LAR_CF, latent attribute rating-based collaborative filtering, that is robust to data sparsity problem which is one of traditional problems caused of decreasing rating prediction accuracy. As compared with that existing collaborative filtering method uses a preference rating rated by users as feature vector to calculate similarity between objects, the proposed method improves data sparsity problem using unique attributes of two target objects with existing explicit preference. We consider MovieLens 100k dataset and its item attributes to evaluate the LAR_CF. As a result of artificial data sparsity and full-rating experiments, we confirmed that rating prediction accuracy can be improved rating prediction accuracy in data sparsity condition by the LAR_CF.

• Journal of information and communication convergence engineering
• /
• v.14 no.2
• /
• pp.129-135
• /
• 2016

In this paper, we present a novel algorithm for image-based maritime obstacle detection using global sparsity potentials (GSPs), in which "global" refers to the entire sea area. The horizon line is detected first to segment the sea area as the region of interest (ROI). Considering the geometric relationship between the camera and the sea surface, variable-size image windows are adopted to sample patches in the ROI. Then, each patch is represented by its texture feature, and its average distance to all the other patches is taken as the value of its GSP. Thereafter, patches with a smaller GSP are clustered as the sea surface, and patches with a higher GSP are taken as the obstacle candidates. Finally, the candidates far from the mean feature of the sea surface are selected and aggregated as the obstacles. Experimental results verify that the proposed approach is highly accurate as compared to other methods, such as the traditional feature space reclustering method and a state-of-the-art saliency detection method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.10 no.1
• /
• pp.14-30
• /
• 1985

Recently, multiple criteria decision making has been well established as a practical approach to seek a satisfactory solution to a decision making problem. Goal programming is one of the most powerful MCDM tools with satisfying operational assumptions that reflect the actual decision making process in real-world situations. In this paper we propose an efficient method implemented on a microcomputer for solving linear goal programming problems. It is an iterative revised goal simplex method using the sparsity technique. We design as interactive software package for microcomputers based on this method. From some computational experiences, we can state that the revised iterative goal simplex method using the sparsity technique is the most efficient one for microcomputer for solving goal programming problems.

• Journal of Communications and Networks
• /
• v.15 no.5
• /
• pp.443-456
• /
• 2013

Compressive sensing (CS) is a novel sampling paradigm that samples signals in a much more efficient way than the established Nyquist sampling theorem. CS has recently gained a lot of attention due to its exploitation of signal sparsity. Sparsity, an inherent characteristic of many natural signals, enables the signal to be stored in few samples and subsequently be recovered accurately, courtesy of CS. This article gives a brief background on the origins of this idea, reviews the basic mathematical foundation of the theory and then goes on to highlight different areas of its application with a major emphasis on communications and network domain. Finally, the survey concludes by identifying new areas of research where CS could be beneficial.

• Structural Monitoring and Maintenance
• /
• v.4 no.4
• /
• pp.381-396
• /
• 2017

Structural health monitoring (SHM) is a necessity for reliable and efficient functioning of engineering systems. Damage detection (DD) is a crucial component of any SHM system. Lamb waves are a popular means to DD owing to their sensitivity to small damages over a substantial length. This typically involves an active sensing paradigm in a pitch-catch setting, that involves two piezo-sensors, a transmitter and a receiver. In this paper, we propose a data-intensive DD approach for beam structures using high frequency signals acquired from beams in a pitch-catch setting. The key idea is to develop a statistical learning-based approach, that harnesses the inherent sparsity in the problem. The proposed approach performs damage detection, localization in beams. In addition, quantification is possible too with prior calibration. We demonstrate numerically that the proposed approach achieves 100% accuracy in detection and localization even with a signal to noise ratio of 25 dB.

• ETRI Journal
• /
• v.45 no.3
• /
• pp.379-393
• /
• 2023

Underwater communication (UWC) is widely used in coastal surveillance and early warning systems. Precise channel estimation is vital for efficient and reliable UWC. The sparse direct-adaptive filtering algorithms have become popular in UWC. Herein, we present an improved adaptive convex-combination method for the identification of sparse structures using a reweighted normalized leastmean-square (RNLMS) algorithm. Moreover, to make RNLMS algorithm independent of the reweighted l₁-norm parameter, a modified sparsity-aware adaptive zero-attracting RNLMS (AZA-RNLMS) algorithm is introduced to ensure accurate modeling. In addition, we present a quantitative analysis of this algorithm to evaluate the convergence speed and accuracy. Furthermore, we derive an excess mean-square-error expression that proves that the AZA-RNLMS algorithm performs better for the harsh underwater channel. The measured data from the experimental channel of SPACE08 is used for simulation, and results are presented to verify the performance of the proposed algorithm. The simulation results confirm that the proposed algorithm for underwater channel estimation performs better than the earlier schemes.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.45 no.3
• /
• pp.329-334
• /
• 1996

Power system is becoming more and more complex and large Existing procedural programming technique can't cope with software flexibility and maintenance problems. So, Object-Oriented Programming (OOP) is increasingly used to solve these problems. OOP in power system analysis field has been greatly developed. This paper applies OOP in power flow analysis, and presents new algorithm which uses only a Jacobian to solve mismatch equations, and introduces a new sparse matrix storage method which is different from existing method. (author). 11 refs., 12 figs., 3 tabs.

• Information and Communications Magazine
• /
• v.31 no.11
• /
• pp.35-45
• /
• 2014

주성분 분석 기법(PCA)는 가장 널리 사용되는 데이터 차원 감소 (dimensionality reduction) 기법으로 알려져 있다. 하지만 데이터에 이상점 (outlier)가 존재하는 환경에서는 성능이 크게 저하된다는 단점을 가지고 있다. Rank-Sparsity(Robust PCA) 기법은 주어진 행렬을 low-rank 행렬과 저밀도(sparse)행렬의 합으로 분해하는 방식으로, 이상점이 많은 환경에서 PCA기법을 효과적으로 대체할 수 있는 알고리즘으로 알려져 있다. 본 고에서는 RPCA 기법을 간략히 소개하고, 그의 적용분야, 및 알고리즘에 관한 연구들을 대해서 알아본다.

• Current Optics and Photonics
• /
• v.5 no.6
• /
• pp.672-679
• /
• 2021

We propose a high-speed layer-based algorithm for synthesizing computer-generated holograms (CGHs), featuring sparsity-based image segmentation and computational parallelism. The sparsity-based image segmentation of layer-based three-dimensional scenes leads to considerable improvement in the efficiency of CGH computation. The efficiency enhancement of the proposed algorithm is ascribed to the field localization of the fast Fourier transform (FFT), and the consequent reduction of FFT computational complexity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2602-2608
• /
• 2013

User-based and item-based method have been developed as the solutions of the movie recommendation problem. However, these methods are faced with the sparsity problem and the problem of not reflecting user's rating respectively. In order to solve these problems, there is a research on the combination of the two methods using the concept of similarity. In reality, it is not free from the problem of sparsity, since it has a lot of parameters to be calculated. In this study, we propose a recommendation method using rating difference between items in order to complement this problem. This method is relatively free from the problem of sparsity, since it has less parameters to be calculated. And it can get more accurate results by reflecting the users rating to calculate the parameters. In experiments for the proposed method, the initial error is large, but the performance has been quickly stabilized after. In addition, it showed a 0.0538 lower average error compared to the existing method using similarity.