一种多级运动目标检测算法

为了提高Javed等提出的运动目标三级检测算法的稳定性,文中对其处理方法做出改进;在像素级处理阶段,采用每一个像素点及其邻域组成的集合作为特征矢量来描述图像,对YUV格式的彩色图像的不同颜色分量分别建立混合高斯模型,得到背景模型后,计算出Sobel边缘检测得到的边缘点的统计分布;在区域级处理阶段,将彩色图像分割与背景建模结合起来,得到具有精确边缘的运动目标,并利用边缘信息消除干扰目标;实验结果表明,即使在前景纹理、颜色比较一致且与背景对比不是很明显的情况下,改进后的方法也能完整地检测出运动目标.     

北斗2代卫星导航电文纠错校验设计与仿真

提出了一种制表映射的BCH纠错解码和校验方法,通过对RNSS-ICD文档北斗导航电文BCH编码的深入理解,设计出了一种占用CPU资源少、实现简单方便的制表映射的编码和纠错解码算法,减小了算法在实现时对CPU和内存资源的占用;给出了一种再编码校验的校验方法仿真验证了该算法的准确性和可靠性,保证导航电文的可靠性;对提高接收机的性能具有很强的工程适用价值.     

基于奇偶量化的彩色图像盲水印算法

提出一种基于奇偶量化的彩色图像小波域的数字水印算法。首先对水印图像进行置乱处理,然后对图像进行翻转,最后利用混沌系统产生的混沌序列对水印进行加密。水印嵌入时,采用小波变换并利用奇偶量化规则将加密后的水印嵌入到载体图像蓝色分量最深层的四个子带中。水印提取时,不需要原始图像的参与,实现了盲提取。仿真实验和性能分析表明,该算法有很好的不可见性和鲁棒性,可以有效地抵抗JPEG压缩、噪声、剪切等攻击。     

Phase change materials in the ternary system NH4Cl+CaCl2+H2O

Solubility isotherms of the ternary system (NH₄Cl+CaCl₂+H₂O) were elaborately determined at T= (273.15 and 298.15) K by using the isothermal method. In the equilibrium phase diagram, there are two solubility branches corresponding to the solid phases CaCl₂⋅6H₂O and NH₄Cl. Invariant point compositions are 36.32 wt% CaCl₂ and 3.4 wt% NH₄Cl at 273.15 K, and 45.86 wt% CaCl₂ and 5.22 wt% NH₄Cl at 298.15 K. A Pitzer-Simonson-Clegg thermodynamic model was applied to represent the thermodynamic properties of this ternary system and to construct a partial phase diagram of the ternary system at temperatures between (273.15 and 323.15) K. It was found in the predicted solubility phase diagram that the double salt 2NH₄Cl⋅CaCl₂⋅3H₂O, found by other authors at (323.1 and 348.1) K, will disappear at temperatures below 298.15 K. Besides, it was found that there are two peritectic points in the ternary system with peritectic temperatures at 299.65 K and 298.15 K, and the former peritectic point falls just on the line between the composition points of NH₄Cl and CaCl₂⋅6H₂O. According to phase rule, a solution made of this point will begin to crystallize at 299.65 K and end at 298 K and therefore can be acted as a “pseudo eutectic” phase change material (PCM). A heat storing and releasing experiment of 50 grams of the PCM was carried out, obtaining a satisfying result.     

基于移动平均线组合和支持向量机的股市趋势研究

证券投资是一种高风险、高收益的理财方式,而对市场运行趋势的良好把握有助于投资者回避风险、把握机会。提出基于多条移动平均线斜率组合和支持向量机算法,判断当前市场运行趋势,从而采取相应的投资策略。模拟实验证明,该方法取得了良好的效果。     

H.264帧内预测模式选择快速算法的研究

提出一种适用于H.264帧内预测的快速算法,利用相邻像素间的梯度筛选预测模式来避免不必要的预测模式计算。实验结果表明:用全I帧编码,该算法在图像质量和输出码率基本不变的情况下,编码时间大约节省了60%。     

A computer-enabled solution procedure for food wholesalers’ distribution decision in cities with a circular transportation infrastructure

This paper addresses the food distribution decision from a wholesaler's perspective, as the wholesalers are often faced with thorny issues such as when, where, how to deliver products at the lowest costs to best satisfy the retailers’ changing needs. This research relies on a distribution problem encountered at Northern Grocery Company in Beijing as an example to develop a two-stage solution procedure and subsequent computer-enabled programs for identifying efficient vehicle routing alternatives. The solution process, which integrates heuristic search algorithms and an integer programming model, can be applied to a wide range of distribution problems with specified route durations and a circular transportation network structure as exemplified by City of Beijing.     

A new feature selection method for Gaussian mixture clustering

With the wide applications of Gaussian mixture clustering, e.g., in semantic video classification [H. Luo, J. Fan, J. Xiao, X. Zhu, Semantic principal video shot classification via mixture Gaussian, in: Proceedings of the 2003 International Conference on Multimedia and Expo, vol. 2, 2003, pp. 189-192], it is a nontrivial task to select the useful features in Gaussian mixture clustering without class labels. This paper, therefore, proposes a new feature selection method, through which not only the most relevant features are identified, but the redundant features are also eliminated so that the smallest relevant feature subset can be found. We integrate this method with our recently proposed Gaussian mixture clustering approach, namely rival penalized expectation-maximization (RPEM) algorithm [Y.M. Cheung, A rival penalized EM algorithm towards maximizing weighted likelihood for density mixture clustering with automatic model selection, in: Proceedings of the 17th International Conference on Pattern Recognition, 2004, pp. 633-636; Y.M. Cheung, Maximum weighted likelihood via rival penalized EM for density mixture clustering with automatic model selection, IEEE Trans. Knowl. Data Eng. 17(6) (2005) 750-761], which is able to determine the number of components (i.e., the model order selection) in a Gaussian mixture automatically. Subsequently, the data clustering, model selection, and the feature selection are all performed in a single learning process. Experimental results have shown the efficacy of the proposed approach.