Skip to content
naulon
Not checkedNot checked for notices yet.

Parallel algorithms for solution of nonlinear diffusion problems in image smoothing

R. Čiegis, A. Jakušev, A. Krylovas and 1 more

Mathematical Modelling and Analysis · 2005

doi:10.3846/13926292.2005.9637279 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

In this work we consider parallel algorithms for solution of nonlinear parabolic PDEs. First mathematical models describing nonlinear diffusion filters are presented. The finite‐volume method is used to approximate differential equations. Parallel algorithms are based on the domain decomposition method. The algorithms are implemented by using ParSol parallelization tool and a brief description of this tool is also presented. The efficiency of proposed parallel algorithms is investigated and results of the scalability analysis are given. Theoretical predictions are compared with results of computational experiments. Application of nonlinear diffusion filters for analysis of computer tomography images is discussed in the last section of the paper. Šiame darbe nagrinejami lygiagretieji algoritmai, kurie skirti netiesiniu nestacionariu difuzijos lygčiu sprendimui. Pirmiausia yra suformuluoti netiesiniu filtru matematiniai modeliai. Šie uždaviniai aproksimuoti baigtiniu tūriu schemomis. Lygiagretieji algoritmai konstruojami duomenu lygiagretumo metodu. Jie realizuoti autoriu sukurtu ParSolprogramavimo irankiu. Pateiktas trumpas šio irankio aprašymas. Ištirtas lygiagrečiuju algoritmu efektyvumas ir pateikti algoritmu išplečiamumo analizes rezultatai. Teorines išvados palygintos su skaičiavimo rezultatais. Netiesiniai difuziniai filtrai pritaikyti galvos kompiuteriniu tomogramu filtravimui.

Abstract licence: CC BY

References18

    18 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.