Effects of high-order correlations on personalized recommendations for bipartite networks

In this paper, we introduce a modified collaborative filtering (MCF) algorithm, which has remarkably higher accuracy than the standard collaborative filtering. In the MCF, instead of the cosine similarity index, the user-user correlations are obtained by a diffusion process. Furthermore, by considering the second-order correlations, we design an effective algorithm that depresses the influence of mainstream preferences. Simulation results show that the algorithmic accuracy, measured by the average ranking score, is further improved by 20.45% and 33.25% in the optimal cases of MovieLens and Netflix data. More importantly, the optimal value depends approximately monotonously on the sparsity of the training set. Given a real system, we could estimate the optimal parameter according to the data sparsity, which makes this algorithm easy to be applied. In addition, two significant criteria of algorithmic performance, diversity and popularity, are also taken into account. Numerical results show that as the sparsity increases, the algorithm considering the second-order correlation can outperform the MCF simultaneously in all three criteria.     

Personal recommendation via modified collaborative filtering

In this paper, we propose a novel method to compute the similarity between congeneric nodes in bipartite networks. Different from the standard cosine similarity, we take into account the influence of a node’s degree. Substituting this new definition of similarity for the standard cosine similarity, we propose a modified collaborative filtering (MCF). Based on a benchmark database, we demonstrate the great improvement of algorithmic accuracy for both user-based MCF and object-based MCF.     

Information filtering via weighted heat conduction algorithm

In this paper, by taking into account effects of the user and object correlations on a heat conduction (HC) algorithm, a weighted heat conduction (WHC) algorithm is presented. We argue that the edge weight of the user-object bipartite network should be embedded into the HC algorithm to measure the object similarity. The numerical results indicate that both the accuracy and diversity could be improved greatly compared with the standard HC algorithm and the optimal values reached simultaneously. On the Movielens and Netflix datasets, the algorithmic accuracy, measured by the average ranking score, can be improved by 39.7% and 56.1% in the optimal case, respectively, and the diversity could reach 0.9587 and 0.9317 when the recommendation list equals to 5. Further statistical analysis indicates that, in the optimal case, the distributions of the edge weight are changed to the Poisson form, which may be the reason why HC algorithm performance could be improved. This work highlights the effect of edge weight on a personalized recommendation study, which maybe an important factor affecting personalized recommendation performance.     

QCF: Quantum Collaborative Filtering Recommendation Algorithm

With the rapid development of the Internet, e-commerce plays an important role in people’s lives, and the recommendation system is one of the most critical technologies. However, as the number of users and the scale of goods increase sharply, the traditional collaborative filtering recommendation algorithm has a large computational complexity in the part of calculating the user similarity, which leads to a low recommendation efficiency. In response to the above problems, this paper introduces the concept of quantum computing theory. The user score vector is first prepared into a quantum state, the similarity score is calculated in parallel, then the similarity information is saved into the quantum bit, and finally the similar user is searched by the Grover search algorithm. Compared with the traditional collaborative filtering recommendation algorithm, the time complexity of the collaborative filtering recommendation algorithm based on Grover algorithm can be effectively reduced under certain conditions.

     

Collaborative filtering based on multi-channel diffusion

In this paper, by applying a diffusion process, we propose a new index to quantify the similarity between two users in a user-object bipartite graph. To deal with the discrete ratings on objects, we use a multi-channel representation where each object is mapped to several channels with the number of channels being equal to the number of different ratings. Each channel represents a certain rating and a user having voted an object will be connected to the channel corresponding to the rating. Diffusion process taking place on such a user-channel bipartite graph gives a new similarity measure of user pairs, which is further demonstrated to be more accurate than the classical Pearson correlation coefficient under the standard collaborative filtering framework.     

基于自适应阈值和动态更新因子的ViBe改进算法

针对传统ViBe算法不能及时反映场景变化,动态场景适应性差等问题,提出一种改进的ViBe算法。改进内容包括：采用随机选取背景样本和24邻域法获取初始背景,可以加速“鬼影”消融;结合大津法（OTSU）和均匀性度量法的平均自适应阈值计算方法,可以提高算法对树叶晃动、水波纹和光照变化等环境的适应性,最大限度保留有效像素;更新阶段引入自适应更新因子,可以有效减少被误判的概率,从而增强算法的鲁棒性;最后通过形态学处理和滤波使目标更加完整。采用标准数据集视频对改进算法进行了测试和对比分析,改进算法相对于KDE算法、GMM算法和传统ViBe算法各项指标均有大幅度提高,精确度分别提高30.44%、40.72%和20.95%,错分比分别降低了43.28%、40.59%和29.43%。     

受污染混沌信号的协同滤波降噪

根据混沌吸引子的自相似分形特性,提出了一种利用协同滤波重构受污染混沌信号的降噪算法.所设计的降噪算法通过对相似片段的分组将一维混沌信号的降噪转化为一个二维联合滤波问题;然后,在二维变换域用阈值法衰减噪声;最后,通过反变换获得原始信号的估计.由于分组中的相似片段具有良好的相关性,与直接在一维变换域做阈值降噪相比,分组的二维变换能获得原信号更稀疏的表示,更好地抑制噪声.仿真结果表明,该算法对原始混沌信号的重构精度和信噪比的提升都优于小波阈值、局部曲线拟合等现有的混沌信号降噪方法,对相图的还原质量也更好.     

Mixed noise removal algorithm of EBAPS image under low illumination condition based on FPGA北大核心CSCD

In order to solve the problem that single median filtering and gaussian filtering algorithm is not effective in suppressing impulse noise and poisson noise simultaneously in low illumination image, and the edge detail protection is insufficient, an open and close mix-median-gaussian (OCMMG) filtering algorithm based on field programmable gate array (FPGA) was proposed. Firstly, the minimum four-direction difference was used to detect the anomaly degree of each pixel point, the weight was allocated according to the threshold of pulse noise discrimination, and the first step was filtering. Then, the four-direction edge detection algorithm was used to extract image edges, and the second step was filtered according to the set edge confidence characterization value. Finally, the images collected by electron bombarded active pixel sensor (EBAPS) under the condition of 1×10−3 lx illumination were processed by FPGA in real time. The experimental results show that the FPGA processing results are consistent with the software simulation processing results. Compared with the median filtering and gaussian filtering algorithm, the peak signal-to-noise ratio (PSNR) of the algorithm is improved by 3.23% and 16.34%, the structural similarity is improved by 14.66% and 33.86%, and the edge retention index is improved by 0.49% and 4.21%, respectively, which can effectively remove the mixed noise of EBAPS image and meet the real-time requirements. © 2022 Editorial office of Journal of Applied Optics. All rights reserved.     

一类求解箱式约束优化问题的自适应引力搜索算法

为了改进引力搜索算法求解箱式约束优化问题的性能,提出了一类自适应引力搜索算法,新算法定义了算法停滞系数,当算法陷入停滞时,可以自适应的修改引力参数,帮助算法跳出停滞状态;定义了个体相似系数,当种群陷入局部最优时,通过变异策略改善种群的多样性。数值试验结果表明,新算法有效的平衡了全局开发和局部搜索能力,具有更强的全局寻优能力,适于求解复杂优化问题。     

基于改进梯度幅值的包装缺陷检测算法研究及应用

针对包装质量检测精度易受外界光照影响的问题，在已有基于梯度幅值相似性的缺陷检测算法基础上，将局部二值模式算子引入到该算法中，提出了一种基于改进梯度幅值相似性的缺陷检测算法。该算法利用局部二值模式算子的旋转不变性和灰度不变性的特点，并将其与图像的梯度幅值特征进行融合后用于包装的缺陷检测中，提升了缺陷检测算法对光照的鲁棒性。实验结果表明，相比传统梯度幅值缺陷检测算法，该算法具有更好的抗光照影响能力，并且对于不同光照情况下的包装缺陷，该算法的检测准确率可达96.57%。因而，该算法能够被广泛地用于包装缺陷检测中，提高缺陷检测的精度。     

一种用于合成孔径雷达图像相干斑抑制的双边滤波参数配置新方法

基于最优折衷假设以及等效视数曲线和边缘保持指数曲线的单调特性, 提出了一种用于合成孔径雷达(SAR) 图像相干斑抑制的双边滤波参数配置新方法. 该方法与传统方法相比, 在计算时间相当的情况下, 灰度值近似方差精度提高一个数量级; 当灰度值近似方差精度相同时, 计算时间减少一个数量级.     

数字图像相关技术的综合算法及其在断裂力学中的应用

鉴于散斑图的随机噪声和相关搜索运算过程仍是当今影响相关图像技术所获结果精度与计算速度两大有待研究解决的主要问题,提出一种基于小波变换、序惯相似度检测和统计相关算法三者相结合的新算法。其基本原理是应用小波变换对变形前后的散斑图进行滤波平滑处理;利用序惯相似度检测算法进行粗搜索,找到可能的匹配点;在可能的匹配点应用统计相关法进行细搜索,最终找到匹配点的位置。基本实验、计算和应用表明,这种算法在消除噪声和提高运算速度等方面,取得了良好的效果。     

Weighted Similarity and Core-User-Core-Item Based Recommendations

In traditional recommendation algorithms, the users and/or the items with the same rating scores are equally treated. In real world, however, a user may prefer some items to other items and some users are more loyal to a certain item than other users. In this paper, therefore, we propose a weighted similarity measure by exploiting the difference in user-item relationships. In particular, we refer to the most important item of a user as his core item and the most important user of an item as its core user. We also propose a Core-User-Item Solver (CUIS) to calculate the core users and core items of the system, as well as the weighting coefficients for each user and each item. We prove that the CUIS algorithm converges to the optimal solution efficiently. Based on the weighted similarity measure and the obtained results by CUIS, we also propose three effective recommenders. Through experiments based on real-world data sets, we show that the proposed recommenders outperform corresponding traditional-similarity based recommenders, verify that the proposed weighted similarity can improve the accuracy of the similarity, and then improve the recommendation performance.     

改进Canny算法的红外人脸图像边缘轮廓提取

红外人脸图像的边缘轮廓特征对于红外人脸检测、识别等相关应用具有重要价值。针对红外人脸图像边缘轮廓提取时存在伪边缘的问题,提出了一种改进Canny算法的红外人脸图像边缘轮廓提取方法。首先通过对引导滤波算法引入“动态阈值约束因子”替换原始算法中的高斯滤波,解决了原始算法滤波处理不均匀和造成红外人脸图像弱边缘特征丢失的弊端;接着对原始算法的非极大值抑制进行了改进,在原始计算梯度方向的基础上又增加了4个梯度方向,使得非极大值抑制的插值较原始算法更加精细;最后改进OTSU(大津)算法,构造灰度-梯度映射函数确定最佳阈值,解决了原始算法人为经验确定阈值的局限性。实验结果表明:提出的改进Canny算法的红外人脸轮廓提取方法滤波后的图像,相较于原始Canny算法滤波处理,信噪比性能提升了34.40%,结构相似度性能提升了21.66%;最终的红外人脸边缘轮廓提取实验的优质系数值高于对比实验的其他方法,证明改进后的算法对于红外人脸图像边缘轮廓提取具有优越性。     

ICF靶腔曲面光场计算

传统的衍射计算方法都是针对衍射场为平面的计算,对于ICF靶腔衍射场为曲面时,计算困难。通过比较常用衍射计算方法的优缺点,基于层析成像的思想,提出采用快速傅里叶变换分层计算,并根据最相邻原则拟合曲面衍射场光场分布的快速计算方法。该方法可以计算出任意给定空间曲面上的光场分布,且具有计算快速、结果精确的优点。模拟分析表明,当分层数足够大时,采用该方法可有效解决ICF靶腔内壁曲面光场的计算问题。     

Optimization Algorithms for Joint Power and Sub-Channel Allocation for NOMA-Based Maritime Communications

This paper investigates resource optimization schemes in a marine communication scenario based on non-orthogonal multiple access (NOMA). According to the offshore environment of the South China Sea, we first establish a Longley–Rice-based channel model. Then, the weighted achievable rate (WAR) is considered as the optimization objective to weigh the information rate and user fairness effectively. Our work introduces an improved joint power and user allocation scheme (RBPUA) based on a single resource block. Taking RBPUA as a basic module, we propose three joint multi-subchannel power and marine user allocation algorithms. The gradient descent algorithm (GRAD) is used as the reference standard for WAR optimization. The multi-choice knapsack algorithm combined with dynamic programming (MCKP-DP) obtains a WAR optimization result almost equal to that of GRAD. These two NOMA-based solutions are able to improve WAR performance by 7.47% compared with OMA. Due to the high computational complexity of the MCKP-DP, we further propose a DP-based fully polynomial-time approximation algorithm (DP-FPTA). The simulation results show that DP-FPTA can reduce the complexity by 84.3% while achieving an approximate optimized performance of 99.55%. This advantage of realizing the trade-off between performance optimization and complexity meets the requirements of practical low-latency systems.     

面向脑血管分割的改进型非局部均值滤波算法研究

介绍了经典非局部均值滤波算法与Manjón非局部均值滤波算法,改进了非局部均值滤波方法的相似度权值,使算法在具有旋转平移不变性,保持时间复杂度的同时优化了视觉效果与信噪比。实验通过添加噪声标准差从10~100不等的高斯加性噪声,比较了改进后的算法与传统滤波算法以及Manjón非均值滤波算法,结果表明,改进后的算法无论从视觉上还是数值上都优于Manjón非均值滤波算法。     

基于多标签共享子空间学习和内核脊回归的空谱分类算法

针对高光谱图像维度高、地物间非线性可分造成的分类精度低等问题,提出一种基于多标签共享子空间和内核脊回归的空谱分类算法.该算法利用内核脊回归将地物相近像素在线性空间的不可分特征映射到高维空间中,实现分类特性在高维空间下的有效分离,以提高地物相近特性的区分精度;同时将高维样本数据映射到低维共享子空间中,在低维环境下以多类标为指导,引入低秩矩阵建立类别标签与共享空间的预测关系,挖掘多标签间的共同特性,提高融合利用多类别间的共同属性提高高光谱图像的分类精度;最后利用奇异值分解迭代法求解目标函数,一定程度上加速参数求解.在Indian Pines和Pavia University两组高光谱数据集上进行仿真实验,实验结果表明,与其他同类算法相比,在低样本比例下,本文算法在总体分类精度、平均分类精度和Kappa系数等评价指标上至少提高4.76%、4.24%和5.19%,与非内核化的算法相比,本文算法在基本不增加运行时间的情况下总体分类精度、平均分类精度和Kappa系数至少提高2.92%、2.8%和3.48%.     

Temporal information effect on personalized recommendation

As information explosively grows, it requires to find out the highly efficient data from the global database. In this paper, based on two real systems, i.e., the MovieLens and Netflix, we investigate the temporal information effect on personalized recommendation for three collaborative filtering algorithms, by considering both the volume and time of the training data. It is observed that, for an increasing training data of a certain time range, the recommendation accuracy using the time-dependent training data outperforms that using the random training data of the same size. Moreover, the increase of data volume would not always improve the recommendation accuracy for the time-dependent training data case, whereas the recent temporal training data are important to elevate the recommendation accuracy. Further study on a hybrid algorithm of heat conduction and mass diffusion shows that, using the recent temporal information as training data, the algorithm reaches the optimal recommendation accuracy, when it returns to the original mass diffusion algorithm, which suggests no necessity of introducing an extra parameter. And the simple mass diffusion algorithm is found to be more advantageous than the previous three algorithms.     

惯性约束聚变中环孔编码图像恢复的改进维纳滤波方法

针对惯性约束聚变(ICF)中环形孔径编码图像的恢复问题提出了一种改进的维纳滤波方法。在传统的维纳滤波方法中,由于原图像和噪声是未知的,故通常是用某一待定常量来代替其中的噪声与信号的谱密度之比。这种近似忽视了信号与噪声本身的信息,从而造成丢失某些关键的细节,难以达到高质量的图像复原效果。在改进的方法中,首先采用传统维纳滤波方法求得初始估值,然后利用该初始值求得原图像及噪声的谱密度估值,进而利用这些新获得的信息构成改进的维纳滤波器对退化图像进行第二次滤波。实验表明,这种改进方法可以克服原方法的不足,突出图像的一些关键细节,提高图像的整体质量。在仿真实验中,恢复图像的均方误差降低了15％以上;在实际惯性约束聚变图像的解码恢复实验中,图像恢复效果亦有显著改善。该方法还可以推广到其他图像恢复的应用中。