نتایج جستجو برای: color watermarking algorithm

تعداد نتایج: 866166  

2002
Mehmet Kivanç Mihçak Ramarathnam Venkatesan Mustafa Kesal

Assume that we are given a watermark (wm) embedding algorithm that performs well against generic benchmark-type attacks that comprise of simple operations that are independent of the algorithm and generally of the input as well. A natural question then is to ask for a nearly perfect cryptanalytic attack for the specific watermarking method. In this paper we present and analyze an attack on a st...

2014
Jingbing Li Yaoli Liu Jiling Zhong

Applying digital watermarking technique for the security protection of medical information systems is a hotspot of research in recent years. In this paper, we present a robust watermarking algorithm for medical volume data using 3D DWT-DCT and Logistic Map. After applying Logistic Map to enhance the security of watermarking, the visual feature vector of medical volume data is obtained using 3D ...

2013
YONG YONG YI RAN

This paper proposed a digital watermarking algorithm based on discrete wavelet transform (DWT), which can achieve the purpose of embedding hidden watermarks by decompose three-level wavelet of image and decompose bit-plane of watermarking gray scale image by Arnold scrambling transformation. Layer adaptive threshold and quantizer were referenced in this algorithm, and which adaptive selected co...

2009
Sahasan Naraharisetti Saraju P. Mohanty Krishna Kavi Sandra L. Terrell

The multimedia revolution has made a strong impact on our society. The explosive growth of the Internet, the access to this digital information generates new opportunities and challenges. The ease of editing and duplication in digital domain created the concern of copyright protection for content providers. Various schemes to embed secondary data in the digital media are investigated to preserv...

2005
Florence Denis Guillaume Lavoué Florent Dupont Atilla Baskurt

This paper presents a robust watermarking algorithm applied to 3D compressed polygonal meshes. Copyright protection of 3D models becomes very important for many applications using public networks. As some recent compression techniques allow very high compression rates, it is of interest to verify that watermarking techniques support this kind of attack. In this paper we present the complete sch...

2012
Basant Kumar Animesh Anand S. P. Singh Anand Mohan

This paper presents a new spread-spectrum watermarking algorithm for digital images in discrete wavelet transform (DWT) domain. The algorithm is applied for embedding watermarks like patient identification /source identification or doctors signature in binary image format into host digital radiological image for potential telemedicine applications. Performance of the algorithm is analysed by va...

2007
Hyoung-Joong Kim Shijun Xiang Subhamoy Maitra

The patchwork watermarking scheme is investigated in this chapter. The performance of this algorithm in terms of imperceptibility, robustness and security has been shown to be satisfactory. Robustness of the patchwork algorithm to the curve-fitting attack and blind multipleembedding attack is presented also in this chapter. Robustness against jitter attack which is a natural enemy of this water...

2011
Baisa L. Gunjal

A good quality watermarking scheme should have maximum PSNR, ideally Correlation Factor equals to 1 and should have maximum watermark information hiding capacity. In this paper, a robust digital color image watermarking scheme based on ‘Discrete Wavelet Transform’ is implemented. The RGB color space is converted into YUV color space and then V component is selected for watermark embedding. The ...

2015
Feng Liu Hao Feng

In this paper, a novel blind color image watermarking technique using Quaternion and Joint QSVD Blocks is proposed to protect the intellectual property rights of color images. The proposed method tries to insert the watermark in the joint blocks .In this method, the color image is considered as an array of pure quaternion numbers. Then the array of pure quaternion is divided into non-overlappin...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید

function paginate(evt) { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term pg=parseInt(evt.target.text) var data={ "year":filter_year, "term":term, "pgn":pg } filtered_res=post_and_fetch(data,url) window.scrollTo(0,0); } function update_search_meta(search_meta) { meta_place=document.getElementById("search_meta_data") term=search_meta.term active_pgn=search_meta.pgn num_res=search_meta.num_res num_pages=search_meta.num_pages year=search_meta.year meta_place.dataset.term=term meta_place.dataset.page=active_pgn meta_place.dataset.num_res=num_res meta_place.dataset.num_pages=num_pages meta_place.dataset.year=year document.getElementById("num_result_place").innerHTML=num_res if (year !== "unfilter"){ document.getElementById("year_filter_label").style="display:inline;" document.getElementById("year_filter_place").innerHTML=year }else { document.getElementById("year_filter_label").style="display:none;" document.getElementById("year_filter_place").innerHTML="" } } function update_pagination() { search_meta_place=document.getElementById('search_meta_data') num_pages=search_meta_place.dataset.num_pages; active_pgn=parseInt(search_meta_place.dataset.page); document.getElementById("pgn-ul").innerHTML=""; pgn_html=""; for (i = 1; i <= num_pages; i++){ if (i===active_pgn){ actv="active" }else {actv=""} pgn_li="
  • " +i+ "
  • "; pgn_html+=pgn_li; } document.getElementById("pgn-ul").innerHTML=pgn_html var pgn_links = document.querySelectorAll('.mypgn'); pgn_links.forEach(function(pgn_link) { pgn_link.addEventListener('click', paginate) }) } function post_and_fetch(data,url) { showLoading() xhr = new XMLHttpRequest(); xhr.open('POST', url, true); xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8'); xhr.onreadystatechange = function() { if (xhr.readyState === 4 && xhr.status === 200) { var resp = xhr.responseText; resp_json=JSON.parse(resp) resp_place = document.getElementById("search_result_div") resp_place.innerHTML = resp_json['results'] search_meta = resp_json['meta'] update_search_meta(search_meta) update_pagination() hideLoading() } }; xhr.send(JSON.stringify(data)); } function unfilter() { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":"unfilter", "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } function deactivate_all_bars(){ var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(bar) { bar.dataset.active = false bar.style = "stroke:#71a3c5;" }) } year_chart.on("created", function() { var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(check) { check.addEventListener('click', checkIndex); }) }); function checkIndex(event) { var yrchart = document.querySelectorAll('.ct-bar'); var year_bar = event.target if (year_bar.dataset.active == "true") { unfilter_res = unfilter() year_bar.dataset.active = false year_bar.style = "stroke:#1d2b3699;" } else { deactivate_all_bars() year_bar.dataset.active = true year_bar.style = "stroke:#e56f6f;" filter_year = chart_data['labels'][Array.from(yrchart).indexOf(year_bar)] url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":filter_year, "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } } function showLoading() { document.getElementById("loading").style.display = "block"; setTimeout(hideLoading, 10000); // 10 seconds } function hideLoading() { document.getElementById("loading").style.display = "none"; } -->