J4 ›› 2011, Vol. 49 ›› Issue (01): 82-86.

Previous Articles     Next Articles

Hole-Filling Algorithm Based on Contour

ZHANG Decai, ZHOU Chunguang, ZHOU Qiang, CHI Shuzhen, WANG Sujing   

  1. College of Computer Science and Technology, Jilin University, Changchun 130012, China
  • Received:2010-01-06 Online:2011-01-26 Published:2011-02-19
  • Contact: ZHOU Chunguang E-mail:cgzhou@jlu.edu.cn

Abstract:

A new holefilling algorithm based on contour was proposed. First of all, the circumscribed contour to the target area is found and ma
rked, then a point in the area is selected as the seed to perform the regiongrowing operation inside the contour until all the points are found. At last, the algorithm eliminates all the marks, and sets the target area foreground color. Experimental results show that the algorithm is adaptable to any kind of hole filling algorithm and efficient. And the speed of the algorithm will be accelerated when the area of the target reduces. When the algorithm is applied in the motion detection system, more complete information of the moving target will be acquired.

Key words: region growing, holefilling, circumscribed contour; moving object detection

CLC Number: 

  • TP391.41