0000000000674437

AUTHOR

Mirko Myllykoski

showing 7 related works from this author

A New Augmented Lagrangian Approach for $L^1$-mean Curvature Image Denoising

2015

Variational methods are commonly used to solve noise removal problems. In this paper, we present an augmented Lagrangian-based approach that uses a discrete form of the L1-norm of the mean curvature of the graph of the image as a regularizer, discretization being achieved via a finite element method. When a particular alternating direction method of multipliers is applied to the solution of the resulting saddle-point problem, this solution reduces to an iterative sequential solution of four subproblems. These subproblems are solved using Newton’s method, the conjugate gradient method, and a partial solution variant of the cyclic reduction method. The approach considered here differs from ex…

ta113Mean curvatureDiscretizationimage denoisingAugmented Lagrangian methodApplied MathematicsGeneral Mathematicsmean curvaturekuvankäsittelyTopologyFinite element methodimage processingsymbols.namesakeLagrangian relaxationLagrange multiplierConjugate gradient methodsymbolsApplied mathematicsaugmented Lagrangian methodalternating direction methods of multipliersvariational modelMathematicsCyclic reductionSIAM Journal on Imaging Sciences
researchProduct

A parallel radix-4 block cyclic reduction algorithm

2013

SUMMARY A conventional block cyclic reduction algorithm operates by halving the size of the linear system at each reduction step, that is, the algorithm is a radix-2 method. An algorithm analogous to the block cyclic reduction known as the radix-q partial solution variant of the cyclic reduction (PSCR) method allows the use of higher radix numbers and is thus more suitable for parallel architectures as it requires fever reduction steps. This paper presents an alternative and more intuitive way of deriving a radix-4 block cyclic reduction method for systems with a coefficient matrix of the form tridiag{ − I,D, − I}. This is performed by modifying an existing radix-2 block cyclic reduction me…

Reduction (complexity)Algebra and Number TheoryApplied MathematicsLinear systemPartial solutionRadixCoefficient matrixPartial fraction decompositionAlgorithmMathematicsBlock (data storage)Cyclic reductionNumerical Linear Algebra with Applications
researchProduct

On solving separable block tridiagonal linear systems using a GPU implementation of radix-4 PSCR method

2018

Partial solution variant of the cyclic reduction (PSCR) method is a direct solver that can be applied to certain types of separable block tridiagonal linear systems. Such linear systems arise, e.g., from the Poisson and the Helmholtz equations discretized with bilinear finite-elements. Furthermore, the separability of the linear system entails that the discretization domain has to be rectangular and the discretization mesh orthogonal. A generalized graphics processing unit (GPU) implementation of the PSCR method is presented. The numerical results indicate up to 24-fold speedups when compared to an equivalent CPU implementation that utilizes a single CPU core. Attained floating point perfor…

Tridiagonal linear systemsProgramvaruteknikComputer Networks and CommunicationsComputer sciencePartial solution techniquereduction010103 numerical & computational mathematicsParallel computingtietotekniikka01 natural scienceslineaariset mallitTheoretical Computer ScienceSeparable spaceinformation technologyArtificial IntelligenceSeparable block tridiagonal linear systemBlock (telecommunications)Fast direct solverRadix0101 mathematicsta113Computer Sciencesta111Linear systemSoftware EngineeringGPU computingSolverComputer Science::Numerical Analysis010101 applied mathematicsPSCR methodDatavetenskap (datalogi)partial solution techniqueHardware and ArchitectureComputer Science::Mathematical Softwarepienennyslinear modelsSoftwareRoofline modelCyclic reductionJournal of Parallel and Distributed Computing
researchProduct

On GPU-accelerated fast direct solvers and their applications in image denoising

2015

block cyclic reductionnäytönohjaimetOpenCLnumeeriset menetelmätprosessoritimage denoisingparallel computingmean curvatureGPU computingkuvankäsittelyimage processingfast Poisson solverseparable block tridiagonal linear systemPSCR methodoptimointialgoritmitohjelmointiaugmented Lagrangian methodkohinafast direct solverrinnakkaislaskentaalternating direction methods of multipliers
researchProduct

Fast Poisson solvers for graphics processing units

2013

Two block cyclic reduction linear system solvers are considered and implemented using the OpenCL framework. The topics of interest include a simplified scalar cyclic reduction tridiagonal system solver and the impact of increasing the radix-number of the algorithm. Both implementations are tested for the Poisson problem in two and three dimensions, using a Nvidia GTX 580 series GPU and double precision floating-point arithmetic. The numerical results indicate up to 6-fold speed increase in the case of the two-dimensional problems and up to 3- fold speed increase in the case of the three-dimensional problems when compared to equivalent CPU implementations run on a Intel Core i7 quad-core CPU…

Tridiagonal matrixOpenCLComputer scienceparallel computingScalar (mathematics)Linear systemSyklinen reductionGPGPUGPUDouble-precision floating-point formatParallel computingSolverPoisson distributionPSCRComputational sciencefast Poisson solversymbols.namesakenopea Poisson-ratkaisijanäytönohjainsymbolsComputer Science::Mathematical SoftwareCyclic reductionGraphicsrinnakkaislaskentaCyclic reduction
researchProduct

A GPU-accelerated augmented Lagrangian based L1-mean curvature Image denoising algorithm implementation

2015

This paper presents a graphics processing unit (GPU) implementation of a recently published augmented Lagrangian based L1-mean curvature image denoising algorithm. The algorithm uses a particular alternating direction method of multipliers to reduce the related saddle-point problem to an iterative sequence of four simpler minimization problems. Two of these subproblems do not contain the derivatives of the unknown variables and can therefore be solved point-wise without inter-process communication. Inparticular, this facilitates the efficient solution of the subproblem that deals with the non-convex term in the original objective function by modern GPUs. The two remaining subproblems are so…

GPU výpočtyOpenCLimage denoisingodstranění šumu z obrazumean curvaturekuvankäsittelystřední zakřiveníaugmented Lagrangian methodGPU computingzpracování obrazurozšířená Lagrangianova metodaimage processing
researchProduct

A parallel radix-4 block cyclic reduction algorithm

2014

A conventional block cyclic reduction algorithm operates by halving the size of the linear system at each reduction step, that is, the algorithm is a radix-2 method. An algorithm analogous to the block cyclic reduction known as the radix-q partial solution variant of the cyclic reduction (PSCR) method allows the use of higher radix numbers and is thus more suitable for parallel architectures as it requires fever reduction steps. This paper presents an alternative and more intuitive way of deriving a radix-4 block cyclic reduction method for systems with a coefficient matrix of the form tridiag{ − I,D, − I}. This is performed by modifying an existing radix-2 block cyclic reduction method. Th…

fast Poisson solverblock cyclic reductionnopea Poisson ratkaisijaosamurtokehitelmätekniikkaparallel computingsyklinen reduktioPSCRrinnakkaislaskentasuora ratkaisijadirect solverpartial fraction technique
researchProduct