MétaCan
Menu
Back to cohort
Record W2521592752 · doi:10.11159/mhci16.102

Hiding Information in 3D Printed Objects by Forming Fine Cavities inside Objects

2016· article· en· W2521592752 on OpenAlexvenueno aff
Kazutake Uehira, Satoru Baba, Masahiro Suzuki, Piyarat Silapasuphakornwong, Hideyuki Torii, Youichi Takashima

Bibliographic record

VenueProceedings of the World Congress on Electrical Engineering and Computer Systems and Science · 2016
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Steganography and Watermarking Techniques
Canadian institutionsnot available
Fundersnot available
Keywords3d printedComputer scienceComputer graphics (images)Computer visionArtificial intelligenceEngineering

Abstract

fetched live from OpenAlex

This paper presents a copyright protection technique for 3D printing by hiding information inside 3D-printed objects.In the future when 3D printers become widespread, people will purchase the digital data of objects they want to produce from Web sites, download it, and manufacture objects at home with 3D printers instead of purchasing real objects.In this situation, the problem of illegal copies of digital data will become serious because digital data is easy to copy.Therefore, copyright protection for digital data for 3D printing will become important.We previously proposed a technique that can protect the copyrights of digital data for products manufactured by 3D printers [1].The basic concept of our technique is as follows.When the providers prepare the contents of a 3D object using the 3D-CAD, the copyright information is integrated to the object data.After that, when a customer purchases the digital data through the internet and prints out 3D objects by using a household 3D printer, the fine cavities are simultaneously formed inside the physical 3D object by integrating copyright information during its fabrication.The disposition of the fine cavities expresses the information, that is, existence or non-existence of a cavity in a designated position inside the object expresses binary data, "1" or "0".We also proposed a technique that can non-destructively read out information from inside the objects using thermography.If we form the cavity near the surface of the object and raise the temperature of the surface by heating, the surface regions under which cavities exist become warmer than the other regions because of the low-thermal conductivity of the cavity.Therefore, we can find out the disposition of the fine cavities from the thermal image captured with thermography, that is, we can read out embedded information.In a previous study, we just showed the feasibility using a sample with flat and spherical surfaces [1], [2].In this paper, we study the readability of embedded information relating with the structure parameters of the fine cavities inside real objects and try to clarify the conditions in which this technique can be applied.We conducted an experiment using samples fabricated by a stereolithographic 3D printer, and polylactide (PLA) resin was used as the material for the sample, which was 5 x 5 x 1 cm.The size of the cavities, the space between cavities, and the depth of the cavities from the surface of the object were changed as experimental parameters.Experimental results reveal that a cavity of at least 1.5 x 1.5 mm can be detected.This size is the top viewed size, and all cavities are 2 mm high.It is also seen that cavities over 1.5 mm apart can be detected separately.Moreover, the cavities at the depth of within 2 mm from the surface can be detected.From these results, the conditions for forming cavities inside the fabricated object are clarified.Moreover, these results show that a sufficient amount of information for copyright (i.e.hundreds bits) can be embedded if a fabricated object is several centimetres in size.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.001
Threshold uncertainty score0.003

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.005
GPT teacher head0.192
Teacher spread0.187 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2016
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of the World Congress on Electrical Engineering and Computer Systems and ScienceSame topicAdvanced Steganography and Watermarking TechniquesFrench-language works237,207