Blind image deblurring, aiming at obtaining the sharp image from blurred one, is a widely existing problem in image processing. Traditional image deblurring methods always use the deconvolution method to remove the bl...
详细信息
ISBN:
(纸本)9781467322164
Blind image deblurring, aiming at obtaining the sharp image from blurred one, is a widely existing problem in image processing. Traditional image deblurring methods always use the deconvolution method to remove the blur kernel's effect, however, deconvolution is so sensitive to noise that inevitable artifacts always exist in the deblurring results, even though regularity terms are introduced as constraints. In this paper, we propose a novel blind image deblurring method based on the sparse prior of dictionary pair, estimating the sparse coefficient, sharp image and blur kernel alternately. The proposed method could avoid the deconvolution problem which is an ill-posed problem, and obtain the result with fewer artifacts. Compared with the state-of-the-art method, experimental results demonstrate that the proposed method could obtain better performance.
In this paper, we propose a new methodology to combine spectral information and spatial features for Support Vector Machine (SVM)-based classification. The novelty of the proposed work is in the combination of band se...
详细信息
In this paper, we propose a new methodology to combine spectral information and spatial features for Support Vector Machine (SVM)-based classification. The novelty of the proposed work is in the combination of band selection (i.e., linear prediction (LP)-based method), spatial feature extraction (i.e., morphology profiles (MP)), and spectral transformation (i.e., principal component analysis (PCA)) to build a computationally tractable system. The preliminary result with ROSIS data shows that using the selected bands and MP features extracted from principal components (PCs) can yield the highest accuracy. We believe such finding is instructive to feature extraction/selection for spectral/spatial-based hyperspectral image classification.
Linear Discriminant Analysis (LDA) is an efficient image feature extraction technique by supervised dimensionality reduction. In this paper, we extend LDA to Structured Sparse LDA (SSLDA), where the projecting vectors...
详细信息
Linear Discriminant Analysis (LDA) is an efficient image feature extraction technique by supervised dimensionality reduction. In this paper, we extend LDA to Structured Sparse LDA (SSLDA), where the projecting vectors are not only constrained to sparsity but also structured with a pre-specified set of shapes. While the sparse priors deal with small sample size problem, the proposed structure regularization can also encode higher-order information with better interpretability. We also propose a simple and efficient optimization algorithm to solve the proposed optimization problem. Experiments on face images show the benefits of the proposed structured sparse LDA on both classification accuracy and interpretability.
There exist noisy, unparallel sentences in parallel web pages. Web page structure is subjected to some limitation for sentences alignment task for web page text. The most straightforward way of aligning sentences is u...
详细信息
There exist noisy, unparallel sentences in parallel web pages. Web page structure is subjected to some limitation for sentences alignment task for web page text. The most straightforward way of aligning sentences is using a translation lexicon. However, a major obstacle to this approach is the lack of dictionary for training. This paper presents a method for automatically align Mongolian-Chinese parallel text on the Web via vector space model. Vector space model is an algebraic model for representing any object as vectors of identifiers, such as index terms. In the statistically based vector-space model, a sentence is conceptually represented by a vector of keywords extracted from the text. Extracted keywords are composed by content words, known as terms and the weight of a term in a sentence vector can be determined tf-idf method. CHI is used to compute the association between bilingual words. Once the term weights are determined, the similarity between sentence vectors is computed via cosine measure. The experimental results indicate that the method is accurate and efficient enough to apply without human intervention.
This paper present a geometric method to reconstruct human motion pose from 2D point correspondences obtained from uncalibrated monocular images. The proposed algorithm can handle images with very strong perspective e...
详细信息
The constaints of time and memory will reduce the learning performance of Support Vector Machine (SVM) when it is used to solve the large number of samples. In order to solve this problem, a novel algorithm called Gra...
详细信息
The constaints of time and memory will reduce the learning performance of Support Vector Machine (SVM) when it is used to solve the large number of samples. In order to solve this problem, a novel algorithm called Granular Support Vector Machine based on Mixed Kernel Function (GSVM-MKF) is proposed. Firstly, the granular method is propsed and then the judgment and extraction methods of support vector particles are given. On the above basis, we propose a new granular support vector machine learning model. Secondly, in order to further improve the performance of the granular support vector machine learning model, a mixed kernel function which effectively uses the global kernel function having the good generalization ability and the local kernel function having good learning ability is proposed. Finally, the theoretical analysis and experimental results show the effectiveness of the method.
TWSVM(Twin Support Vector Machines) is based on the idea of GEPSVM (Proximal SVM based on Generalized Eigenvalues), which determines two nonparallel planes by solving two related SVM-type problems, so that its computi...
详细信息
TWSVM(Twin Support Vector Machines) is based on the idea of GEPSVM (Proximal SVM based on Generalized Eigenvalues), which determines two nonparallel planes by solving two related SVM-type problems, so that its computing cost in the training phase is 1/4 of standard SVM. In addition to keeping the superior characteristics of GEPSVM, the classification performance of TWSVM significantly outperforms that of GEPSVM. In order to further improve the speed and accuracy of TWSVM, this paper proposes the twin support vector machines based on rough sets. Firstly, using the rough sets theory to reduce the attributes, and then using TWSVM to train and predict the new datasets. The final experimental results and data analysis show that the proposed algorithm has higher accuracy and better efficiency compared with the traditional twin support vector machines.
Simple and efficient location algorithms are of great research significance to Wireless Sensor Networks (WSNs) systems. In this paper, main factors of position error in the Centroid location algorithm are analysed, an...
详细信息
When applied to precipitation forecasting, the mean generating function - optimal subset regression (MGF-OSR) model is limited by its low accuracy and high error, while the back propagation (BP) neural network model h...
详细信息
When applied to precipitation forecasting, the mean generating function - optimal subset regression (MGF-OSR) model is limited by its low accuracy and high error, while the back propagation (BP) neural network model has difficulty in learning for matrix selection. This paper proposes a new MGF-OSR-BP model, which uses a MGF to extend original data, an OSR to select the best series as the BP neural network input node and learning matrix, and the resultant data for training. The training procedure determines the number of hidden layers and uses an optimal number of hidden layers for model training. This paper uses the MGF-OSR-BP model to analyze precipitation data from Hangzhou, China, for 53 years, from 1956 to 2008. The 1956-2006 precipitation data are used as the training sample, and the 2007-2008 data are used as the test set data to verify the practicality of the forecast system. A fitting verification is performed using the forecasted data against field measurement data, and the results show that the forecast accuracy is better than that of the MGF-OSR model or the MGF stepwise multiple regression model.
Video-based Face Recognition (VFR) can be converted to the matching of two image sets containing face images captured from each video. For this purpose, we propose to bridge the two sets with a reference image set tha...
详细信息
Video-based Face Recognition (VFR) can be converted to the matching of two image sets containing face images captured from each video. For this purpose, we propose to bridge the two sets with a reference image set that is well-defined and pre-structured to a number of local models offline. In other words, given two image sets, as long as each of them is aligned to the reference set, they are mutually aligned and well structured. Therefore, the similarity between them can be computed by comparing only the corresponded local models rather than considering all the pairs. To align an image set with the reference set, we further formulate the problem as a quadratic programming. It integrates three constrains to guarantee robust alignment, including appearance matching cost term exploiting principal angles, geometric structure consistency using affine invariant reconstruction weights, smoothness constraint preserving local neighborhood relationship. Extensive experimental evaluations are performed on three databases: Honda, MoBo and YouTube. Compared with competing methods, our approach can consistently achieve better results.
暂无评论