Reference-omitted affine soft correspondence algorithm

Peng-Peng Zhang; Yu Qiao; Sheng-Zheng Wang; Jie Yang

Reference-omitted affine soft correspondence algorithm

View Fulltext

Author(s): Peng-Peng Zhang ¹ ; Yu Qiao ¹ ; Sheng-Zheng Wang ² ; Jie Yang ¹
- Affiliations: 1: Institute of Image Processing and Pattern Recognition, Key Laboratory of System Control and Information Processing, Ministry of Education, Shanghai Jiao Tong University, Shanghai, People's Republic of China ;
  2: Merchant Marine College, Shanghai Maritime University, Shanghai, People's Republic of China
Source: Volume 10, Issue 8, August 2016, p. 571 – 581
DOI: 10.1049/iet-ipr.2015.0254 , Print ISSN 1751-9659, Online ISSN 1751-9667

« Previous Article
Table of contents
Next Article »

Received 10/05/2015, Accepted 14/02/2016, Revised 10/11/2015, Published 01/08/2016

In this study, an affine registration algorithm with reference-omitted scheme and soft correspondence is proposed. It is an iterative method with two-step matching process at each iteration, named as forward matching and backward matching. Due to the introduction of backward matching, two sets of points are alternately to be reference set, such that the selection of reference set is omitted. Failure caused by different reference sets can be corrected with the reference-omitted scheme, and even there is obvious difference in scale. Additionally, soft correspondence is applied to avoid estimating the initial transformations. The simulation and real experimental results show that the proposed method substantially outperforms the current affine registration methods, especially when the scale difference between two sets of points is obvious or there are outliers in one set.

References

1. 1)
  - 8. Zhao, W., Nister, D., Hsu, S.: ‘Alignment of continuous video onto 3D point clouds’, IEEE Trans. Pattern Anal. Mach. Intell., 2005, 27, (8), pp. 1305–1318 (doi: 10.1109/TPAMI.2005.152).
2. 2)
  - 1. Almhdie, A., Léger, C., Deriche, M., et al: ‘3D registration using a new implementation of the ICP algorithm based on a comprehensive lookup matrix: Application to medical imaging’, Pattern Recognit. Lett., 2007, 28, (12), pp. 1523–1533 (doi: 10.1016/j.patrec.2007.03.005).
3. 3)
  - 20. Latecki, L.J., Lakamper, R., Eckhardt, T.: ‘Shape descriptors for non-rigid shapes with a single closed contour’. Computer Vision and Pattern Recognition, June 2000, vol. 1, pp. 424–429.
4. 4)
  - 18. Nuchter, A., Lingemann, K., Hertzberg, J.: ‘Cached kd tree search for ICP algorithms’. Int. Conf. on 3-D Digital Imaging and Modeling, 2007, pp. 419–426.
5. 5)
  - 9. Granger, S., Pennec, X.: ‘Multi-scale EM-ICP: a fast and robust approach for surface registration’. European Conf. on Computer Vision, 2002, pp. 418–432.
6. 6)
  - 6. Gold, S., Rangarajan, A., Lu, C.P., et al: ‘New algorithms for 2D and 3D point matching: pose estimation and correspondence’, Pattern Recognit., 1998, 31, (8), pp. 1019–1031 (doi: 10.1016/S0031-3203(98)80010-1).
7. 7)
  - 11. Jian, B., Vemuri, B.C.: ‘A robust algorithm for point set registration using mixture of Gaussians’. Int. Conf. on Computer Vision, October 2005, vol. 2, pp. 1246–1251.
8. 8)
  - 14. Ho, J., Peter, A., Rangarajan, A., et al: ‘An algebraic approach to affine registration of point sets’. Int. Conf. on Computer Vision, September 2009, pp. 1335–1340.
9. 9)
  - 7. Besl, P.J., McKay, N.D.: ‘A method for registration of 3D shapes’, Trans. PAMI, 1992, 14, pp. 239–256 (doi: 10.1109/34.121791).
10. 10)
  - 7. David, P., DeMenthon, D., Duraiswami, R., et al: ‘Simultaneous pose and correspondence determination using line features’. Computer Vision and Pattern Recognition, June2003, vol. 2, pp. 424–431.
11. 11)
  - 10. Tsin, Y., Kanade, T.: ‘A correlation-based approach to robust point set registration’. European Conference on Computer Vision, May 2004, pp. 558–569.
12. 12)
  - 4. Yang, C., Medioni, G.: ‘Object modelling by registration of multiple range images’, Image Vis. Comput., 1992, 10, (3), pp. 145–155 (doi: 10.1016/0262-8856(92)90066-C).
13. 13)
  - 2. Hongdong, L., Richard, H.: ‘The 3D-3D registration problem revisited’. IEEE Int. Conf. on Computer Vision, October 2007, pp. 1–8.
14. 14)
  - 21. Tamaki, T., Abe, M., Raytchev, B., et al: ‘SoftAssign and EM-ICP on GPU’. Int. Conf. on Networking and Computing, 2010, pp. 179–183.
15. 15)
  - 15. Du, S., Zheng, N., Meng, G., et al: ‘Affine registration of point sets using ICP and ICA’, Signal Process. Lett., 2008, 15, pp. 689–692 (doi: 10.1109/LSP.2008.2001823).
16. 16)
  - 19. Zhang, P.P., Wang, S.Z., Qiao, Y., et al: ‘Affine SoftAssign with bidirectional distance for point matching’. IEEE Int. Conf. on Image Processing, 2013, pp. 1267–1271.
17. 17)
  - 17. Zhu, J., Du, S., Yuan, Z., et al: ‘Robust affine iterative closest point algorithm with bidirectional distance’, IET Comput. Vis., 2012, 6, (3), pp. 252–261 (doi: 10.1049/iet-cvi.2011.0178).
18. 18)
  - 12. Myronenko, A., Song, X., Carreira-Perpinán, M.A.: ‘Non-rigid point set registration: coherent point drift’. Advances in Neural Information Processing Systems, 2006, pp. 1009–1016.
19. 19)
  - 5. Zhang, Z.: ‘Iterative point matching for registration of free-form curves and surfaces’, Int. J. Comput. Vis., 1994, 13, (2), pp. 119–152 (doi: 10.1007/BF01427149).
20. 20)
  - 16. Du, S., Zheng, N., Ying, S., et al: ‘Affine iterative closest point algorithm for point set registration’, Pattern Recognit. Lett., 2010, 31, (9), pp. 791–799 (doi: 10.1016/j.patrec.2010.01.020).
21. 21)
  - 13. Myronenko, A., Song, X.: ‘Point set registration: coherent point drift’, IEEE Trans. Pattern Anal. Mach. Intell., 2010, 32, (12), pp. 2262–2275 (doi: 10.1109/TPAMI.2010.46).

Login

Not registered yet?

Share

Tools

Login to add to favourites

Key

Reference-omitted affine soft correspondence algorithm

References

Related content