Combining feature spaces for classification

In this paper we offer a variational Bayes approximation to the multinomial probit model for basis expansion and kernel combination. Our model is well-founded within a hierarchical Bayesian framework and is able to instructively combine available sources of information for multinomial classification. The proposed framework enables informative integration of possibly heterogeneous sources in a multitude of ways, from the simple summation of feature expansions to weighted product of kernels, and it is shown to match and in certain cases outperform the well-known ensemble learning approaches of combining individual classifiers. At the same time the approximation reduces considerably the CPU time and resources required with respect to both the ensemble learning methods and the full Markov chain Monte Carlo, Metropolis-Hastings within Gibbs solution of our model. We present our proposed framework together with extensive experimental studies on synthetic and benchmark datasets and also for the first time report a comparison between summation and product of individual kernels as possible different methods for constructing the composite kernel matrix.     

Learning a color distance metric for region-based image segmentation

In this paper we describe an experiment where we studied empirically the application of a learned distance metric to be used as discrimination function for an established color image segmentation algorithm. For this purpose we chose the Mumford–Shah energy functional and the Mahalanobis distance metric. The objective was to test our approach in an objective and quantifiable way on this specific algorithm employing this particular distance model, without making generalization claims. The empirical validation of the results was performed in two experiments: one applying the resulting segmentation method on a subset of the Berkeley Image Database, an exemplar image set possessing ground-truths and validating the results against the ground-truths using two well-known inter-cluster validation methods, namely, the Rand and BGM indexes, and another experiment using images of the same context divided into training and testing set, where the distance metric is learned from the training set and then applied to segment all the images. The obtained results suggest that the use of the specified learned distance metric provides better and more robust segmentations, even if no other modification of the segmentation algorithm is performed.     

Least squares twin support vector machines for pattern classification

In this paper we formulate a least squares version of the recently proposed twin support vector machine (TSVM) for binary classification. This formulation leads to extremely simple and fast algorithm for generating binary classifiers based on two non-parallel hyperplanes. Here we attempt to solve two modified primal problems of TSVM, instead of two dual problems usually solved. We show that the solution of the two modified primal problems reduces to solving just two systems of linear equations as opposed to solving two quadratic programming problems along with two systems of linear equations in TSVM. Classification using nonlinear kernel also leads to systems of linear equations. Our experiments on publicly available datasets indicate that the proposed least squares TSVM has comparable classification accuracy to that of TSVM but with considerably lesser computational time. Since linear least squares TSVM can easily handle large datasets, we further went on to investigate its efficiency for text categorization applications. Computational results demonstrate the effectiveness of the proposed method over linear proximal SVM on all the text corpuses considered.     

基于流形学习和SVM的Web文档分类算法

为解决Web文档分类问题,提出一种基于流形学习和SVM的Web文档分类算法。该算法利用流形学习算法LPP对训练集中的高维Web文档空间进行非线性降维,从中找出隐藏在高维观测数据中有意义的低维结构,在降维后的低维特征空间中利用乘性更新规则的优化SVM进行分类预测。实验结果表明该算法以较少的运行时间获得更高的分类准确率。     

基于分布式服务模型的遥感影像数据挖掘系统

依据遥感影像的特点及WCS标准,研究面向服务的遥感数据挖掘模式及其基于工作流的分布式系统架构。在此基础上,采用．Net体系及WSBPEL流程建模语言,设计一个遥感影像纹理关联规则的挖掘系统,并研究对大数据集的访问、网络资源占用、程序的可伸缩性等方面的实现技术,为Internet环境下遥感影像的处理提供了依据。     

基于特征的文档图像检索

提出一种综合利用文档图像的段落特征和局部像素分布相对差特征进行文档图像检索的方法。给出段落特征和局部像素分布相对差特征的定义、提取方法以及基于这2个特征结合使用的检索方法。段落特征这一全局特征以及局部像素分布相对差特征这一局部特征相结合能够较好地表征和区分文档图像,检索方法将两者充分结合取得较好的效果。     

基于差值扩展和纠错编码的可逆图像认证

针对一些敏感数字图像在认证水印嵌入过程中不能引入失真的问题,提出一种能够定位图像篡改块的可逆图像认证方案,利用纠错编码使认证数据能抵抗可能受到的篡改攻击,并用差值扩展的方式将编码后的认证数据嵌入到图像中。仿真实验结果表明,若认证通过,则图像可完全恢复到原始状态,否则,图像中篡改的块可被定位,并完全恢复其他未篡改的区域。     

基于SVM-2DPCA的X光胸片异常筛查

基于统计学习理论的支持向量机分类算法,提出一种X光胸片异常筛查系统,能够自动判别胸片的正常和异常。为了提高SVM算法的效率,利用小波变换等预处理手段去除对判读无用的图像冗余信息,采用二维主成分分析进一步降低图像特征维数。实验结果表明,SVM用于医学X光片异常筛查可行且有效、识别率高。     

基于改进曲率尺度空间技术的图像水印算法

提出一种新的鲁棒性水印算法,利用改进的曲率尺度空间技术,提取图像的少量较顽强角点,用于重建受几何攻击的图像。选取2个chirp信号作为水印信息,将其嵌入图像的分数傅里叶变换（FRFT）域,选用变换阶次和水印嵌入位置矩阵作为算法密钥,根据chirp信号在FRFT域呈现的冲激特征检测水印信号。仿真实验结果表明,该算法具有较高不可见性、安全性和鲁棒性。     

基于结构张量的自适应CTV彩色图像恢复模型

讨论一种基于非线性扩散方程的彩色图像去噪方法。在图像去噪的3个基本要求的基础上,总结出调和项模型和彩色总变差去噪模型中的不足,利用图像的局部信息构造函数使得模型在接近图像边缘处各向异性平滑并保持边界。在平坦区域各向同性平滑,防止阶梯效应的产生,并利用角点信息保持了角点形状。实验结果表明,所建模型能够较好地保持图像中目标的几何结构,同时具有良好的去噪能力。