一种区域边界显示的快速算法  

A Rapid Algorithm to Display Region Boundaries

作　　者：黄全亮[1] 刘卫忠[1] 邹雪城[1] 孙德宝[2] 

机构地区：[1]华中科技大学电子科学技术系,武汉430074 [2]华中科技大学控制科学与工程系,武汉430074

出　　处：《计算机与数字工程》2007年第3期8-10,共3页Computer & Digital Engineering

摘　　要：由于在交互式的图像处理中,影响系统性能的主要是时间而非存储空间。虽然作为描述区域边界的常用方法——链码,能有效降低存储空间,本文仍然用最简单和最直接的方法——横向和纵向线段组来描述图像区域边界。并在分析横向和纵向线段组的规律性的基础上,给出了一种由图像区域同时生成其横向和纵向线段组的快速算法。Since, the main factor that effects system performance in interactive image processing is the time rather than storage space. Though, chain coding is the main method to represent the region boundaries for its advantage on storage space. In this paper, we still use the most simply and the most direct method, which is the horizontal line array and vertical line array, to display the region boundaries. After analyzing the regulars of the horizontal line array and vertical line array, a rapid algorithm to display region boundaries is presented. This algorithm can also be used on the sort of data, which possesses the same regulars.

关 键 词：交互式图像处理 区域边界 排序 

分 类 号：TN391[电子电信—物理电子学]