A fast connected domain marking algorithm for binary image streams

Abstract

The invention discloses a fast connected region marking algorithm for binary image streams, which can quickly identify the connected region according to the continuous image streams formed by a lineararray image sensor, and proposes a fast connected region marking algorithm for binary image which is suitable for FPGA parallel implementation. The algorithm scans the image line by line from left toright and from top to bottom, tags the target pixels, calculates the number of connected regions, and computes the maximum number of horizontal and vertical target pixels of each connected region. Only two adjacent lines of data are needed to make the tagging judgment, and only one scan is needed for the image. The algorithm can not only mark the connected region of binary continuous image stream, but also mark the connected region of static binary image.

Description

technical field [0001] The invention relates to the technical field of image information processing, and specifically discloses a fast connected domain marking algorithm for binary images, which is suitable for the connected domain analysis of high-speed moving image streams and still images. Background technique [0002] With the continuous advancement of computer image processing technology and the continuous development of many related disciplines such as pattern recognition, robot vision, and detection technology, the detection efficiency of connected domains in binary images has become one of the basic issues in the research of this type of image-related fields. Many scholars have studied the problem of connected domain labeling in binary images. In this kind of application, the efficiency of binary image connected domain labeling algorithm is always a common bottleneck problem. At present, many literatures introduce connected domain labeling algorithms mainly include ...

AI Technical Summary

Problems solved by technology

This improved algorithm can complete the marking of pixels in one scan for most shape objects, but this algorithm cannot deal with all complex connected shapes (such as bifurcations) in a general way, and can only use different methods for different bifurcation directions. It is processed by scanning, which is not universal

Moreover, the above algorithm requires that the image must have a complete frame. For the image flow formed by linear CCD scanning, continuous connected domain detection cannot be performed, and it cannot meet the requirements of the marking algorithm for real-time tracking of moving targets based on image flow.

Images