Search

Detailed analysis of spinal deformity is important within orthopaedic healthcare, in particular for assessment of idiopathic scoliosis. This paper addresses this challenge by proposing an image analysis method, capable of providing a full three-dimensional spine characterization. The proposed method is based on the registration of a highly detailed spine model to image data from computed tomography. The registration process provides an accurate segmentation of each individual vertebra and the ability to derive various measures describing the spinal deformity. The derived measures are estimated from landmarks attached to the spine model and transferred to the patient data according to the registration result. Evaluation of the method provides an average point-to-surface error of 0.9 mm ± 0.9 (comparing segmentations), and an average target registration error of 2.3 mm ± 1.7 (comparing landmarks). Comparing automatic and manual measurements of axial vertebral rotation provides a mean absolute difference of 2.5° ± 1.8, which is on a par with other computerized methods for assessing axial vertebral rotation. A significant advantage of our method, compared to other computerized methods for rotational measurements, is that it does not rely on vertebral symmetry for computing the rotational measures. The proposed method is fully automatic and computationally efficient, only requiring three to four minutes to process an entire image volume covering vertebrae L5 to T1. Given the use of landmarks, the method can be readily adapted to estimate other measures describing a spinal deformity by changing the set of employed landmarks. In addition, the method has the potential to be utilized for accurate segmentations of the vertebrae in routine computed tomography examinations, given the relatively low point-to-surface error.

Detailed analysis of spinal deformity is important within orthopaedic healthcare, in particular for assessment of idiopathic scoliosis. This paper addresses this challenge by proposing an image analysis method, capable of providing a full three-dimensional spine characterization. The proposed method is based on the registration of a highly detailed spine model to image data from computed tomography. The registration process provides an accurate segmentation of each individual vertebra and the ability to derive various measures describing the spinal deformity. The derived measures are estimated from landmarks attached to the spine model and transferred to the patient data according to the registration result. Evaluation of the method provides an average point-to-surface error of 0.9 mm ± 0.9 (comparing segmentations), and an average target registration error of 2.3 mm ± 1.7 (comparing landmarks). Comparing automatic and manual measurements of axial vertebral rotation provides a mean absolute difference of 2.5° ± 1.8, which is on a par with other computerized methods for assessing axial vertebral rotation. A significant advantage of our method, compared to other computerized methods for rotational measurements, is that it does not rely on vertebral symmetry for computing the rotational measures. The proposed method is fully automatic and computationally efficient, only requiring three to four minutes to process an entire image volume covering vertebrae L5 to T1. Given the use of landmarks, the method can be readily adapted to estimate other measures describing a spinal deformity by changing the set of employed landmarks. In addition, the method has the potential to be utilized for accurate segmentations of the vertebrae in routine computed tomography examinations, given the relatively low point-to-surface error.

Detailed analysis of spinal deformity is important within orthopaedic healthcare, in particular for assessment of idiopathic scoliosis. This paper addresses this challenge by proposing an image analysis method, capable of providing a full three-dimensional spine characterization. The proposed method is based on the registration of a highly detailed spine model to image data from computed tomography. The registration process provides an accurate segmentation of each individual vertebra and the ability to derive various measures describing the spinal deformity. The derived measures are estimated from landmarks attached to the spine model and transferred to the patient data according to the registration result. Evaluation of the method provides an average point-to-surface error of 0.9 mm ± 0.9 (comparing segmentations), and an average target registration error of 2.3 mm ± 1.7 (comparing landmarks). Comparing automatic and manual measurements of axial vertebral rotation provides a mean absolute difference of 2.5° ± 1.8, which is on a par with other computerized methods for assessing axial vertebral rotation. A significant advantage of our method, compared to other computerized methods for rotational measurements, is that it does not rely on vertebral symmetry for computing the rotational measures. The proposed method is fully automatic and computationally efficient, only requiring three to four minutes to process an entire image volume covering vertebrae L5 to T1. Given the use of landmarks, the method can be readily adapted to estimate other measures describing a spinal deformity by changing the set of employed landmarks. In addition, the method has the potential to be utilized for accurate segmentations of the vertebrae in routine computed tomography examinations, given the relatively low point-to-surface error.

Detailed analysis of spinal deformity is important within orthopaedic healthcare, in particular for assessment of idiopathic scoliosis. This paper addresses this challenge by proposing an image analysis method, capable of providing a full three-dimensional spine characterization. The proposed method is based on the registration of a highly detailed spine model to image data from computed tomography. The registration process provides an accurate segmentation of each individual vertebra and the ability to derive various measures describing the spinal deformity. The derived measures are estimated from landmarks attached to the spine model and transferred to the patient data according to the registration result. Evaluation of the method provides an average point-to-surface error of 0.9 mm ± 0.9 (comparing segmentations), and an average target registration error of 2.3 mm ± 1.7 (comparing landmarks). Comparing automatic and manual measurements of axial vertebral rotation provides a mean absolute difference of 2.5° ± 1.8, which is on a par with other computerized methods for assessing axial vertebral rotation. A significant advantage of our method, compared to other computerized methods for rotational measurements, is that it does not rely on vertebral symmetry for computing the rotational measures. The proposed method is fully automatic and computationally efficient, only requiring three to four minutes to process an entire image volume covering vertebrae L5 to T1. Given the use of landmarks, the method can be readily adapted to estimate other measures describing a spinal deformity by changing the set of employed landmarks. In addition, the method has the potential to be utilized for accurate segmentations of the vertebrae in routine computed tomography examinations, given the relatively low point-to-surface error.

Detailed analysis of spinal deformity is important within orthopaedic healthcare, in particular for assessment of idiopathic scoliosis. This paper addresses this challenge by proposing an image analysis method, capable of providing a full three-dimensional spine characterization. The proposed method is based on the registration of a highly detailed spine model to image data from computed tomography. The registration process provides an accurate segmentation of each individual vertebra and the ability to derive various measures describing the spinal deformity. The derived measures are estimated from landmarks attached to the spine model and transferred to the patient data according to the registration result. Evaluation of the method provides an average point-to-surface error of 0.9 mm ± 0.9 (comparing segmentations), and an average target registration error of 2.3 mm ± 1.7 (comparing landmarks). Comparing automatic and manual measurements of axial vertebral rotation provides a mean absolute difference of 2.5° ± 1.8, which is on a par with other computerized methods for assessing axial vertebral rotation. A significant advantage of our method, compared to other computerized methods for rotational measurements, is that it does not rely on vertebral symmetry for computing the rotational measures. The proposed method is fully automatic and computationally efficient, only requiring three to four minutes to process an entire image volume covering vertebrae L5 to T1. Given the use of landmarks, the method can be readily adapted to estimate other measures describing a spinal deformity by changing the set of employed landmarks. In addition, the method has the potential to be utilized for accurate segmentations of the vertebrae in routine computed tomography examinations, given the relatively low point-to-surface error.

Reliable measurements of spinal deformities in idiopathic scoliosis are vital, since they are used for assessing the degree of scoliosis, deciding upon treatment and monitoring the progression of the disease. However, commonly used two dimensional methods (e.g. the Cobb angle) do not fully capture the three dimensional deformity at hand in scoliosis, of which axial vertebral rotation (AVR) is considered to be of great importance. There are manual methods for measuring the AVR, but they are often time-consuming and related with a high intra- and inter-observer variability. In this paper, we present a fully automatic method for estimating the AVR in images from computed tomography. The proposed method is evaluated on four scoliotic patients with 17 vertebrae each and compared with manual measurements performed by three observers using the standard method by Aaro-Dahlborn. The comparison shows that the difference in measured AVR between automatic and manual measurements are on the same level as the inter-observer difference. This is further supported by a high intraclass correlation coefficient (0.971-0.979), obtained when comparing the automatic measurements with the manual measurements of each observer. Hence, the provided results and the computational performance, only requiring approximately 10 to 15Â s for processing an entire volume, demonstrate the potential clinical value of the proposed method.

Reliable measurements of spinal deformities in idiopathic scoliosis are vital, since they are used for assessing the degree of scoliosis, deciding upon treatment and monitoring the progression of the disease. However, commonly used two dimensional methods (e.g. the Cobb angle) do not fully capture the three dimensional deformity at hand in scoliosis, of which axial vertebral rotation (AVR) is considered to be of great importance. There are manual methods for measuring the AVR, but they are often time-consuming and related with a high intra- and inter-observer variability. In this paper, we present a fully automatic method for estimating the AVR in images from computed tomography. The proposed method is evaluated on four scoliotic patients with 17 vertebrae each and compared with manual measurements performed by three observers using the standard method by Aaro-Dahlborn. The comparison shows that the difference in measured AVR between automatic and manual measurements are on the same level as the inter-observer difference. This is further supported by a high intraclass correlation coefficient (0.971-0.979), obtained when comparing the automatic measurements with the manual measurements of each observer. Hence, the provided results and the computational performance, only requiring approximately 10 to 15Â s for processing an entire volume, demonstrate the potential clinical value of the proposed method.

Reliable measurements of spinal deformities in idiopathic scoliosis are vital, since they are used for assessing the degree of scoliosis, deciding upon treatment and monitoring the progression of the disease. However, commonly used two dimensional methods (e.g. the Cobb angle) do not fully capture the three dimensional deformity at hand in scoliosis, of which axial vertebral rotation (AVR) is considered to be of great importance. There are manual methods for measuring the AVR, but they are often time-consuming and related with a high intra- and inter-observer variability. In this paper, we present a fully automatic method for estimating the AVR in images from computed tomography. The proposed method is evaluated on four scoliotic patients with 17 vertebrae each and compared with manual measurements performed by three observers using the standard method by Aaro-Dahlborn. The comparison shows that the difference in measured AVR between automatic and manual measurements are on the same level as the inter-observer difference. This is further supported by a high intraclass correlation coefficient (0.971-0.979), obtained when comparing the automatic measurements with the manual measurements of each observer. Hence, the provided results and the computational performance, only requiring approximately 10 to 15Â s for processing an entire volume, demonstrate the potential clinical value of the proposed method.

Reliable measurements of spinal deformities in idiopathic scoliosis are vital, since they are used for assessing the degree of scoliosis, deciding upon treatment and monitoring the progression of the disease. However, commonly used two dimensional methods (e.g. the Cobb angle) do not fully capture the three dimensional deformity at hand in scoliosis, of which axial vertebral rotation (AVR) is considered to be of great importance. There are manual methods for measuring the AVR, but they are often time-consuming and related with a high intra- and inter-observer variability. In this paper, we present a fully automatic method for estimating the AVR in images from computed tomography. The proposed method is evaluated on four scoliotic patients with 17 vertebrae each and compared with manual measurements performed by three observers using the standard method by Aaro-Dahlborn. The comparison shows that the difference in measured AVR between automatic and manual measurements are on the same level as the inter-observer difference. This is further supported by a high intraclass correlation coefficient (0.971-0.979), obtained when comparing the automatic measurements with the manual measurements of each observer. Hence, the provided results and the computational performance, only requiring approximately 10 to 15Â s for processing an entire volume, demonstrate the potential clinical value of the proposed method.

Reliable measurements of spinal deformities in idiopathic scoliosis are vital, since they are used for assessing the degree of scoliosis, deciding upon treatment and monitoring the progression of the disease. However, commonly used two dimensional methods (e.g. the Cobb angle) do not fully capture the three dimensional deformity at hand in scoliosis, of which axial vertebral rotation (AVR) is considered to be of great importance. There are manual methods for measuring the AVR, but they are often time-consuming and related with a high intra- and inter-observer variability. In this paper, we present a fully automatic method for estimating the AVR in images from computed tomography. The proposed method is evaluated on four scoliotic patients with 17 vertebrae each and compared with manual measurements performed by three observers using the standard method by Aaro-Dahlborn. The comparison shows that the difference in measured AVR between automatic and manual measurements are on the same level as the inter-observer difference. This is further supported by a high intraclass correlation coefficient (0.971-0.979), obtained when comparing the automatic measurements with the manual measurements of each observer. Hence, the provided results and the computational performance, only requiring approximately 10 to 15Â s for processing an entire volume, demonstrate the potential clinical value of the proposed method.

In this paper, we propose a novel algorithm for regularizing displacement fields in image registration. The method uses the local structure tensor and gradients of the displacement field to impose a local metric, which is then used optimizing a global cost function. The method allows for linear operators, such as tensors and differential operators modeling the underlying physical anatomy of the human body in medical images. The algorithm is tested using output from the Morphon image registration algorithm on MRI data as well as synthetic test data and the result is compared to the initial displacement field. The results clearly demonstrate the power of the method and the unique features brought forth through the global optimization approach., Dynamic Context Atlases for Image Denoising and Patient Safety

The use of polynomial expansion in image registration has previously been shown to be beneficial due to fast convergence and high accuracy. However, earlier work has only briefly out-lined how non-rigid image registration is handled, e.g. not discussing issues like regularization of the displacement field or how to accumulate the displacement field. In this work, it is shown how non-rigid image registration based upon polynomial expansion can be integrated into a generic framework for non-rigid image registration achieving diffeomorphic displacement fields. The proposed non-rigid image registration algorithm using diffeomorphic field accumulation has been evaluated on both synthetically deformed data and real image data and compared to traditional field accumulation. The results clearly demonstrate the power of the diffeomorphic field accumulation.

The use of polynomial expansion in image registration has previously been shown to be beneficial due to fast convergence and high accuracy. However, earlier work has only briefly out-lined how non-rigid image registration is handled, e.g. not discussing issues like regularization of the displacement field or how to accumulate the displacement field. In this work, it is shown how non-rigid image registration based upon polynomial expansion can be integrated into a generic framework for non-rigid image registration achieving diffeomorphic displacement fields. The proposed non-rigid image registration algorithm using diffeomorphic field accumulation has been evaluated on both synthetically deformed data and real image data and compared to traditional field accumulation. The results clearly demonstrate the power of the diffeomorphic field accumulation.

In this paper, we propose a novel algorithm for regularizing displacement fields in image registration. The method uses the local structure tensor and gradients of the displacement field to impose a local metric, which is then used optimizing a global cost function. The method allows for linear operators, such as tensors and differential operators modeling the underlying physical anatomy of the human body in medical images. The algorithm is tested using output from the Morphon image registration algorithm on MRI data as well as synthetic test data and the result is compared to the initial displacement field. The results clearly demonstrate the power of the method and the unique features brought forth through the global optimization approach., Dynamic Context Atlases for Image Denoising and Patient Safety

The use of polynomial expansion in image registration has previously been shown to be beneficial due to fast convergence and high accuracy. However, earlier work has only briefly out-lined how non-rigid image registration is handled, e.g. not discussing issues like regularization of the displacement field or how to accumulate the displacement field. In this work, it is shown how non-rigid image registration based upon polynomial expansion can be integrated into a generic framework for non-rigid image registration achieving diffeomorphic displacement fields. The proposed non-rigid image registration algorithm using diffeomorphic field accumulation has been evaluated on both synthetically deformed data and real image data and compared to traditional field accumulation. The results clearly demonstrate the power of the diffeomorphic field accumulation.

The use of polynomial expansion in image registration has previously been shown to be beneficial due to fast convergence and high accuracy. However, earlier work has only briefly out-lined how non-rigid image registration is handled, e.g. not discussing issues like regularization of the displacement field or how to accumulate the displacement field. In this work, it is shown how non-rigid image registration based upon polynomial expansion can be integrated into a generic framework for non-rigid image registration achieving diffeomorphic displacement fields. The proposed non-rigid image registration algorithm using diffeomorphic field accumulation has been evaluated on both synthetically deformed data and real image data and compared to traditional field accumulation. The results clearly demonstrate the power of the diffeomorphic field accumulation.

In this paper, we propose a novel algorithm for regularizing displacement fields in image registration. The method uses the local structure tensor and gradients of the displacement field to impose a local metric, which is then used optimizing a global cost function. The method allows for linear operators, such as tensors and differential operators modeling the underlying physical anatomy of the human body in medical images. The algorithm is tested using output from the Morphon image registration algorithm on MRI data as well as synthetic test data and the result is compared to the initial displacement field. The results clearly demonstrate the power of the method and the unique features brought forth through the global optimization approach., Dynamic Context Atlases for Image Denoising and Patient Safety

In this paper, we propose a novel algorithm for regularizing displacement fields in image registration. The method uses the local structure tensor and gradients of the displacement field to impose a local metric, which is then used optimizing a global cost function. The method allows for linear operators, such as tensors and differential operators modeling the underlying physical anatomy of the human body in medical images. The algorithm is tested using output from the Morphon image registration algorithm on MRI data as well as synthetic test data and the result is compared to the initial displacement field. The results clearly demonstrate the power of the method and the unique features brought forth through the global optimization approach., Dynamic Context Atlases for Image Denoising and Patient Safety

Image registration is frequently used within the medical image domain and where methods with high performance are required. The need for high accuracy coupled with high speed is especially important for applications such as adaptive radiation therapy and image-guided surgery. During the last years, a number of significant projects have been introduced to make the computational power of GPUs available to a wider audience. The most well known project is the introduction of CUDA (Compute Unified Device Architecture). In this paper, we present a CUDA based GPU implementation of a non-rigid image registration algorithm, known as the Morphon, and compare it with a CPU implementation of the Morphon. The achieved speedup, in the range of 51-54x, is also compared with speedups reported from other non-rigid registration methods mplemented on the GPU. These include the Demons algorithm and a mutual information based algorithm.

Image registration is a well-known concept within the medical image domain and has been shown to be useful in a number of dierent tasks. However, due to sometimes long processing times, image registration is not fully utilized in clinical workows, where time is an important factor. During the last couple of years, a number of signicant projects have been introduced to make the computational power of GPUs available to a wider audience, where the most well known is CUDA. In this paper we present, with the aid of CUDA, a speedup in the range of 38-44x (from 29 minutes to 40 seconds) when implementing a phasebased non-rigid image registration algorithm, known as the Morphon, on a single GPU. The achieved speedup is in the same magnitude as the speedups reported from other non-rigid registration algorithms fully ported to the GPU. Given the impressive speedups, both reported in this paper and other papers, we therefore consider that it is now feasible to eectively integrate image registration into various clinical workows, where time is a critical factor.

Image registration is frequently used within the medical image domain and where methods with high performance are required. The need for high accuracy coupled with high speed is especially important for applications such as adaptive radiation therapy and image-guided surgery. During the last years, a number of significant projects have been introduced to make the computational power of GPUs available to a wider audience. The most well known project is the introduction of CUDA (Compute Unified Device Architecture). In this paper, we present a CUDA based GPU implementation of a non-rigid image registration algorithm, known as the Morphon, and compare it with a CPU implementation of the Morphon. The achieved speedup, in the range of 51-54x, is also compared with speedups reported from other non-rigid registration methods mplemented on the GPU. These include the Demons algorithm and a mutual information based algorithm.

Image registration is a well-known concept within the medical image domain and has been shown to be useful in a number of dierent tasks. However, due to sometimes long processing times, image registration is not fully utilized in clinical workows, where time is an important factor. During the last couple of years, a number of signicant projects have been introduced to make the computational power of GPUs available to a wider audience, where the most well known is CUDA. In this paper we present, with the aid of CUDA, a speedup in the range of 38-44x (from 29 minutes to 40 seconds) when implementing a phasebased non-rigid image registration algorithm, known as the Morphon, on a single GPU. The achieved speedup is in the same magnitude as the speedups reported from other non-rigid registration algorithms fully ported to the GPU. Given the impressive speedups, both reported in this paper and other papers, we therefore consider that it is now feasible to eectively integrate image registration into various clinical workows, where time is a critical factor.

Image registration is frequently used within the medical image domain and where methods with high performance are required. The need for high accuracy coupled with high speed is especially important for applications such as adaptive radiation therapy and image-guided surgery. During the last years, a number of significant projects have been introduced to make the computational power of GPUs available to a wider audience. The most well known project is the introduction of CUDA (Compute Unified Device Architecture). In this paper, we present a CUDA based GPU implementation of a non-rigid image registration algorithm, known as the Morphon, and compare it with a CPU implementation of the Morphon. The achieved speedup, in the range of 51-54x, is also compared with speedups reported from other non-rigid registration methods mplemented on the GPU. These include the Demons algorithm and a mutual information based algorithm.

Image registration is a well-known concept within the medical image domain and has been shown to be useful in a number of dierent tasks. However, due to sometimes long processing times, image registration is not fully utilized in clinical workows, where time is an important factor. During the last couple of years, a number of signicant projects have been introduced to make the computational power of GPUs available to a wider audience, where the most well known is CUDA. In this paper we present, with the aid of CUDA, a speedup in the range of 38-44x (from 29 minutes to 40 seconds) when implementing a phasebased non-rigid image registration algorithm, known as the Morphon, on a single GPU. The achieved speedup is in the same magnitude as the speedups reported from other non-rigid registration algorithms fully ported to the GPU. Given the impressive speedups, both reported in this paper and other papers, we therefore consider that it is now feasible to eectively integrate image registration into various clinical workows, where time is a critical factor.

Image registration is frequently used within the medical image domain and where methods with high performance are required. The need for high accuracy coupled with high speed is especially important for applications such as adaptive radiation therapy and image-guided surgery. During the last years, a number of significant projects have been introduced to make the computational power of GPUs available to a wider audience. The most well known project is the introduction of CUDA (Compute Unified Device Architecture). In this paper, we present a CUDA based GPU implementation of a non-rigid image registration algorithm, known as the Morphon, and compare it with a CPU implementation of the Morphon. The achieved speedup, in the range of 51-54x, is also compared with speedups reported from other non-rigid registration methods mplemented on the GPU. These include the Demons algorithm and a mutual information based algorithm.

Image registration is a well-known concept within the medical image domain and has been shown to be useful in a number of dierent tasks. However, due to sometimes long processing times, image registration is not fully utilized in clinical workows, where time is an important factor. During the last couple of years, a number of signicant projects have been introduced to make the computational power of GPUs available to a wider audience, where the most well known is CUDA. In this paper we present, with the aid of CUDA, a speedup in the range of 38-44x (from 29 minutes to 40 seconds) when implementing a phasebased non-rigid image registration algorithm, known as the Morphon, on a single GPU. The achieved speedup is in the same magnitude as the speedups reported from other non-rigid registration algorithms fully ported to the GPU. Given the impressive speedups, both reported in this paper and other papers, we therefore consider that it is now feasible to eectively integrate image registration into various clinical workows, where time is a critical factor.

Phase-based methods are commonly applied in image registration. When working with phase-difference methods only a single is employed, although the algorithms are normally iterated over multiple scales, whereas phase-congruency methods utilize the phase from multiple scales simultaneously. This paper presents an extension to phase-difference methods employing parallel scales to achieve more accurate displacements. Results are also presented clearly favouring the use of parallel scales over single scale in more than 95% of the 120 tested cases.

Phase-based methods are commonly applied in image registration. When working with phase-difference methods only a single is employed, although the algorithms are normally iterated over multiple scales, whereas phase-congruency methods utilize the phase from multiple scales simultaneously. This paper presents an extension to phase-difference methods employing parallel scales to achieve more accurate displacements. Results are also presented clearly favouring the use of parallel scales over single scale in more than 95% of the 120 tested cases.

Image registration is a crucial task in many applications and applied in a variety of different areas. In addition to the primary task of image alignment, the deformation field is valuable when studying structural/volumetric changes in the brain. In most applications a regularizing term is added to achieve a smoothly varying deformation field. This can sometimes cause conflicts in situations of local complex deformations. In this paper we present a new regularizer, which aims at handling local complex deformations while maintaining an overall smooth deformation field. It is based on an adaptive anisotropic regularizer and its usefulness is demonstrated by two examples, one synthetic and one with real MRI data from a pre- and post-op situation with normal pressure hydrocephalus.

Phase-based methods are commonly applied in image registration. When working with phase-difference methods only a single is employed, although the algorithms are normally iterated over multiple scales, whereas phase-congruency methods utilize the phase from multiple scales simultaneously. This paper presents an extension to phase-difference methods employing parallel scales to achieve more accurate displacements. Results are also presented clearly favouring the use of parallel scales over single scale in more than 95% of the 120 tested cases.

Image registration is a crucial task in many applications and applied in a variety of different areas. In addition to the primary task of image alignment, the deformation field is valuable when studying structural/volumetric changes in the brain. In most applications a regularizing term is added to achieve a smoothly varying deformation field. This can sometimes cause conflicts in situations of local complex deformations. In this paper we present a new regularizer, which aims at handling local complex deformations while maintaining an overall smooth deformation field. It is based on an adaptive anisotropic regularizer and its usefulness is demonstrated by two examples, one synthetic and one with real MRI data from a pre- and post-op situation with normal pressure hydrocephalus.

Image registration is a crucial task in many applications and applied in a variety of different areas. In addition to the primary task of image alignment, the deformation field is valuable when studying structural/volumetric changes in the brain. In most applications a regularizing term is added to achieve a smoothly varying deformation field. This can sometimes cause conflicts in situations of local complex deformations. In this paper we present a new regularizer, which aims at handling local complex deformations while maintaining an overall smooth deformation field. It is based on an adaptive anisotropic regularizer and its usefulness is demonstrated by two examples, one synthetic and one with real MRI data from a pre- and post-op situation with normal pressure hydrocephalus.

Phase-based methods are commonly applied in image registration. When working with phase-difference methods only a single is employed, although the algorithms are normally iterated over multiple scales, whereas phase-congruency methods utilize the phase from multiple scales simultaneously. This paper presents an extension to phase-difference methods employing parallel scales to achieve more accurate displacements. Results are also presented clearly favouring the use of parallel scales over single scale in more than 95% of the 120 tested cases.

Phase-based methods are commonly applied in image registration. When working with phase-difference methods only a single is employed, although the algorithms are normally iterated over multiple scales, whereas phase-congruency methods utilize the phase from multiple scales simultaneously. This paper presents an extension to phase-difference methods employing parallel scales to achieve more accurate displacements. Results are also presented clearly favouring the use of parallel scales over single scale in more than 95% of the 120 tested cases.

Image registration is a crucial task in many applications and applied in a variety of different areas. In addition to the primary task of image alignment, the deformation field is valuable when studying structural/volumetric changes in the brain. In most applications a regularizing term is added to achieve a smoothly varying deformation field. This can sometimes cause conflicts in situations of local complex deformations. In this paper we present a new regularizer, which aims at handling local complex deformations while maintaining an overall smooth deformation field. It is based on an adaptive anisotropic regularizer and its usefulness is demonstrated by two examples, one synthetic and one with real MRI data from a pre- and post-op situation with normal pressure hydrocephalus.

This paper presents an overview of the project “Classification of multivariate medical datasets using deformable models” and the current work within the project. The project is a joint venture between the Department of Biomedical Engineering (Linköping University), the Center for Medical Image Science and Visualization (Linköping University) and Sectra Imtec AB (Linköping) and focuses on extending a deformable model approach, named the Morphon, to 3D and to utilize multi-variate data with multiple priors. Recent work in the project includes evaluating different methods for estimating the displacement field and automatic scale control.

This paper presents an overview of the project “Classification of multivariate medical datasets using deformable models” and the current work within the project. The project is a joint venture between the Department of Biomedical Engineering (Linköping University), the Center for Medical Image Science and Visualization (Linköping University) and Sectra Imtec AB (Linköping) and focuses on extending a deformable model approach, named the Morphon, to 3D and to utilize multi-variate data with multiple priors. Recent work in the project includes evaluating different methods for estimating the displacement field and automatic scale control.

This paper presents an overview of the project “Classification of multivariate medical datasets using deformable models” and the current work within the project. The project is a joint venture between the Department of Biomedical Engineering (Linköping University), the Center for Medical Image Science and Visualization (Linköping University) and Sectra Imtec AB (Linköping) and focuses on extending a deformable model approach, named the Morphon, to 3D and to utilize multi-variate data with multiple priors. Recent work in the project includes evaluating different methods for estimating the displacement field and automatic scale control.

This paper presents an overview of the project “Classification of multivariate medical datasets using deformable models” and the current work within the project. The project is a joint venture between the Department of Biomedical Engineering (Linköping University), the Center for Medical Image Science and Visualization (Linköping University) and Sectra Imtec AB (Linköping) and focuses on extending a deformable model approach, named the Morphon, to 3D and to utilize multi-variate data with multiple priors. Recent work in the project includes evaluating different methods for estimating the displacement field and automatic scale control.