• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.5006-5022
• /
• 2017

Effect and robust detection of targets in infrared images has crucial meaning for many applications, such as infrared guidance, early warning, and video surveillance. However, it is not an easy task due to the special characteristics of the infrared images, in which the background clutters are severe and the targets are weak. The recent literature demonstrates that sparse representation can help handle the detection problem, however, the detection performance should be improved. To this end, in this text, a hybrid method based on local sparse representation and contrast is proposed, which can effectively and robustly detect the infrared targets. First, a residual image is calculated based on local sparse representation for the original image, in which the target can be effectively highlighted. Then, a local contrast based method is adopted to compute the target prediction image, in which the background clutters can be highly suppressed. Subsequently, the residual image and the target prediction image are combined together adaptively so as to accurately and robustly locate the targets. Based on a set of comprehensive experiments, our algorithm has demonstrated better performance than other existing alternatives.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.11 no.4
• /
• pp.143-150
• /
• 1991

This paper presents an overview of a system of computer programs for the solution of a large geodetic network of about 2,000 stations. The system arranges the matrices in systematic sparse form which is applied to observation equations of RR(C)U (Row-wise Representation Complete Unordered) type and to normal equations of RR(U)U (Row-wise Representation Upper Unordered) type. The solution is done by a Modified Cholesky's algorithm in view of large networks. The implementation program are tested in PC-386 by korean new secondary networks, the results show that the sparse techniques are highly useful to geodetic networks in core-storage management and processing time.

• Journal of the Optical Society of Korea
• /
• v.20 no.6
• /
• pp.752-761
• /
• 2016

Hyperspectral images are often contaminated with stripe noise, which severely degrades the imaging quality and the precision of the subsequent processing. In this paper, a variational model is proposed by employing spectral-spatial adaptive unidirectional variation and a sparse representation. Unlike traditional methods, we exploit the spectral correction and remove stripes in different bands and different regions adaptively, instead of selecting parameters band by band. The regularization strength adapts to the spectrally varying stripe intensities and the spatially varying texture information. Spectral correlation is exploited via dictionary learning in the sparse representation framework to prevent spectral distortion. Moreover, the minimization problem, which contains two unsmooth and inseparable $l_1$-norm terms, is optimized by the split Bregman approach. Experimental results, on datasets from several imaging systems, demonstrate that the proposed method can remove stripe noise effectively and adaptively, as well as preserve original detail information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3620-3637
• /
• 2019

Since the birth of Synthetic Aperture Radar (SAR), it has been widely used in the military field and so on. However, the existence of speckle noise makes a good deal inconvenience for the subsequent image processing. The continuous development of sparse representation (SR) opens a new field for the speckle suppressing of SAR image. Although the SR de-noising may be effective, the over-smooth phenomenon still has bad influence on the integrity of the image information. In this paper, one novel SAR image de-noising method based on residual image fusion and sparse representation is proposed. Firstly we can get the similar block groups by the non-local similar block matching method (NLS-BM). Then SR de-noising based on the adaptive K-means singular value decomposition (K-SVD) is adopted to obtain the initial de-noised image and residual image. The residual image is processed by Shearlet transform (ST), and the corresponding de-noising methods are applied on it. Finally, in ST domain the low-frequency and high-frequency components of the initial de-noised and residual image are fused respectively by relevant fusion rules. The final de-noised image can be recovered by inverse ST. Experimental results show the proposed method can not only suppress the speckle effectively, but also save more details and other useful information of the original SAR image, which could provide more authentic and credible records for the follow-up image processing.

• 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.

• Journal of Computing Science and Engineering
• /
• v.12 no.1
• /
• pp.1-11
• /
• 2018

Human activities recognition is a challenging task due to its complexity of human movements and the variety performed by different subjects for the same action. This paper presents a recognition algorithm by using skeleton information generated from depth maps. Concatenating motion features and temporal constraint feature produces feature vector. Reducing dictionary scale proposes an improved fast classifier based on sparse representation. The developed method is shown to be effective by recognizing different activities on the UTD-MHAD dataset. Comparison results indicate superior performance of our method over some existing methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2590-2606
• /
• 2017

Generally, research of classical image classification algorithms assume that training data and testing data are derived from the same domain with the same distribution. Unfortunately, in practical applications, this assumption is rarely met. Aiming at the problem, a domain adaption image classification approach based on multi-sparse representation is proposed in this paper. The existences of intermediate domains are hypothesized between the source and target domains. And each intermediate subspace is modeled through online dictionary learning with target data updating. On the one hand, the reconstruction error of the target data is guaranteed, on the other, the transition from the source domain to the target domain is as smooth as possible. An augmented feature representation produced by invariant sparse codes across the source, intermediate and target domain dictionaries is employed for across domain recognition. Experimental results verify the effectiveness of the proposed algorithm.

• International Journal of Advanced Culture Technology
• /
• v.9 no.1
• /
• pp.218-223
• /
• 2021

Pervasive enhancement and required enforcement of the Internet of Things (IoTs) in a distributed massively multiplayer online architecture have effected in massive growth of Big-Data in terms of server over-load. There have been some previous works to overcome the overloading of server works. However, there are lack of considered methods, which is commonly applicable. Therefore, we propose a combing Sparse Auto-Encoder and Load-Balancing, which is ProGReGA for Big-Data of server loads. In the process of Sparse Auto-Encoder, when it comes to selection of the feature-pattern, the less relevant feature-pattern could be eliminated from Big-Data. In relation to Load-Balancing, the alleviated degradation of ProGReGA can take advantage of the less redundant feature-pattern. That means the most relevant of Big-Data representation can work. In the performance evaluation, we can find that the proposed method have become more approachable and stable.

• 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.

• Journal of Information Processing Systems
• /
• v.16 no.2
• /
• pp.343-359
• /
• 2020

In this paper, a new algorithm is proposed for three-dimensional (3D) shape recognition using local features of model views and its sparse representation. The algorithm starts with the normalization of 3D models and the extraction of 2D views from uniformly distributed viewpoints. Consequently, the 2D views are stacked over each other to from view cubes. The algorithm employs the descriptors of 3D local features in the view cubes after applying Gabor filters in various directions as the initial features for 3D shape recognition. In the training stage, we store some 3D local features to build the prototype dictionary of local features. To extract an intermediate feature vector, we measure the similarity between the local descriptors of a shape model and the local features of the prototype dictionary. We represent the intermediate feature vectors of 3D models in the sparse domain to obtain the final descriptors of the models. Finally, support vector machine classifiers are used to recognize the 3D models. Experimental results using the Princeton Shape Benchmark database showed the average recognition rate of 89.7% using 20 views. We compared the proposed approach with state-of-the-art approaches and the results showed the effectiveness of the proposed algorithm.