• KNOM Review
• /
• v.24 no.2
• /
• pp.24-34
• /
• 2021

Service providers using edge computing provide a high level of service. As a result, devices store important information in inner storage and have become a target of the latest cyberattacks, which are more difficult to detect. Although experts use a security system such as intrusion detection systems, the existing intrusion systems have low detection accuracy. Therefore, in this paper, we proposed a machine learning model for more accurate intrusion detections of devices in edge computing. The proposed model is a hybrid model that combines a stacked sparse autoencoder (SSAE) and a convolutional neural network (CNN) to extract important feature vectors from the input data using sparsity constraints. To find the optimal model, we compared and analyzed the performance as adjusting the sparsity coefficient of SSAE. As a result, the model showed the highest accuracy as a 96.9% using the sparsity constraints. Therefore, the model showed the highest performance when model trains only important features.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.283-296
• /
• 2005

It is well known that the ordering of the unknowns can have a significant effect on the convergence of a preconditioned iterative method and on its implementation on a parallel computer. To do so, we introduce a block red-black coloring to increase the degree of parallelism in the application of the block ILU preconditioner for solving sparse matrices, arising from convection-diffusion equations discretized using the finite difference scheme (five-point operator). We study the preconditioned PGMRES iterative method for solving these linear systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2650-2662
• /
• 2012

Due to the semantic gap issue, the performance of automatic image annotation is still far from satisfactory. Active learning approaches provide a possible solution to cope with this problem by selecting most effective samples to ask users to label for training. One of the key research points in active learning is how to select the most effective samples. In this paper, we propose a novel active learning approach based on sparse graph. Comparing with the existing active learning approaches, the proposed method selects the samples based on two criteria: uncertainty and representativeness. The representativeness indicates the contribution of a sample's label propagating to the other samples, while the existing approaches did not take the representativeness into consideration. Extensive experiments show that bringing the representativeness criterion into the sample selection process can significantly improve the active learning effectiveness.

• ETRI Journal
• /
• v.36 no.1
• /
• pp.167-170
• /
• 2014

In this letter, we propose an unsupervised framework for speech noise reduction based on the recent development of low-rank and sparse matrix decomposition. The proposed framework directly separates the speech signal from noisy speech by decomposing the noisy speech spectrogram into three submatrices: the noise structure matrix, the clean speech structure matrix, and the residual noise matrix. Evaluations on the Noisex-92 dataset show that the proposed method achieves a signal-to-distortion ratio approximately 2.48 dB and 3.23 dB higher than that of the robust principal component analysis method and the non-negative matrix factorization method, respectively, when the input SNR is -5 dB.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.06a
• /
• pp.250-253
• /
• 2014

방송 서비스를 안정적으로 제공하기 위해서는 가시청시간율을 안정적으로 확보하는 것이 중요하다. 이를 위해서는 수신단에서 ToV SNR 부근에서의 추가적인 margin을 확보하는 기술이 요구된다. 기존 방송 시스템은 안테나를 하나만 사용하는 수신 환경을 가정하고 있으므로, 본 논문에서는 하나의 안테나로부터 수신된 신호를 서로 다른 equalizer 기법 2가지를 동시에 적용하여 마치 2개의 수신 안테나부터 신호를 수신한 효과를 얻었고, 그 출력을 weight combining 하여 최종 SNR 이득을 높이는 기술을 제안하였다. 특히, equalizer 기법은 기존에 성능이 우수하다고 알려져 있는 MMSE-DFE 기술과 최근 큰 주목을 받고 있는 compressed Sensing 기반 sparse-DFE 기술을 동시에 사용하였다. Simulation을 통해서 MMSE-DFE 또는 sparse-DFE를 단독으로 사용하는 것보다 두 기법을 가중치 결합을 통해서 사용함으로써 가시청시간율이 크게 향상되는 것을 확인하였다.

• Communications for Statistical Applications and Methods
• /
• v.15 no.1
• /
• pp.43-50
• /
• 2008

Multinomial logistic regression is a well known multiclass classification method in the field of statistical learning. More recently, the development of sparse multinomial logistic regression model has found application in microarray classification, where explicit identification of the most informative observations is of value. In this paper, we propose a sparse multinomial kernel logistic regression model, in which the sparsity arises from the use of a Laplacian prior and a fast exact algorithm is derived by employing a bound optimization approach. Experimental results are then presented to indicate the performance of the proposed procedure.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.60-64
• /
• 2001

In this paper, a new learning methodology for Kernel Methods is suggested that results in a sparse representation of kernel space from the training patterns for classification problems. Among the traditional algorithms of linear discriminant function(perceptron, relaxation, LMS(least mean squared), pseudoinverse), this paper shows that the relaxation procedure can obtain the maximum margin separating hyperplane of linearly separable pattern classification problem as SVM(Support Vector Machine) classifier does. The original relaxation method gives only the necessary condition of SV patterns. We suggest the sufficient condition to identify the SV patterns in the learning epochs. Experiment results show the new methods have the higher or equivalent performance compared to the conventional approach.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.61-63
• /
• 2010

Recent work in compressed sensing theory shows that m${\times}$n independent and identically distributed sensing matrices whose entries are drawn independently from certain probability distributions guarantee exact recovery of a sparse signal with high probability even if m${\ll}$n. In particular, it is well understood that the L1 minimization algorithm is able to recover sparse signals from incomplete measurements. In this paper, we propose a novel sparse signal reconstruction method that is based on the reweighted L1 minimization via support recovery.

• Journal of the Korean Mathematical Society
• /
• v.54 no.1
• /
• pp.193-213
• /
• 2017

We investigate an efficient approximation of solution to stochastic Burgers equation driven by an additive space-time noise. We discuss existence and uniqueness of a solution through the Orstein-Uhlenbeck (OU) process. To approximate the OU process, we introduce the Karhunen-$Lo{\grave{e}}ve$ expansion, and sparse grid stochastic collocation method. About spatial discretization of Burgers equation, two separate finite element approximations are presented: the conventional Galerkin method and Galerkin-conservation method. Numerical experiments are provided to demonstrate the efficacy of schemes mentioned above.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2012.05a
• /
• pp.30-33
• /
• 2012

대사성 골 질환인 골다공증(Osteoporosis)의 조기 진단을 위해 X 선 영상에서 골 밀도를 측정하는 방법이 최근 연구되고 있다. 골 밀도는 X 선 영상에서 뼈가 분리되고, 분리된 영역에서의 픽셀에 의해 BMD가 측정되는데, 개선된 영상에서의 정밀한 뼈 추출이 주요한 요소이므로 X 선 영상의 개선은 골다공증의 조기 진단을 위해 필수적이다. 본 논문에서는 sparse 표현법을 도입하여 X 선 영상을 개선시키는 방법을 제안한다. 실험을 통해 제안한 방법의 결과가 기존의 방법인 웨이블릿 BayesShrink에 비해 개선됨을 CNR(Contrast to Noise Ratio)을 통해 확인하였다.