On the security of a visual cryptography scheme for color images

Hou [Visual cryptography for color images, Pattern Recognition 36 (2003) 1619-1629] proposed a four-share visual cryptography scheme for color images. The scheme splits a dithered eight-color secret image into four shares: the black mask and other three shares. It was claimed that without knowing the black mask, no information about the secret image can be obtained even if all the other three shares are known. In this paper, we show that this may be true for a few specific two-color secret images only. In all other cases, however, security cannot be guaranteed. We show that an attacker can compromise a randomly chosen two-color secret image from any two of the other three shares with probability by completely recovering the shape and pattern of the secret image. The advantage will increase to if all the three shares are known. If the secret image has three or four colors, we show that the attacker can compromise it with probability and , respectively. Finally, we show that our technique can be extended to compromising secret images with more than four colors.     

Throughput analysis of STS-based CDMA system with variable spreading factor in non-frequency selective Rayleigh fading channel

The throughput enhancement of space-time spreading (STS)-based code division multiple access (CDMA) system is investigated in this paper. Variable spreading factor (VSF) is utilized to improve the data throughput of the system in non-frequency selective Rayleigh fading channel. In this contribution, an analytical approach is proposed to compute a new expression for the bit error rate (BER) performance of the STS-based CDMA system against pre-despreading signal-to-noise-ratio (SNR) for different values of spreading factor. The other contribution of the paper is deriving a new analytical expression for the throughput enhancement of the VSF STS-based CDMA system in non-frequency selective Rayleigh fading channel. Simulation and analytical results demonstrate that using VSF method in STS-based CDMA system improves the throughput of the system by keeping the BER performance at a target level.     

Improved Interface Conditions for 2<Emphasis Type="Italic">D</Emphasis> Domain Decomposition with Corners: Numerical Applications

This article deals with a local improvement of domain decomposition methods for 2-dimensional elliptic problems for which either the geometry or the domain decomposition presents conical singularities. After explaining the main results of the theoretical analysis carried out in Chniti et al. (Calcolo 45, 2008), the numerical experiments presented in this article confirm the optimality properties of the new interface conditions.     

Effective solution for unhandled exception in decision tree induction algorithms

This paper deals with some improvements to rule induction algorithms in order to resolve the tie that appear in special cases during the rule generation procedure for specific training data sets. These improvements are demonstrated by experimental results on various data sets. The tie occurs in decision tree induction algorithm when the class prediction at a leaf node cannot be determined by majority voting. When there is a conflict in the leaf node, we need to find the source and the solution to the problem. In this paper, we propose to calculate the Influence factor for each attribute and an update procedure to the decision tree has been suggested to deal with the problem and provide subsequent rectification steps.     

多光谱数据波段选择方法试验研究——以湖北神农架林区为例

本文以神农架林区植被信息提取为例,从统计特征的角度出发,采用最佳指数因子、联合熵与类间、类内可分性判别准则三种波段选择方法。在对三种波段选择方法计算结果综合分析的基础上,结合试验区地物光谱特征和TM传感器不同波段功能,采用逐步逼近的思路,从候选波段组合中确定了最佳波段组合。试验得出TM传感器453波段组合为神农架林区植被信息提取的最佳波段组合。     

无约束最优化问题的BFGS并行算法与实现

介绍无约束最优化问题的BFGS算法及其收敛性,提出利用行卷帘格式并行Cholesky分解法、同步并行Wolfe-Powell非线性搜索和并行处理BFGS修正公式来构建BFGS的并行算法,并对该算法的时间复杂性、加速比进行分析。在PC机群数值实验的结果表明,BFGS并行算法提高了无约束最优化问题的求解速度,理论分析与实验结果相一致,并行算法具有线性加速比。     

基于网格的散乱点曲面重构技术

提出一种利用网格技术实现散乱点曲面重构的方法,设计适合网格并行的松耦合分层重构算法,在此基础上研究基于Agent技术的智能任务分解机制和基于Condor-G技术的任务分配与调度策略,并搭建网格实验平台进行测试。对重构结果的分析表明,该技术可提高基于散乱点的曲面重构速度,降低应用成本。     

基于多代理的CSCL系统成员感知实现

针对一般基于多代理技术的CSCL系统中没有有效感知机制的问题,提出将具有感知功能的学习者Agent应用于协作学习系统中,描述学习者Agent的内部结构,给出感知功能模块中小组任务的分解和原子任务图的构造算法,定义感知强度的计算函数,对感知信息的呈现过程进行描述,有效解决现有协作学习系统中群体互动效果差、感知信息混乱的问题。     

基于EMD和SVDD的铸钢支座故障诊断

针对重庆轻轨铸钢支座系统故障诊断中缺乏故障样本的问题,提出一种基于经验模态分解（EMD）和支持向量数据描述（SVDD）的故障诊断方法。对采集到的振动脉冲响应信号进行EMD分解,提取第一、第二模态的能量和平均值作为特征输入到SVDD分类器进行训练和分类。实验结果表明,采用EMD分解后提取的特征能有效地浓缩故障信息,使SVDD分类器具有分类效果好、计算效率高等优点。     

基于加权对称图像的二维FDA人脸识别算法

提出一种融合加权对称图像的二维FDA人脸识别算法。将人脸图像分解为奇偶对称脸,并利用加权因子将奇偶对称脸重构新的人脸样本,通过二维FDA算法求解新样本图像的最优特征子空间进行人脸分类。有效融合二维FDA算法的优点,并利用人脸对称性的特征,同时进一步分析加权因子对人脸识别效果的影响,通过选取最优加权因子最大地提高识别率。在人脸图像库ORL中进行的实验结果表明,该算法有效并能获得较高的识别率。