QQ客服 官方微博 反馈留言

浏览/检索结果: 共3条，第1-3条 帮助 已选(0)清除 条数/页：5101520253035404550556065707580859095100   排序方式：请选择发表日期升序发表日期降序提交时间升序提交时间降序题名升序题名降序作者升序作者降序 The exact extreme response and the confidence extreme response analysis of structures subjected to uncertain-but-bounded excitations 期刊论文 Applied Mathematical Modelling, 2020, 卷号: 77, 页码: 1742-1761 作者:  Guo, Xu;  Yang, Juntan;  Han JD(韩建达);  Li Q(李琦) 收藏  |  浏览/下载：249/0  |  提交时间：2019/11/23 Uncertainties  Interva  l Euclidean norm  Global optimality  Confidence  DCA   The exact extreme response and the confidence extreme response analysis of structures subjected to uncertain-but-bounded excitations 期刊论文 Applied Mathematical Modelling, 2020, 卷号: 77, 页码: 1742-1761 作者:  Li Q(李琦);  Han JD(韩建达);  Yang JT(杨君坦);  Guo X(郭旭 ) 收藏  |  浏览/下载：27/0  |  提交时间：2019/11/23 Uncertainties  Interva  l Euclidean norm  Global optimality  Confidence  DCA   A shape context based Hausdorff similarity measure in image matching 会议论文 5th International Symposium on Photoelectronic Detection and Imaging (ISPDI) - Infrared Imaging and Applications, Beijing, June 25-27, 2013 作者:  Ma TL(马天磊);  Liu YP(刘云鹏);  Shi ZL(史泽林);  Yin J(尹健) 收藏  |  浏览/下载：24/0  |  提交时间：2013/12/26 The traditional Hausdorff measure, which uses Euclidean distance metric (L2 norm) to define the distance between coordinates of any two points, has poor performance in the presence of the rotation and scale change although it is robust to the noise and occlusion. To address the problem, we define a novel similarity function including two parts in this paper. The first part is Hausdorff distance between shapes which is calculated by exploiting shape context that is rotation and scale invariant as the distance metric. The second part is the cost of matching between centroids. Unlike the traditional method, we use the centroid as reference point to obtain its shape context that embodies global information of the shape. Experiment results demonstrate that the function value between shapes is rotation and scale invariant and the matching accuracy of our algorithm is higher than that of previously proposed algorithm on the MEPG-7 database.