An approach of fast image mosaic based on binary region segmentation

摘要

An approach of fast image mosaic is presented, which involves image matching and image intensity smoothing. Image matching includes two procedures, i.e. rough matching and fine matching. In rough matching, the overlapped regions of two adjacent images to be mosaicked are segmented to binary image at first. Then the binary images are filtered by open operation of mathematic morphologic method. In the binary image region of the reference image, feature template is searched and extracted on a given rule. Via XOR operation of the feature template and search region, some possible matching positions in the overlapped region of the other image are got. In the fine matching, the sequential similarity detection algorithm (SSDA) is adopted to perform matching computation in the small regions near the positions got in the rough matching, and then the relative position offsets in X-orientation and Y-orientation between the two adjacent images are got. Based on the result of the image matching, the two images are stitched. An approach of seam-line smoothing is adopted to adjust the intensity of the overlapped area. Simulation experimental results show that the approach greatly improves the operation speed, while the precision remains fine, so it can be applied in real-time mosaicking.