ID 原文 译文
22675 首先采用基于局部梯度 DT-CWT(Dual-Tree Complex Wavelet Transform)主方向模式(Dominant Direction Pattern, DDP)特征的 DTW 对表情序列进行规整。 Firstly, the method of DTW based on local gradient Dual Tree-Complex Wavelet Transform (DT-CWT) dominant direction pattern is used to warp expression sequence.
22676 然后采用 AAM 定位出表情图像的 66 个特征点并进行跟踪，利用中性脸的特征点构建人脸几何模型，通过人脸几何模型的匹配克服不同人呈现表情的差异，并通过计算表情序列中相邻两帧图像对应特征点的位移获得表情的变化特征。 Secondly, using AAM to locate 66 feature points of face image and track them. The changing feature of expression can be obtained by calculating the displacement of corresponding feature points in two adjacent expression sequences image. And using the feature points of neutral face to build the facial geometry model. The matching of facial geometry model can overcome the expression differences between various people.
22677 最后采用最近邻分类器进行分类识别。 Finally, the nearest neighbor classifier is used for classification and recognition.
22678 在 CK+库和实验室自建库 HFUT-FE(HeFei University of Technology-Face Emotion)上的实验结果表明，所提算法具有较高的准确性。 The experimental results on CK+ database and HeFei University of Technology-Face Emotion (HFUT-FE) database show that the proposed algorithm has a high degree of accuracy.
22679 针对立体图像中目标对象的闭合轮廓提取任务，该文提出一种基于视差信息的轮廓提取算法。 To get the closed boundary of target object of given stereoscopic image, this paper proposes an improved algorithm with disparity-guided constraint for active contour extraction based on greedy snake model.
22680 该算法在传统贪婪蛇模型的基础上，利用各控制点和中心的视差关系为模型设计收缩和膨胀力，能够有效指导初始轮廓曲线向目标边缘的收敛。 The disparity relationship between the control points and the center of the object is used to design a new external force, which guides the original contour to real boundary.
22681 同时算法采用重复利用经处理的控制点作为模型输入的循环迭代方式，能够获得分布均匀且较为密集的边缘曲线。 In addition, this method also uses the improved model iteratively with processed control points as the original input.
22682 实验结果表明，该轮廓提取算法减少了传统的贪婪蛇模型算法对初始值的依赖，准确度和可靠性均得到了很大的提升。 Experiment results prove this method reduces the reliance on initial values of input contour, and obtains accurate contour made up of uniform and dense points, which is more effective than the traditional greedy snake algorithm.
22683 针对当前垂直切换判决算法存在的单一性，即切换判决时以用户或网络单方面为中心，没有充分考虑两者对切换判决的综合影响，导致垂直切换性能不佳的问题，该文提出一种基于双向匹配模型的垂直切换算法。 Most of the existing vertical handover algorithms are only based on user centric or network centric, which do not fully consider the common impact of the two sides on the handover decision. In order to solve this problem, a two-sided matching model based vertical handover algorithm in heterogeneous wireless networks is proposed.
22684 该算法的主要思想是：首先分别以用户和网络为中心，设计各自的评估模型，用于评估双方对彼此的偏好顺序，并建立相应的排序值矩阵； The handover performance is improved from the following aspects: first, two evaluation models of user centered and network centered are respectively proposed based on quality of service revenue and the blocking rate. And the ranking value of the two sides is evaluated further.