In this paper, we first designed Huffman code (HC)-based absolute moment block truncation coding (AMBTC). Then, applied (AMBTC) to design a pixel pair-wise fragile image watermarking method. Pixel tampering detection and content recovery mechanisms were collaboratively in the proposed scheme enhance readability even when images have been tampered with. Representative features are derived from o...

We study the amount of knowledge about the future that an online algorithm needs to color the edges of a graph optimally (i.e. using as few colors as possible). Assume that along with each edge, the online algorithm receives a fixed number of advice bits. For graphs of maximum degree ∆, it follows from Vizing’s Theorem that ⌈log(∆+ 1)⌉ bits per edge suffice to achieve optimality. We show that e...

In this paper, we present some attacks on GAGE, InGAGE, and CiliPadi which are candidates of the first round of the NIST-LWC competition. GAGE and InGAGE are lightweight sponge based hash function and Authenticated Encryption with Associated Data (AEAD), respectively and support different sets of parameters. The length of hash, key, and tag are always 256, 128, and 128 bits, respec...

This paper describes a supervised system for pixel-level change detection for fixed, monocular surveillance cameras. Per-pixel intensity sequences are modeled by a class of Hidden Semi-Markov Models, Duration Dependent Hidden Markov Models (DDHMMs), to accurately account for stochastically periodic phenomena prevalent in real-world video. The per-pixel DDHMMs are used to assign discrete state l...

A Monte Carlo method is presented for checking when a multivariate formal (noncommuting variables) polynoial vanishes. The method uses O(n) random bits to achieve an error upper bound of 1=2, where n is the total degree of the polynomial. It is applied to produce a certiicate of a digital image which for an error upper bound of 1=2 has size O(n + q) log(n + q)) bits where n is the image resolut...

In this paper, a simple hierarchical fragile watermarking scheme for image authentication is proposed. The important features and parity bits of an image are embedded by modifying the pixel value of the host image. Once an image is tampered by other users or corrupted by transmission, the parity bits and important features can be used to detect and recover the image. The method is effective bec...

In this paper, a new approach of image steganography using twodimensional Cellular Automata (2D-CA) has been proposed for a confidential message. We convert the message in such a way that message length becomes 1024 bits after padding some bits. If message size is more than 1024 bits, we subdivide the message of length 1024 bits using padding technique. Convert original message by XORing with s...