-
公开(公告)号：US09489708B2
公开(公告)日：2016-11-08
申请号：US14624733
申请日：2015-02-18
Inventor： Alexander Bronstein , Michael Bronstein , Ron Kimmel , Yohai Devir , Ofir Weber
CPC classification number: G06T1/20 , G06K9/6215 , G06T5/30 , G06T7/60 , G06T15/00 , G06T15/08 , G06T2207/20041
Abstract: Method for parallel approximation of distance maps on a discrete representation of a manifold, the method comprising: for at least one Euclidean grid applied on the discrete representation of a manifold, iterating over rows of the Euclidean grid in a first direction, and for each row currently visited during the iterating in the first direction, calculating a distance value for each single cell of the currently visited row in parallel, wherein the calculating is carried out according to a predefined approximation rule, using a distance value calculated for each one of respective cells of a row visited immediately before the currently visited row, wherein the cells of the row visited before the currently visited row are adjacent to the single cell in the Euclidean grid.
-
公开(公告)号：US10467325B2
公开(公告)日：2019-11-05
申请号：US14093671
申请日：2013-12-02
Inventor： Guy Rosman , Alexander Bronstein , Michael Bronstein , Ron Kimmel
Abstract: A method for multidimensional scaling (MDS) of a data set comprising a plurality of data elements is provided, wherein each data element is identified by its coordinates, the method comprising the steps of: (i) applying an iterative optimization technique, such as SMACOF, a predetermined amount of times on a coordinates vector, said coordinates vector representing the coordinates of a plurality of said data elements, and obtaining a modified coordinates vector; (ii) applying a vector extrapolation technique, such as Minimal Polynomial Extrapolation (MPE) or reduced Rank Extrapolation (RRE) on said modified coordinates vector obtaining a further modified coordinates vector; and (iii) repeating steps (i) and (ii) until one or more predefined conditions are met.
-
公开(公告)号：US20150262321A1
公开(公告)日：2015-09-17
申请号：US14624733
申请日：2015-02-18
Inventor： Alexander Bronstein , Michael Bronstein , Ron Kimmel , Yohai Devir , Ofir Weber
CPC classification number: G06T1/20 , G06K9/6215 , G06T5/30 , G06T7/60 , G06T15/00 , G06T15/08 , G06T2207/20041
Abstract: Method for parallel approximation of distance maps on a discrete representation of a manifold, the method comprising: for at least one Euclidean grid applied on the discrete representation of a manifold, iterating over rows of the Euclidean grid in a first direction, and for each row currently visited during the iterating in the first direction, calculating a distance value for each single cell of the currently visited row in parallel, wherein the calculating is carried out according to a predefined approximation rule, using a distance value calculated for each one of respective cells of a row visited immediately before the currently visited row, wherein the cells of the row visited before the currently visited row are adjacent to the single cell in the Euclidean grid.
Abstract translation: 用于在歧管的离散表示上的距离图的并行逼近的方法，所述方法包括：对于应用于歧管的离散表示上的至少一个欧几里德网格，在第一方向上迭代欧几里得网格的行，并且对于每行 在第一方向的迭代期间当前访问的，并行计算当前访问行的每个单个单元的距离值，其中，使用针对各个单元中的每个单元计算出的距离值，根据预定义的近似规则来执行计算 在当前访问行之前访问的一行中，其中在当前访问行之前访问的行的单元与欧几里德网格中的单个单元相邻。
-
公开(公告)号：US08982142B2
公开(公告)日：2015-03-17
申请号：US13746008
申请日：2013-01-21
Inventor： Alexander Bronstein , Michael Bronstein , Ron Kimmel , Yohai Devir , Ofir Weber
CPC classification number: G06T1/20 , G06K9/6215 , G06T5/30 , G06T7/60 , G06T15/00 , G06T15/08 , G06T2207/20041
Abstract: Method for parallel approximation of distance maps on a discrete representation of a manifold, the method comprising: for at least one Euclidean grid applied on the discrete representation of a manifold, iterating over rows of the Euclidean grid in a first direction, and for each row currently visited during the iterating in the first direction, calculating a distance value for each single cell of the currently visited row in parallel, wherein the calculating is carried out according to a predefined approximation rule, using a distance value calculated for each one of respective cells of a row visited immediately before the currently visited row, wherein the cells of the row visited before the currently visited row are adjacent to the single cell in the Euclidean grid.
Abstract translation: 用于在歧管的离散表示上的距离图的并行逼近的方法，所述方法包括：对于应用于歧管的离散表示上的至少一个欧几里德网格，在第一方向上迭代欧几里得网格的行，并且对于每行 在第一方向的迭代期间当前访问的，并行计算当前访问行的每个单个单元的距离值，其中，使用针对各个单元中的每个单元计算出的距离值，根据预定义的近似规则来执行计算 在当前访问行之前访问的一行中，其中在当前访问行之前访问的行的单元与欧几里德网格中的单个单元相邻。
-
-
-
Search Results
4
records
(took 0.023 seconds)
