Generalized constrained multiobjective games in locally FC-uniform spaces

A new class of generalized constrained multiobjective games is introduced and studied in locally FC-uniform spaces without convexity structure where the number of players may be finite or infinite and all payoff functions get their values in an infinite-dimensional space. By using a Himmelberg type fixed point theorem in locally FC-uniform spaces due to author, some existence theorems of weak Paxeto equilibria for the generalized constrained multiobjective games are established in locally FC-uniform spaces. These theorems improve, unify and generalize the corresponding results in recent literatures.

An Evolutionary Algorithm with Multi-Local Search for the Resource-Constrained Project Scheduling Problem

This paper introduces a hybrid evolutionary algorithm for the resource-constrained project scheduling problem (RCPSP). Given an RCPSP instance, the algorithm identifies the problem structure and selects a suitable decoding scheme. Then a multi-pass biased sampling method followed up by a multi-local search is used to generate a diverse and good quality initial population. The population then evolves through modified order-based recombination and mutation operators to perform exploration for promising solutions within the entire region. Mutation is performed only if the current population has converged or the produced offspring by recombination operator is too similar to one of his parents. Finally the algorithm performs an intensified local search on the best solution found in the evolutionary stage. Computational experiments using standard instances indicate that the proposed algorithm works well in both computational time and solution quality.

EQUILIBRIUM EXISTENCE FOR MULTI-LEADER-FOLLOWER GENERALIZED CONSTRAINED MULTIOBJECTIVE GAMES IN LOCALLY FC-UNIFORM SPACES

In this article, we introduce and study some new classes of multi-leader-follower generalized constrained multiobjective games in locally FC-uniform spaces where the number of leaders and followers may be finite or infinite and the objective functions of the followers obtain their values in infinite-dimensional spaces. Each leader has a constrained correspondence. By using a collective fixed point theorem in locally FC-uniform spaces due to author, some existence theorems of equilibrium points for the multi-leader-follower generalized constrained multiobjective games are established under nonconvex settings. These results generalize some corresponding results in recent literature.

NEW SIMPLE SMOOTH MERIT FUNCTION FOR BOX CONSTRAINED VARIATIONAL INEQUALITIES AND DAMPED NEWTON TYPE METHOD

By introducing a smooth merit function for the median function, a new smooth merit function for box constrained variational inequalities (BVIs) was constructed. The function is simple and has some good differential properties. A damped Newton type method was presented based on it.Global and local superlinear/quadratic convergence results were obtained under mild conditions, and the finite termination property was also shown for the linear BVIs. Numerical results suggest that the method is efficient and promising.

Practical constrained least-square algorithm for moving source location using TDOA and FDOA measurements

By utilizing the time difference of arrival （TDOA） and frequency difference of arrival （FDOA） measurements of signals received at a number of receivers, a constrained least-square （CLS） algorithm for estimating the position and velocity of a moving source is proposed. By utilizing the Lagrange multipliers technique, the known relation between the intermediate variables and the source location coordinates could be exploited to constrain the solution. And without requiring apriori knowledge of TDOA and FDOA measurement noises, the proposed algorithm can satisfy the demand of practical applications. Additionally, on basis of con- volute and polynomial rooting operations, the Lagrange multipliers can be obtained efficiently and robustly allowing real-time imple- mentation and global convergence. Simulation results show that the proposed estimator achieves remarkably better performance than the two-step weighted least square （WLS） approach especially for higher measurement noise level.

基于语义与几何约束的动态SLAM系统

针对传统视觉SLAM在动态环境中出现的漂移、定位丢失和精度差等问题,提出一种基于语义先验信息和几何约束的面向动态环境的视觉SLAM系统。在传统ORB-SLAM2系统框架下加入语义分割模块,以提取物体的先验信息;利用先验的静态特征点进行几何约束,剔除图像中的动态特征点;针对剔除动态特征点会导致特征缺失等问题,加入图像补全线程,合成一个不包含动态物体的图像帧;利用合成帧求解相机位姿。实验结果表明,与传统算法相比,该算法在高动态环境中具有较高精度。

基于Swin Transformer和图形推理的结直肠息肉分割方法

针对结直肠息肉图像分割中病灶区域尺度变化大、边缘模糊以及息肉与正常组织对比度低等问题,导致病变区域分割精度低和分割边界存在伪影,提出一种基于Swin Transformer和图形推理的自适应网络.该网络一是利用Swin Transformer编码器逐层提取输入图像的全局上下文信息,弱化背景信息干扰,多尺度分析病变区域的显著性特点.二是提出全局与局部特征交互模块增强网络对复杂病灶的空间感知能力,突出待分割目标的关键位置信息,精准定位目标.三是通过区域引导图推理模块以图循环递推的方式挖掘先验信息之间的高阶显性关系,促进图间信息传递.四是设计面向边缘细节的边缘约束图推理模块,整合边缘细节,改善分割效果,提高分割精度.在CVC-ClinicDB、Kvasir、CVC-ColonDB和ETIS数据集上进行实验,其Dice系数分别为0.939,0.926,0.810和0.788,平均交并比分别为0.889,0.879,0.731和0.710,分割性能优于现有方法.仿真实验结果表明,对于形态结构复杂、对比度低和边缘模糊的结直肠息肉图像均有较高的分割精度.

Improved Dual Algorithm for Constrained Optimization Problems

One class of effective methods for the optimization problem with inequality constraints are to transform the problem to a unconstrained optimization problem by constructing a smooth potential function. In this paper, we modifies a dual algorithm for constrained optimization problems and establishes a corresponding improved dual algorithm; It is proved that the improved dual algorithm has the local Q-superlinear convergence; Finally, we performed numerical experimentation using the improved dual algorithm for many constrained optimization problems, the numerical results are reported to show that it is valid in practical computation.

Semidefinite programming approach for TDOA/GROA based source localization

Time-differences-of-arrival （TDOA） and gain-ratios-of- arrival （GROA） measurements are used to determine the passive source location. Based on the measurement models, the con- strained weighted least squares （CWLS） estimator is presented. Due to the nonconvex nature of the CWLS problem, it is difficult to obtain its globally optimal solution. However, according to the semidefinite relaxation, the CWLS problem can be relaxed as a convex semidefinite programming problem （SDP）, which can be solved by using modern convex optimization algorithms. Moreover, this relaxation can be proved to be tight, i.e., the SDP solves the relaxed CWLS problem, and this hence guarantees the good per- formance of the proposed method. Furthermore, this method is extended to solve the localization problem with sensor position errors. Simulation results corroborate the theoretical results and the good performance of the proposed method.

New simple exact penalty function for constrained minimization

By adding one variable to the equality- or inequality-constrained minimization problems, a new simple penalty function is proposed. It is proved to be exact in the sense that under mild assumptions, the local minimizers of this penalty function are precisely the local minimizers of the original problem, when the penalty parameter is sufficiently large.

NEW SIMPLE SMOOTH MERIT FUNCTION FOR BOX CONSTRAINED VARIATIONAL INEQUALITIES AND DAMPED NEWTON TYPE METHOD

By introducing a smooth merit function for the median function, a new smooth merit function for box constrained variational inequalities （BVIs） was constructed. The function is simple and has some good differential properties. A damped Newton type method was presented based on it. Global and local superlinear/ quadratic convergence results were obtained under mild conditions, and the finite termination property was also shown for the linear BVIs. Numerical results suggest that the method is efficient and promising.

Memetic algorithm for multi-mode resource-constrained project scheduling problems

A memetic algorithm （MA） for a multi-mode resourceconstrained project scheduling problem （MRCPSP） is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The fitness function makes use of a mechanism called ＂strategic oscillation＂ to make the search process have a higher probability to visit solutions around a ＂feasible boundary＂. One of the local search procedures aims at improving the lower bound of project makespan to be less than a known upper bound, and another aims at improving a solution of an MRCPSP instance accepting infeasible solutions based on the new fitness function in the search process. A detailed computational experiment is set up using instances from the problem instance library PSPLIB. Computational results show that the proposed MA is very competitive with the state-of-the-art algorithms. The MA obtains improved solutions for one instance of set J30.

基于最小哈希的网络单信道重复数据剔除算法

剔除重复数据是保证网络高效运行不可缺少的步骤,但该过程易受信号强度、网络装置、路由器性能等问题的干扰。为此,提出基于最小哈希的网络单信道重复数据剔除算法。首先利用哈希算法中的散列函数对网络单信道数据实行聚类处理,然后采用带有监督判别的投影算法对聚类后的数据进行降维处理,最后采用代数签名预估数据,保证数据之间的计算开销最小,再构造最小哈希树生成校验值,在更新去重标签的同时,通过双层剔除机制完全剔除单信道中的重复数据。实验结果表明,该算法的执行时间短,且计算和存储开销较小。

Development of Algorithm for Person Re-Identification Using Extended Openface Method

Deep learning has risen in popularity as a face recognition technology in recent years.Facenet,a deep convolutional neural network(DCNN)developed by Google,recognizes faces with 128 bytes per face.It also claims to have achieved 99.96%on the reputed Labelled Faces in the Wild(LFW)dataset.How-ever,the accuracy and validation rate of Facenet drops down eventually,there is a gradual decrease in the resolution of the images.This research paper aims at developing a new facial recognition system that can produce a higher accuracy rate and validation rate on low-resolution face images.The proposed system Extended Openface performs facial recognition by using three different features i)facial landmark ii)head pose iii)eye gaze.It extracts facial landmark detection using Scattered Gated Expert Network Constrained Local Model(SGEN-CLM).It also detects the head pose and eye gaze using Enhanced Constrained Local Neur-alfield(ECLNF).Extended openface employs a simple Support Vector Machine(SVM)for training and testing the face images.The system’s performance is assessed on low-resolution datasets like LFW,Indian Movie Face Database(IMFDB).The results demonstrated that Extended Openface has a better accuracy rate(12%)and validation rate(22%)than Facenet on low-resolution images.

基于时空图像分割和交互区域检测的人体动作识别方法

针对现有人体动作识别方法没有考虑到非人体目标的作用,提出一种基于时空图像分割和目标交互区域检测的人体动作识别方法。在视频流中检测出人体轮廓,并将其进行时空图像分段形成关键段区域;然后,扩展分段使其包含与人体交互的非人体目标,通过时空梯度方向直方图(HOG)和光流场方向直方图(HOF)描述符来表示关键段的静态和动态特征,并通过K-均值算法构建成码书,同时采用局部约束线性编码(LLC)技术来优化码书;最后采用非线性支持向量机(SVM)对特征进行学习并进行动作识别。实验结果表明,与现有基于兴趣点的方法相比,该方案获得了较高的动作识别率。

非负局部约束线性编码图像分类算法

基于特征提取的图像分类算法的核心问题是如何对特征进行有效编码.局部约束线性编码(Locality-constrained linear coding,LLC)因其良好的特征重构性与局部平滑稀疏性,已取得了很好的分类性能.然而,LLC编码的分类性能对编码过程中的近邻数k的大小比较敏感,随着k的增大,编码中的某些负值元素与正值元素的差值绝对值也可能增大,这使得LLC越来越不稳定.本文通过在LLC优化模型的目标方程中引入非负约束,提出了一种新型编码方式,称为非负局部约束线性编码(Non-negative locality-constrained linear coding,NNLLC).该模型一般采取迭代优化算法进行求解,但其计算复杂度较大.因此,本文提出两种近似非负编码算法,其编码速度与LLC一样快速.实验结果表明,在多个广泛使用的图像数据集上,相比于LLC,NNLLC编码方式不仅在分类精确率上提高了近1%～4%,而且对k的选取具有更强的鲁棒性.

一种基于多级空间视觉词典集体的图像分类方法

针对单一特征时存在提取的信息量不足,对图像内容描述比较片面,提出将传统的SIFT特征与KDESG特征进行串行融合,生成一个联合向量作为新的特征向量.针对传统的视觉词典构造方法缺乏考虑视觉词汇在空间的分布特点,本文引入图像空间信息,提出了一种空间视觉词典的构造方法,先对图像进行空间金字塔划分,再把空间各子区域内的特征分别聚类,构建属于对应子空间区域的空间视觉词典.在图像表示阶段,图像各子区域内的特征基于其对应的空间视觉词典进行LLC稀疏编码,根据各子区域对图像贡献程度的不同,把编码后各子区域的特征向量赋予不同的权重加权处理,再连接形成最终的图像描述.最后,利用线性SVM进行图像分类,实验结果表明了本文方法的有效性和鲁棒性.

基于LLC与GIST特征的静态人体行为分类

针对静态图像人体行为识别问题,提出一种融合局部约束线性编码(LLC)和全局特征描述子的方法。该方法对图像进行密集采样,提取每个子区域的SIFT特征,利用LLC方法对提取的密集SIFT特征进行编码和池化。为了加入空间信息,采用空间金字塔的思想,获得具有空间位置信息的LLC池化特征。将LLC池化特征串联通用搜索树(GIST)特征作为图像的最终描述,使用核函数为直方图交叉核函数的支持向量机进行分类。实验结果表明,与利用LLC、空间金字塔匹配特征和GIST特征进行识别的方法相比,该方法识别效果较好。

基于粒子群的控制器参数模糊规则自动提取

设计一种移动机器人轨迹跟踪控制器并利用Lyapunov稳定性定理证明了该控制器的全局稳定性。针对人为设定该类控制器参数工作量较大,根据移动机器人跟踪控制过程的非线性本质,提出了一种采用模糊非线性参数的跟踪控制方法。在无先验知识的前提下,利用粒子群算法自动提取控制器参数的模糊规则基。设计一种动态群体的粒子群方法,使得种群的多样性得到保证,减少局部收敛的可能,同时又不会对已有种群的模式造成巨大破坏。对比实验验证了该方法的有效性。

基于改进典型形状上下文特征的形状识别方法

针对形状上下文特征难以解决大规模样本的形状识别问题,提出一种利用角点典型形状上下文特征进行快速形状识别的方法.该方法仅以少数角点作为代表点生成直方图,对目标形状关键特征进行描述,通过减少匹配的特征数目降低了采样点匹配时间;在此基础上提出了局部约束匹配的方法,能够快速实现形状匹配并解决特征旋转不变性的问题,最终通过结合快速剪枝和精确匹配完成形状的识别.对形状数据进行仿真实验的结果证明,文中方法能够快速、有效地实现大规模数据的形状识别和检索.