scholarly journals Data hiding using bit plane complexity segmentation steganography

2018 ◽  
Vol 7 (2.20) ◽  
pp. 33
Author(s):  
M Chandra Sekhar ◽  
S K. Chandini ◽  
V Sai Rohith ◽  
V Jhansi Lakshmi ◽  
M Pavan Kumar
Keyword(s):  
Data Hiding ◽  
Image Data ◽  
Limited Data ◽  
Information Measures ◽  
Bit Plane ◽  
Bit Planes ◽  
Human Attributes ◽  
Cover Up

Steganography is the basis of information covering the puzzle in some other data (we call it the ship), leaving no obvious evidence of data change. Most conventional steganographic strategies is limited data that hide the limit. They can cover up just 10% (or less) of the information measures of the vessel. This is on the grounds that the standard of those procedures was either to supplant an uncommon piece of the recurrence parts of the vessel picture, or to supplant all the slightest critical image bits with a secret multi-valued data. Our new Steganography uses the image as vessel information, and we enter the data in the bit-plane mystery vessel. This strategy makes use of human attributes, through which people cannot see the structure of any form of data exclusively damned pair, for example. We can replace most of the «Commotion like" regions in the bit-planes of the puzzle vessel image data without deteriorating the quality of the photos. We called our steganography "BPCS-steganography," which remains a Bit-Plane Complexity Segmentation steganography.  

scholarly journals DIGDH: A Novel Framework of Difference Image Grafting Deep Hiding for Image Data Hiding

Symmetry ◽  
2022 ◽  
Vol 14 (1) ◽  
pp. 151
Author(s):  
Xintao Duan ◽  
Lei Li ◽  
Yao Su ◽  
Wenxin Wang ◽  
En Zhang ◽  
...  
Keyword(s):  
Neural Networks ◽  
Data Hiding ◽  
Deep Neural Networks ◽  
Random Distribution ◽  
Image Data ◽  
Experimental Results ◽  
The Real ◽  
Difference Image ◽  
Audio Media

Data hiding is the technique of embedding data into video or audio media. With the development of deep neural networks (DNN), the quality of images generated by novel data hiding methods based on DNN is getting better. However, there is still room for the similarity between the original images and the images generated by the DNN models which were trained based on the existing hiding frameworks to improve, and it is hard for the receiver to distinguish whether the container image is from the real sender. We propose a framework by introducing a key_img for using the over-fitting characteristic of DNN and combined with difference image grafting symmetrically, named difference image grafting deep hiding (DIGDH). The key_img can be used to identify whether the container image is from the real sender easily. The experimental results show that without changing the structures of networks, the models trained based on the proposed framework can generate images with higher similarity to original cover and secret images. According to the analysis results of the steganalysis tool named StegExpose, the container images generated by the hiding model trained based on the proposed framework is closer to the random distribution.

scholarly journals Security Analysis of Bit plane Level Image Encryption Schemes

2021 ◽  
Vol 71 (2) ◽  
pp. 209-221
Author(s):  
Ram Ratan ◽  
Arvind Yadav
Keyword(s):  
Image Encryption ◽  
Data Security ◽  
Security Analysis ◽  
Image Data ◽  
Encryption Scheme ◽  
Mobile Environments ◽  
Least Significant Bit ◽  
Encryption Schemes ◽  
Bit Plane ◽  
Bit Planes

A selective bit-plane encryption scheme was proposed for securing the transmission of image data in mobile environments with a claim that it provides a high security viz. the encryption of the four most significant bit-planes is sufficient for a high image data security. This paper presents the security analysis of the said encryption scheme and reports new important results. We perform the security analysis of the bit-level encryption by considering the normal images and their histogram equalised enhanced images. We consider different bit-plane aspects to analyse the security of the image encryption, and show that the encryption of the four most significant bit-planes is not adequate. The contents of the images can be obtained even when all the bit-planes except one least significant bit-plane are encrypted in the histogram equalised images as shown in the results. The bit-plane level security analysis seems very useful for the analysis of the bit-plane level image encryption schemes.

scholarly journals Data Hiding Method for Color AMBTC Compressed Images Using Color Difference

2021 ◽  
Vol 11 (8) ◽  
pp. 3418
Author(s):  
Cheonshik Kim ◽  
Dongkyoo Shin ◽  
Chingnung Yang ◽  
Lu Leng
Keyword(s):  
Data Hiding ◽  
Copyright Protection ◽  
Color Image ◽  
Color Difference ◽  
Adjustment Process ◽  
Absolute Moment ◽  
Compressed Images ◽  
Secret Communication ◽  
Bit Plane

Image compression technology and copyright protection are certainly the important technologies for free exchange of multimedia. For compression of an image, we propose a color Absolute Moment Block Trucation Coding (AMBTC) method using a common bit-plane created by k-means. In addition, a data hiding method based on a color AMBTC using Optimal Pixel Adjustment Process (OPAP) was proposed for copyright protection and confidential secret communication. The number of quantization levels of the proposed color AMBTC is nine per block. Therefore, the edge of the compressed color image can be expressed more delicately. As a result of the simulation, it can be seen that the edge of the image of the color AMBTC is close to the original image. Moreover, the data hiding performance of the proposed method also obtained excellent results. For the experiment, we measured the quality of the image using the Color Difference (CD) we proposed, and the measurement result was very satisfactory.

scholarly journals An Embedded Data Using Slantlet Transform

2011 ◽  
Vol 8 (3) ◽  
pp. 840-848
Author(s):  
Baghdad Science Journal
Keyword(s):  
Data Hiding ◽  
Wavelet Transforms ◽  
Image Data ◽  
Scaling Factor ◽  
Discrete Wavelet ◽  
Discrete Wavelet Transforms ◽  
Extra Information ◽  
Hidden Data ◽  
Common Signal

Data hiding is the process of encoding extra information in an image by making small modification to its pixels. To be practical, the hidden data must be perceptually invisible yet robust to common signal processing operations. This paper introduces a scheme for hiding a signature image that could be as much as 25% of the host image data and hence could be used both in digital watermarking as well as image/data hiding. The proposed algorithm uses orthogonal discrete wavelet transforms with two zero moments and with improved time localization called discrete slantlet transform for both host and signature image. A scaling factor ? in frequency domain control the quality of the watermarked images. Experimental results of signature image recovery after applying JPEG coding to the watermarking image are included.

Robust image data hiding method based on multiple backups and pixel bit weight

2021 ◽  
pp. 1-14
Author(s):  
Yu Dong ◽  
Xianquan Zhang ◽  
Chunqiang Yu ◽  
Zhenjun Tang ◽  
Guoen Xia
Keyword(s):  
Data Hiding ◽  
Digital Images ◽  
Image Data ◽  
Experimental Results ◽  
Cover Image ◽  
Secret Image ◽  
Robust Image ◽  
Reference Matrix ◽  
Least Significant Bits

Digital images are easily corrupted by attacks during transmission and most data hiding methods have limitations in resisting cropping and noise attacks. Aiming at this problem, we propose a robust image data hiding method based on multiple backups and pixel bit weight (PBW). Especially multiple backups of every pixel bit are pre-embedded into a cover image according to a reference matrix. Since different pixel bits have different weights, the most significant bits (MSBs) occupy more weights on the secret image than those of the least significant bits (LSBs). Accordingly, some backups of LSBs are substituted by the MSBs to increase the backups of MSBs so that the quality of the extracted secret image can be improved. Experimental results show that the proposed algorithm is robust to cropping and noise attacks for secret image.

Resistance to Lettuce Infectious Yellows Virus in Melon

HortScience ◽  
1998 ◽  
Vol 33 (3) ◽  
pp. 534b-534
Author(s):  
James D. McCreight
Keyword(s):  
Cucumis Melo ◽  
Dominant Gene ◽  
Field Tests ◽  
Single Dominant Gene ◽  
Limited Data ◽  
Sweetpotato Whitefly ◽  
Sources Of Resistance ◽  
Lettuce Infectious Yellows Virus ◽  
Greenhouse Tests

Yellowing of melon (Cucumis melo L.) incited by lettuce infectious yellows virus (LIYV) reduces yield and fruit quality of infected plants. LIYV is transmitted only by the sweetpotato whitefly (Bemisia tabaci Genn.). Two naturally infected field tests indicated several potential sources of resistance to LIYV. PI 124112 and `Snake Melon' had mild symptoms in both field tests whereas PI 313970 was asymptomatic in the test in which it was included. In greenhouse tests using controlled inoculation, PI 313970 was asymptomatic, had negative ELISA assays for LIYV, and was negative for LIYV in serial transfers to Chenopodium. `Top Mark' and `PMR 5' were symptomatic, had positive ELISA assays for LIYV, and were positive for LIYV in serial transfers to Chenopodium in these greenhouse tests. Limited data indicate that resistance in PI 313970 is conditioned by a single, dominant gene.

scholarly journals Fast Multi-Focus Fusion Based on Deep Learning for Early-Stage Embryo Image Enhancement

Sensors ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 863
Author(s):  
Vidas Raudonis ◽  
Agne Paulauskaite-Taraseviciene ◽  
Kristina Sutiene
Keyword(s):  
Deep Learning ◽  
Image Fusion ◽  
Early Stage ◽  
Image Data ◽  
Cell Detection ◽  
Processing Times ◽  
Fused Image ◽  
Stage Embryo ◽  
Early Stage Embryo

Background: Cell detection and counting is of essential importance in evaluating the quality of early-stage embryo. Full automation of this process remains a challenging task due to different cell size, shape, the presence of incomplete cell boundaries, partially or fully overlapping cells. Moreover, the algorithm to be developed should process a large number of image data of different quality in a reasonable amount of time. Methods: Multi-focus image fusion approach based on deep learning U-Net architecture is proposed in the paper, which allows reducing the amount of data up to 7 times without losing spectral information required for embryo enhancement in the microscopic image. Results: The experiment includes the visual and quantitative analysis by estimating the image similarity metrics and processing times, which is compared to the results achieved by two wellknown techniques—Inverse Laplacian Pyramid Transform and Enhanced Correlation Coefficient Maximization. Conclusion: Comparatively, the image fusion time is substantially improved for different image resolutions, whilst ensuring the high quality of the fused image.

scholarly journals Security Analysis and Improvement of an Image Encryption Cryptosystem Based on Bit Plane Extraction and Multi Chaos

Entropy ◽  
2021 ◽  
Vol 23 (5) ◽  
pp. 505
Author(s):  
Shuqin Zhu ◽  
Congxu Zhu
Keyword(s):  
Image Encryption ◽  
Random Sequence ◽  
Security Analysis ◽  
Encryption Algorithm ◽  
Original Algorithm ◽  
Plane Extraction ◽  
Bit Plane ◽  
Bit Planes ◽  
And Diffusion ◽  
Improved Algorithm

This paper analyzes the security of image encryption systems based on bit plane extraction and multi chaos. It includes a bit-level permutation for high, 4-bit planes and bit-wise XOR diffusion, and finds that the key streams in the permutation and diffusion phases are independent of the plaintext image. Therefore, the equivalent diffusion key and the equivalent permutation key can be recovered by the chosen-plaintext attack method, in which only two special plaintext images and their corresponding cipher images are used. The effectiveness and feasibility of the proposed attack algorithm is verified by a MATLAB 2015b simulation. In the experiment, all the key streams in the original algorithm are cracked through two special plaintext images and their corresponding ciphertext images. In addition, an improved algorithm is proposed. In the improved algorithm, the generation of a random sequence is related to ciphertext, which makes the encryption algorithm have the encryption effect of a “one time pad”. The encryption effect of the improved algorithm is better than that of the original encryption algorithm in the aspects of information entropy, ciphertext correlation analysis and ciphertext sensitivity analysis.

scholarly journals 225Actinium-labeled prostate-specific membrane antigen targeting peptide induces complete response in a metastatic prostate cancer patient

2021 ◽  
Vol 10 (5) ◽  
pp. 205846012110225
Author(s):  
Omer Aras ◽  
Stefan Harmsen ◽  
Richard Ting ◽  
Haluk B Sayman
Keyword(s):  
Prostate Cancer ◽  
Standard Of Care ◽  
Complete Response ◽  
Prostate Specific Membrane Antigen ◽  
Limited Data ◽  
Castrate Resistant Prostate Cancer ◽  
Targeting Peptide ◽  
Castrate Resistant ◽  
Specific Membrane

Targeted radionuclide therapy has emerged as a promising and potentially curative strategy for high-grade prostate cancer. However, limited data are available on efficacy, quality of life, and pretherapeutic biomarkers. Here, we highlight the case of a patient with prostate-specific membrane antigen (PSMA)-positive metastatic castrate-resistant prostate cancer who displayed complete response to 225Ac-PSMA-617 after having been resistant to standard-of-care therapy, then initially partially responsive but later resistant to subsequent immunotherapy, and resistant to successive 177Lu-PSMA-617. In addition, the patient’s baseline germline mutation likely predisposed him to more aggressive disease.

scholarly journals Image data of crumb structure of bread from flour of czech spring wheat cultivars

2011 ◽  
Vol 22 (No. 4) ◽  
pp. 133-142 ◽  
Author(s):  
I. Švec ◽  
M. Hrušková
Keyword(s):  
Image Analysis ◽  
Image Data ◽  
Analysis Data ◽  
Wheat Cultivars ◽  
Rheological Measurements ◽  
Class A ◽  
Bread Volume ◽  
Class B ◽  
Crumb Structure

Abstract: Baking quality of flour from six wheat cultivars (harvest 2002 and 2003), belonging to the quality classes A and B, was evaluated using the fermented dough test. Analytical traits of kernel and flour showed differences between the classes which were confirmed by the baking test with the full-bread-formula according to Czech method. In addition to standard methods of the bread parameters description (specific bread volume and bread shape measurements) rheological measurements of penetrometer and image analysis were used in effort to differentiate wheat samples into the quality classes. The results of the baking test proved significant differences in specific bread volumes – the highest volume in class A was obtained with the cultivar Vinjet and in class B with SG-S1098 – approx. 410 and 420 ml/100 g. Although significant correlations among image analysis data and specific bread volume having been proved, any image analysis parameter did not distinguish the quality classes. Only the penetronetric measurements made with bread crumb were suitable for such purpose (r = 0.9083; for  = 0.01). Among image analysis data the total cell area of the crumb had the strongest correlation with specific bread volume (r = 0.7840; for α = 0.01).    

Sign in / Sign up

Export Citation Format

Share Document