Accelerating active contour algorithms with the Gradient Diffusion Field

Active contours were proposed by Kass et al. as a way to represent the contours of an image. Although the method is simple, one of its shortcomings is its inability to converge into concave structures. The Gradient Vector Flow (GVF) algorithm was put forth by Xu and Prince to succesfully address the concave structure problem. Although there has been much research into GVF, little has been done to reduce its computation time, which makes it unsuitable for applications requiring real-time processing of images. In this paper, we propose a method for computing an approximation of the GVF, called the Gradient Diffusion Field (GDF), which exhibits the same useful properties of the GVF but converges faster and requires less resources for implementation. Our proposed method is also more amenable for real-time hardware and we outline a method for implementing an active contour algorithm in FPGA hardware using the GDF.

• Type: Conference
• Year: 2008
• Where: ICPR
• Authors: Willie Kiser, Pradeep Sen, Chris Musial
• Keywords: Active Contour Algorithm, Computer Vision, Concave Structure Problem, Gradient Diffusion Field, ICPR 2008