About: A Comparison of Fast Level Set-Like Algorithms for Image Segmentation in Fluorescence Microscopy     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Image segmentation, one of the fundamental task of image processing, can be accurately solved using the level set framework. However, the computational time demands of the level set methods make them practically useless, especially for segmentation of large threedimensional images. Many approximations have been introduced in recent years to speed up the computation of the level set methods. Although these algorithms provide favourable results, most of them were not properly tested against ground truth images. In this paper we present a comparison of three methods: the Sparse-Field method [1], Deng and Tsui's algorithm [2] and Nilsson and Heyden's algorithm [3]. Our main motivation was to compare these methods on 3D image data acquired using fluorescence microscope, but we suppose that presented results are also valid and applicable to other biomedical images like CT scans, MRI or ultrasound images.
  • Image segmentation, one of the fundamental task of image processing, can be accurately solved using the level set framework. However, the computational time demands of the level set methods make them practically useless, especially for segmentation of large threedimensional images. Many approximations have been introduced in recent years to speed up the computation of the level set methods. Although these algorithms provide favourable results, most of them were not properly tested against ground truth images. In this paper we present a comparison of three methods: the Sparse-Field method [1], Deng and Tsui's algorithm [2] and Nilsson and Heyden's algorithm [3]. Our main motivation was to compare these methods on 3D image data acquired using fluorescence microscope, but we suppose that presented results are also valid and applicable to other biomedical images like CT scans, MRI or ultrasound images. (en)
Title
  • A Comparison of Fast Level Set-Like Algorithms for Image Segmentation in Fluorescence Microscopy
  • A Comparison of Fast Level Set-Like Algorithms for Image Segmentation in Fluorescence Microscopy (en)
skos:prefLabel
  • A Comparison of Fast Level Set-Like Algorithms for Image Segmentation in Fluorescence Microscopy
  • A Comparison of Fast Level Set-Like Algorithms for Image Segmentation in Fluorescence Microscopy (en)
skos:notation
  • RIV/00216224:14330/07:00022769!RIV10-MSM-14330___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(2B06052), P(LC535), Z(MSM0021622419)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 407822
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/07:00022769
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • image segmentation; level set method; active contours (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [2AE7553E9EDA]
http://linked.open...v/mistoKonaniAkce
  • Lake Tahoe, Nevada/California
http://linked.open...i/riv/mistoVydani
  • Berlin, Heidelberg
http://linked.open...i/riv/nazevZdroje
  • 3rd International Symposium on Visual Computing
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Maška, Martin
  • Svoboda, David
  • Hubený, Jan
  • Kozubek, Michal
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000251785200056
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 978-3-540-76855-5
http://localhost/t...ganizacniJednotka
  • 14330
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 38 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software