A Reversible Watermarking Based on Histogram Shifting
In this paper, we propose a reversible watermarking algorithm where an original image can be recovered from watermarked image data. Most watermarking algorithms cause degradation of image quality in original digital content in the process of embedding watermark. In the proposed algorithm, the origin...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 361 |
---|---|
container_issue | |
container_start_page | 348 |
container_title | |
container_volume | |
creator | Hwang, JinHa Kim, JongWeon Choi, JongUk |
description | In this paper, we propose a reversible watermarking algorithm where an original image can be recovered from watermarked image data. Most watermarking algorithms cause degradation of image quality in original digital content in the process of embedding watermark. In the proposed algorithm, the original image can be obtained when the degradation is removed from the watermarked image after extracting watermark information. In the proposed algorithm, we utilize a peak point of image histogram and the location map and modify pixel values slightly to embed data. Because the peak point of image histogram and location map are employed in this algorithm, there is no need of extra information transmitted to receiving side. Also, because a slight modification on pixel values is conducted, highly imperceptibly images can be achieved. As locations of watermark embedding are identified using location map, amount of watermark data can dramatically increases through recursive embedding. Experimental results show that it can embed 5K to 130K bits of additional data. |
doi_str_mv | 10.1007/11922841_28 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19105150</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19105150</sourcerecordid><originalsourceid>FETCH-LOGICAL-c261t-d3d5ec6ff4187031ead2571120b590e677c9c81157abaad5bae465812d47df0b3</originalsourceid><addsrcrecordid>eNpNkEtPwzAQhM1LIpSe-AO5cOAQ8PoR28dSAUWqhMRDHK1N7JTQNKnsqBL_HqOCxFz28I1mR0PIBdBroFTdABjGtADL9AE541JQoTVT-pBkUAIUnAtzRKZG6T8m5THJKKesMErwUzKN8ZMmcVApKSNylj_7nQ-xrTqfv-PowwbDuu1X-S1G7_KhzxdtHIdVwE3-8tE2Y2Ln5KTBLvrp752Qt_u71_miWD49PM5ny6JmJYyF4076umwaAVqllx4dkwqA0Uoa6kulalNrAKmwQnSyQi9KqYE5oVxDKz4hl_vcLcYauyZgX7fRbkObSn5ZMEAlSJp8V3tfTKhf-WCrYVhHC9T-7Gb_7ca_AZ5DWNQ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Reversible Watermarking Based on Histogram Shifting</title><source>Springer Books</source><creator>Hwang, JinHa ; Kim, JongWeon ; Choi, JongUk</creator><contributor>Shi, Yun Qing ; Jeon, Byeungwoo</contributor><creatorcontrib>Hwang, JinHa ; Kim, JongWeon ; Choi, JongUk ; Shi, Yun Qing ; Jeon, Byeungwoo</creatorcontrib><description>In this paper, we propose a reversible watermarking algorithm where an original image can be recovered from watermarked image data. Most watermarking algorithms cause degradation of image quality in original digital content in the process of embedding watermark. In the proposed algorithm, the original image can be obtained when the degradation is removed from the watermarked image after extracting watermark information. In the proposed algorithm, we utilize a peak point of image histogram and the location map and modify pixel values slightly to embed data. Because the peak point of image histogram and location map are employed in this algorithm, there is no need of extra information transmitted to receiving side. Also, because a slight modification on pixel values is conducted, highly imperceptibly images can be achieved. As locations of watermark embedding are identified using location map, amount of watermark data can dramatically increases through recursive embedding. Experimental results show that it can embed 5K to 130K bits of additional data.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540488255</identifier><identifier>ISBN: 3540488251</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540488278</identifier><identifier>EISBN: 9783540488279</identifier><identifier>DOI: 10.1007/11922841_28</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Artificial intelligence ; Computer science; control theory; systems ; Exact sciences and technology ; Information Hiding ; Maximum Point ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; Minimum Point ; Original Image ; Pattern recognition. Digital image processing. Computational geometry ; Software ; Watermark Image</subject><ispartof>Digital Watermarking, 2006, p.348-361</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2007 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c261t-d3d5ec6ff4187031ead2571120b590e677c9c81157abaad5bae465812d47df0b3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11922841_28$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11922841_28$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19105150$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Shi, Yun Qing</contributor><contributor>Jeon, Byeungwoo</contributor><creatorcontrib>Hwang, JinHa</creatorcontrib><creatorcontrib>Kim, JongWeon</creatorcontrib><creatorcontrib>Choi, JongUk</creatorcontrib><title>A Reversible Watermarking Based on Histogram Shifting</title><title>Digital Watermarking</title><description>In this paper, we propose a reversible watermarking algorithm where an original image can be recovered from watermarked image data. Most watermarking algorithms cause degradation of image quality in original digital content in the process of embedding watermark. In the proposed algorithm, the original image can be obtained when the degradation is removed from the watermarked image after extracting watermark information. In the proposed algorithm, we utilize a peak point of image histogram and the location map and modify pixel values slightly to embed data. Because the peak point of image histogram and location map are employed in this algorithm, there is no need of extra information transmitted to receiving side. Also, because a slight modification on pixel values is conducted, highly imperceptibly images can be achieved. As locations of watermark embedding are identified using location map, amount of watermark data can dramatically increases through recursive embedding. Experimental results show that it can embed 5K to 130K bits of additional data.</description><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Information Hiding</subject><subject>Maximum Point</subject><subject>Memory and file management (including protection and security)</subject><subject>Memory organisation. Data processing</subject><subject>Minimum Point</subject><subject>Original Image</subject><subject>Pattern recognition. Digital image processing. Computational geometry</subject><subject>Software</subject><subject>Watermark Image</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540488255</isbn><isbn>3540488251</isbn><isbn>3540488278</isbn><isbn>9783540488279</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkEtPwzAQhM1LIpSe-AO5cOAQ8PoR28dSAUWqhMRDHK1N7JTQNKnsqBL_HqOCxFz28I1mR0PIBdBroFTdABjGtADL9AE541JQoTVT-pBkUAIUnAtzRKZG6T8m5THJKKesMErwUzKN8ZMmcVApKSNylj_7nQ-xrTqfv-PowwbDuu1X-S1G7_KhzxdtHIdVwE3-8tE2Y2Ln5KTBLvrp752Qt_u71_miWD49PM5ny6JmJYyF4076umwaAVqllx4dkwqA0Uoa6kulalNrAKmwQnSyQi9KqYE5oVxDKz4hl_vcLcYauyZgX7fRbkObSn5ZMEAlSJp8V3tfTKhf-WCrYVhHC9T-7Gb_7ca_AZ5DWNQ</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Hwang, JinHa</creator><creator>Kim, JongWeon</creator><creator>Choi, JongUk</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>A Reversible Watermarking Based on Histogram Shifting</title><author>Hwang, JinHa ; Kim, JongWeon ; Choi, JongUk</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c261t-d3d5ec6ff4187031ead2571120b590e677c9c81157abaad5bae465812d47df0b3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Information Hiding</topic><topic>Maximum Point</topic><topic>Memory and file management (including protection and security)</topic><topic>Memory organisation. Data processing</topic><topic>Minimum Point</topic><topic>Original Image</topic><topic>Pattern recognition. Digital image processing. Computational geometry</topic><topic>Software</topic><topic>Watermark Image</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hwang, JinHa</creatorcontrib><creatorcontrib>Kim, JongWeon</creatorcontrib><creatorcontrib>Choi, JongUk</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hwang, JinHa</au><au>Kim, JongWeon</au><au>Choi, JongUk</au><au>Shi, Yun Qing</au><au>Jeon, Byeungwoo</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Reversible Watermarking Based on Histogram Shifting</atitle><btitle>Digital Watermarking</btitle><date>2006</date><risdate>2006</risdate><spage>348</spage><epage>361</epage><pages>348-361</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540488255</isbn><isbn>3540488251</isbn><eisbn>3540488278</eisbn><eisbn>9783540488279</eisbn><abstract>In this paper, we propose a reversible watermarking algorithm where an original image can be recovered from watermarked image data. Most watermarking algorithms cause degradation of image quality in original digital content in the process of embedding watermark. In the proposed algorithm, the original image can be obtained when the degradation is removed from the watermarked image after extracting watermark information. In the proposed algorithm, we utilize a peak point of image histogram and the location map and modify pixel values slightly to embed data. Because the peak point of image histogram and location map are employed in this algorithm, there is no need of extra information transmitted to receiving side. Also, because a slight modification on pixel values is conducted, highly imperceptibly images can be achieved. As locations of watermark embedding are identified using location map, amount of watermark data can dramatically increases through recursive embedding. Experimental results show that it can embed 5K to 130K bits of additional data.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11922841_28</doi><tpages>14</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0302-9743 |
ispartof | Digital Watermarking, 2006, p.348-361 |
issn | 0302-9743 1611-3349 |
language | eng |
recordid | cdi_pascalfrancis_primary_19105150 |
source | Springer Books |
subjects | Applied sciences Artificial intelligence Computer science control theory systems Exact sciences and technology Information Hiding Maximum Point Memory and file management (including protection and security) Memory organisation. Data processing Minimum Point Original Image Pattern recognition. Digital image processing. Computational geometry Software Watermark Image |
title | A Reversible Watermarking Based on Histogram Shifting |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T19%3A30%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20Reversible%20Watermarking%20Based%20on%20Histogram%20Shifting&rft.btitle=Digital%20Watermarking&rft.au=Hwang,%20JinHa&rft.date=2006&rft.spage=348&rft.epage=361&rft.pages=348-361&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540488255&rft.isbn_list=3540488251&rft_id=info:doi/10.1007/11922841_28&rft_dat=%3Cpascalfrancis_sprin%3E19105150%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540488278&rft.eisbn_list=9783540488279&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |