• 인터넷정보학회논문지
• /
• 제14권5호
• /
• pp.59-67
• /
• 2013

본 논문에서는 협업 필터링의 선호도 예측 정확성의 저하를 초래하는 전통적 문제점 중 하나인 데이터 희소성 문제에 강인한 잠재적 속성 선호도 기반 협업 필터링 방법(Latent Attribute Rating-based Collaborative Filtering, LAR_CF)을 제안한다. 기존의 협업 필터링은 객체의 유사성을 판단하기 위한 특징벡터로써 사용자가 명시적으로 평가한 선호도만을 이용하며, 해당 문제 개선을 위해 속성을 사용하는 연구들은 범용적으로 사용하기 어려웠다. 이웃 기반 필터링에 근본을 두는 LAR_CF는 기존의 명시적 선호도와 함께 유사도 평가의 대상이 되는 두 객체의 고유한 속성을 특징벡터로 삼기 때문에 명시적 선호도의 수가 적어서 발생하는 데이터 희소성 문제를 개선하여 선호도 예측 정확도를 향상시키며, 속성의 종류에 구애받지 않고 손쉽게 적용할 수 있는 장점을 가진다. LAR_CF의 유효성 평가를 위해서 MovieLens 100k 데이터세트 및 해당 데이터세트에 사용된 속성정보를 활용하여 일반적 성능 실험과 인공적 데이터 희소성 실험에서 선호도 예측 정확도를 평가한 결과, 제안하는 방법이 데이터 희소 조건에서 선호도 예측 정확도를 향상시킬 수 있음을 확인하였다.

• Journal of information and communication convergence engineering
• /
• 제14권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.

• 한국경영과학회지
• /
• 제10권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
• /
• 제15권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
• /
• 제4권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
• /
• 제45권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.

• 대한전기학회논문지
• /
• 제45권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.

• 정보와 통신
• /
• 제31권11호
• /
• pp.35-45
• /
• 2014

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

• Current Optics and Photonics
• /
• 제5권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.

• 한국정보통신학회논문지
• /
• 제17권11호
• /
• pp.2602-2608
• /
• 2013

영화 추천 문제에 대한 해법으로 사용자 기반 추천 방법과 항목 기반 추천 방법이 연구되어왔다. 그러나 이들은 각각 희박성의 문제와 사용자의 선호도를 반영하지 못한다는 문제를 안고 있다. 이러한 문제들을 해결하기 위해서 유사도의 개념을 이용해 두 가지 방법을 조합하는 연구가 있으나 계산해야 할 파라메타 수가 많아 현실적으로 희박성의 문제에서 자유롭지 못하다. 본 연구에서는 이러한 문제를 보완하기 위하여 항목 간 선호도 차이를 이용한 추천 방법을 제안한다. 이 방법은 계산해야 할 파라메타 수가 적어 희박성의 문제에서 비교적 자유롭다. 또한 파라메타 계산에 사용자들이 평가한 선호도를 반영함으로써 보다 정확한 결과를 얻을 수 있다. 실험 결과 제안된 방법은 초기에는 오류가 크지만 빠르게 성능이 안정화되는 것을 보여준다. 또한 유사도를 이용한 기존의 추천 방법과 비교하여 평균 오류를 0.0538 낮추는 결과를 보였다.