Discrete Rigid Transformation Graph Search for 2D Image Registration
Rigid image registration is an essential image processing task, with a large body of applications. This problem is usually formulated in the continuous domain, often in the context of an optimization framework. This approach leads to sometimes unwanted artifacts, e.g. due to interpolation. In the case of purely discrete applications, e.g., for template-based segmentation or classification, it is however preferable to avoid digitizing the result again after transformation. In this article, we deal with this point of view in the 2D case. Based on a fully discrete framework, we explicitly explore the parameter space of rigid transformations. This exploration leads to a local search scheme that can be involved in combinatorial optimization strategies.
KeywordsRigid registration digital image combinatorial optimisation on graph parameter space subdivision
- 1.Hajnal, J.V., Hill, D.L.G., Hawkes, D.J.: Medical Image Registration. CRC Press (2001)Google Scholar
- 2.Schowengerdt, R.A.: Remote Sensing: Models and Methods for Image Processing, 3rd edn. Elsevier Academic Press (2007)Google Scholar
- 12.Aarts, E., Lenstra, J.K.: Local Search in Combinatorial Optimization. John Wiley & Sons, Inc. (1997)Google Scholar