Nonlinear Registration of Binary Shapes (bibtex)
by Jozsef Nemeth, Csaba Domokos, Zoltan Kato
Abstract:
A novel approach is proposed to estimate the parameters of a diffeomorphism that aligns two binary images. Classical approaches usually define a cost function based on a similarity metric and then find the solution via optimization. Herein, we trace back the problem to the solution of a system of nonlinear equations which directly provides the parameters of the aligning transformation. The proposed method works without any time consuming optimization step or established correspondences. The advantage of our algorithm is that it is easy to implement, less sensitive to the strength of the deformation, and robust against segmentation errors. The efficiency of the proposed approach has been demonstrated on a large synthetic dataset as well as in the context of an industrial application.
Reference:
Jozsef Nemeth, Csaba Domokos, Zoltan Kato, Nonlinear Registration of Binary Shapes, In Proceedings of International Conference on Image Processing, Cairo, Egypt, pp. 1001-1004, 2009, IEEE.
Bibtex Entry:
@string{icip="Proceedings of International Conference on Image Processing"}
@InProceedings{Nemeth-etal2009b,
  author =	 {Nemeth, Jozsef and Domokos, {Cs}aba and Kato,
                  Zoltan},
  title =	 {Nonlinear Registration of Binary Shapes},
  booktitle =	 icip,
  pages =	 {1001--1004},
  year =	 2009,
  address =	 {Cairo, Egypt},
  month =	 nov,
  organization = {IEEE},
  publisher =	 {IEEE},
  abstract =	 {A novel approach is proposed to estimate the
                  parameters of a diffeomorphism that aligns two
                  binary images. Classical approaches usually define a
                  cost function based on a similarity metric and then
                  find the solution via optimization. Herein, we trace
                  back the problem to the solution of a system of
                  nonlinear equations which directly provides the
                  parameters of the aligning transformation. The
                  proposed method works without any time consuming
                  optimization step or established
                  correspondences. The advantage of our algorithm is
                  that it is easy to implement, less sensitive to the
                  strength of the deformation, and robust against
                  segmentation errors. The efficiency of the proposed
                  approach has been demonstrated on a large synthetic
                  dataset as well as in the context of an industrial
                  application.},
  pdf =		 {papers/icip2009_nj.pdf}
}
Powered by bibtexbrowser