Fast algorithm for hybrid region-based active contours optimisation

Yamina Boutiche, Abdelhamid Abdesselam

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Active contours are usually based on the optimisation of energy functionals that are built to attract the curve towards the objects' boundaries. This study describes a hybrid region-based active contours technique that uses global means to define the global fitting energy and local means and variances to define the local fitting energy. The optimisation of the functional is performed by applying a sweeping-principle algorithm, which avoids solving any partial differential equation and removes the need for any stability conditions. Furthermore, sweeping-principle algorithm is not based on the computation of derivatives, which allows using a binary level set function during the minimisation process instead of the signed distance function, consequently this removes the need for the distance regularisation term, avoiding its subtle side effects and speeding up the optimisation process. Successful and accurate segmentation results are obtained on synthetic and real images with a significant gain in the CPU execution time when compared with the minimisation via the commonly used gradient descent method.

Original languageEnglish
Pages (from-to)200-209
Number of pages10
JournalIET Image Processing
Volume11
Issue number3
DOIs
Publication statusPublished - Mar 1 2017

Fingerprint

Partial differential equations
Program processors
Derivatives

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering

Cite this

Fast algorithm for hybrid region-based active contours optimisation. / Boutiche, Yamina; Abdesselam, Abdelhamid.

In: IET Image Processing, Vol. 11, No. 3, 01.03.2017, p. 200-209.

Research output: Contribution to journalArticle

@article{e966b5e1325d4f969b0eecde5928026a,
title = "Fast algorithm for hybrid region-based active contours optimisation",
abstract = "Active contours are usually based on the optimisation of energy functionals that are built to attract the curve towards the objects' boundaries. This study describes a hybrid region-based active contours technique that uses global means to define the global fitting energy and local means and variances to define the local fitting energy. The optimisation of the functional is performed by applying a sweeping-principle algorithm, which avoids solving any partial differential equation and removes the need for any stability conditions. Furthermore, sweeping-principle algorithm is not based on the computation of derivatives, which allows using a binary level set function during the minimisation process instead of the signed distance function, consequently this removes the need for the distance regularisation term, avoiding its subtle side effects and speeding up the optimisation process. Successful and accurate segmentation results are obtained on synthetic and real images with a significant gain in the CPU execution time when compared with the minimisation via the commonly used gradient descent method.",
author = "Yamina Boutiche and Abdelhamid Abdesselam",
year = "2017",
month = "3",
day = "1",
doi = "10.1049/iet-ipr.2016.0648",
language = "English",
volume = "11",
pages = "200--209",
journal = "IET Image Processing",
issn = "1751-9659",
publisher = "Institution of Engineering and Technology",
number = "3",

}

TY - JOUR

T1 - Fast algorithm for hybrid region-based active contours optimisation

AU - Boutiche, Yamina

AU - Abdesselam, Abdelhamid

PY - 2017/3/1

Y1 - 2017/3/1

N2 - Active contours are usually based on the optimisation of energy functionals that are built to attract the curve towards the objects' boundaries. This study describes a hybrid region-based active contours technique that uses global means to define the global fitting energy and local means and variances to define the local fitting energy. The optimisation of the functional is performed by applying a sweeping-principle algorithm, which avoids solving any partial differential equation and removes the need for any stability conditions. Furthermore, sweeping-principle algorithm is not based on the computation of derivatives, which allows using a binary level set function during the minimisation process instead of the signed distance function, consequently this removes the need for the distance regularisation term, avoiding its subtle side effects and speeding up the optimisation process. Successful and accurate segmentation results are obtained on synthetic and real images with a significant gain in the CPU execution time when compared with the minimisation via the commonly used gradient descent method.

AB - Active contours are usually based on the optimisation of energy functionals that are built to attract the curve towards the objects' boundaries. This study describes a hybrid region-based active contours technique that uses global means to define the global fitting energy and local means and variances to define the local fitting energy. The optimisation of the functional is performed by applying a sweeping-principle algorithm, which avoids solving any partial differential equation and removes the need for any stability conditions. Furthermore, sweeping-principle algorithm is not based on the computation of derivatives, which allows using a binary level set function during the minimisation process instead of the signed distance function, consequently this removes the need for the distance regularisation term, avoiding its subtle side effects and speeding up the optimisation process. Successful and accurate segmentation results are obtained on synthetic and real images with a significant gain in the CPU execution time when compared with the minimisation via the commonly used gradient descent method.

UR - http://www.scopus.com/inward/record.url?scp=85013670352&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85013670352&partnerID=8YFLogxK

U2 - 10.1049/iet-ipr.2016.0648

DO - 10.1049/iet-ipr.2016.0648

M3 - Article

VL - 11

SP - 200

EP - 209

JO - IET Image Processing

JF - IET Image Processing

SN - 1751-9659

IS - 3

ER -