Hyppää sisältöön
    • FI
    • ENG
  • FI
  • /
  • EN
OuluREPO – Oulun yliopiston julkaisuarkisto / University of Oulu repository
Näytä viite 
  •   OuluREPO etusivu
  • Oulun yliopisto
  • Avoin saatavuus
  • Näytä viite
  •   OuluREPO etusivu
  • Oulun yliopisto
  • Avoin saatavuus
  • Näytä viite
JavaScript is disabled for your browser. Some features of this site may not work without it.

3D printing watermarking algorithm based on 2D slice mean distance

Tran, Thang V.; Pham, Giao N.; Nguyen, Binh A.; Ta, Khoa D.; Nguyen, Phong H. (2020-02-29)

 
Avaa tiedosto
nbnfi-fe2020050725513.pdf (1.177Mt)
nbnfi-fe2020050725513_meta.xml (35.11Kt)
nbnfi-fe2020050725513_solr.xml (32.01Kt)
Lataukset: 

URL:
https://doi.org/10.30534/ijatcse/2020/10912020

Tran, Thang V.
Pham, Giao N.
Nguyen, Binh A.
Ta, Khoa D.
Nguyen, Phong H.
The World Academy of Research in Science and Engineering
29.02.2020

V. Tran, T. (2020). 3D Printing Watermarking Algorithm Based on 2D Slice Mean Distance. International Journal of Advanced Trends in Computer Science and Engineering, 9(1), 57–64. https://doi.org/10.30534/ijatcse/2020/10912020

https://rightsstatements.org/vocab/InC/1.0/
© The Authors 2020.
https://rightsstatements.org/vocab/InC/1.0/
doi:https://doi.org/10.30534/ijatcse/2020/10912020
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe2020050725513
Tiivistelmä

Abstract

3D printing has recently been applied to many areas of life including education, healthcare, aerospace, automotive, industrial design and other domains in industry. Due to the fact that the benefit of 3D printing is significant, the copyright issue of 3D printing has been become essentially and importantly. To solve the copyright issue of 3D printing, we would like to propose a 3D printing watermarking algorithm based on the mean distance of 2D slices in this paper. In the proposed method, 3D printing model is sliced into a set of 2D slices, and each 2D slice is then embedded a bit of watermark data by changing the length of mean distance of that slice. Finally, the coordinates of points in each 2D slice will be altered according to the changed mean distance value of 2D slice which has been embedded watermark bit. Experimental results showed that the mean distance error between the watermarked 2D slices and the original 2D slices is very small. The bit error rate (BER) between the extracted watermark and the original watermark is also very low. So, we verify that the invisibility of the proposed method is effective, and the proposed method is also robust to geometric attacks as rotation, scaling, and translation. Comparing to the conventional works, the proposed method also provides a solution with better accuracy.

Kokoelmat
  • Avoin saatavuus [42019]
oulurepo@oulu.fiOulun yliopiston kirjastoOuluCRISLaturiMuuntaja
SaavutettavuusselosteTietosuojailmoitusYlläpidon kirjautuminen
 

Selaa kokoelmaa

NimekkeetTekijätJulkaisuajatAsiasanatUusimmatSivukartta

Omat tiedot

Kirjaudu sisäänRekisteröidy
oulurepo@oulu.fiOulun yliopiston kirjastoOuluCRISLaturiMuuntaja
SaavutettavuusselosteTietosuojailmoitusYlläpidon kirjautuminen