Skip to main content

3-D Oral Shape Retrieval Using Registration Algorithm

  • Conference paper
  • First Online:
MultiMedia Modeling (MMM 2020)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11962))

Included in the following conference series:

Abstract

In this paper, we present a novel 3-D oral shape retrieval using correntropy-based registration algorithm. Fast matching as the traditional registration method can achieve, its registration accuracy is disturbed by noise and outliers. Since the 3-D oral model contains a large amount of noise and outliers, it may lead to a decrease in registration accuracy, which affects the accuracy of retrieval rate. Therefore, we introduce the correntropy into the rigid registration algorithm to solve this problem. Although the noise and outliers are suppressed by the correntropy-based algorithm, these noises and outliers still participate in the registration. For better retrieval, we choose the matched point cloud data and use mean squared error results to judge the individual differences of the shape. Finally, the accurate retrieval of the oral shape is realized. Experimental results demonstrate our 3-D shape retrieval algorithm can be successfully searched under different models, which can help forensics use the characteristics of biological individuals to accurately search and identify, and improve recognition efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Cao, K., Jain, A.K.: Automated latent fingerprint recognition. IEEE Trans. Pattern Anal. Mach. Intell. 41(4), 788–800 (2019)

    Article  Google Scholar 

  2. Du, S., Guo, Y., Sanroma, G., et al.: Building dynamic population graph for accurate correspondence detection. Med. Image Anal. 26(1), 256–267 (2015)

    Article  Google Scholar 

  3. Zhang, Y., Pan, P., Zheng, Y., et al.: Visual search at Alibaba. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 993–1001. ACM (2018)

    Google Scholar 

  4. Yang, Y., Li, B., Li, P., et al.: A two-stage clustering based 3-D visual saliency model for dynamic scenarios. IEEE Trans. Multimed. 21(4), 809–820 (2018)

    Article  Google Scholar 

  5. Yang, Y., Liu, Q., He, X., et al.: Cross-view multi-lateral filter for compressed multi-view depth video. IEEE Trans. Image Process. 28(1), 302–315 (2018)

    Article  MathSciNet  Google Scholar 

  6. Bray, M.A., Vokes, M.S., Carpenter, A.E.: Using cell Profiler for automatic identification and measurement of biological objects in images. Curr. Protocols Mol. Biol. 109(1), 14.17. 1–14.17. 13 (2015)

    Article  Google Scholar 

  7. Ke, Q., Deng, J., Baker, S., et al.: Image retrieval using discriminative visual features. U.S. Patent 9,229,956, 5 January 2016

    Google Scholar 

  8. Zhao, F., Huang, Y., Wang, L., et al.: Deep semantic ranking based hashing for multi-label image retrieval. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1556–1564 (2015)

    Google Scholar 

  9. Li, A., Sun, J., Yue-Hei Ng, J., et al.: Generating holistic 3D scene abstractions for text-based image retrieval. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 193–201 (2017)

    Google Scholar 

  10. Besl, P.J., Mckay, H.D.: A method for registration of 3-D shapes. IEEE Trans. Pattern Anal. Mach. Intell. (PAMI) 14(2), 239–256 (1992)

    Article  Google Scholar 

  11. Du, S., Zhang, C., Wu, Z., et al.: Robust isotropic scaling ICP algorithm with bidirectional distance and bounded rotation angle. Neurocomputing 215, 160–168 (2016)

    Article  Google Scholar 

  12. Chetverikov, D., Stepanov, D., Krsek, P.: Robust Euclidean alignment of 3-D point sets: the trimmed iterative closest point algorithm. Image Vis. Comput. 23(3), 299–309 (2005)

    Article  Google Scholar 

  13. Phillips, J.M., Liu, R., Tomasi, C.: Outlier robust ICP for minimizing fractional RMSD. In: Proceedings of IEEE International Conference on 3-D Digital Imaging and Modeling (3DIM), pp. 427–434 (2007)

    Google Scholar 

  14. Boissonnat, J.D., Dyer, R., Ghosh, A.: Delaunay triangulation of manifolds. Found. Comput. Math. 18(2), 399–431 (2018)

    Article  MathSciNet  Google Scholar 

  15. Chen, Y., Zhou, L., Tang, Y., et al.: Fast neighbor search by using revised k-d tree. Inf. Sci. 472, 145–162 (2019)

    Article  MathSciNet  Google Scholar 

  16. Arun, K.S., Huang, T.S., Blostein, S.D.: Least-squares fitting of two 3D point sets. IEEE Trans. Pattern Anal. Mach. Intell. (PAMI) 9(5), 698–700 (1987)

    Article  Google Scholar 

Download references

Acknowledgment

This work was supported by the National Natural Science Foundation of China under Grant Nos. 61573274, 61627811 and 61971343.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shaoyi Du .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cui, W. et al. (2020). 3-D Oral Shape Retrieval Using Registration Algorithm. In: Ro, Y., et al. MultiMedia Modeling. MMM 2020. Lecture Notes in Computer Science(), vol 11962. Springer, Cham. https://doi.org/10.1007/978-3-030-37734-2_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-37734-2_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-37733-5

  • Online ISBN: 978-3-030-37734-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics