Volume 08 Issue 01, JANUARY 2020

Improving Image Imperceptibility Based on Block Histogram Shifting Technique and SRDHHT

Shalini Soni, Prof. Aishwaryai Vishwakarma

Page no:01-05


Image processing processes our area and field with many problems, and with digital image data increasing rapidly from the exchange of digital data and the increased use of digital images, it is important to protect confidential image data from illegitimate access. Recently, more attention is given to reversible hidden data (RDH) in encrypted images, as it has the excellent property that the first image cover often overlaps to recover after the integrated data is extracted while protecting Image content as confidential. This procedure uses the differential pixel function to embed more data than other random partitions using the block-based image sharpness, filtering, and refining approach with singlelevel wavelet decomposition shift techniques to stop image distortion problems. Transforms the content of the last image into the content of another image object of equivalent size. The transformed image, which resembles the target image, is used because the "image is encrypted" and subcontracted to the cloud. Therefore, the cloud server can simply integrate data into the "encrypted image" using any RDH method for plain text images to propose a secure reversible watermark technique for digital images using histogram change methods. Additional security is provided through watermarks provided with encryption. The watermark is provided encrypted and sequenced before the image embedding is digital. In addition, the block-based technique is evaluated for greater watermark capacity. The technical results are compared with the idea of MSE and PSNR. In our experience, watermark data is integrated into the first images using the Mat simulation laboratories. This document is presented using the technique of the old EBHT method and our digital watermark image method with proposed histogram change supports special and frequency domains, showing that spatial domain techniques provide image watermark security and recovery Watermark with better PSNR values compared to a frequency domain Improved impeccability supports technical changes of histogram block and proposed techniques.

Error Minimization, Analysis Based on Positioning Methods in Wireless Sensor Network: Review

Anuj Sharma, Sandeep Rai

Page no:06-10


Wireless sensor networks and location are also an important aspect in the field of wireless sensor networks (WSN) that have developed important research interests between the academic world and research communities. The wireless sensor network is made up of a gigantic number of limited, low-energy and small processing capacities, and low-cost sensors that communicate with each other in ad-hoc mode, target tracking and, therefore, the task to determine the number of node positions or sensor nodes in. WSNs understood as location or position. This work aims to determine the situation of the sensor nodes with high accuracy and precision of position accuracy for various varied applications, different location methods used in different applications and there are several challenges in some special scenarios such as fire detection, The initial part in this work it is applied to the location of the nodes using node or device proposals in AWSN and obtaining device estimates when knowing a minimum of position values of the dye nodes that must be remembered in absolute position values in the network where the sensor nodes not fixed in WSN. The algorithm is known as Minimum RSSI Error. The analysis of the results obtained by simulation shows that the method of locating the proposed algorithm works better than the RSSI technique in terms of probability rate errors with a variable number of known sensors and the search for larger locations minimizing fault and thus obtain the optimal result. The basic challenge during a wireless sensor network is the location.

Keywords: Wireless Sensor Network, localization, Global Positioning System, RSSI, Sensor Node, MAE , MRE.