Anne Cathrine Elster

Anne Cathrine Elster

Auto-generated profile, based on publicly available information

Anne Cathrine Elster

Norwegian University of Science and Technology, Norway

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2015 in Medical Image Analysis
Verified
Journal Article
Open access
ESErik Smistad
Erik Smistad
TFThomas L. Falch
Thomas L. Falch
MBMohammadmehdi Bozorgi
Mohammadmehdi Bozorgi
AEAnne C. Elster
Anne C. Elster
FLFrank Lindseth
Frank Lindseth
Segmentation of anatomical structures, from modalities like computed tomography (CT), magnetic resonance imaging (MRI) and ultrasound, is a key enabling technology for medical applications such as diagnostics, planning and guidance. More efficient implementations are necessary, as most segmentation methods are computationally expensive, and the amount of medical imaging data is growing. The increased programmability of graphic processing units (GPUs) in recent years have enabled their use in several areas. GPUs can solve large data parallel problems at a higher speed than the traditional CPU, while being more affordable and energy efficient than distributed systems. Furthermore, using a GPU enables concurrent visualization and interactive segmentation, where the user can help the algorithm to achieve a satisfactory result. This review investigates the use of GPUs to accelerate medical image segmentation methods. A set of criteria for efficient use of GPUs are defined and each segmentation method is rated accordingly. In addition, references to relevant GPU implementations and insight into GPU optimization are provided and discussed. The review concludes that most segmentation methods may benefit from GPU processing due to the methods' data parallel structure and high thread count. However, factors such as synchronization, branch divergence and memory usage can limit the speedup.

1 October 2014 in Medical Image Analysis
Verified
Journal Article
Closed access
RRRina D. Rudyanto
Rina D. Rudyanto
SKSjoerd Kerkstra
Sjoerd Kerkstra
EREva M. van Rikxoort
Eva M. van Rikxoort
CFCatalin Fetita
Catalin Fetita
PBPierre-Yves Brillet
Pierre-Yves Brillet
BGBram van Ginneken
Bram van Ginneken

7 June 2022 in Computing in Science & Engineering
Verified
Journal Article
Closed access
AEAnne C. Elster
Anne C. Elster
THTor A. Haugdahl
Tor A. Haugdahl
At GTC 2022, Nvidia announced a new product family that aims to cover from small enterprise workloads through exascale high performance computing (HPC) and trillion-parameter AI models. This column highlights the most interesting features of their new Hopper graphical processing unit (GPU) and Grace central processing unit (CPU) computer chips and the Hopper product family. We also discuss some of the history behind Nvidia technologies and their most useful features for computational scientists, such as the Hopper DPX dynamic programming (DP) instruction set, increased number of SMs, and FP 8 tensor core availability. Also included are descriptions of the new Hopper Clustered SMs architecture and updated NVSwitch technologies that integrate their new ARM-based Grace CPU.

1 November 2013 in International Journal of Computer Assisted Radiology and Surgery
Verified
Journal Article
Closed access
PDF file
ESErik Smistad
Erik Smistad
AEAnne C. Elster
Anne C. Elster
FLFrank Lindseth
Frank Lindseth

1 May 2015
Verified
Conference Paper
Closed access
TFThomas L. Falch
Thomas L. Falch
AEAnne C. Elster
Anne C. Elster
Heterogeneous computing, which combines devices with different architectures, is rising in popularity, and promises increased performance combined with reduced energy consumption. OpenCL has been proposed as a standard for programing such systems, and offers functional portability. It does, however, suffer from poor performance portability, code tuned for one device must be re-tuned to achieve good performance on another device. In this paper, we use machine learning-based auto-tuning to address this problem. Benchmarks are run on a random subset of the entire tuning parameter configuration space, and the results are used to build an artificial neural network based model. The model can then be used to find interesting parts of the parameter space for further search. We evaluate our method with different benchmarks, on several devices, including an Intel i7 3770 CPU, an Nvidia K40 GPU and an AMD Radeon HD 7970 GPU. Our model achieves a mean relative error as low as 6.1%, and is able to find configurations as little as 1.3% worse than the global minimum.

1 May 2009
Verified
Conference Paper
Closed access
DSDaniele G. Spampinato
Daniele G. Spampinato
AEAnne C. Elstery
Anne C. Elstery
Optimization algorithms are becoming increasingly more important in many areas, such as finance and engineering. Typically, real problems involve several hundreds of variables, and are subject to as many constraints. Several methods have been developed trying to reduce the theoretical time complexity. Nevertheless, when problems exceed reasonable sizes they end up being very computationally intensive. Heterogeneous systems composed by coupling commodity CPUs and GPUs are becoming relatively cheap, highly performing systems. Recent developments of GPGPU technologies give even more powerful control over them. In this paper, we show how we use a revised simplex algorithm for solving linear programming problems originally described by Dantzig for both our CPU and GPU implementations. Previously, this approach has showed not to scale beyond around 200 variables. However, by taking advantage of modern libraries such as ATLAS for matrix-matrix multiplication, and the NVIDIA CUDA programming library on recent GPUs, we show that we can scale to problem sizes up to at least 2000 variables in our experiments for both architectures. On the GPU, we also achieve an appreciable precision on large problems with thousands of variables and constraints while achieving between 2X and 2.5X speed-ups over the serial ATLAS-based CPU version. With further tuning of both the algorithm and its implementations, even better results should be achievable for both the CPU and GPU versions.