期刊文献+
共找到127篇文章
< 1 2 7 >
每页显示 20 50 100
Blind Image Quality Assessment by Pairwise Ranking Image Series
1
作者 Li Xu Xiuhua Jiang 《China Communications》 SCIE CSCD 2023年第9期127-143,共17页
Image quality assessment(IQA)is constantly innovating,but there are still three types of stickers that have not been resolved:the“content sticker”-limitation of training set,the“annotation sticker”-subjective inst... Image quality assessment(IQA)is constantly innovating,but there are still three types of stickers that have not been resolved:the“content sticker”-limitation of training set,the“annotation sticker”-subjective instability in opinion scores and the“distortion sticker”-disordered distortion settings.In this paper,a No-Reference Image Quality Assessment(NR IQA)approach is proposed to deal with the problems.For“content sticker”,we introduce the idea of pairwise comparison and generate a largescale ranking set to pre-train the network;For“annotation sticker”,the absolute noise-containing subjective scores are transformed into ranking comparison results,and we design an indirect unsupervised regression based on EigenValue Decomposition(EVD);For“distortion sticker”,we propose a perception-based distortion classification method,which makes the distortion types clear and refined.Experiments have proved that our NR IQA approach Experiments show that the algorithm performs well and has good generalization ability.Furthermore,the proposed perception based distortion classification method would be able to provide insights on how the visual related studies may be developed and to broaden our understanding of human visual system. 展开更多
关键词 no reference image quality assessment distortion classification method pairwise preference network EVD-based unsupervised regression
下载PDF
Deep Fake Detection Using Computer Vision-Based Deep Neural Network with Pairwise Learning
2
作者 R.Saravana Ram M.Vinoth Kumar +3 位作者 Tareq M.Al-shami Mehedi Masud Hanan Aljuaid Mohamed Abouhawwash 《Intelligent Automation & Soft Computing》 SCIE 2023年第2期2449-2462,共14页
Deep learning-based approaches are applied successfully in manyfields such as deepFake identification,big data analysis,voice recognition,and image recognition.Deepfake is the combination of deep learning in fake creati... Deep learning-based approaches are applied successfully in manyfields such as deepFake identification,big data analysis,voice recognition,and image recognition.Deepfake is the combination of deep learning in fake creation,which states creating a fake image or video with the help of artificial intelligence for political abuse,spreading false information,and pornography.The artificial intel-ligence technique has a wide demand,increasing the problems related to privacy,security,and ethics.This paper has analyzed the features related to the computer vision of digital content to determine its integrity.This method has checked the computer vision features of the image frames using the fuzzy clustering feature extraction method.By the proposed deep belief network with loss handling,the manipulation of video/image is found by means of a pairwise learning approach.This proposed approach has improved the accuracy of the detection rate by 98%on various datasets. 展开更多
关键词 Deep fake deep belief network fuzzy clustering feature extraction pairwise learning
下载PDF
基于Pairwise策略优化的双塔召回算法模型研究
3
作者 于庆洋 《中国新通信》 2023年第11期34-36,共3页
在推荐或广告系统中,召回阶段扮演着快速从大量的候选集中挑选出较为合适的物品Item集合,作为下一阶段精排的准入,从而起到在较为贴合用户兴趣的基础上,缓解精排的计算压力的作用,故召回阶段面临的候选集数量通常非常大,一般在几百万至... 在推荐或广告系统中,召回阶段扮演着快速从大量的候选集中挑选出较为合适的物品Item集合,作为下一阶段精排的准入,从而起到在较为贴合用户兴趣的基础上,缓解精排的计算压力的作用,故召回阶段面临的候选集数量通常非常大,一般在几百万至上亿规模。此时,在训练召回模型时,采样便成了很重要的问题,尤其是负采样,一般情况下,训练召回模型时,会做随机负采样,由于召回模型负样本的不置信问题,采到的负样本有可能并不是真负样本,导致影响了模型的训练效果。针对此问题,本文提出了一个基于双塔模型的Pairwise训练策略,利用度量学习的思想规避召回模型负采样过程中负样本不置信的问题,不直接针对负样本判别真假,而是学习样本对之间的差距,提升模型学习精度与效率。 展开更多
关键词 推荐系统 召回 双塔模型 负样本 pairwise
下载PDF
Pairwise马尔科夫模型下的势均衡多目标多伯努利滤波器 被引量:3
4
作者 张光华 韩崇昭 +1 位作者 连峰 曾令豪 《自动化学报》 EI CSCD 北大核心 2017年第12期2100-2108,共9页
由于在实际应用中目标模型不一定满足隐马尔科夫模型(Hidden Markov model,HMM)隐含的马尔科夫假设和独立性假设条件,一种更为一般化的Pairwise马尔科夫模型(Pairwise Markov model,PMM)被提出.它放宽了HMM的结构性限制,可以有效地处理... 由于在实际应用中目标模型不一定满足隐马尔科夫模型(Hidden Markov model,HMM)隐含的马尔科夫假设和独立性假设条件,一种更为一般化的Pairwise马尔科夫模型(Pairwise Markov model,PMM)被提出.它放宽了HMM的结构性限制,可以有效地处理更为复杂的目标跟踪场景.本文针对杂波环境下的多目标跟踪问题,提出一种在PMM框架下的势均衡多目标多伯努利(Cardinality balanced multi-target multi-Bernoulli,CBMe MBer)滤波器,并给出它在线性高斯PMM条件下的高斯混合(Gaussian mixture,GM)实现.最后,采用一种满足HMM局部物理特性的线性高斯PMM,将本文所提算法与概率假设密度(Probability hypothesis density,PHD)滤波器进行比较.实验结果表明本文所提算法的跟踪性能优于PHD滤波器. 展开更多
关键词 隐马尔科夫模型 pairwise马尔科夫模型 多目标跟踪 随机有限集 多伯努利密度 高斯混合
下载PDF
基于PairWise排序学习算法研究综述 被引量:6
5
作者 熊李艳 陈晓霞 +1 位作者 钟茂生 黄晓辉 《科学技术与工程》 北大核心 2017年第21期184-190,共7页
Learning to Rank(L2R)技术是对搜索结果进行排序,是近几年的研究热点。现关于L2R中的PairWise方法进行研究分析,PairWise方法将排序问题转化为二元分类问题,其缺点是只考虑两篇文档的相对顺序,而不考虑文档出现在搜索结果列表中的位置... Learning to Rank(L2R)技术是对搜索结果进行排序,是近几年的研究热点。现关于L2R中的PairWise方法进行研究分析,PairWise方法将排序问题转化为二元分类问题,其缺点是只考虑两篇文档的相对顺序,而不考虑文档出现在搜索结果列表中的位置。另外,不同的查询拥有的文档对数目不同,结果会向拥有文档对较多的查询偏移。对常用的PairWise算法的损失函数及其求解方法、基本思想、算法框架、效用评价以及算法应用进行概括分析。 展开更多
关键词 pairwise 损失函数 优化方法
下载PDF
基于pairwise的改进ranking算法 被引量:1
6
作者 程凡 仲红 《计算机应用》 CSCD 北大核心 2011年第7期1740-1743,共4页
传统基于pairwise的ranking算法,学习后得到的模型在用NDCG这样的ranking标准评价时效果并不好,对此提出了一种新型ranking算法。该算法也是使用样本对作为训练数据,但定义了一个面向NDCG评估标准的目标函数。针对此目标函数非平滑、难... 传统基于pairwise的ranking算法,学习后得到的模型在用NDCG这样的ranking标准评价时效果并不好,对此提出了一种新型ranking算法。该算法也是使用样本对作为训练数据,但定义了一个面向NDCG评估标准的目标函数。针对此目标函数非平滑、难以直接优化的特点,提出使用割平面算法进行学习,不仅解决了上述问题,而且使算法迭代的次数不再依赖于训练样本对数。最后基于基准数据集的实验证明了算法的有效性。 展开更多
关键词 ranking算法 pairwise方法 支持向量机 NDCG 割平面算法
下载PDF
基于Pairwise算法的人车事故中人伤影响因素分析 被引量:1
7
作者 袁敏 侯林鹏 谭正平 《重庆理工大学学报(自然科学)》 CAS 北大核心 2020年第5期68-77,共10页
根据影响骑车人头部损伤的可能因素(汽车车速、电动车车速、碰撞角、骑车人面朝方向、地面附着系数、前置汽车发动机罩离地高度等9个因素)建立模型进行试验。经研究分析发现:在正向撞击过程中,骑车人头部HIC值受肢体作用汽车表面的影响... 根据影响骑车人头部损伤的可能因素(汽车车速、电动车车速、碰撞角、骑车人面朝方向、地面附着系数、前置汽车发动机罩离地高度等9个因素)建立模型进行试验。经研究分析发现:在正向撞击过程中,骑车人头部HIC值受肢体作用汽车表面的影响,此作用随车速的提升迅速减缓;汽车处于低速行驶撞击时(速度小于30 km/h),骑车人HIC值随汽车发动机罩离地高度逐次增加而减小;汽车处于高速行驶撞击时(速度大于等于30 km/h),骑车人HIC值随汽车发动机罩离地高度逐次增加而增大;当相对速度(即汽车前进方向上,电动车速度与汽车分速度之和)超过40 km/h时,骑车人头部有很大可能受到伤害或严重损伤。碰撞角为0°时骑车人头部伤害最重,碰撞角为90°时骑车人头部伤害最轻;骑车人头部与接触面作用时间越短,头部HIC值越大。 展开更多
关键词 事故再现 pairwise算法 极差法分析 碰撞角
下载PDF
基于Pairwise算法的组合测试应用研究 被引量:1
8
作者 郑根让 林正春 《电子技术与软件工程》 2022年第15期49-52,共4页
本文对基于Pairwise算法的组合测试常用实现方法进行了综述和比较分析。利用Pairwise算法思想对电商平台系统测试进行了需求分析及测试设计,使用PICT工具对电商平台进行组合测试实验,根据电商平台运行需求利用贪心算法对约束关系进行了... 本文对基于Pairwise算法的组合测试常用实现方法进行了综述和比较分析。利用Pairwise算法思想对电商平台系统测试进行了需求分析及测试设计,使用PICT工具对电商平台进行组合测试实验,根据电商平台运行需求利用贪心算法对约束关系进行了优化,进一步提高组合测试效能。为验证PICT在电商平台组合测试的有效性,对电商平台相关关联关系进行了仿真实验和实际测试,其在测试用例覆盖、测试生成速度和测试成本等方面具有一定优势。 展开更多
关键词 pairwise 组合测试 PICT工具
下载PDF
Incompressible Pairwise Incompressible Surfaces in Knot Exteriors
9
作者 韩友发 《Chinese Quarterly Journal of Mathematics》 CSCD 2001年第2期47-53,共7页
We discuss the properties of incompressible pairwise incompressible surfaces in a knot complement by using twist crossing number. Let K be a pretzel knot or rational knot that its twistindex is less than 6, and l... We discuss the properties of incompressible pairwise incompressible surfaces in a knot complement by using twist crossing number. Let K be a pretzel knot or rational knot that its twistindex is less than 6, and let F be an incompressible pairwise incompressible surface in S 3-K. Then F is a punctured sphere. 展开更多
关键词 incompressible pairwise incompressible surface twist crossing number pretzel knot puncture sphere rational knot
下载PDF
基于Pairwise排序学习的因子分解推荐算法 被引量:1
10
作者 周俊宇 戴月明 吴定会 《计算机应用与软件》 CSCD 2016年第6期255-259,共5页
针对基于内存的协同过滤推荐算法存在推荐列表排序效果不佳的问题,提出基于Pairwise排序学习的因子分解推荐算法(简称Pairwise-SVD推荐算法)。新算法将因子分解的预测结果作为排序学习算法的输入,把排序问题转化成分类问题使用排序学习... 针对基于内存的协同过滤推荐算法存在推荐列表排序效果不佳的问题,提出基于Pairwise排序学习的因子分解推荐算法(简称Pairwise-SVD推荐算法)。新算法将因子分解的预测结果作为排序学习算法的输入,把排序问题转化成分类问题使用排序学习理论进行排序产生推荐列表。实验结果表明相比基于内存的协同过滤推荐算法,Pairwise-SVD推荐算法的排序效果更佳。其在指标Kendall-tau上提高了近一倍,在指标MRR上提高了近30%,且在指标MAP上也有小幅提高。 展开更多
关键词 pairwise 因子分解 协同过滤 分类 排序学习
下载PDF
On Pairwise Singular Sets and Pairwise Singular Maps
11
作者 Rina Pankaj Verma Mamta Singh 《Journal of Mathematics and System Science》 2014年第4期261-268,共8页
In this paper we introduce the concept of pairwise singular sets and pairwise singular maps between pairwise locally compact and pairwise hausdorff spaces and study the properties of pairwise singular maps.
关键词 pairwise singular sets pairwise singular maps
下载PDF
SOME LIMIT THEOREMS FOR SEQUENCES OF PAIRWISE NQD RANDOM VARIABLES 被引量:8
12
作者 甘师信 陈平炎 《Acta Mathematica Scientia》 SCIE CSCD 2008年第2期269-281,共13页
In this article, the authors study some limit properties for sequences of pairwise NQD random variables, which are not necessarily identically distributed. They obtain Baum and Katz complete convergence and the strong... In this article, the authors study some limit properties for sequences of pairwise NQD random variables, which are not necessarily identically distributed. They obtain Baum and Katz complete convergence and the strong stability of Jamison's weighted sums for pairwise NQD random variables, which may have different distributions. Some wellknown results are improved and extended. 展开更多
关键词 pairwise NQD random variable sequence convergence in probability almost sure convergence complete convergence strong stability
下载PDF
INCOMPRESSIBLE PAIRWISE INCOMPRESSIBLE SURFACES IN LINK COMPLEMENTS 被引量:4
13
作者 韩友发 《Acta Mathematica Scientia》 SCIE CSCD 2011年第3期1011-1019,共9页
The central subject of studying in this paper is incompressible pairwise incompressible surfaces in link complements. Let L be a non-split prime link and let F be an incompressible pairwise incompressible surface in S... The central subject of studying in this paper is incompressible pairwise incompressible surfaces in link complements. Let L be a non-split prime link and let F be an incompressible pairwise incompressible surface in S3 - L. We discuss the properties that the surface F intersects with 2-spheres in S3 - L. The intersection forms a topological graph consisting of a collection of circles and saddle-shaped discs. We introduce topological graphs and their moves (R-move and S2-move), and define the characteristic number of the topological graph for F∩S2±. The characteristic number is unchanged under the moves. In fact, the number is exactly the Euler Characteristic number of the surface when a graph satisfies some conditions. By these ways, we characterize the properties of incompressible pairwise incompressible surfaces in alternating (or almost alternating) link complements. We prove that the genus of the surface equals zero if the component number of F∩S2+(or F∩S2-) is less than five and the graph is simple for alternating or almost alternating links. Furthermore, one can prove that the genus of the surface is zero if #(F) ≤8. 展开更多
关键词 alternating link almost alternating link incompressible pairwise incompressible surface standard position GENUS
下载PDF
An important property of entanglement: pairwise entanglement that can only be transferred by an entangled pair 被引量:4
14
作者 惠小强 刘伍明 《Chinese Physics B》 SCIE EI CAS CSCD 2007年第7期1858-1862,共5页
Based on the calculation of all the pairwise entanglements in the n (n ≤ 6)-qubit Heisenberg XX open chain with system impurity, we find an important result: pairwise entanglement can only be transferred by an ent... Based on the calculation of all the pairwise entanglements in the n (n ≤ 6)-qubit Heisenberg XX open chain with system impurity, we find an important result: pairwise entanglement can only be transferred by an entangled pair. The non-nearest pairwise entanglements will have the possibility to exist as long as there has been even number of qubits in their middle. This point indicates that we can obtain longer distance entanglement in a solid system. 展开更多
关键词 pairwise entanglement transfer of entanglement Heisenberg XX chain
下载PDF
Pairwise Shared Ancestry in Random-Mating Constant-Size Populations 被引量:2
15
作者 Philip M. Service 《Natural Science》 2022年第5期193-202,共10页
In a panmictic population of constant size N, random pairs of individuals will have a most recent shared ancestor who lived slightly more than 0.5 log<sub>2</sub>N generations previously, on average. The p... In a panmictic population of constant size N, random pairs of individuals will have a most recent shared ancestor who lived slightly more than 0.5 log<sub>2</sub>N generations previously, on average. The probability that a random pair of individuals will share at least one ancestor who lived 0.5 log<sub>2</sub>N generations ago, or more recently, is about 50%. Those individuals, if they do share an ancestor from that generation, would be cousins of degree (0.5 log<sub>2</sub>N) - 1. Shared ancestry from progressively earlier generations increases rapidly until there is universal pairwise shared ancestry. At that point, every individual has one or more ancestors in common with every other individual in the population, although different pairs may share different ancestors. Those ancestors lived approximately 0.7 log<sub>2</sub>N generations in the past, or more recently. Qualitatively, the ancestries of random pairs have about 50% similarity for ancestors who lived about 0.9 log<sub>2</sub>N generations before the present. That is, about half of the ancestors from that generation belonging to one member of the pair are present also in the genealogy of the other member. Qualitative pairwise similarity increases to more than 99% for ancestors who lived about 1.4 log<sub>2</sub>N generations in the past. Similar results apply to a metric of quantitative pairwise genealogical overlap. 展开更多
关键词 pairwise Shared Ancestry Genealogical Overlap Quantitative Ancestry Most Recent Common Ancestor Number of Cousins
下载PDF
Pairwise Shared Genealogical Ancestry in Structured Populations 被引量:1
16
作者 Philip M. Service 《Natural Science》 CAS 2022年第8期305-321,共17页
Simulation was used to investigate the effects of population structure and migration on metrics of pairwise shared ancestry. Random and hierarchical structures, or migration geometries, were examined. Compared to panm... Simulation was used to investigate the effects of population structure and migration on metrics of pairwise shared ancestry. Random and hierarchical structures, or migration geometries, were examined. Compared to panmictic populations, progress to all qualitative metrics of pairwise ancestry is delayed in structured populations. However, unless migration is very low, the time required is generally less than triple and often less than twice that required in a panmictic population of the same total size. Population structure also increases, to a similar degree, the time required for a population-wide most recent common ancestor (MRCA). As a result, the relationships between various qualitative metrics of pairwise shared ancestry and MRCA time are relatively unaffected by population structure. For example, the mean time to most recent shared ancestor (MRSA) with global sampling of pairs is 40% - 50% of the MRCA time for almost all simulated structures and migration levels. Quantitative pairwise genealogical overlap is strongly affected by population structure. With global sampling, pairwise quantitative overlap never approaches 1.0, as it does in panmictic populations;and instead eventually becomes stationary at much lower values. Possible implications of the present results for human pairwise shared ancestry are discussed. For globally sampled pairs, the longest time to most recent shared ancestor (MRSA) for humans is suggested to be approximately 2100 years before the present. If generation time is 30 years, then all humans are 69th, or closer, cousins. For people with recent European ancestry, the MRSA time may be only half as long, about 1000 years. 展开更多
关键词 Population Structure pairwise Shared Ancestry GENEALOGY MIGRATION Most Recent Common Ancestor Humans
下载PDF
Total Pairwise Quantum Correlation and Entanglement in a Mixed-Three-Spin Ising-XY Model with Added Dzyaloshinskii-Moriya Interaction under Decoherence
17
作者 H.A.Zad 《Chinese Physics Letters》 SCIE CAS CSCD 2016年第9期5-9,共5页
We investigate the behavior of geometric global quantum discord (GGQD) and concurrence (C) between half- spins of a mixed-three-spin (1/2, 1, 1/2) system with the Ising-XY model for which spins (1, 1/2) have t... We investigate the behavior of geometric global quantum discord (GGQD) and concurrence (C) between half- spins of a mixed-three-spin (1/2, 1, 1/2) system with the Ising-XY model for which spins (1, 1/2) have the Ising interaction and half-spins (1/2, 1/2) have both XY and the Dzyaloshinskii Moriya interactions together, under the decoherence action. A single-ion anisotropy property with coefficient ζ is assumed for the spin-integer. This system which includes an analytical Hamiltonian is considered at the front of an external homogeneous magnetic field B in thermal equilibrium. Finally, we compare GGQD and C and express some interesting phase flip reactions of the total quantum correlation and pairwise entanglement between spins (1/2, 1/2). Generally, we conclude that the concurrence and GGQD have different behaviors under the phase flip channel. 展开更多
关键词 of is in for Total pairwise Quantum Correlation and Entanglement in a Mixed-Three-Spin Ising-XY Model with Added Dzyaloshinskii-Moriya Interaction under Decoherence with
下载PDF
Characterization of the pairwise correlations in different quantum networks consisting of four-wave mixers and beamsplitters
18
作者 祁健 忻俊 +1 位作者 王海龙 荆杰泰 《Chinese Physics B》 SCIE EI CAS CSCD 2017年第7期153-160,共8页
We investigate the performances of the pairwise correlations(PCs) in different quantum networks consisting of fourwave mixers(FWMs) and beamsplitters(BSs). PCs with quantum correlation in different quantum netwo... We investigate the performances of the pairwise correlations(PCs) in different quantum networks consisting of fourwave mixers(FWMs) and beamsplitters(BSs). PCs with quantum correlation in different quantum networks can be verified by calculating the degree of relative intensity squeezing for any pair of all the output fields. More interestingly, the quantum correlation recovery and enhancement are present in the FWM+BS network and the repulsion effect phenomena(signal(idler)-frequency mode cannot be quantum correlated with the other two idler(signal)-frequency modes simultaneously)between the PCs with quantum correlation are predicted in the FWM + FWM and FWM + FWM + FWM networks. Our results presented here pave the way for the manipulation of the quantum correlation in quantum networks. 展开更多
关键词 pairwise correlation four-wave mixer degree of relative intensity squeezing quantum network
下载PDF
Impurity in Pairwise Entanglement of Heisenberg XX Open Chain
19
作者 XI Xiao-Qiang~(1,2)CHEN Wen-Xue~1 LIU Qi~3 and YUE Rui-Hong~3~1 Department of Applied Mathematics and Physics,Xi’an Institute of Posts and Telecommunications,Xi’an 710061,China~2 Joint Laboratory of Advanced Technology in Measurements,Beijing National Laboratory for Condensed Matter Physics,Institute of Physics,the Chinese Academy of Sciences,Beijing 100080,China~3 Institute of Modern Physics,North-West University,Xi’an 710069,China 《Communications in Theoretical Physics》 SCIE CAS CSCD 2007年第12期1009-1016,共8页
We calculate the concurrence of all pairwise entanglement of Heisenberg XX open chain with single systemimpurity in three-qubit and four-qubit cases,and find that the impurity parameter J_i has great effect on pairwis... We calculate the concurrence of all pairwise entanglement of Heisenberg XX open chain with single systemimpurity in three-qubit and four-qubit cases,and find that the impurity parameter J_i has great effect on pairwiseentanglement.Choosing the proper parameter J_i,we can obtain the maximal pairwise entanglement of the nearestqubits and make the non-nearest qubits entangle. 展开更多
关键词 system impurity pairwise entanglement Heisenberg XX chain
下载PDF
Heuristic Reduction Algorithm Based on Pairwise Positive Region
20
作者 祁立 刘玉树 《Journal of Beijing Institute of Technology》 EI CAS 2007年第3期295-299,共5页
To guarantee the optimal reduct set, a heuristic reduction algorithm is proposed, which considers the distinguishing information between the members of each pair decision classes. Firstly the pairwise positive region ... To guarantee the optimal reduct set, a heuristic reduction algorithm is proposed, which considers the distinguishing information between the members of each pair decision classes. Firstly the pairwise positive region is defined, based on which the pairwise significance measure is calculated between the members of each pair classes. Finally the weighted pairwise significance of attribute is used as the attribute reduction criterion, which indicates the necessity of attributes very well. By introducing the noise tolerance factor, the new algorithm can tolerate noise to some extent. Experimental results show the advantages of our novel heuristic reduction algorithm over the traditional attribute dependency based algorithm. 展开更多
关键词 rough set pairwise positive region heuristic reduction algorithm
下载PDF
上一页 1 2 7 下一页 到第
使用帮助 返回顶部