邻接图,adjacent graph,在线英语词典,英文翻译,专业英语

1) adjacent graph

邻接图

Based on the assembly constraints and engineering design semantic information, the part adjacent graph was constructed automatically.

基于产品装配约束信息及工程设计语义信息 ,自动构建零件邻接图 ;通过建立连接单元体识别规则 ,识别构件单元 ;通过运动几何元素求交运算规则及运动几何元素与运动副映射关系 ,自动构建机构模型 ,使机构建模过程简化 ,建模速度与精度提高 ,分析复杂度降低。

2) block adjacency graph(BAG)

块邻接图

After analyzing the advantages and disadvantages of the existed grid-line erasing algorithm we present a grid-line erasing algorithm based on the block adjacency graph(BAG) devised by Pavlidis and the stroke reconstruction algorithm in this paper.

在分析已有的手写汉字文本格线删除算法利弊的基础上,采用Pavlid is提出的块邻接图表示法来进行格线删除,并提出了格线删除后的笔画重构算法。

3) AAG

属性邻接图

An AAG-based Method of Machining Feature Recognition for Shaft Parts;

基于属性邻接图的轴类零件制造特征识别方法

4) vectors adjacency graph

矢量邻接图

5) outlying adjacency graph

离群邻接图

6) region adjacency graph

区域邻接图

Second, a region adjacency graph is constracted according to the neighboring relationships between the basins, among which the most possible ones are selected as seeds.

首先用分水岭变换将图像分割成积水盆地和堤坝,然后由筛选后的盆地构造出区域邻接图描述,并从中选出种子点,最后遍历图中的种子,提出一种局部条件泄洪法以获取待检测目标。

Secondly,the basins which are most impossible to be the objects are deleted,and then the neighboring relationships between the remainders are analyzed to construct a region adjacency graph(RAG).

然后对盆地进行初步筛选,删除不可能是目标的盆地,并用区域邻接图(RAG)表示剩下的盆地。

Then the region adjacency graph(RAG) with its adjacency list of data structure was used to represent the image partitions after the initial partitioning with the classical watershed transform.

该算法先对梯度图像进行Lee滤波以降低分水岭变换的过分割程度,在传统分水岭变换初步分割的基础上,利用区域邻接图(RAG,Region Ad jacency Graph)的邻接表数据结构描述过分割区域之间的关系,采用分级阈值合并的方式完成区域合并,以降低合并计算的复杂度。

参考词条

单义域邻接图双向行邻接图单义城邻接图超图的邻接图工程图元邻接图隐意

补充资料：图的减缩图(或称图子式)

图的减缩图(或称图子式)
minor of a graph

图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i

说明：补充资料仅用于学习参考，请勿用于其它任何用途。

首页 \| 翻译 \| 影视 \| 论坛 \| 索引游程邻接图空间邻接图加工面邻接图局部细节邻接图扩展型面邻接图

1) adjacent graph 邻接图 1. Based on the assembly constraints and engineering design semantic information, the part adjacent graph was constructed automatically. 基于产品装配约束信息及工程设计语义信息 ,自动构建零件邻接图 ;通过建立连接单元体识别规则 ,识别构件单元 ;通过运动几何元素求交运算规则及运动几何元素与运动副映射关系 ,自动构建机构模型 ,使机构建模过程简化 ,建模速度与精度提高 ,分析复杂度降低。 2) block adjacency graph(BAG) 块邻接图 1. After analyzing the advantages and disadvantages of the existed grid-line erasing algorithm we present a grid-line erasing algorithm based on the block adjacency graph(BAG) devised by Pavlidis and the stroke reconstruction algorithm in this paper. 在分析已有的手写汉字文本格线删除算法利弊的基础上,采用Pavlid is提出的块邻接图表示法来进行格线删除,并提出了格线删除后的笔画重构算法。 3) AAG 属性邻接图 1. An AAG-based Method of Machining Feature Recognition for Shaft Parts; 基于属性邻接图的轴类零件制造特征识别方法 4) vectors adjacency graph 矢量邻接图 5) outlying adjacency graph 离群邻接图 6) region adjacency graph 区域邻接图 1. Second, a region adjacency graph is constracted according to the neighboring relationships between the basins, among which the most possible ones are selected as seeds. 首先用分水岭变换将图像分割成积水盆地和堤坝,然后由筛选后的盆地构造出区域邻接图描述,并从中选出种子点,最后遍历图中的种子,提出一种局部条件泄洪法以获取待检测目标。 2. Secondly,the basins which are most impossible to be the objects are deleted,and then the neighboring relationships between the remainders are analyzed to construct a region adjacency graph(RAG). 然后对盆地进行初步筛选,删除不可能是目标的盆地,并用区域邻接图(RAG)表示剩下的盆地。 3. Then the region adjacency graph(RAG) with its adjacency list of data structure was used to represent the image partitions after the initial partitioning with the classical watershed transform. 该算法先对梯度图像进行Lee滤波以降低分水岭变换的过分割程度,在传统分水岭变换初步分割的基础上,利用区域邻接图(RAG,Region Ad jacency Graph)的邻接表数据结构描述过分割区域之间的关系,采用分级阈值合并的方式完成区域合并,以降低合并计算的复杂度。参考词条单义域邻接图双向行邻接图单义城邻接图超图的邻接图工程图元邻接图隐意补充资料：图的减缩图(或称图子式) 图的减缩图(或称图子式) minor of a graph 图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i 说明：补充资料仅用于学习参考，请勿用于其它任何用途。
©2008 dictall.com