边界的快速跟踪算法和硬件实现  

A Method for Fast Binary Image Boundary Following and Its Hardware Implementation

作　　者：吴宇岚[1] 费旭东[1] 荆仁杰[1] 

机构地区：[1]浙江大学

出　　处：《通信学报》1997年第5期67-72,共6页Journal on Communications

基　　金：科工委八五重点资助

摘　　要：本文研究了一种快速跟踪二值图边界的方法，该方法采用２×２的跟踪窗口，能将连通区的所有边界（包括连通区内部空洞的边界）全提取出来，以图像方式和链码方式输出。为提高速度，在软件模拟成功后，我们更以硬件加以实现。用若干图像进行处理的结果表明，对于多数大小为５１２×５１２的复杂景物图像，由硬件提取一幅图中边界的时间在４０ｍｓ以内。In this paper, a method for fast binary -image boundary following is presented. A 2×2 window is used for boundary tracing. All the boundaries of the connected components in the image, including boundaries of cavities inside the components, can be extracted and chain -coded. After the succession of the software simulation, we further implemented the algorithm by hardware to improve the work speed. It is shown that, for most practical images of size 512×512, boundary following can be done within 40ms using hardware, reaching the request of the real -time image processing in TV rate.

关 键 词：二值图 边界跟踪 实时图像处理 

分 类 号：TN919.8[电子电信—通信与信息系统]