Learning to hash has become a crucial technique for big data analytics. Among existing methods, supervised learning approaches play an important role as they can produce compact codes and enable semantic search. However, the size of an instancepairwise similarity matrix used in most supervised hashing methods is quadratic to the size of labeled training data, which is very expensive in terms of...

In this paper, a general concept called n+k/n method is introduced. In n+k/n method, a special mapping function is defined to map an intermediate set with n+k bits into n bits information set. In the embedding process, the intermediate set is embedded into cover image rather than embedding the information set. If the distance between the features of cover image and the bits of intermediate set ...

− This paper describes two methods for economical test of dynamic parameters ADCs in embedded Data Acquisition Systems. First method is Exponential Fit Test, second method is Wobbler Test. Common testing methods are mentioned as far the accuracy and time necessary for the complete test are concerned. The tests for fast evaluation of the dependence of an effective number of bits on frequency of ...

In today's digital age, security and safe communication are necessities. Applications frequently transport large amounts of private data as binary images. This research proposes a unique scheme that uses cover pattern histogram-based decision tree for information concealment extraction from aims to provide data-hiding approach with capacity concealment, possible minor distortion, security, diff...

The eventual goal of steganalytic forensic is to extract the hidden messages embedded in steganographic images. A promising technique that addresses this problem partially is steganographic payload location, an approach to reveal the message bits, but not their logical order. It works by finding modified pixels, or residuals, as an artifact of the embedding process. This technique is successful...

The joint data-hiding and compression scheme for digital images technique is carried out using the sidematch vector quantization and image inpainting techniques. Data hiding and image compression are integrated into one single module. At the sender side, the blocks in the leftmost and topmost of the image are by default considered as complex blocks and are compressed using VQ technique and the ...

In this paper, we propose two blind adaptive audio watermarking schemes based on complex cepstrum transform (CCT) domain features. In first scheme (SchemeI), each audio segment is divided into two subsets having approximately same statistical mean value using down-sampling method. Since the human auditory system (HAS) is not much sensitive to the minute change of the wavelet high-frequency comp...

This paper introduces a novel robust watermarking scheme for digital images, which is robust against common signal processing and geometric distortion attacks. In order to be resistant to geometric distortion attacks, the matched feature points determined by the scale-invariance feature transform (SIFT) are used for image restoration to reduce the synchronization errors caused by geometric dist...

Recently, several reversible information hiding methods based PVO (pixel value ordering) techniques have been proposed, in these methods, secret data always are embedded in pixels with largest or smallest value in the block. In order to make use of the block with multiple largest-valued (or smallest-valued) pixels, a PVO-K method was proposed, which treats K largest-valued (or smallest-valued) ...

Steganography is the concept of embedding information in such a way that its existence is concealed. In this paper we have shown one of the techniques used in Steganography to hide information and deliver the message to the end user using Bit-planes without any loss of data. The method used is to replace lowest 3 or 4 LSB with message bits or image data (assume 8 bit values). We do this method ...