Efficient tree construction for multiscale image representation and processing

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F16%3APU121648" target="_blank" >RIV/00216305:26230/16:PU121648 - isvavai.cz</a>

Výsledek na webu

<a href="http://link.springer.com/article/10.1007/s11554-016-0604-0" target="_blank" >http://link.springer.com/article/10.1007/s11554-016-0604-0</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s11554-016-0604-0" target="_blank" >10.1007/s11554-016-0604-0</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Efficient tree construction for multiscale image representation and processing

Popis výsledku v původním jazyce

With the continuous growth of sensor performances, image analysis and processing algorithms have to cope with larger and larger data volumes. Besides, the informative components of an image might not be the pixels themselves, but rather the objects they belong to. This has led to a wide range of successful multiscale techniques in image analysis and computer vision. Hierarchical representations are thus of first importance, and require efficient algorithms to be computed in order to address real-life applications. Among these hierarchical models, we focus on morphological trees (e.g., min/maxtree, tree of shape, binary partition tree, a-tree) that come with interesting properties and already led to appropriate techniques for image processing and analysis, with a growing interest from the image processing community. More precisely, we build upon two recent algorithms for efficient a-tree computation and introduce several improvements to achieve higher performance. We also discuss the impact of the data structure underlying the tree representation, and provide for the sake of illustration several applications where efficient multiscale image representation leads to fast but accurate techniques, e.g., in remote sensing image analysis or video segmentation.

Název v anglickém jazyce

Efficient tree construction for multiscale image representation and processing

Popis výsledku anglicky

With the continuous growth of sensor performances, image analysis and processing algorithms have to cope with larger and larger data volumes. Besides, the informative components of an image might not be the pixels themselves, but rather the objects they belong to. This has led to a wide range of successful multiscale techniques in image analysis and computer vision. Hierarchical representations are thus of first importance, and require efficient algorithms to be computed in order to address real-life applications. Among these hierarchical models, we focus on morphological trees (e.g., min/maxtree, tree of shape, binary partition tree, a-tree) that come with interesting properties and already led to appropriate techniques for image processing and analysis, with a growing interest from the image processing community. More precisely, we build upon two recent algorithms for efficient a-tree computation and introduce several improvements to achieve higher performance. We also discuss the impact of the data structure underlying the tree representation, and provide for the sake of illustration several applications where efficient multiscale image representation leads to fast but accurate techniques, e.g., in remote sensing image analysis or video segmentation.

Druh

J_imp - Článek v periodiku v databázi Web of Science

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/TE01020415" target="_blank" >TE01020415: Centrum kompetence ve zpracování vizuálních informací (V3C - Visual Computing Competence Center)</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2016

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

Journal of Real-Time Image Processing

ISSN

1861-8200

e-ISSN

1861-8219

Svazek periodika

16

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

18

Strana od-do

1129-1146

Kód UT WoS článku

000477988400022

EID výsledku v databázi Scopus

2-s2.0-85069942451