华东师范大学学报(自然科学版) ›› 2005, Vol. 2005 ›› Issue (2): 33-38.

• 计算机科学 • 上一篇    下一篇

图像顶点链编码和顶点欧氏距离的计算

张薇，陈优广，顾国庆   

  1. 华东师范大学 信息科学技术学院,上海200062
  • 收稿日期:2003-12-01 修回日期:2004-04-09 出版日期:2005-05-25 发布日期:2005-05-25
  • 通讯作者: 张薇

Calculation of Euclidean Distance between Vertices Based on VCC(Chinese)

ZHANG Wei,CHEN You-guang,GU Guo-qing   

  1. School of Information Science and Technology, East China Normal University,Shanghai200062, China
  • Received:2003-12-01 Revised:2004-04-09 Online:2005-05-25 Published:2005-05-25
  • Contact: ZHANG Wei

摘要： 利用链编码及其特性，分析得出图像区域边界的周长、最小外接矩形（MER）的长与宽，及图像所占区域的面积.对于正四边形、正三边形和正六边形点阵上的图形，分别提出了直接从链编码计算图像顶点欧氏距离的方法.

关键词: 顶点链编码, 坐标标定自动机, 欧氏距离, 顶点链编码, 坐标标定自动机, 欧氏距离

Abstract: This paper introduces the way of utilizing VCC to get the perimeter of an image region, the length and width of the minimum external rectangular (ab. MER) of the image and the size of the region occupied by the image. For digital images in square, triangular and hexagonal lattices, formulates respectively the methods of calculating the Euclid distance from vertex-chain-code of the region boundary.

Key words: coordinate-labeling-automata, Euclidean distance, VCC, coordinate-labeling-automata, Euclidean distance

中图分类号: