Algebraic filtering of surfaces from 3d medical images with julia

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F21%3A43959834" target="_blank" >RIV/49777513:23520/21:43959834 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/00216208:11140/20:10417891 RIV/00669806:_____/20:10417891

Výsledek na webu

<a href="http://doi.org/10.14733/cadaps.2021.468-485" target="_blank" >http://doi.org/10.14733/cadaps.2021.468-485</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.14733/cadaps.2021.468-485" target="_blank" >10.14733/cadaps.2021.468-485</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Algebraic filtering of surfaces from 3d medical images with julia

Popis výsledku v původním jazyce

In this paper we introduce a novel algebraic filter, based on algebraic topology methods, to extract and smooth the boundary surface of any subset of voxels arising from the segmentation of a 3D medical image. The input of the Linear Algebraic Representation (lar) Surface extraction filter (lar-surf) is defined as a chain, i.e., an element of a linear space of chains here subsets of voxels represented in coordinates as a sparse binary vector. The output is produced by a linear mapping between spaces of 3-and 2-chains, given by the boundary operator ∂3: C3 → C2. The only data structures used in this approach are sparse arrays with one or two indices, i.e., sparse vectors and sparse matrices. This work is based on lar algebraic methods and is implemented in Julia language, natively supporting parallel computing on hybrid hardware architectures.

Název v anglickém jazyce

Algebraic filtering of surfaces from 3d medical images with julia

Popis výsledku anglicky

In this paper we introduce a novel algebraic filter, based on algebraic topology methods, to extract and smooth the boundary surface of any subset of voxels arising from the segmentation of a 3D medical image. The input of the Linear Algebraic Representation (lar) Surface extraction filter (lar-surf) is defined as a chain, i.e., an element of a linear space of chains here subsets of voxels represented in coordinates as a sparse binary vector. The output is produced by a linear mapping between spaces of 3-and 2-chains, given by the boundary operator ∂3: C3 → C2. The only data structures used in this approach are sparse arrays with one or two indices, i.e., sparse vectors and sparse matrices. This work is based on lar algebraic methods and is implemented in Julia language, natively supporting parallel computing on hybrid hardware architectures.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/LO1506" target="_blank" >LO1506: Podpora udržitelnosti centra NTIS - Nové technologie pro informační společnost</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Computer-Aided Design and Applications

ISSN

1686-4360

e-ISSN

—

Svazek periodika

18

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

18

Strana od-do

468-485

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-85090491619