• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.6043-6062
• /
• 2019

Low-rank matrix decomposition has shown its capability in many applications such as image in-painting, de-noising, background reconstruction and defect detection etc. In this paper, we consider the texture background of rail track images and the sparse foreground of the defects to construct a low-rank matrix decomposition model with block sparsity for defect inspection of rail tracks, which jointly minimizes the nuclear norm and the 2-1 norm. Similar to ADM, an alternative method is proposed in this study to solve the optimization problem. After image decomposition, the defect areas in the resulting low-rank image will form dark stripes that horizontally cross the entire image, indicating the preciselocations of the defects. Finally, a two-stage defect extraction method is proposed to locate the defect areas. The experimental results of the two datasets show that our algorithm achieved better performance compared with other methods.

• 한국음향학회지
• /
• 제21권5호
• /
• pp.494-502
• /
• 2002

본 연구는 실측 잔향음 자료에서 나타나는 단주기적 시변동성 신호 간섭 (interference)을 억제하기 위해 Ecart-Young 이론을 토대로 자료 행렬로부터 낮은 계수를 추출하여 근사화하는 낮은 계수 근사법 (LRA: Low Rank Approximation) 기법을 제안하였다. 이 기법을 실측 자료에 적용한 결과, 잔향음 신호와 시변동성 신호가 분리되었으며 이때 적절한 낮은 계수를 추출키 위해서 특이치 분해법 (SVD: Singular Value Decomposition)이 사용되었다. 잔향음 신호의 억제는 LRA를 통해 얻어진 근사치와 실측치 사이의 잔차를 계산함으로써 수행하였으며 결과적으로 LRA을 이용하여 시간적으로 안정적인 잔향음 신호를 획득함으로써 능동 소오나 시스템 운용 및 잔향음 모델링시 적용 가능성을 제시하였다.

• 대한전자공학회논문지SP
• /
• 제46권5호
• /
• pp.15-24
• /
• 2009

Compressed sensing은 소수의 선형 관측으로부터 sparse 신호를 복원하는 문제를 언급하고 있다. 최근 벡터 경우에서의 성공적인 연구 결과가 행렬의 경우로 확장되었다. Low-rank 행렬의 compressed sensing은 ill-posed inverse problem을 low-rank 정보를 이용하여 해결한다. 본 문제는 rank 최소화 혹은 low-rank 근사의 형태로 나타내질 수 있다. 본 논문에서는 최근 제안된 여러 가지 효율적인 알고리즘에 대한 survey를 제공한다.

• ETRI Journal
• /
• 제36권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권9호
• /
• pp.4510-4526
• /
• 2017

Most available methods of facial gender recognition work well under a constrained situation, but the performances of these methods have decreased significantly when they are implemented under unconstrained environments. In this paper, a method via low-rank and collaborative representation is proposed for facial gender recognition in the wild. Firstly, the low-rank decomposition is applied to the face image to minimize the negative effect caused by various corruptions and dynamical illuminations in an unconstrained environment. And, we employ the collaborative representation to be as the classifier, which using the much weaker $l_2-norm$ sparsity constraint to achieve similar classification results but with significantly lower complexity. The proposed method combines the low-rank and collaborative representation to an organic whole to solve the task of facial gender recognition under unconstrained environments. Extensive experiments on three benchmarks including AR, CAS-PERL and YouTube are conducted to show the effectiveness of the proposed method. Compared with several state-of-the-art algorithms, our method has overwhelming superiority in the aspects of accuracy and robustness.

• ETRI Journal
• /
• 제39권1호
• /
• pp.21-29
• /
• 2017

This paper addresses the problem of unsupervised speech separation based on robust non-negative matrix factorization (RNMF) with ${\beta}$-divergence, when neither speech nor noise training data is available beforehand. We propose a robust version of non-negative matrix factorization, inspired by the recently developed sparse and low-rank decomposition, in which the data matrix is decomposed into the sum of a low-rank matrix and a sparse matrix. Efficient multiplicative update rules to minimize the ${\beta}$-divergence-based cost function are derived. A convolutional extension of the proposed algorithm is also proposed, which considers the time dependency of the non-negative noise bases. Experimental speech separation results show that the proposed convolutional RNMF successfully separates the repeating time-varying spectral structures from the magnitude spectrum of the mixture, and does so without any prior training.

• 방송공학회논문지
• /
• 제26권2호
• /
• pp.125-131
• /
• 2021

최근 CNN(Convolutional Neural Network)은 영상 분류, 객체 인식, 화질 개선 등 다양한 비전 분야에서 우수한 성능을 보여주고 있다. 그러나 많은 메모리와 계산량이 요구되어 모바일 또는 IoT(Internet of Things) 장치와 같은 저전력 디바이스에 적용하기에는 제한이 따른다. 이에, CNN 모델의 임무 성능을 유지하면서 네트워크 모델을 압축하는 연구가 진행되고 있다. 본 논문에서는 행렬 분해 기술인 저계수 행렬 근사(Low-rank approximation)와 CP(Canonical Polyadic) 분해 기법을 결합한 CNN 모델 압축 기법을 제안한다. 제안기법은 하나의 행렬 분해 기법만을 적용하는 기존의 기법과 달리 CNN의 계층 유형에 따라 두 가지 분해 기법을 선택적으로 적용하여 압축 성능을 높인다. 제안기법의 성능 검증을 위하여 영상 분류 CNN 모델인 VGG-16, ResNet50, 그리고 MobileNetV2 모델을 압축하였고, 계층 유형에 따라 두 가지의 분해 기법을 선택적으로 적용함으로써 저계수 행렬 근사 기법만 적용한 경우 보다 1.5 ~ 12.1 배의 동일한 압축률에서 분류 성능이 향상됨을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권6호
• /
• pp.2634-2648
• /
• 2020

In this paper, an adaptive sparse singular value decomposition (ASSVD) algorithm is proposed to estimate the signal matrix when only one data matrix is observed and there is high dimensional white noise, in which we assume that the signal matrix is low-rank and has sparse singular vectors, i.e. it is a simultaneously low-rank and sparse matrix. It is a structured matrix since the non-zero entries are confined on some small blocks. The proposed algorithm estimates the singular values and vectors separable by exploring the structure of singular vectors, in which the recent developments in Random Matrix Theory known as anisotropic Marchenko-Pastur law are used. And then we prove that when the signal is strong in the sense that the signal to noise ratio is above some threshold, our estimator is consistent and outperforms over many state-of-the-art algorithms. Moreover, our estimator is adaptive to the data set and does not require the variance of the noise to be known or estimated. Numerical simulations indicate that ASSVD still works well when the signal matrix is not very sparse.

• 청정기술
• /
• 제22권4호
• /
• pp.299-307
• /
• 2016

These days, coal is one of the most important energy resources used for transportation, industry, and electricity. There are two types of coal: high-rank and low-rank. Low-rank coal has a low calorific value and contains large amounts of useless moisture. The quality of low-rank coal can be increased by simple drying technology and it needs to be stabilized by hydrocarbons (e.g. palm acid oil, PAO) to prevent spontaneous combustion and moisture re-adsorption. Spontaneous combustion becomes a major problem during coal mining, storage, and transportation. It can involve the loss of life, property, and economic value; reduce the quality of the coal; and increase greenhouse gas emissions. Besides spontaneous combustion, moisture re-adsorption also leads to a decrease in quality of the coal due to its lower heating value. In this work, PAO was used for additive to stabilize the upgraded coal. The objectives of the experiments were to determine the stabilization characteristic of coal by analyzing the behavior of upgraded coal by drying and PAO addition regarding crossing-point temperature of coal, the moisture behavior of briquette coal, and thermal decomposition behavior of coal.

• ETRI Journal
• /
• 제40권4호
• /
• pp.421-434
• /
• 2018

The application of deep neural networks (DNNs) to connect the world with cyber physical systems (CPSs) has attracted much attention. However, DNNs require a large amount of memory and computational cost, which hinders their use in the relatively low-end smart devices that are widely used in CPSs. In this paper, we aim to determine whether DNNs can be efficiently deployed and operated in low-end smart devices. To do this, we develop a method to reduce the memory requirement of DNNs and increase the inference speed, while maintaining the performance (for example, accuracy) close to the original level. The parameters of DNNs are decomposed using a hybrid of canonical polyadic-singular value decomposition, approximated using a tensor power method, and fine-tuned by performing iterative one-shot hybrid fine-tuning to recover from a decreased accuracy. In this study, we evaluate our method on frequently used networks. We also present results from extensive experiments on the effects of several fine-tuning methods, the importance of iterative fine-tuning, and decomposition techniques. We demonstrate the effectiveness of the proposed method by deploying compressed networks in smartphones.