共查询到20条相似文献,搜索用时 93 毫秒
1.
分层强化学习中自动分层问题目前仍未得到有效的解决,本文针对Option方法,研究了基于核密度估计的Option自动生成算法,该算法根据分层强化学习的特点并结合改进后的核密度估计层次聚类方法,实现分层强化学习的自动分层,生成子目标,并在此基础上构建出Options。实验结果表明这种算法可以大大加快学习的效率。 相似文献
2.
针对云服务安全评估时专家判断复杂的心理特征问题,在区间犹豫模糊背景下提出一种改进的IVHF-TODIM多属性决策方法。结合COWA算子和Dice相似性测度的各自优势,提出了一种考虑决策者态度的区间犹豫模糊Dice相似性测度公式,并对其基本性质加以验证,在TODIM方法优势度的计算中,运用所提出的Dice相似性测度替代原有的距离测度,最后将该方法运用到云服务安全评估上。实例分析表明了该方法的有效性。 相似文献
3.
4.
徐金宝 《数字社区&智能家居》2013,(27):6185-6188
聚类是数据挖掘的一种重要方法,核函数是能够将低维不可分的数据映射到高维空间进行线性可分时能够降低数据处理难度的重要手段。介绍了聚类算法和核函数的特点。通过引入基于核函数的相似性测度,对k-平均聚类算法和围绕中心点的划分(PAM)算法在Matlab上做了改进和实现。 相似文献
5.
6.
目前,很多基于核密度估计的数据分类算法采用的判别规则忽视了不平衡类问题.对此,提出了改进的基于核密度估计的数据分类算法.该算法可处理不平衡类带来的影响,并在不平衡类问题严重时也能发挥好的效果,而且可以推广到多分类问题.实验结果表明了这种改进是非常有效的,它提高了基于核密度估计的分类算法对不平衡类的适应力. 相似文献
7.
《计算机应用与软件》2013,(6)
最优分组问题是直方图算法需要解决的一个重要问题,对于分组数如何确定没有一个定量的规则。为此,采用改进的核密度估计算法得到参数的概率密度函数,然后定义直方图上部轮廓线与参数概率密度函数之间的贴近度,以此度量直方图上部轮廓线与参数概率密度函数之间的接近程度,作为最优分组的判决准则。改进的核密度估计算法可以获得接近于理论最优窗宽,利用改进核密度估计算法确定最优分组并用于雷达辐射源信号的参数分析中,结果表明该算法是有效的,可以自动搜索出最优分组数。 相似文献
8.
为解决煤层气开采(CBM)现场中抽水机往复运动和风吹草动等动态环境对前景检测的干扰及核密度估计(KDE)目标检测法实时性差的问题,提出了一种改进核密度估计前景检测算法。该方法先用背景差分法(BS)融合三帧差算法将图像分割成动态背景区与非动态背景区,对于动态背景区再用核密度算法分割前景。分割前景时提出了一种新的动态阈值求取方法,综合了相邻样本绝对差均值和样本方差来确定窗宽,并用定时更新与实时更新相结合的策略更新第二背景模型,在替换样本时用随机抽取策略代替先进先出(FIFO)方式。仿真结果表明,改进核密度估计算法与核密度估计法和背景差分核密度估计(BS-KDE)法相比,平均每帧图像算法耗时分别降低了94.18%和15.38%,识别的运动目标也更为完整。实验结果表明所提算法在煤层气开采场景中能准确检测到前景,并基本满足标清视频监控实时性要求。 相似文献
9.
针对非参数核密度估计学习阶段信息冗余与重复计算,估计阶段的估计错误噪声和计算量大的问题,提出了一种基于聚类分析的差分图像核密度估计前景目标检测算法.该方法在非参数核密度估计的学习阶段基于最大最小聚类原理从原采样全样本中提取那些具有较高频度和多样件的小样本来包含尽可能多的关键样本信息,在估计阶段采用基于自适应阈值的图像差分滤去非典型的运动像素,再利用高斯核密度估计进行运动像素分类.实验结果表明该方法限制了非典型运动像素估计错误产生的噪声,并减少了核密度估计计算量,提高了算法的实时性. 相似文献
10.
相似性度量在模糊环境中起着重要作用。通过距离测度进行相似性判断的方法通常利用两个模糊系统间的欧几里得距离,明科夫斯基距离和曼哈顿距离进行测度。引入一种新的基于欧几里得距离求解模糊集距离相似性测度的方法,通过分析将此方法推广至模糊超图。并提出了三种与模糊集和模糊超图相关的算法。使用此算法可以应对不同类型的决策分析。为了检验上述方法的效率与可靠性,利用多个实例进行验证,证明了所提出新的距离相似性测度方法的合理性和有效性。 相似文献
11.
12.
Comparison of video sequences is an important operation in many multimedia information systems. The similarity measure for comparison is typically based on some measure of correlation with the perceptual similarity (or difference) amongst the video sequences or with the similarity (or difference) in some measure of semantics associated with the video sequences. In content-based similarity analysis, the video data are expressed in terms of different features. Similarity matching is then performed by quantifying the feature relationships between the target video and query video shots, with either an individual feature or with a feature combination. In this study, two approaches are proposed for the similarity analysis of video shots. In the first approach, mosaic images are created from video shots, and the similarity analysis is done by determining the similarities amongst the mosaic images. In the second approach, key frames are extracted for each video shot and the similarity amongst video shots is determined by comparing the key frames of the video shots. The features extracted include image histograms, slopes, edges, and wavelets. Both individual features and feature combinations are used in similarity matching using an artificial neural network. The similarity rank of the query video shots is determined based on the values of the coefficients of determination and the mean absolute error. The study reported in this paper shows that the mosaic-based similarity analysis can be expected to yield a more reliable result, whereas the key frame-based similarity analysis could be potentially applied to a wider range of applications. The weighted non-linear feature combination is shown to yield better results than a single feature for video similarity analysis. The coefficient of determination is shown to be a better criterion than the mean absolute error in similarity matching analysis. 相似文献
13.
Corner matching in image sequences is an important and difficult problem that serves as a building block of several important applications of stereo vision etc. Normally, in area-based corner matching techniques, the linear measures like standard cross correlation coefficient, zero-mean (normalized) cross correlation coefficient, sum of absolute difference and sum of squared difference are used. Fuzzy logic is a powerful tool to solve many image processing problems because of its ability to deal with ambiguous data. In this paper, we use a similarity measure based on fuzzy correlations in order to establish the corner correspondence between sequence images in the presence of intensity variations and motion blur. The matching approach proposed here needs only to extract one set of corner points as candidates from the left image (first frame), and the positions of which in the right image (second frame) are determined by matching, not by extracting. Experiments conducted with the help of various sequences of images prove the superiority of our algorithm over standard and zero-mean cross correlation as well as one contemporary work using mutual information as a window similarity measure combined with graph matching techniques under non-ideal conditions. 相似文献
14.
《Computer Vision and Image Understanding》2000,77(2):233-250
In this paper, we discuss matching of magnetic resonance, diffusion tensor (DT) images of the human brain. Issues concerned with matching and transforming these complex images are discussed. In particular, we outline a method for preserving the intrinsic orientation of the data during nonrigid warps of the image and a number of similarity measures are proposed, based on the DT itself, on the DT deviatoric, and on indices derived from the DT. Each measure is used to drive an elastic matching algorithm applied to the task of registration of 3D images of the human brain. The performance of the various similarity measures is compared empirically by the use of several quality of match measures computed over a pair of matched images. Results indicate that the best matches are obtained from a Euclidean difference measure using the full DT. 相似文献
15.
图像匹配是图像信息领域中一个非常重要的技术。以中介真值程度的数值化度量为基础,建立了中介相似性量度,设计了采用中介相似性量度的灰度信息图像匹配算法。实验结果表明,与已有的典型算法处理结果相比较,基于中介相似性量度的匹配算法具有良好的抗噪性和一定的抗失真性,且具有较高的匹配精度和匹配速度。 相似文献
16.
17.
18.
19.
20.
针对传统的SAD局部立体匹配容易引起幅度失真、存在匹配窗口大小选择困难等问题,提出一种改进SAD局部立体匹配算法。首先在传统的SAD算法的基础上,提出利用像素灰度间欧氏距离的大小关系代替像素差值作为相似度量函数,很好地利用了邻近像素灰度值之间的连续性约束;在极限约束条件下,提出引导滤波器的动态匹配窗口的建立,能够很好地保持边缘特性;最后经过左右一致性检测策略来检测匹配异常点,再进一步平滑去噪,求得最终的视差图。实验结果表明,本文算法效率高、匹配精度高,对光照失真条件和边缘信息较多、深度不连续区域具有更好的鲁棒性。 相似文献