The idea of linear Diophantine fuzzy set(LDFS)theory with its control parameters is a strong model for machine learning and optimization under uncertainty.The activity times in the critical path method(CPM)representat...The idea of linear Diophantine fuzzy set(LDFS)theory with its control parameters is a strong model for machine learning and optimization under uncertainty.The activity times in the critical path method(CPM)representation procedures approach are initially static,but in the Project Evaluation and Review Technique(PERT)approach,they are probabilistic.This study proposes a novel way of project review and assessment methodology for a project network in a linear Diophantine fuzzy(LDF)environment.The LDF expected task time,LDF variance,LDF critical path,and LDF total expected time for determining the project network are all computed using LDF numbers as the time of each activity in the project network.The primary premise of the LDF-PERT approach is to address ambiguities in project network activity timesmore simply than other approaches such as conventional PERT,Fuzzy PERT,and so on.The LDF-PERT is an efficient approach to analyzing symmetries in fuzzy control systems to seek an optimal decision.We also present a new approach for locating LDF-CPM in a project network with uncertain and erroneous activity timings.When the available resources and activity times are imprecise and unpredictable,this strategy can help decision-makers make better judgments in a project.A comparison analysis of the proposed technique with the existing techniques has also been discussed.The suggested techniques are demonstrated with two suitable numerical examples.展开更多
In this paper, a class of the stochastic generalized linear complementarity problems with finitely many elements is proposed for the first time. Based on the Fischer-Burmeister function, a new conjugate gradient proje...In this paper, a class of the stochastic generalized linear complementarity problems with finitely many elements is proposed for the first time. Based on the Fischer-Burmeister function, a new conjugate gradient projection method is given for solving the stochastic generalized linear complementarity problems. The global convergence of the conjugate gradient projection method is proved and the related numerical results are also reported.展开更多
Motivated by the count sketch maximal weighted residual Kaczmarz (CS-MWRK) method presented by Zhang and Li (Appl. Math. Comput., 410, 126486), we combine the count sketch tech with the maximal weighted residual Kaczm...Motivated by the count sketch maximal weighted residual Kaczmarz (CS-MWRK) method presented by Zhang and Li (Appl. Math. Comput., 410, 126486), we combine the count sketch tech with the maximal weighted residual Kaczmarz Method with Oblique Projection (MWRKO) constructed by Wang, Li, Bao and Liu (arXiv: 2106.13606) to develop a new method for solving highly overdetermined linear systems. The convergence rate of the new method is analyzed. Numerical results demonstrate that our method performs better in computing time compared with the CS-MWRK and MWRKO methods.展开更多
Although the structured light system that uses digital fringe projection has been widely implemented in three-dimensional surface profile measurement, the measurement system is susceptible to non-linear error. In this...Although the structured light system that uses digital fringe projection has been widely implemented in three-dimensional surface profile measurement, the measurement system is susceptible to non-linear error. In this work, we propose a convenient look-up-table-based （LUT-based） method to compensate for the non-linear error in captured fringe patterns. Without extra calibration, this LUT-based method completely utilizes the captured fringe pattern by recording the full-field differences. Then, a phase compensation map is established to revise the measured phase. Experimental results demonstrate that this method works effectively.展开更多
In this paper, we present a modified projection method for the linear feasibility problems （LFP）. Compared with the existing methods, the new method adopts a surrogate technique to obtain new iteration instead of th...In this paper, we present a modified projection method for the linear feasibility problems （LFP）. Compared with the existing methods, the new method adopts a surrogate technique to obtain new iteration instead of the line search procedure with fixed stepsize. For the new method, we first show its global convergence under the condition that the solution set is nonempty, and then establish its linear convergence rate. Preliminary numerical experiments show that this method has good performance.展开更多
In this paper, we study the contraction linearity for metric projection in L p spaces. A geometrical property of a subspace Y of L p is given on which P Y is a contraction projection.
微表情是一个人试图隐藏内心真实情感却又不由自主流露出的不易被察觉的面部表情。与一般面部表情相比,微表情最显著的特点是持续时间短、强度弱,往往难以有效识别。文中提出了一种基于LBP-TOP(Local Binary Pattern from Three Orthogo...微表情是一个人试图隐藏内心真实情感却又不由自主流露出的不易被察觉的面部表情。与一般面部表情相比,微表情最显著的特点是持续时间短、强度弱,往往难以有效识别。文中提出了一种基于LBP-TOP(Local Binary Pattern from Three Orthogonal Planes)特征和支持向量机(Support Vector Machine,SVM)分类器的微表情识别方法。首先,采用LBP-TOP算子来提取微表情特征;然后,提出一种基于ReliefF与局部线性嵌入(Locally Linear Embedding,LLE)流形学习算法相结合的特征选择算法,对提取的LBP-TOP特征向量进行降维;最后,使用径向基函数(Radial Basis Function,RBF)核的SVM分类器进行分类,将测试样本图像序列的微表情分为5类:高兴、厌恶、压抑、惊讶、其他。在CASME Ⅱ微表情数据库上采用"留一人交叉验证"(Leave-One-Subject-Out Cross Validation,LOSO-CV)的方式进行了实验,可得到58.98%的分类准确率。实验结果表明了该算法的有效性。展开更多
流形学习方法可以有效地发现存在于高维图像空间的低维子流形,但是流形学习是一种非监督学习方法,其鉴别能力反而不如传统的维数约简方法,且对人脸图像的光照、姿态等局部变化敏感.针对这两个问题,本文提出一种基于人脸表观流形鉴别分...流形学习方法可以有效地发现存在于高维图像空间的低维子流形,但是流形学习是一种非监督学习方法,其鉴别能力反而不如传统的维数约简方法,且对人脸图像的光照、姿态等局部变化敏感.针对这两个问题,本文提出一种基于人脸表观流形鉴别分析的识别方法,该方法利用局部二元模式(Local binary pattern,LBP)对人脸图像进行局部特征描述,提取对局部变化不敏感的特征,然后使用有监督的核局部线性嵌入算法(Supervised kernel local linear embedding,SKLLE)对由局部特征构造的全局特征进行维数约简,提取低维鉴别流形特征进行人脸识别.该方法不仅对局部变化不敏感,而且将人脸表观流形和类别信息进行有效的结合,同时对新样本有较好的泛化性.实验结果表明该算法能有效的提高人脸识别的性能.展开更多
基金supported by the Deanship of Scientific Research,Vice Presidency for Graduate Studies and Scientific Research,King Faisal University,Saudi Arabia[Grant No.GRANT3862].
文摘The idea of linear Diophantine fuzzy set(LDFS)theory with its control parameters is a strong model for machine learning and optimization under uncertainty.The activity times in the critical path method(CPM)representation procedures approach are initially static,but in the Project Evaluation and Review Technique(PERT)approach,they are probabilistic.This study proposes a novel way of project review and assessment methodology for a project network in a linear Diophantine fuzzy(LDF)environment.The LDF expected task time,LDF variance,LDF critical path,and LDF total expected time for determining the project network are all computed using LDF numbers as the time of each activity in the project network.The primary premise of the LDF-PERT approach is to address ambiguities in project network activity timesmore simply than other approaches such as conventional PERT,Fuzzy PERT,and so on.The LDF-PERT is an efficient approach to analyzing symmetries in fuzzy control systems to seek an optimal decision.We also present a new approach for locating LDF-CPM in a project network with uncertain and erroneous activity timings.When the available resources and activity times are imprecise and unpredictable,this strategy can help decision-makers make better judgments in a project.A comparison analysis of the proposed technique with the existing techniques has also been discussed.The suggested techniques are demonstrated with two suitable numerical examples.
文摘In this paper, a class of the stochastic generalized linear complementarity problems with finitely many elements is proposed for the first time. Based on the Fischer-Burmeister function, a new conjugate gradient projection method is given for solving the stochastic generalized linear complementarity problems. The global convergence of the conjugate gradient projection method is proved and the related numerical results are also reported.
文摘Motivated by the count sketch maximal weighted residual Kaczmarz (CS-MWRK) method presented by Zhang and Li (Appl. Math. Comput., 410, 126486), we combine the count sketch tech with the maximal weighted residual Kaczmarz Method with Oblique Projection (MWRKO) constructed by Wang, Li, Bao and Liu (arXiv: 2106.13606) to develop a new method for solving highly overdetermined linear systems. The convergence rate of the new method is analyzed. Numerical results demonstrate that our method performs better in computing time compared with the CS-MWRK and MWRKO methods.
基金the financial support provided by the National Natural Science Foundation of China(11472267 and 11372182)the National Basic Research Program of China(2012CB937504)
文摘Although the structured light system that uses digital fringe projection has been widely implemented in three-dimensional surface profile measurement, the measurement system is susceptible to non-linear error. In this work, we propose a convenient look-up-table-based （LUT-based） method to compensate for the non-linear error in captured fringe patterns. Without extra calibration, this LUT-based method completely utilizes the captured fringe pattern by recording the full-field differences. Then, a phase compensation map is established to revise the measured phase. Experimental results demonstrate that this method works effectively.
基金supported by National Natural Science Foundation of China (No. 10771120)Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry
文摘In this paper, we present a modified projection method for the linear feasibility problems （LFP）. Compared with the existing methods, the new method adopts a surrogate technique to obtain new iteration instead of the line search procedure with fixed stepsize. For the new method, we first show its global convergence under the condition that the solution set is nonempty, and then establish its linear convergence rate. Preliminary numerical experiments show that this method has good performance.
基金Supported by the natural science foundation of Hebei
文摘In this paper, we study the contraction linearity for metric projection in L p spaces. A geometrical property of a subspace Y of L p is given on which P Y is a contraction projection.
文摘流形学习方法可以有效地发现存在于高维图像空间的低维子流形,但是流形学习是一种非监督学习方法,其鉴别能力反而不如传统的维数约简方法,且对人脸图像的光照、姿态等局部变化敏感.针对这两个问题,本文提出一种基于人脸表观流形鉴别分析的识别方法,该方法利用局部二元模式(Local binary pattern,LBP)对人脸图像进行局部特征描述,提取对局部变化不敏感的特征,然后使用有监督的核局部线性嵌入算法(Supervised kernel local linear embedding,SKLLE)对由局部特征构造的全局特征进行维数约简,提取低维鉴别流形特征进行人脸识别.该方法不仅对局部变化不敏感,而且将人脸表观流形和类别信息进行有效的结合,同时对新样本有较好的泛化性.实验结果表明该算法能有效的提高人脸识别的性能.
