Multimodal registration using patch algorithm

  1. Get@NRC: Multimodal registration using patch algorithm (Opens in a new window)
DOIResolve DOI:
AuthorSearch for: ; Search for: ; Search for:
TypeBook Chapter
Proceedings titleBiomedical Image Registration : Second International Workshop, WBIR 2003, Philadelphia, PA, USA, June 23-24, 2003. Revised Papers
Series titleLecture Notes In Computer Science; Volume 2717
ConferenceSecond International Workshop (WBIR 2003), June 23-24, 2003, Philadelphia, PA, USA
Pages254260; # of pages: 7
AbstractImages of different modality are registered using a unimodal image registration program (“Patch Algorithm”). An affine model for the displacement field is considered. Prior to registration the images are convolved with a set of Gabor filter (quadrature) pairs tuned to certain orientations and scales, and a gradient of local phase (local frequency) is computed for the filtered images. Local frequency representation of an image is relatively insensitive to changes in illumination conditions, and may enable common features between images of different modality to be captured. To demonstrate the algorithm, a series of 2- dimensional T₂-weighted magnetic resonance images of brain was registered against a T₁-weighted reference image. Also, registration of a near infrared hyperspectral datacube was shown to improve recovery of localized skin chromophore features for facial imaging, demonstrating its potential to obtain high spatial resolution diagnostic information.
Publication date
PublisherSpringer Berlin Heidelberg
AffiliationNational Research Council Canada; NRC Institute for Biodiagnostics
Peer reviewedYes
NRC number2053
NPARC number9721626
Export citationExport as RIS
Report a correctionReport a correction
Record identifier3485c8e6-cc4a-4779-a4eb-73959778515b
Record created2009-07-17
Record modified2016-07-11
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)
Date modified: