Exact computation of median surfaces using optimal 3D graph search

  • Zhengwang Wu
  • , Xiaoyi Jiang
  • , Nanning Zheng
  • , Yuehu Liu
  • , Dachuan Cheng

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In this paper we formulate the generalized median surface problem and present its exact solution by means of an optimal 3D graph search algorithm. In addition to the general interest in median surface computation our work is also motivated by the task of parameter space exploration without ground truth, which is an effective means of dealing with the difficult parameter problem. A concrete application in this context will be demonstrated on artery boundary detection in ultrasound data. It will be shown that the median computation can not only avoid the parameter training, but also potentially achieve even better results than with trained parameters. Particularly in situations with no available ground truth, the median-based approach can thus be a good alternate.

Original languageEnglish
Title of host publicationGraph-Based Representations in Pattern Recognition - 9th IAPR-TC-15 International Workshop, GbRPR 2013, Proceedings
Pages234-243
Number of pages10
DOIs
StatePublished - 2013
Event9th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition, GbRPR 2013 - Vienna, Austria
Duration: 15 May 201317 May 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7877 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition, GbRPR 2013
Country/TerritoryAustria
CityVienna
Period15/05/1317/05/13

Fingerprint

Dive into the research topics of 'Exact computation of median surfaces using optimal 3D graph search'. Together they form a unique fingerprint.

Cite this