Based on the coded and non-coded targets, the targets are extracted from the images according to their size, shape and intensity etc., and thus an improved method to identify the unique identity（D） of every coded ta...Based on the coded and non-coded targets, the targets are extracted from the images according to their size, shape and intensity etc., and thus an improved method to identify the unique identity（D） of every coded target is put forward and the non-coded and coded targets are classified. Moreover, the gray scale centroid algorithm is applied to obtain the subpixel location of both uncoded and coded targets. The initial matching of the uncoded target correspondences between an image pair is established according to similarity and compatibility, which are based on the ID correspondences of the coded targets. The outliers in the initial matching of the uncoded target are eliminated according to three rules to finally obtain the uncoded target correspondences. Practical examples show that the algorithm is rapid, robust and is of high precision and matching ratio.展开更多
For a correspondence in question we establish a sequence of fundamental geometrical objects of the correspondence and find invariant normalizations of the first and second orders of all hupersurfaces under the corresp...For a correspondence in question we establish a sequence of fundamental geometrical objects of the correspondence and find invariant normalizations of the first and second orders of all hupersurfaces under the correspondence. We single out main tensors of the correspondence and establish a connection between the geometry of point correspondences between n + 1 hypersurfaces of projective spaces and the theory of multidimensional (n + 1)-webs.展开更多
发现在二幅图象之间的可靠的相应的点是在计算机视觉的一个基本问题，特别与 L 视觉框架的发展。这篇论文介绍歧管的通讯并且建议一个新奇计划由听说向上的看法拒绝孤立点歧管。建议计划独立于在出版工作要估计并且克服可得到的方法的...发现在二幅图象之间的可靠的相应的点是在计算机视觉的一个基本问题，特别与 L 视觉框架的发展。这篇论文介绍歧管的通讯并且建议一个新奇计划由听说向上的看法拒绝孤立点歧管。建议计划独立于在出版工作要估计并且克服可得到的方法的下列限制的参量的模型：效率严厉地因孤立点百分比的增加和估计的模型参数的数字倒下；孤立点拒绝被结合模型选择和模型评价。真实图象对的实验显示出我们的建议计划的优秀性能。展开更多
Editor’s NoteEarly this year,we received a letter from Dr.Kiichiro Tsutani,Medical Officer of TraditionalMedicine,WHO Regional Office for the Western Pacific,pointing out that in the paper written by Dr.Wang Deshen,e...Editor’s NoteEarly this year,we received a letter from Dr.Kiichiro Tsutani,Medical Officer of TraditionalMedicine,WHO Regional Office for the Western Pacific,pointing out that in the paper written by Dr.Wang Deshen,entitled “The Third WHO Regional Workshop on the Standardization of AcupunctureNomenclature” carried in the No.3 issue,1988,pp.221-228 of our journal,the list of “展开更多
Deep-learning methods provide a promising approach for measuring in-vivo knee joint motion from fast registration of two-dimensional(2D)to three-dimensional(3D)data with a broad range of capture.However,if there are i...Deep-learning methods provide a promising approach for measuring in-vivo knee joint motion from fast registration of two-dimensional(2D)to three-dimensional(3D)data with a broad range of capture.However,if there are insufficient data for training,the data-driven approach will fail.We propose a feature-based transfer-learning method to extract features from fluoroscopic images.With three subjects and fewer than 100 pairs of real fluoroscopic images,we achieved a mean registration success rate of up to 40%.The proposed method provides a promising solution,using a learning-based registration method when only a limited number of real fluoroscopic images is available.展开更多
提出了一种分层块状全局搜索到临近点局部搜索的改进迭代最近点(ICP)算法,用于进一步提高ICP算法的配准速度并消除点云缺失对点云配准的影响。该配准方法在粗略配准之后,以点云块为分层单元对模型点集进行选取,并对选取的少量模型点进...提出了一种分层块状全局搜索到临近点局部搜索的改进迭代最近点(ICP)算法,用于进一步提高ICP算法的配准速度并消除点云缺失对点云配准的影响。该配准方法在粗略配准之后,以点云块为分层单元对模型点集进行选取,并对选取的少量模型点进行全局搜索获取其对应最近点;然后,以这些模型点对应的最近点作为搜索中心,在场景点集中进行局部搜索,获取这些模型点的大量临近点的对应最近点;最后,剔除错误对应最近点对,并求取坐标变换。与基于KD-Tree的ICP算法和基于LS+HS(Logarithmic Search Combined with Hierarchical Model Point Selection)的ICP算法相比,该配准算法对Happy bunny扫描数据的配准速度分别提高了78%和24%;对Dragon扫描数据的配准速度分别提高了73%和30%。这些结果表明该算法可以快速、精确地实现三维点云间的配准。展开更多
基金The National Natural Science Foundation of China(No50475041)
文摘Based on the coded and non-coded targets, the targets are extracted from the images according to their size, shape and intensity etc., and thus an improved method to identify the unique identity（D） of every coded target is put forward and the non-coded and coded targets are classified. Moreover, the gray scale centroid algorithm is applied to obtain the subpixel location of both uncoded and coded targets. The initial matching of the uncoded target correspondences between an image pair is established according to similarity and compatibility, which are based on the ID correspondences of the coded targets. The outliers in the initial matching of the uncoded target are eliminated according to three rules to finally obtain the uncoded target correspondences. Practical examples show that the algorithm is rapid, robust and is of high precision and matching ratio.
文摘For a correspondence in question we establish a sequence of fundamental geometrical objects of the correspondence and find invariant normalizations of the first and second orders of all hupersurfaces under the correspondence. We single out main tensors of the correspondence and establish a connection between the geometry of point correspondences between n + 1 hypersurfaces of projective spaces and the theory of multidimensional (n + 1)-webs.
基金Supported by National Natural Science Foundation of China （60675020, 60773132）, Natural Science Foundation of Shandong Province （Q2007G02）, and Opening Task-fund for National Laboratory of Pattern Recognition
文摘发现在二幅图象之间的可靠的相应的点是在计算机视觉的一个基本问题，特别与 L 视觉框架的发展。这篇论文介绍歧管的通讯并且建议一个新奇计划由听说向上的看法拒绝孤立点歧管。建议计划独立于在出版工作要估计并且克服可得到的方法的下列限制的参量的模型：效率严厉地因孤立点百分比的增加和估计的模型参数的数字倒下；孤立点拒绝被结合模型选择和模型评价。真实图象对的实验显示出我们的建议计划的优秀性能。
文摘Editor’s NoteEarly this year,we received a letter from Dr.Kiichiro Tsutani,Medical Officer of TraditionalMedicine,WHO Regional Office for the Western Pacific,pointing out that in the paper written by Dr.Wang Deshen,entitled “The Third WHO Regional Workshop on the Standardization of AcupunctureNomenclature” carried in the No.3 issue,1988,pp.221-228 of our journal,the list of “
基金sponsored by the National Natural Science Foundation of China(31771017,31972924,81873997)the Science and Technology Commission of Shanghai Municipality(16441908700)+3 种基金the Innovation Research Plan supported by Shanghai Municipal Education Commission(ZXWF082101)the National Key R&D Program of China(2017YFC0110700,2018YFF0300504,2019YFC0120600)the Natural Science Foundation of Shanghai(18ZR1428600)the Interdisciplinary Program of Shanghai Jiao Tong University(ZH2018QNA06,YG2017MS09).
文摘Deep-learning methods provide a promising approach for measuring in-vivo knee joint motion from fast registration of two-dimensional(2D)to three-dimensional(3D)data with a broad range of capture.However,if there are insufficient data for training,the data-driven approach will fail.We propose a feature-based transfer-learning method to extract features from fluoroscopic images.With three subjects and fewer than 100 pairs of real fluoroscopic images,we achieved a mean registration success rate of up to 40%.The proposed method provides a promising solution,using a learning-based registration method when only a limited number of real fluoroscopic images is available.
文摘提出了一种分层块状全局搜索到临近点局部搜索的改进迭代最近点(ICP)算法,用于进一步提高ICP算法的配准速度并消除点云缺失对点云配准的影响。该配准方法在粗略配准之后,以点云块为分层单元对模型点集进行选取,并对选取的少量模型点进行全局搜索获取其对应最近点;然后,以这些模型点对应的最近点作为搜索中心,在场景点集中进行局部搜索,获取这些模型点的大量临近点的对应最近点;最后,剔除错误对应最近点对,并求取坐标变换。与基于KD-Tree的ICP算法和基于LS+HS(Logarithmic Search Combined with Hierarchical Model Point Selection)的ICP算法相比,该配准算法对Happy bunny扫描数据的配准速度分别提高了78%和24%;对Dragon扫描数据的配准速度分别提高了73%和30%。这些结果表明该算法可以快速、精确地实现三维点云间的配准。
