Research overview
Recent publications:
Show/hide year headlines.
2012
Abstract Objective. This study aimed to develop a probabilistic decision support model to calculate the lifetime incremental cost-effectiveness ratio (ICER) between radical prostatectomy and watchful waiting for different patient groups. Material and methods. A randomized trial (SPCG-4) provided most data for this study. Data on survival, costs and quality of life were inputs in a decision analysis, and a decision support model was developed. The model can generate cost-effectiveness information on subgroups of patients with different characteristics. Results. Age was the most important independent factor explaining cost-effectiveness. The cost-effectiveness value varied from 21 026 Swedish kronor (SEK) to 858 703 SEK for those aged 65 to 75 years, depending on Gleason scores and prostate-specific antigen (PSA) values. Information from the decision support model can support decision makers in judging whether or not radical prostatectomy (RP) should be used to treat a specific patient group. Conclusions. The cost-effectiveness ratio for RP varies with age, Gleason scores, and PSA values. Assuming a threshold value of 200 000 SEK per quality-adjusted life-year (QALY) gained, for patients aged ≤70 years the treatment was always cost-effective, except at age 70, Gleason 0–4 and PSA ≤10. Using the same threshold value at age 75, Gleason 7–9 (regardless of PSA) and Gleason 5–6 (with PSA >20) were cost-effective. Hence, RP was not perceived to be cost-effective in men aged 75 years with low Gleason and low PSA. Higher threshold values for patients with clinically localized prostate cancer could be discussed.
Keywords cost-effectiveness, decision support, prostate cancer, radical prostatectomy, randomized trial, watchful waiting, Engineering and Technology
BIBTEX
@article{diva2:442462,
author = {Lyth, Johan and Andersson, Swen-Olof and Andr\'{e}n, Ove and Johansson, Jan-Erik and Carlsson, Per and Shahsavar, Nosrat},
title = {{A decision support model for cost-effectiveness of radical prostatectomy in localized prostate cancer}},
journal = {Scandinavian Journal of Urology and Nephrology},
year = {2012},
volume = {46},
number = {1},
pages = {19--25},
}
Abstract Functional magnetic resonance imaging (fMRI) makes it possible to non-invasively measure brain activity with high spatial resolution.There are however a number of issues that have to be addressed. One is the large amount of spatio-temporal data that needsto be processed. In addition to the statistical analysis itself, several preprocessing steps, such as slice timing correction and motioncompensation, are normally applied. The high computational power of modern graphic cards has already successfully been used forMRI and fMRI. Going beyond the first published demonstration of GPU-based analysis of fMRI data, all the preprocessing stepsand two statistical approaches, the general linear model (GLM) and canonical correlation analysis (CCA), have been implementedon a GPU. For an fMRI dataset of typical size (80 volumes with 64 x 64 x 22 voxels), all the preprocessing takes about 0.5 s on theGPU, compared to 5 s with an optimized CPU implementation and 120 s with the commonly used statistical parametric mapping(SPM) software. A random permutation test with 10 000 permutations, with smoothing in each permutation, takes about 50 s ifthree GPUs are used, compared to 0.5 - 2.5 h with an optimized CPU implementation. The presented work will save time forresearchers and clinicians in their daily work and enables the use of more advanced analysis, such as non-parametric statistics, bothfor conventional fMRI and for real-time fMRI.
Keywords Functional magnetic resonance imaging (fMRI), Graphics processing unit (GPU), CUDA, General linear model (GLM), Canonical correlation analysis (CCA), Random permutation test, Engineering and Technology
BIBTEX
@article{diva2:430972,
author = {Eklund, Anders and Andersson, Mats and Knutsson, Hans},
title = {{fMRI Analysis on the GPU - Possibilities and Challenges}},
journal = {Computer Methods and Programs in Biomedicine},
year = {2012},
volume = {105},
number = {2},
pages = {145--161},
}
2011
Thobias Romu, Olof Dahlqvist Leinhard, Mikael Forsgren, Sven Almer, Nils Dahlström, Stergios Kechagias, Fredrik Nyström, Örjan Smedby, Peter Lundberg, Magnus Borga,
"Fat Water Classification of Symmetrically Sampled Two-Point Dixon Images Using Biased Partial Volume Effects",
ISMRM, Montreal 2011,
2011.
Keywords Medical and Health Sciences
BIBTEX
@inproceedings{diva2:475977,
author = {Romu, Thobias and Dahlqvist Leinhard, Olof and Forsgren, Mikael and Almer, Sven and Dahlström, Nils and Kechagias, Stergios and Nyström, Fredrik and Smedby, Örjan and Lundberg, Peter and Borga, Magnus},
title = {{Fat Water Classification of Symmetrically Sampled Two-Point Dixon Images Using Biased Partial Volume Effects}},
booktitle = {ISMRM, Montreal 2011},
year = {2011},
}
Abstract The multilinear least-squares (MLLS) problem is an extension of the linear least-squares problem. The difference is that a multilinearoperator is used in place of a matrix-vector product. The MLLS istypically a large-scale problem characterized by a large number of local minimizers. It originates, for instance, from the design of filter networks. We present a global search strategy that allows formoving from one local minimizer to a better one. The efficiencyof this strategy isillustrated by results of numerical experiments performed forsome problems related to the design of filter networks.
Keywords Global optimization; Global search strategies; Multilinear least-squares; Filter networks, Natural Sciences, Engineering and Technology
BIBTEX
@techreport{diva2:457980,
author = {Andersson, Mats and Burdakov, Oleg and Knutsson, Hans and Zikrin, Spartak},
title = {{Global Search Strategies for Solving Multilinear Least-squares Problems}},
institution = {Linköping University, Department of Electrical Engineering},
year = {2011},
type = {Other academic},
number = {LiTH-MAT-R, 17},
address = {Sweden},
}
Daniel Forsberg, Claes Lundström, Mats Andersson, Hans Knutsson,
"Model-Based Transfer Functions for Efficient Visualization of Medical Image Volumes",
17th Scandinavian Conference on Image Analysis, SCIA 2011, Ystad, Sweden, May 2011., Lecture Notes in Computer Science,
Vol. 6688,
592-603, 2011.
Abstract The visualization of images with a large dynamic range is a difficult task and this is especially the case for gray-level images. In radiology departments, this will force radiologists to review medical images several times, since the images need to be visualized with several different contrast windows (transfer functions) in order for the full information content of each image to be seen. Previously suggested methods for handling this situation include various approaches using histogram equalization and other methods for processing the image data. However, none of these utilize the underlying human anatomy in the images to control the visualization and the fact that different transfer functions are often only relevant for disjoint anatomical regions. In this paper, we propose a method for using model-based local transfer functions. It allows the reviewing radiologist to apply multiple transfer functions simultaneously to a medical image volume. This provides the radiologist with a tool for making the review process more efficient, by allowing him/her to review more of the information in a medical image volume with a single visualization. The transfer functions are automatically assigned to different anatomically relevant regions, based upon a model registered to the volume to be visualized. The transfer functions can be either pre-defined or interactively changed by the radiologist during the review process. All of this is achieved without adding any unfamiliar aspects to the radiologist’s normal work-flow, when reviewing medical image volumes.
Keywords Engineering and Technology
BIBTEX
@inproceedings{diva2:452696,
author = {Forsberg, Daniel and Lundström, Claes and Andersson, Mats and Knutsson, Hans},
title = {{Model-Based Transfer Functions for Efficient Visualization of Medical Image Volumes}},
booktitle = {17th Scandinavian Conference on Image Analysis, SCIA 2011, Ystad, Sweden, May 2011.},
year = {2011},
series = {Lecture Notes in Computer Science},
volume = {6688},
pages = {592--603},
publisher = {Springer Berlin},
address = {Heidelberg},
}
Daniel Forsberg, Yogesh Rathi, Sylvain Bouix, Demian Wassermann, Hans Knutsson, Carl-Fredrik Westin,
"Improving Registration Using Multi-channel Diffeomorphic Demons Combined with Certainty Maps",
Multimodal Brain Image Analysis, First International Workshop, MBIA 2011, Lecture Notes in Computer Science,
Vol. 7012,
19-26, 2011.
Abstract The number of available imaging modalities increases both in clinical practice and in clinical studies. Even though data from multiple modalities might be available, image registration is typically only performed using data from a single modality. In this paper, we propose using certainty maps together with multi-channel diffeomorphic demons in order to improve both accuracy and robustness when performing image registration. The proposed method is evaluated using DTI data, multiple region overlap measures and a fiber bundle similarity metric.
Keywords Engineering and Technology
BIBTEX
@inproceedings{diva2:452670,
author = {Forsberg, Daniel and Rathi, Yogesh and Bouix, Sylvain and Wassermann, Demian and Knutsson, Hans and Westin, Carl-Fredrik},
title = {{Improving Registration Using Multi-channel Diffeomorphic Demons Combined with Certainty Maps}},
booktitle = {Multimodal Brain Image Analysis, First International Workshop, MBIA 2011},
year = {2011},
series = {Lecture Notes in Computer Science},
volume = {7012},
pages = {19--26},
publisher = {Springer Berlin},
address = {Heidelberg},
}
Keywords Engineering and Technology
BIBTEX
@inproceedings{diva2:452657,
author = {Lind, Leili and Klompstra, Leonie and Jaarsma, Tiny and Strömberg, Anna},
title = {{Implementation and testing of the digital pen to support patients with heart failure and their health care providers in detecting early signs of deterioration and monitor adherence - a pilot study}},
booktitle = {Heart Failure Congress 2011, 21 May 2011 - 24 May 2011 , Gothenburg -- Sweden},
year = {2011},
}
Keywords Engineering and Technology
BIBTEX
@inproceedings{diva2:452656,
author = {Lind, Leili and Klompstra, Leonie and Jaarsma, Tiny and Strömberg, Anna},
title = {{Implementation and testing of a digital pen and paper tool to support patients with heart failure and their health care providers in detecting early signs of deterioration and monitor adherence}},
booktitle = {INIC11 (The International Network of Integrated Care), March 30 - April 1, 2011 in Odense, Denmark},
year = {2011},
}
Abstract Transcranial direct current stimulation (tDCS), together with speech therapy, is known to relieve the symptoms of aphasia. Knowledge about amount of current to apply and stimulation location is needed to ensure the best result possible. Segmented tissues are used in a finite element method (FEM) simulation and by creating a mesh, information to guide the stimulation is gained. Thus, correct segmentation is crucial. Manual segmentation is known to produce the most accurate result, although it is not useful in the clinical setting since it currently takes weeks to manually segment one image volume. Automatic segmentation is faster, although both acute stroke lesions and nectrotic stroke lesions are known to cause problems. Three automatic segmentation routines are evaluated using default settings and two sets of tissue probability maps (TPMs). Two sets of stroke patients are used; one set with acute stroke lesions (which can only be seen as a change in image intensity) and one set with necrotic stroke lesions (which are cleared out and filled with cerebrospinal fluid (CSF)). The original segmentation routine in SPM8 does not produce correct segmentation result having problems with lesion and paralesional areas. Mohamed Seghier’s ALI, an automatic segmentation routine developed to handle lesions as an own tissue class, does not produce satisfactory result. The new segmentation routine in SPM8 produces the best results, especially if Chris Rorden’s (professor at The Georgia Institute of Technology) improved TPMs are used. Unfortunately, the layer of CSF is not continuous. The segmentation result can still be used in a FEM simulation, although the result from the simulatation will not be ideal. Neither of the automatic segmentation routines evaluated produce an acceptable result (see Figure 5.7) for stroke patients. Necrotic stroke lesions does not affect the segmentation result as much as the acute dito, especially if there is only a small amount of scar tissue present at the lesion site. The new segmentation routine in SPM8 has the brightest future, although changes need to be made to ensure anatomically correct segmentation results. Post-processing algorithms, relying on morphological prior constraints, can improve the segmentation result further.
Keywords automatic segmentation, manual segmentation, stroke lesions, tDCS, SPM8, aphasia patients, Engineering and Technology, Technology, Medical Informatics, 30 hp
BIBTEX
@mastersthesis{diva2:450199,
author = {Naeslund, Elin},
title = {{Stroke Lesion Segmentation for tDCS}},
school = {Linköping University},
type = {{LiTH-IMT/MI30-A-EX--11/502--SE}},
year = {2011},
address = {Sweden},
}
Abstract Canonical correlation analysis (CCA) is a statistical methodthat can be preferable to the general linear model (GLM) for analysisof functional magnetic resonance imaging (fMRI) data. There are,however, two problems with CCA based fMRI analysis. First, it is notfeasible to use a parametric approach to calculate an activity thresholdfor a certain signi cance level. Second, two covariance matrices need tobe estimated in each voxel, from a rather small number of time samples.We recently solved the rst problem by doing random permutation testson the graphics processing unit (GPU), such that the null distribution ofany maximum test statistics can be estimated in the order of minutes. Inthis paper we consider the second problem. We extend the idea of variancepooling, that previously has been used for the GLM, to covariancepooling to improve the estimates of the covariance matrices. Our GPUimplementation of random permutation tests is used to calculate signicance thresholds, which are needed to compare the di erent activitymaps in an objective way. The covariance pooling results in more robustestimates of the covariance matrices. The number of signi cantly activevoxels that are detected (thresholded at p = 0.05, corrected for multiplecomparisons) is increased with 40 - 120% (if 8 mm smoothing is appliedto the covariance estimates). Too much covariance pooling can howeverresult in a loss of small activity clusters, 7-10 mm of smoothing givesthe best results. The calculations that were made in order to generatethe results in this paper would have taken a total of about 65 days witha Matlab implementation and about 10 days with a multithreaded Cimplementation, with our multi-GPU implementation they took about 2hours. By using fast random permutation tests, suggested improvementsof existing methods for fMRI analysis can be evaluated in an objective way.
Keywords Engineering and Technology
BIBTEX
@inproceedings{diva2:446875,
author = {Eklund, Anders and Andersson, Mats and Knutsson, Hans},
title = {{Improving CCA based fMRI Analysis by Covariance Pooling - Using the GPU for Statistical Inference}},
booktitle = {Joint MICCAI Workshop on High Performance and Distributed Computing for Medical Imaging, HP-MICCAI, September 22nd, Toronto, Canada},
year = {2011},
}
Abstract Functional connectivity analysis is a way to investigate how different parts of the brain are connected and interact. A common measure of connectivity is the temporal correlation between a reference voxel time series and all the other time series in a functional MRI data set. An fMRI data set generally contains more than 20,000 within-brain voxels, making a complete correlation analysis between all possible combinations of voxels heavy to compute, store, visualize and explore. In this paper, a GPU-accelerated interactive tool for investigating functional connectivity in fMRI data is presented. A reference voxel can be moved by the user and the correlations to all other voxels are calculated in real-time using the graphics processing unit (GPU). The resulting correlation map is updated in real-time and visualized as a 3D volume rendering together with a high resolution anatomical volume. This tool greatly facilitates the search for interesting connectivity patterns in the brain.
Keywords fMRI, functional connectivity, GPU, OpenCL, MeVisLab, Engineering and Technology
BIBTEX
@inproceedings{diva2:445120,
author = {Eklund, Anders and Friman, Ola and Andersson, Mats and Knutsson, Hans},
title = {{A GPU Accelerated Interactive Interface for Exploratory Functional Connectivity Analysis of fMRI Data}},
booktitle = {Proceedings from IEEE International Conference on Image Processing (ICIP), Brussels. Belgium},
year = {2011},
pages = {1621--1624},
publisher = {IEEE},
}
Abstract A well-known approach to the design of computationally efficient filters is to use spectral factorization, i.e. a decomposition of a filter into a sequence of sub-filters. Due to the sparsity of the sub-filters, the typical processing speedup factor is within the range 1-10 in 2D, and for 3D it achieves10-100. The design of such decompositions consists in choosing the proper number of sub-filters, their individual types and sparsity. We focus here on finding optimal values of coefficients for given sequences of sparse sub-filters. It is a non-convex large scale optimization problem. The existing approaches are characterized by a lack of robustness - a very slow convergence with no guarantee of success. They are typically based on generating random initial points for further refinement with the use of local search methods. To deal with the multi-extremal nature of the original problem, we introduce a new constrained optimization problem. Its solution is then used as an initial point in the original problem for further refinement. Our approach is applicable to designing multi-dimensional filters. Its efficiency and robustness is illustrated by designing sub-filter sequences for 2D low-pass, band-pass and high-pass filters of approximately the same quality as with the use of a standard approach, but with the overall design speedup factor of several hundred.
Keywords Natural Sciences, Engineering and Technology
BIBTEX
@techreport{diva2:444274,
author = {Norell, Björn and Burdakov, Oleg and Andersson, Mats and Knutsson, Hans},
title = {{Approximate spectral factorization for design of efficient sub-filter sequences}},
institution = {Linköping University, Department of Electrical Engineering},
year = {2011},
type = {Other academic},
number = {LiTH-MAT-R, 2011:14},
address = {Sweden},
}
Abstract The Swedish National Board of Health and Welfare has been overseeing translations of the international clinical terminology SNOMED CT from English to Swedish. This study was performed to find whether semi-automatic methods of translation could produce a satisfactory translation while requiring fewer resources than manual translation. Using the medical English-Swedish dictionary TermColl translations of select subsets of SNOMED CT were produced by ways of translation memory and statistical translation. The resulting translations were evaluated via BLEU score using translations provided by the Swedish National Board of Health and Welfare as reference before being compared with each other. The results showed a strong advantage for statistical translation over use of a translation memory; however, overall translation results were far from satisfactory.
Keywords computational linguistics, medical terminology, statistical translation, translation memory, direct translation, English, Swedish, Natural Sciences, Technology, Medical Informatics, 30 hp
BIBTEX
@mastersthesis{diva2:432348,
author = {Lindgren, Anna},
title = {{Semi-Automatic Translation of Medical Terms from English to Swedish:
SNOMED CT in Translation}},
school = {Linköping University},
type = {{LiTH-IMT/MI30-A-EX--11/501--SE}},
year = {2011},
address = {Sweden},
}
Abstract Parametric statistical methods, such as Z-, t-, and F-values are traditionally employed in functional magnetic resonance imaging (fMRI) for identifying areas in the brain that are active with a certain degree of statistical significance. These parametric methods, however, have two major drawbacks. First, it is assumed that the observed data are Gaussian distributed and independent; assumptions that generally are not valid for fMRI data. Second, the statistical test distribution can be derived theoretically only for very simple linear detection statistics. With non-parametric statistical methods, the two limitations described above can be overcome. The major drawback of non-parametric methods is the computational burden with processing times ranging from hours to days, which so far have made them impractical for routine use in single subject fMRI analysis. In this work, it is shown how the computational power of cost-efficient Graphics Processing Units (GPUs) can be used to speed up random permutation tests. A test with 10 000 permutations takes less than a minute, making statistical analysis of advanced detection methods in fMRI practically feasible. To exemplify the permutation based approach, brain activity maps generated by the General Linear Model (GLM) and Canonical Correlation Analysis (CCA) are compared at the same significance level. During the development of the routines and writing of the paper, 3-4 years of processing time has been saved by using the GPU.
Keywords Functional magnetic resonance imaging (fMRI), Graphics processing unit (GPU), Non-parametric statistics, random permutation test, CUDA, General Linear Model (GLM), Canonical Correlation Analysis (CCA), Engineering and Technology
BIBTEX
@article{diva2:431031,
author = {Eklund, Anders and Andersson, Mats and Knutsson, Hans},
title = {{Fast Random Permutation Tests Enable Objective Evaluation of Methods for Single Subject fMRI Analysis}},
journal = {International Journal of Biomedical Imaging},
year = {2011},
}
Abstract The use of image denoising techniques is an important part of many medical imaging applications. One common application isto improve the image quality of low-dose, i.e. noisy, computed tomography (CT) data. The medical imaging domain has seen atremendous development during the last decades. It is now possible to collect time resolved volumes, i.e. 4D data, with a number ofmodalities (e.g. ultrasound (US), CT, magnetic resonance imaging (MRI)). While 3D image denoising previously has been appliedto several volumes independently, there has not been much work done on true 4D image denoising, where the algorithm considersseveral volumes at the same time (and not a single volume at a time). By using all the dimensions, it is for example possibleto remove some of the time varying reconstruction artefacts that exist in CT volumes. The problem with 4D image denoising,compared to 2D and 3D denoising, is that the computational complexity increases exponentially.In this paper we describe a novel algorithm for true 4D image denoising, based on local adaptive filtering, and how to implementit on the graphics processing unit (GPU). The algorithm was applied to a 4D CT heart dataset of the resolution 512 x 512 x 445 x 20.The result is that the GPU can complete the denoising in about 25 minutes if spatial filtering is used and in about 8 minutes if FFTbased filtering is used. The CPU implementation requires several days of processing time for spatial filtering and about 50 minutesfor FFT based filtering. Fast spatial filtering makes it possible to apply the denoising algorithm to larger datasets (compared to ifFFT based filtering is used). The short processing time increases the clinical value of true 4D image denoising significantly.
Keywords Image denoising, Graphics processing unit (GPU), 4D, Computed tomography (CT), Engineering and Technology
BIBTEX
@article{diva2:430974,
author = {Eklund, Anders and Andersson, Mats and Knutsson, Hans},
title = {{True 4D Image Denoising on the GPU}},
journal = {International Journal of Biomedical Imaging},
year = {2011},
volume = {2011},
}
Anders Eklund, Daniel Forsberg, Mats Andersson, Hans Knutsson,
"Using the Local Phase of the Magnitude of the Local Structure Tensor for Image Registration",
17th Scandinavian Conference, SCIA 2011, Ystad, Sweden, May 2011. Proceedings, Lecture Notes in Computer Science,
Vol. 6688,
414-432, 2011.
Abstract The need of image registration is increasing, especially in the medical image domain. The simplest kind of image registration is to match two images that have similar intensity. More advanced cases include the problem of registering images of different intensity, for which phase based algorithms have proven to be superior. In some cases the phase based registration will fail as well, for instance when the images to be registered do not only differ in intensity but also in local phase. This is the case if a dark circle in the reference image is a bright circle in the source image. While rigid registration algorithms can use other parts of the image to calculate the global transformation, this problem is harder to solve for non-rigid registration. The solution that we propose in this work is to use the local phase of the magnitude of the local structure tensor, instead of the local phase of the image intensity. By doing this, we achieve invariance both to the image intensity and to the local phase and thereby only use the structural information, i.e. the shapes of the objects, for registration.
Keywords Engineering and Technology
BIBTEX
@inproceedings{diva2:424674,
author = {Eklund, Anders and Forsberg, Daniel and Andersson, Mats and Knutsson, Hans},
title = {{Using the Local Phase of the Magnitude of the Local Structure Tensor for Image Registration}},
booktitle = {17th Scandinavian Conference, SCIA 2011, Ystad, Sweden, May 2011. Proceedings},
year = {2011},
series = {Lecture Notes in Computer Science},
volume = {6688},
pages = {414--432},
publisher = {Springer},
}
Abstract Classification of trabecular bone aims at discriminating different types of trabeculae. This paper proposes a method to perform a soft classification from binary 3D images. In a first step, the local structure tensor is used to estimate a membership degree of every voxel to three different classes, plate-, rod- and junction-like trabeculae. In a second step, the global structure tensor of plate-like trabeculae is compared with the local orientation of rod-like trabeculae in order to discriminate aligned from non-aligned rods. Results show that soft classification can be used for estimating independent parameters of trabecular bone for every different class, by using the classification as a weighting function.
Keywords Biomedical image analysis, trabecular bone, classification of tissue, structure tensor, micro computed tomography, Natural Sciences, Medical and Health Sciences
BIBTEX
@inproceedings{diva2:413646,
author = {Moreno, Rodrigo and Borga, Magnus and Smedby, Örjan},
title = {{Soft Classification of trabeculae in Trabecular Bone}},
booktitle = {2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro},
year = {2011},
pages = {1641--1644},
publisher = {IEEE},
}
Thobias Romu, Olof Dahlqvist Leinhard, Mikael Forsgren, Sven Almer, Nils Dahlström, Stergios Kechagias, Fredrik Nyström, Örjan Smedby, Peter Lundberg, Magnus Borga,
"Fat Water Classification of Symmetrically Sampled Two-Point Dixon Images Using Biased Partial Volume Effects",
Proceedings of the annual meeting of the International Society for Magnetic Resonance in Medicine (ISMRM 2011), 2011.,
2011.
Keywords Engineering and Technology, Natural Sciences, Medical and Health Sciences
BIBTEX
@inproceedings{diva2:413659,
author = {Romu, Thobias and Dahlqvist Leinhard, Olof and Forsgren, Mikael and Almer, Sven and Dahlström, Nils and Kechagias, Stergios and Nyström, Fredrik and Smedby, Örjan and Lundberg, Peter and Borga, Magnus},
title = {{Fat Water Classification of Symmetrically Sampled Two-Point Dixon Images Using Biased Partial Volume Effects}},
booktitle = {Proceedings of the annual meeting of the International Society for Magnetic Resonance in Medicine (ISMRM 2011), 2011.},
year = {2011},
}
Abstract It is possible to correct intensity inhomogeneity in fat–water Magnetic Resonance Imaging (MRI) by estimating a bias field based on the observed intensities of voxels classified as the pure adipose tissue. The same procedure can also be used to quantify fat volume and its distribution which opens up for new medical applications. The bias field estimation method has to be robust since pure fat voxels are irregularly located and the density varies greatly within and between image volumes. This paper introduces Multi scale Adaptive Normalized Average (MANA) that solves this problem bybasing the estimate on a scale space of weighted averages. By usingthe local certainty of the data MANA preserves details where the local data certainty is high and provides realistic values in sparse areas.
Keywords Engineering and Technology, Natural Sciences, Medical and Health Sciences
BIBTEX
@inproceedings{diva2:413635,
author = {Romu, Thobias and Borga, Magnus and Dahlqvist Leinhard, Olof},
title = {{MANA -- Multi Scale Adative Normalized Averaging}},
booktitle = {2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro},
year = {2011},
pages = {361--364},
}
Anna Adelöf, Christina Lindberg, Lotti Barlow, Ulla Gerdin, Kristina Bränd Persson, Erika Ericsson, Stefano Testi, Mikael Nyström,
"Förvaltning av SNOMED CT som en del i det nationella fackspråket för vård och omsorg",
-,
2011.
Abstract Förvaltningsrapporten fokuserar på Snomed CT, eftersom det redan i dag finns rutiner för förvaltningar av termbanken och nationella hälsorelaterade klassifikationer. Ett särskilt utvecklingsarbete kommer att krävas för dessa delar. Rapporten tar upp syfte och mål med förvaltningen. Utöver det redogör rapporten för vilka konkreta ansvarsområden som ingår i förvaltningen av Snomed CT. Målet för förvaltningen är att Socialstyrelsen regelbundet ska kunna tillhandahålla en kontrollerad och uppdaterad release av Snomed CT. Det skulle möjliggöra användning inom vård och omsorg. Rapporten tar även upp behovet av kompetens, utbildning och finansiella resurser.
Keywords Medical and Health Sciences, Natural Sciences
BIBTEX
@techreport{diva2:407891,
author = {Adelöf, Anna and Lindberg, Christina and Barlow, Lotti and Gerdin, Ulla and Bränd Persson, Kristina and Ericsson, Erika and Testi, Stefano and Nyström, Mikael},
title = {{Förvaltning av SNOMED CT som en del i det nationella fackspråket för vård och omsorg}},
institution = {Linköping University, Department of Electrical Engineering},
year = {2011},
type = {Other (popular science, discussion, etc.)},
number = {, },
address = {Sweden},
}
Lotti Barlow, Ulla Gerdin, Ann-Helene Almborg, Bengt Kron, Christina Lindberg, Kristina Bränd Persson, Karin Ahlzén, Erika Ericsson, Anna Adelöf, Daniel Karlsson, Lisa Wolff Foster, Lena Widigson, Maria Bratt, Stefano Testi, Anna Staerner Steen, Mikael Nyström,
"Nationellt fackspråk förvård och omsorg: Slutrapport",
-,
2011.
Abstract SammanfattningEtt tillgängligt och använt nationellt fackspråk ska bidra till en god och säker vård och omsorg. Det ska även medverka till att kvaliteten och resultaten på området ska kunna följas upp och jämföras på ett mer effektivt sätt. Slutrapporten presenterar resultatet av projektet Nationellt fackspråk för vård och omsorg samt förslag till förvaltning och utveckling. ResultatetResultatet innefattar bland annat att det internationella begreppssystemet Snomed CT är översatt till svenska och att det är förberett för förvaltning och distribution. Socialstyrelsen har även tagit fram och testat metoder för förvaltning och utveckling av det nationella fackspråket i sin helhet. Därtill har representanter för målgrupperna informerats och fått kunskap. Rapporten innehåller en utförlig beskrivning av det nationella fackspråkets sammantagna innehåll: Socialstyrelsens termbank, klassifikationer och kodverk, den svenska versionen av Snomed CT, metoder för utveckling och förvaltning samt regler för användning. Förvaltning, införande och resursbehovI rapporten finns förslag till hur hela det nationella fackspråket kan tas omhand av Socialstyrelsen och hur det kan införas i vården och omsorgen. Projektets övergång till en långsiktigt hållbar organisation kräver resurser. Därför redogör rapporten för det förväntade resursbehovet för förvaltning och utveckling. Bland annat föreslås en treårig utbildningsinsats samt stimulansbidrag för införande. Krav på styrning, samordning och förtydligat ansvarRapporten betonar behovet av en samlad och medveten styrning av utvecklingen inom området. Socialstyrelsen vill ha en samordnande roll i utvecklingen och förvaltningen av det nationella fackspråket. Myndigheten föreslås få det initiala ansvaret för att utbilda användare och att driva frågor om det nationella fackspråket. Vidare vill Socialstyrelsen få ett uttalat mandat att samordna de nationella aktiviteter som drivs med koppling till Snomed CT. Rapporten pekar ut några särskilt prioriterade områden som myndigheten borde få i uppdrag att arbeta vidare inom. Kunskapsstyrning och normgivningEn viktig slutsats i rapporten är att användningen av det nationella fackspråket behöver regleras för att målet om ökad säkerhet för klienter och patienter ska kunna uppnås. I dagsläget bedöms föreskrifter vara den metod som bäst kan garantera ett brett genomförande. Målgrupper för slutrapportenSlutrapporten riktar sig till beslutsfattare i kommuner och landsting, vård- och omsorgspersonal med särskilt intresse eller ansvar för dokumentationsfrågor och professionella organisationer. Den riktar sig också till terminologiansvariga i kommuner och landsting, IT-direktörer, IT-leverantörer samt aktörer inom den nationella strategin för eHälsa.
Keywords Medical and Health Sciences, Natural Sciences
BIBTEX
@techreport{diva2:407884,
author = {Barlow, Lotti and Gerdin, Ulla and Almborg, Ann-Helene and Kron, Bengt and Lindberg, Christina and Bränd Persson, Kristina and Ahlz\'{e}n, Karin and Ericsson, Erika and Adelöf, Anna and Karlsson, Daniel and Wolff Foster, Lisa and Widigson, Lena and Bratt, Maria and Testi, Stefano and Staerner Steen, Anna and Nyström, Mikael},
title = {{Nationellt fackspråk förvård och omsorg:
Slutrapport}},
institution = {Linköping University, Department of Electrical Engineering},
year = {2011},
type = {Other (popular science, discussion, etc.)},
number = {, },
address = {Sweden},
}
Abstract MRI can measure several important hemodynamic parameters but might not yet have reached its full potential. The most common MRI method for the assessment of flow is phase-contrast MRI velocity mapping that estimates the mean velocity of a voxel. This estimation is precise only when the intravoxel velocity distribution is symmetric. The mean velocity corresponds to the first raw moment of the intravoxel velocity distribution. Here, a generalized MRI framework for the quantification of any moment of arbitrary velocity distributions is described. This framework is based on the fact that moments in the function domain (velocity space) correspond to differentials in the Fourier transform domain (k(v)-space). For proof-of-concept, moments of realistic velocity distributions were estimated using finite difference approximations of the derivatives of the MRI signal. In addition, the framework was applied to investigate the symmetry assumption underlying phase-contrast MRI velocity mapping; we found that this assumption can substantially affect phase-contrast MRI velocity estimates and that its significance can be reduced by increasing the velocity encoding range.
Keywords phase-contrast magnetic resonance imaging, blood flow velocity, turbulent flow, cardiovascular physiology, Fourier transform, moments, Medical and Health Sciences
BIBTEX
@article{diva2:405319,
author = {Dyverfeldt, Petter and Sigfridsson, Andreas and Knutsson, Hans and Ebbers, Tino},
title = {{A Novel MRI Framework for the Quantification of Any Moment of Arbitrary Velocity Distributions}},
journal = {MAGNETIC RESONANCE IN MEDICINE},
year = {2011},
volume = {65},
number = {3},
pages = {725--731},
}
Abstract Parametric statistical methods are traditionally employed in functional magnetic resonance imaging (fMRI) for identifying areas in the brain that are active with a certain degree of statistical significance. These parametric methods, however, have two major drawbacks. First, it isassumed that the observed data are Gaussian distributed and independent; assumptions that generally are not valid for fMRI data. Second, the statistical test distribution can be derived theoretically only for very simple linear detection statistics. In this work it is shown how the computational power of the Graphics Processing Unit (GPU) can be used to speedup non-parametric tests, such as random permutation tests. With random permutation tests it is possible to calculate significance thresholds for any test statistics. As an example, fMRI activity maps from the General Linear Model (GLM) and Canonical Correlation Analysis (CCA) are compared at the same significance level.
Keywords Engineering and Technology
BIBTEX
@inproceedings{diva2:402372,
author = {Eklund, Anders and Friman, Ola and Andersson, Mats and Knutsson, Hans},
title = {{Comparing fMRI Activity Maps from GLM and CCA at the Same Significance Level by Fast Random Permutation Tests on the GPU}},
booktitle = {SSBA Symposium on Image Analysis, March 17-18, Linköping, Sweden},
year = {2011},
publisher = {Linköping University Electronic Press},
address = {Linköping},
}
Andreas Sigfridsson, Henrik Haraldsson, Tino Ebbers, Hans Knutsson, Hajime Sakuma,
"In-vivo SNR in DENSE MRI: temporal and regional effects of field strength, receiver coil sensitivity, and flip angle strategies",
Magnetic Resonance Imaging,
29(2):
202-208, 2011.
Abstract Aim: The influences on the SNR of DENSE MRI of field strength, receiver coil sensitivity and choice of flip angle strategy have been previously investigated individually. In this study, all of these parameters have been investigated in the same setting, and a mutual comparison of their impact on SNR is presented. Materials and methods: Ten healthy volunteers were imaged in a 1.5T and a 3T MRI system, using standard 5 or 6 channel cardiac coils as well as 32 channel coils, with four different excitation patterns. Variation of spatial coil sensitivity was assessed by regional SNR analysis. Results: SNR ranging from 2.8 to 30.5 was found depending on the combination of excitation patterns, coil sensitivity and field strength. The SNR at 3T was 53 ± 26% higher than at 1.5T (p<0.001), whereas spatial differences of 59 ± 26% were found in the ventricle (p<0.001). 32 channel coils provided 52 ± 29% higher SNR compared to standard 5 or 6 channel coils (p<0.001). A fixed flip angle strategy provided an excess of 50% higher SNR in half of the imaged cardiac cycle compared to a sweeping flip angle strategy, and a single phase acquisition provided a six-fold increase of SNR compared to a cine acquisition. Conclusion: The effect of field strength and receiver coil sensitivity influences the SNR with the same order of magnitude, whereas flip angle strategy can have a larger effect on SNR. Thus, careful choice of imaging hardware in combination with adaptation of the acquisition protocol is crucial in order to realize sufficient SNR in DENSE MRI.
Keywords DENSE, strain, SNR, flip angle, coil sensitivity, Engineering and Technology
BIBTEX
@article{diva2:278377,
author = {Sigfridsson, Andreas and Haraldsson, Henrik and Ebbers, Tino and Knutsson, Hans and Sakuma, Hajime},
title = {{\emph{In-vivo} SNR in DENSE MRI:
temporal and regional effects of field strength, receiver coil sensitivity, and flip angle strategies}},
journal = {Magnetic Resonance Imaging},
year = {2011},
volume = {29},
number = {2},
pages = {202--208},
}
2010
Abstract We present a method for fast phase based registration of volume data for medical applications. As the number of different modalities within medical imaging increases, it becomes more and more important with registration that works for a mixture of modalities. For these applications the phase based registration approach has proven to be superior. Today there seem to be two kinds of groups that work with medical image registration, one that works with refining of the registration algorithms and one that works with implementation of more simple algorithms on graphic cards for speeding up the algorithms. We put the work from these groups together and get the best from both worlds. We achieve a speedup of 10-30 compared to our CPU implementation, which makes fast phase based registration possible for large medical volumes.
Keywords Engineering and Technology
BIBTEX
@inproceedings{diva2:398658,
author = {Eklund, Anders and Andersson, Mats and Warntjes, Marcel and Knutsson, Hans},
title = {{Phase Based Volume Registration on the GPU with Application to Quantitative MRI}},
booktitle = {SSBA Symposium on Image Analysis, March 11-12, Uppsala, Sweden},
year = {2010},
}
|