• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1700-1721
• /
• 2017

The problem of blocking artifacts is very common in block-based image and video compression, especially at very low bit rates. In this paper, we propose a post-processing method for JPEG-coded image deblocking via sparse representation and adaptive residual threshold. This method includes three steps. First, we obtain the dictionary by online dictionary learning and the compressed images. The dictionary is then modified by the histogram of oriented gradient (HOG) feature descriptor and K-means cluster. Second, an adaptive residual threshold for orthogonal matching pursuit (OMP) is proposed and used for sparse coding by combining blind image blocking assessment. At last, to take advantage of human visual system (HVS), the edge regions of the obtained deblocked image can be further modified by the edge regions of the compressed image. The experimental results show that our proposed method can keep the image more texture and edge information while reducing the image blocking artifacts.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6028-6042
• /
• 2019

Since Sparse Nonnegative Matrix Factorization (SNMF) method can control the sparsity of the decomposed matrix, and then it can be adopted to control the sparsity of facial feature extraction and recognition. In order to improve the accuracy of SNMF method for facial feature recognition, new additive iterative rules based on the improved iterative step sizes are proposed to improve the SNMF method, and then the traditional multiplicative iterative rules of SNMF are transformed to additive iterative rules. Meanwhile, to further increase the sparsity of the basis matrix decomposed by the improved SNMF method, a threshold-sparse constraint is adopted to make the basis matrix to a zero-one matrix, which can further improve the accuracy of facial feature recognition. The improved SNMF method based on the additive iterative rules and threshold-sparse constraint is abbreviated as ASNMF, which is adopted to recognize the ORL and CK+ facial datasets, and achieved recognition rate of 96% and 100%, respectively. Meanwhile, from the results of the contrast experiments, it can be found that the recognition rate achieved by the ASNMF method is obviously higher than the basic NMF, traditional SNMF, convex nonnegative matrix factorization (CNMF) and Deep NMF.

• Communications for Statistical Applications and Methods
• /
• v.29 no.6
• /
• pp.655-664
• /
• 2022

On the motivation by an integrative study of multi-omics data, we are interested in estimating the structure of the sparse cross correlation matrix of two high-dimensional random vectors. We rewrite the problem as a multiple testing problem and propose a new method to estimate the sparse structure of the cross correlation matrix. To do so, we test the correlation coefficients simultaneously and threshold the correlation coefficients by controlling FRD at a predetermined level α. Further, we apply the proposed method and an alternative adaptive thresholding procedure by Cai and Liu (2016) to the integrative analysis of the protein expression data (X) and the mRNA expression data (Y) in TCGA breast cancer cohort. By varying the FDR level α, we show that the new procedure is consistently more efficient in estimating the sparse structure of cross correlation matrix than the alternative one.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1047-1062
• /
• 2018

In this paper the problem of massive multiple input multiple output (MIMO) channel estimation with sparsity aware adaptive algorithms for $5^{th}$ generation mobile systems is investigated. These channels are shown to be non-stationary along with being sparse. Non-stationarity is a feature that implies channel taps change with time. Up until now most of the adaptive algorithms that have been presented for channel estimation, have only considered sparsity and very few of them have been tested in non-stationary conditions. Therefore we investigate the performance of several newly proposed sparsity aware algorithms in these conditions and finally propose an enhanced version of RZA-LMS/F algorithm with variable threshold namely VT-RZA-LMS/F. The results show that this algorithm has better performance than all other algorithms for the next generation channel estimation problems, especially when the non-stationarity gets high. Overall, in this paper for the first time, we estimate a non-stationary Rayleigh fading channel with sparsity aware algorithms and show that by increasing non-stationarity, the estimation performance declines.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.5
• /
• pp.468-574
• /
• 1991

In construction of breadth-frist tree, the communication complexity can be reduced by efficent synchronization schemes based on several threshold values, We determine several new threshold values by considering the graph density represented as lognm, where n and m are the number of nodes and links., repectively. When thesethreshold values are used in the synchroization method for constructing distrbuted bradth-first search tree, we can obtain a more efficient algorithm in sparse graphs, and also, this algorithm has vthe same performance for communication complexity in dense graphs.

• The Korean Journal of Applied Statistics
• /
• v.35 no.1
• /
• pp.63-75
• /
• 2022

This paper proposes the so-called MOSUM-based sparse projection method for change points detection in high-dimensional time series. Our method is inspired by Wang and Samworth (2018), however, our method improves their method in two ways. One is to find change points all at once, so it minimizes sequential error. The other is localized so that more robust to the mean changes offsetting each other. We also propose data-driven threshold selection using block wild bootstrap. A comprehensive simulation study shows that our method performs reasonably well in finite samples. We also illustrate our method to stock prices consisting of S&P 500 index, and found four change points in recent 6 years.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.531-531
• /
• 2000

The challenge is to control unstable nonlinear dynamic systems using only sparse feedback from the environment concerning its performance. The design of such controllers can be achieved by evolving neural networks. An evolutionary approach to train neural networks in realtime is proposed. Evolutionary strategies adapt the weights of neural networks and the threshold values of neuron's synapses. The proposed method has been successfully implemented for pole balancing problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.4160-4176
• /
• 2015

Data compression like image and video compression has come a long way since the introduction of Compressive Sensing (CS) which compresses sparse signals such as images, videos etc. to very few samples i.e. M < N measurements. At the receiver end, a robust and efficient recovery algorithm estimates the original image or video. Many prominent algorithms solve least squares problem (LSP) iteratively in order to reconstruct the signal hence consuming more processing time. In this paper non-iterative threshold based recovery algorithm (NITRA) is proposed for the recovery of images and videos without solving LSP, claiming reduced complexity and better reconstruction quality. The elapsed time for images and videos using NITRA is in ㎲ range which is 100 times less than other existing algorithms. The peak signal to noise ratio (PSNR) is above 30 dB, structural similarity (SSIM) and structural content (SC) are of 99%.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.733-734
• /
• 2016

This study proposes a novel approach for ground segmentation of 3D point cloud. We combine two techniques: gradient threshold segmentation, and mean height evaluation. Acquired 3D point cloud is represented as a graph data structures by exploiting the structure of 2D reference image. The ground parts nearing the position of the sensor are segmented based on gradient threshold technique. For sparse regions, we separate the ground and nonground by using a technique called mean height evaluation. The main contribution of this study is a new ground segmentation algorithm which works well with 3D point clouds from various environments. The processing time is acceptable and it allows the algorithm running in real time.