-
公开(公告)号：US20110052063A1
公开(公告)日：2011-03-03
申请号：US12546948
申请日：2009-08-25
CPC分类号： G06K9/6219 , G06K9/00684 , G06K9/527 , G06K9/6292
摘要： Classification of image regions comprises: recursively partitioning an image into a tree of image regions having the image as a tree root and at least one image patch in each leaf image region of the tree, the tree having nodes defined by the image regions and edges defined by pairs of nodes connected by edges of the tree; assigning unary classification potentials to nodes of the tree; assigning pairwise classification potentials to edges of the tree; and labeling the image regions of the tree of image regions based on optimizing an objective function comprising an aggregation of the unary classification potentials and the pairwise classification potentials.
摘要翻译： 图像区域的分类包括：将图像递归地划分为具有树根的图像的图像区域的树和在树的每个叶子图像区域中的至少一个图像块，所述树具有由图像区域定义的节点和限定的边缘 由树的边缘连接的节点对; 将一元分类电位分配给树的节点; 将成对分类电位分配给树的边缘; 以及基于优化包括一元分类电位和成对分类电位的聚集的目标函数来标记图像区域的树的图像区域。
-
公开(公告)号：US09355337B2
公开(公告)日：2016-05-31
申请号：US12546948
申请日：2009-08-25
CPC分类号： G06K9/6219 , G06K9/00684 , G06K9/527 , G06K9/6292
摘要： Classification of image regions comprises: recursively partitioning an image into a tree of image regions having the image as a tree root and at least one image patch in each leaf image region of the tree, the tree having nodes defined by the image regions and edges defined by pairs of nodes connected by edges of the tree; assigning unary classification potentials to nodes of the tree; assigning pairwise classification potentials to edges of the tree; and labeling the image regions of the tree of image regions based on optimizing an objective function comprising an aggregation of the unary classification potentials and the pairwise classification potentials.
摘要翻译： 图像区域的分类包括：将图像递归地划分为具有树根的图像的图像区域的树和在树的每个叶子图像区域中的至少一个图像块，所述树具有由图像区域定义的节点和限定的边缘 由树的边缘连接的节点对; 将一元分类电位分配给树的节点; 将成对分类电位分配给树的边缘; 以及基于优化包括一元分类电位和成对分类电位的聚集的目标函数来标记图像区域的树的图像区域。
-
3.发明授权Unified graph matching in euclidean spaces and applications to image comparison and retrieval 有权欧氏空间中的统一图匹配和图像比较和检索应用公开(公告)号：US08407029B2
公开(公告)日：2013-03-26
申请号：US12571630
申请日：2009-10-01
摘要： A first graph embedded in a Euclidean space is modeled by a globally rigid first model graph that includes all vertices and edges of the first graph and has a preselected maximum clique size. The modeling is configured to maintain the preselected maximum clique size by employing an edge adding process that replicates a vertex of a vertex pair connected by an edge. A mapping between vertices of the first graph and vertices of a second graph is computed by optimizing a mapping between vertices of the first model graph and vertices of the second graph.
摘要翻译： 嵌入在欧几里德空间中的第一个图形是由全局刚性的第一个模型图形建模的，该图形包括第一个图形的所有顶点和边缘，并且具有预选的最大集团大小。 该建模被配置为通过采用复制由边缘连接的顶点对的顶点的边添加过程来维持预选的最大团体大小。 通过优化第一模型图的顶点和第二图的顶点之间的映射来计算第一图的顶点和第二图的顶点之间的映射。
-
4.发明申请UNIFIED GRAPH MATCHING IN EUCLIDEAN SPACES AND APPLICATIONS TO IMAGE COMPARISON AND RETRIEVAL 有权欧洲空间中的统一图形匹配和图像比较和检索的应用公开(公告)号：US20110082670A1
公开(公告)日：2011-04-07
申请号：US12571630
申请日：2009-10-01
摘要： A first graph embedded in a Euclidean space is modeled by a globally rigid first model graph that includes all vertices and edges of the first graph and has a preselected maximum clique size. The modeling is configured to maintain the preselected maximum clique size by employing an edge adding process that replicates a vertex of a vertex pair connected by an edge. A mapping between vertices of the first graph and vertices of a second graph is computed by optimizing a mapping between vertices of the first model graph and vertices of the second graph.
摘要翻译： 嵌入在欧几里德空间中的第一个图形是由全局刚性的第一个模型图形建模的，该图形包括第一个图形的所有顶点和边缘，并且具有预选的最大集团大小。 该建模被配置为通过采用复制由边缘连接的顶点对的顶点的边添加过程来维持预选的最大团体大小。 通过优化第一模型图的顶点和第二图的顶点之间的映射来计算第一图的顶点和第二图的顶点之间的映射。
-
-
-
搜索结果
4 条记录 (耗时 0.011 秒)
