• This paper presents a new filling algorithm for vertex chain code.

    该文提出填充算法,解决了顶点编码表示区域的填充问题。

    youdao

  • This paper indicates that there are some problems when old vertex chain code labeling algorithm labels the contours of regions.

    本文指出顶点编码算法标定的时候存在一些问题:在某些情况下会漏标定链编码。

    youdao

  • The sequential VCC(Vertex Chain Code) orders of the regions' contour points can be obtained by appending some codes when we counted the regio

    区域统计同时,还可以通过增加简单的代码获得区域边界顶点编码序列,这对于图像的存储和重现都是很有用的。

    youdao

  • Algorithms are proposed for tracing boundary and extracting vertex chain code and obtaining the tree structure of contours from 8-adjacent and 4-adjacent images.

    分别就近邻图像四近邻图像给出了边界跟踪顶点抽取及围线结构生成算法

    youdao

  • Algorithms are proposed for tracing boundary and extracting vertex chain code and obtaining the tree structure of contours from 8-adjacent and 4-adjacent images.

    分别就近邻图像四近邻图像给出了边界跟踪顶点抽取及围线结构生成算法

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定