Tamperproof watermarking of 3D models using hausdorff distance

This paper describes a novel algorithm for tamperproof watermarking of 3D models. Fragile watermarking is used to detect any kind of tamper i.e. unauthorized modifications in the model. The best and the simplest way to do this is by inserting a watermark at each and every vertex of the model. This p...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Motwani, Mukesh, Sridharan, Balaji, Motwani, Rakhi, Harris, Frederick C.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 54
container_issue
container_start_page 50
container_title
container_volume
creator Motwani, Mukesh
Sridharan, Balaji
Motwani, Rakhi
Harris, Frederick C.
description This paper describes a novel algorithm for tamperproof watermarking of 3D models. Fragile watermarking is used to detect any kind of tamper i.e. unauthorized modifications in the model. The best and the simplest way to do this is by inserting a watermark at each and every vertex of the model. This poses as a challenge as insertion of watermark in every vertex can cause perceptible distortion and inserting such a watermark is computationally expensive. The challenge of perceptible distortion is overcome by using a measure that controls perceptible distortional called the hausdorff distance. Thus, the objective of the Genetic Algorithm is to minimize the hausdorff distance between the 2 ring neighbourhood of the original and the watermarked vertex. The other challenge of time complexity is overcome by running the Genetic Algorithm for just 20 generations and causing it to converge prematurely. This significantly reduces the computational cost. The experimental results indicate that the algorithm effectively detects any distortion in model.
doi_str_mv 10.1109/IADCC.2010.5423040
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5423040</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5423040</ieee_id><sourcerecordid>5423040</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-1a76e73983dd07ee23d1feab025f9f3b302e74f8eb48695a00797a98ce619df13</originalsourceid><addsrcrecordid>eNo1j09Lw0AUxFekoK35AnrJF0h9-y-77yKU1Gqh4KWey6b7VqNNE3ZTxG9vxDqX4TeHYYaxWw5zzgHv14tlVc0FjKyVkKDggmVoLFdCKWWQl5ds-g-AEzYVAIigpYErlqX0AaOUHhvENXvYuran2MeuC_mXGyi2Ln42x7d8ZLnM287TIeWn9Bu9u1PyXQwh900a3HFPN2wS3CFRdvYZe109bqvnYvPytK4Wm6LhRg8Fd6YkI9FK78EQCel5IFeD0AGDrCUIMipYqpUtUTsAg8ah3VPJ0QcuZ-zur7chol0fm3Hl9-78X_4Ao4FL9Q</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Tamperproof watermarking of 3D models using hausdorff distance</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Motwani, Mukesh ; Sridharan, Balaji ; Motwani, Rakhi ; Harris, Frederick C.</creator><creatorcontrib>Motwani, Mukesh ; Sridharan, Balaji ; Motwani, Rakhi ; Harris, Frederick C.</creatorcontrib><description>This paper describes a novel algorithm for tamperproof watermarking of 3D models. Fragile watermarking is used to detect any kind of tamper i.e. unauthorized modifications in the model. The best and the simplest way to do this is by inserting a watermark at each and every vertex of the model. This poses as a challenge as insertion of watermark in every vertex can cause perceptible distortion and inserting such a watermark is computationally expensive. The challenge of perceptible distortion is overcome by using a measure that controls perceptible distortional called the hausdorff distance. Thus, the objective of the Genetic Algorithm is to minimize the hausdorff distance between the 2 ring neighbourhood of the original and the watermarked vertex. The other challenge of time complexity is overcome by running the Genetic Algorithm for just 20 generations and causing it to converge prematurely. This significantly reduces the computational cost. The experimental results indicate that the algorithm effectively detects any distortion in model.</description><identifier>ISBN: 1424447909</identifier><identifier>ISBN: 9781424447909</identifier><identifier>EISBN: 9781424447916</identifier><identifier>EISBN: 1424447917</identifier><identifier>DOI: 10.1109/IADCC.2010.5423040</identifier><identifier>LCCN: 2009905370</identifier><language>eng</language><publisher>IEEE</publisher><subject>2 ring neighbourhood ; 3D mesh model ; Ant colony optimization ; Biological cells ; Computational efficiency ; Convergence ; Distortion measurement ; fragile watermarking ; Genetic algorithms ; Pattern recognition ; PSNR ; Robustness ; SNR ; Watermarking</subject><ispartof>2010 IEEE 2nd International Advance Computing Conference (IACC), 2010, p.50-54</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5423040$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5423040$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Motwani, Mukesh</creatorcontrib><creatorcontrib>Sridharan, Balaji</creatorcontrib><creatorcontrib>Motwani, Rakhi</creatorcontrib><creatorcontrib>Harris, Frederick C.</creatorcontrib><title>Tamperproof watermarking of 3D models using hausdorff distance</title><title>2010 IEEE 2nd International Advance Computing Conference (IACC)</title><addtitle>IADCC</addtitle><description>This paper describes a novel algorithm for tamperproof watermarking of 3D models. Fragile watermarking is used to detect any kind of tamper i.e. unauthorized modifications in the model. The best and the simplest way to do this is by inserting a watermark at each and every vertex of the model. This poses as a challenge as insertion of watermark in every vertex can cause perceptible distortion and inserting such a watermark is computationally expensive. The challenge of perceptible distortion is overcome by using a measure that controls perceptible distortional called the hausdorff distance. Thus, the objective of the Genetic Algorithm is to minimize the hausdorff distance between the 2 ring neighbourhood of the original and the watermarked vertex. The other challenge of time complexity is overcome by running the Genetic Algorithm for just 20 generations and causing it to converge prematurely. This significantly reduces the computational cost. The experimental results indicate that the algorithm effectively detects any distortion in model.</description><subject>2 ring neighbourhood</subject><subject>3D mesh model</subject><subject>Ant colony optimization</subject><subject>Biological cells</subject><subject>Computational efficiency</subject><subject>Convergence</subject><subject>Distortion measurement</subject><subject>fragile watermarking</subject><subject>Genetic algorithms</subject><subject>Pattern recognition</subject><subject>PSNR</subject><subject>Robustness</subject><subject>SNR</subject><subject>Watermarking</subject><isbn>1424447909</isbn><isbn>9781424447909</isbn><isbn>9781424447916</isbn><isbn>1424447917</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1j09Lw0AUxFekoK35AnrJF0h9-y-77yKU1Gqh4KWey6b7VqNNE3ZTxG9vxDqX4TeHYYaxWw5zzgHv14tlVc0FjKyVkKDggmVoLFdCKWWQl5ds-g-AEzYVAIigpYErlqX0AaOUHhvENXvYuran2MeuC_mXGyi2Ln42x7d8ZLnM287TIeWn9Bu9u1PyXQwh900a3HFPN2wS3CFRdvYZe109bqvnYvPytK4Wm6LhRg8Fd6YkI9FK78EQCel5IFeD0AGDrCUIMipYqpUtUTsAg8ah3VPJ0QcuZ-zur7chol0fm3Hl9-78X_4Ao4FL9Q</recordid><startdate>201002</startdate><enddate>201002</enddate><creator>Motwani, Mukesh</creator><creator>Sridharan, Balaji</creator><creator>Motwani, Rakhi</creator><creator>Harris, Frederick C.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201002</creationdate><title>Tamperproof watermarking of 3D models using hausdorff distance</title><author>Motwani, Mukesh ; Sridharan, Balaji ; Motwani, Rakhi ; Harris, Frederick C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-1a76e73983dd07ee23d1feab025f9f3b302e74f8eb48695a00797a98ce619df13</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>2 ring neighbourhood</topic><topic>3D mesh model</topic><topic>Ant colony optimization</topic><topic>Biological cells</topic><topic>Computational efficiency</topic><topic>Convergence</topic><topic>Distortion measurement</topic><topic>fragile watermarking</topic><topic>Genetic algorithms</topic><topic>Pattern recognition</topic><topic>PSNR</topic><topic>Robustness</topic><topic>SNR</topic><topic>Watermarking</topic><toplevel>online_resources</toplevel><creatorcontrib>Motwani, Mukesh</creatorcontrib><creatorcontrib>Sridharan, Balaji</creatorcontrib><creatorcontrib>Motwani, Rakhi</creatorcontrib><creatorcontrib>Harris, Frederick C.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Motwani, Mukesh</au><au>Sridharan, Balaji</au><au>Motwani, Rakhi</au><au>Harris, Frederick C.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Tamperproof watermarking of 3D models using hausdorff distance</atitle><btitle>2010 IEEE 2nd International Advance Computing Conference (IACC)</btitle><stitle>IADCC</stitle><date>2010-02</date><risdate>2010</risdate><spage>50</spage><epage>54</epage><pages>50-54</pages><isbn>1424447909</isbn><isbn>9781424447909</isbn><eisbn>9781424447916</eisbn><eisbn>1424447917</eisbn><abstract>This paper describes a novel algorithm for tamperproof watermarking of 3D models. Fragile watermarking is used to detect any kind of tamper i.e. unauthorized modifications in the model. The best and the simplest way to do this is by inserting a watermark at each and every vertex of the model. This poses as a challenge as insertion of watermark in every vertex can cause perceptible distortion and inserting such a watermark is computationally expensive. The challenge of perceptible distortion is overcome by using a measure that controls perceptible distortional called the hausdorff distance. Thus, the objective of the Genetic Algorithm is to minimize the hausdorff distance between the 2 ring neighbourhood of the original and the watermarked vertex. The other challenge of time complexity is overcome by running the Genetic Algorithm for just 20 generations and causing it to converge prematurely. This significantly reduces the computational cost. The experimental results indicate that the algorithm effectively detects any distortion in model.</abstract><pub>IEEE</pub><doi>10.1109/IADCC.2010.5423040</doi><tpages>5</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 1424447909
ispartof 2010 IEEE 2nd International Advance Computing Conference (IACC), 2010, p.50-54
issn
language eng
recordid cdi_ieee_primary_5423040
source IEEE Electronic Library (IEL) Conference Proceedings
subjects 2 ring neighbourhood
3D mesh model
Ant colony optimization
Biological cells
Computational efficiency
Convergence
Distortion measurement
fragile watermarking
Genetic algorithms
Pattern recognition
PSNR
Robustness
SNR
Watermarking
title Tamperproof watermarking of 3D models using hausdorff distance
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T14%3A15%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Tamperproof%20watermarking%20of%203D%20models%20using%20hausdorff%20distance&rft.btitle=2010%20IEEE%202nd%20International%20Advance%20Computing%20Conference%20(IACC)&rft.au=Motwani,%20Mukesh&rft.date=2010-02&rft.spage=50&rft.epage=54&rft.pages=50-54&rft.isbn=1424447909&rft.isbn_list=9781424447909&rft_id=info:doi/10.1109/IADCC.2010.5423040&rft_dat=%3Cieee_6IE%3E5423040%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424447916&rft.eisbn_list=1424447917&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5423040&rfr_iscdi=true