Sciweavers

PR
2007

Design and formal proof of a new optimal image segmentation program with hypermaps

13 years 4 months ago
Design and formal proof of a new optimal image segmentation program with hypermaps
This article presents the design of a new functional 2D image segmentation algorithm by cell merging in a subdivision, its proof of total correctness, and the derivation of an optimal imperative program. The planar subdivisions are modeled by hypermaps. The formal specifications of hypermaps and segmentation are developed in the Calculus of Inductive Constructions. The proofs are assisted by the Coq system. The final program is written in C. Key words: image segmentation, hypermaps, formal specification, Coq system, computer-aided correctness proof
Jean-François Dufourd
Added 27 Dec 2010
Updated 27 Dec 2010
Type Journal
Year 2007
Where PR
Authors Jean-François Dufourd
Comments (0)