scholarly journals Cost-Effective Watermarking Scheme for Authentication of Digital Fundus Images in Healthcare Data Management

2021 ◽  
Vol 50 (4) ◽  
pp. 645-655
Author(s):  
George Klington ◽  
K Ramesh ◽  
Seifedine Kadry
Keyword(s):  
Data Management ◽  
Cost Effective ◽  
Fundus Images ◽  
Original Image ◽  
Image Size ◽  
Healthcare Data ◽  
Original Size ◽  
Value Decomposition ◽  
Watermarking Scheme ◽  
Mass Volume

This paper presents a cost-effective watermarking scheme for the authentication of healthcare data management. The digital fundus images are one particular class of medical images and it is widely used for screening mass population, identifying early symptoms of various diseases in healthcare. The mass volume of such data and its management requires an effective authentication scheme, while it is exchanged on an open network. The proposed scheme uses a watermarking technique to authenticate the digital fundus images. The watermark is generated concerning the portions of the original image using Singular value decomposition (SVD) and the remaining portions are used for embedding. The embedding process uses interleaving concepts across the red and blue planes of the original images to make the number of embedding as constant. The constant number of embedding is fixed for the original size of the given image to make the scheme as computationally cost-effective. The experiment showed the maximum capacity of the proposed scheme is 329960 bits for an image of size 565x584x3. It modifies 43% of the total number of embedded pixels against jittering attacks at an average. Comparative analysis showed that the proposed scheme uses only 1/3 of the original image size for embedding by retaining good imperceptibility of 54 dB. The net performance of the proposed scheme is found to be constant and it makes a scheme as cost-effective.

Robust Watermarking Scheme for GIS Vector Maps

2018 ◽  
Vol 31 (1) ◽  
pp. 277 ◽  
Author(s):  
Methaq Talib Gaata
Keyword(s):  
Main Idea ◽  
Geospatial Data ◽  
Robust Watermarking ◽  
Digital Map ◽  
Statistical Measures ◽  
Data Authentication ◽  
Two Factors ◽  
Illegal Copying ◽  
Value Decomposition ◽  
Watermarking Scheme

  With the fast progress of information technology and the computer networks, it becomes very easy to reproduce and share the geospatial data due to its digital styles. Therefore, the usage of geospatial data suffers from various problems such as data authentication, ownership proffering, and illegal copying ,etc. These problems can represent the big challenge to future uses of the geospatial data. This paper introduces a new watermarking scheme to ensure the copyright protection of the digital vector map. The main idea of proposed scheme is based on transforming  the digital map to frequently domain using the Singular Value Decomposition (SVD) in order to determine suitable areas to insert the watermark data. The digital map is separated into the isolated parts.Watermark data are embedded within the nominated magnitudes in each part when satisfied the definite criteria. The efficiency of proposed watermarking scheme is assessed within statistical measures based on two factors which are fidelity and robustness. Experimental results demonstrate the proposed watermarking scheme representing ideal trade off for disagreement issue between distortion amount and robustness. Also, the proposed scheme shows  robust resistance for many kinds of attacks.

scholarly journals Dual Zero-Watermarking Scheme for Two-Dimensional Vector Map Based on Delaunay Triangle Mesh and Singular Value Decomposition

2019 ◽  
Vol 9 (4) ◽  
pp. 642 ◽  
Author(s):  
Xu Xi ◽  
Xinchang Zhang ◽  
Weidong Liang ◽  
Qinchuan Xin ◽  
Pengcheng Zhang
Keyword(s):  
Singular Value Decomposition ◽  
Singular Value ◽  
Two Dimensional ◽  
Triangle Mesh ◽  
Vector Map ◽  
Vector Maps ◽  
Feature Sequence ◽  
Zero Watermarking ◽  
Value Decomposition ◽  
Watermarking Scheme

Digital watermarking is important for the copyright protection of electronic data, but embedding watermarks into vector maps could easily lead to changes in map precision. Zero-watermarking, a method that does not embed watermarks into maps, could avoid altering vector maps but often lack of robustness. This study proposes a dual zero-watermarking scheme that improves watermark robustness for two-dimensional (2D) vector maps. The proposed scheme first extracts the feature vertices and non-feature vertices of the vector map with the Douglas-Peucker algorithm and subsequently constructs the Delaunay Triangulation Mesh (DTM) to form a topological feature sequence of feature vertices as well as the Singular Value Decomposition (SVD) matrix to form intrinsic feature sequence of non-feature vertices. Next, zero-watermarks are obtained by executing exclusive disjunction (XOR) with the encrypted watermark image under the Arnold scramble algorithm. The experimental results show that the scheme that synthesizes both the feature and non-feature information improves the watermark capacity. Making use of complementary information between feature and non-feature vertices considerably improves the overall robustness of the watermarking scheme. The proposed dual zero-watermarking scheme combines the advantages of individual watermarking schemes and is robust against such attacks as geometric attacks, vertex attacks and object attacks.

scholarly journals A Pioneering Tactic for Sustainable Waste Management: Design of a Cost-Effective Recycling Machine

2018 ◽  
Vol 172 ◽  
pp. 03003
Author(s):  
A. Agarwal
Keyword(s):  
Waste Management ◽  
Rural Areas ◽  
General Public ◽  
Cost Effective ◽  
Force Analysis ◽  
Mechanical Advantage ◽  
Vital Importance ◽  
Project Study ◽  
Original Size ◽  
Assembly Operations

In this paper we discussed the new design, fabrication and testing of a mechanical can crusher taking into deliberation the force analysis and ergonomic factors that will enable people to use this mechanical can crusher especially in Botswana rural areas. The process of crushing cans is of vital importance as it saves a percentage of space for can disposal and also makes it easier for these cans to be transported to recycling centers or landfill areas. The methods and processes used to bring this project to life include welding, cutting, bending, drilling and assembly operations. This project study is mainly about generating a new concept of a mechanical can crusher that is compact to transport from one location to another and makes can crushing easy and fascinating to the general public so as to promote people buy into crushing in Sub-Sahara market. Even though there are numerous sorts of the mechanical would crusher be able to as of now in presence, this model provides a more practical usage than previous one with the desired mechanical advantage of 10, machinability to crush the entire cans to 25% of their original size and 100% efficiency for the entire rounds.

NOVEL SELF-REFERENCE BASED IMAGE WATERMARKING SCHEME

2010 ◽  
Vol 19 (02) ◽  
pp. 491-502 ◽  
Author(s):  
YONG-GANG FU ◽  
RUIMIN SHEN
Keyword(s):  
Image Watermarking ◽  
Extraction Process ◽  
Jpeg Compression ◽  
Reference Image ◽  
Original Image ◽  
Quantization Step ◽  
Dct Transform ◽  
Gray Level Image ◽  
Watermarking Scheme ◽  
Self Reference

In this paper, a novel image watermarking scheme based on a self-reference technique is proposed. The meaningful watermark is embedded into a gray-level image according to the relation between the constructed reference image and the original host. In order to be robust against Jpeg compression, the reference image should be robust under Jpeg compression. Firstly, the original image is transformed into DCT domain; and then most of the high frequency coefficients are omitted; after the quantization step and inverse DCT transform, we can obtain a robust reference. By considering the relation between the original image and its reference, we can embed the watermark into the host. The watermark extraction process is oblivious. Experimental results under several attacks show good robustness of the proposed scheme. Especially under cropping and Jpeg compression attacks, the watermark can be extracted with only few errors.

Sign in / Sign up

Export Citation Format

Share Document