International audienceThis paper aims to propose a new feature and intensity-based image registration method. The proposed approach is based on the block matching algorithm : a displacement field is locally computed by matching spatially-invariant intensity sub-blocks of the images before performing an optimization algorithm from this vector field to estimate the transformation. Our approach proposes a new way to calculate the displacement field by matching spatially-variant sub-blocks of the images, called General Adaptive Neighborhoods (GANs). These neighborhoods are adaptive with respect to both the intensities and the spatial structures of the image. They represent the patterns within the grayscale images. This paper also presents a con...
Abstract. Mutual information has been widely used in image registration as an effective similarity m...
We describe a robust method for spatial registration, which relies on the coarse correspondence of s...
International audienceA new robust dense matching algorithm is introduced. The algorithm starts from...
International audienceThis paper aims to propose a new feature and intensity-based image registratio...
University of Minnesota Ph.D. dissertation. November 2012. Major: Statistics. Advisor: Peihua Qiu. 1...
We propose a pixel similarity-based algorithm enabling accurate rigid registration between single an...
In this paper, we present a non-rigid quasi-dense match-ing method and its application to object rec...
Abstract. This paper exploits the different properties between the local neighborhood of global opti...
Much biomedical and medical research relies on the collection of ever-larger amounts of image data (...
Image registration is a fundamental task in both image processing and computer vision. Here, we pres...
In this report, we #rst propose a new classi#cation of non-rigid registration algorithms into three ...
Non-rigid image registration is an essential tool required for overcoming the inherent local anatomi...
This paper addresses the image registration problem applying genetic algorithms. The image registrat...
International audienceWe propose and evaluate a new block-matching strategy for rigid-body registrat...
Non-rigid registration algorithms have been proposed over the years to register medical images to ea...
Abstract. Mutual information has been widely used in image registration as an effective similarity m...
We describe a robust method for spatial registration, which relies on the coarse correspondence of s...
International audienceA new robust dense matching algorithm is introduced. The algorithm starts from...
International audienceThis paper aims to propose a new feature and intensity-based image registratio...
University of Minnesota Ph.D. dissertation. November 2012. Major: Statistics. Advisor: Peihua Qiu. 1...
We propose a pixel similarity-based algorithm enabling accurate rigid registration between single an...
In this paper, we present a non-rigid quasi-dense match-ing method and its application to object rec...
Abstract. This paper exploits the different properties between the local neighborhood of global opti...
Much biomedical and medical research relies on the collection of ever-larger amounts of image data (...
Image registration is a fundamental task in both image processing and computer vision. Here, we pres...
In this report, we #rst propose a new classi#cation of non-rigid registration algorithms into three ...
Non-rigid image registration is an essential tool required for overcoming the inherent local anatomi...
This paper addresses the image registration problem applying genetic algorithms. The image registrat...
International audienceWe propose and evaluate a new block-matching strategy for rigid-body registrat...
Non-rigid registration algorithms have been proposed over the years to register medical images to ea...
Abstract. Mutual information has been widely used in image registration as an effective similarity m...
We describe a robust method for spatial registration, which relies on the coarse correspondence of s...
International audienceA new robust dense matching algorithm is introduced. The algorithm starts from...