Cell phone cameras have small apertures, which limits the number of photons they can gather, leading to noisy images in low light. They also have small sensor pixels, which limits the number of electrons each pixel can store, leading to limited dynamic range. We describe a computational photography pipeline that captures, aligns, and merges a burst of frames to reduce noise and increase dynamic...

The development of computer assisted diagnosis (CAD) techniques and direct digital mammography systems have generated significant interest in the issue of the effect of image resolution on the detection and classification (benign vs malignant) of mammographic abnormalities. CAD in particular seems to heavily depend on image resolution, either due to the inherent algorithm design and optimizatio...

—In this paper, A new image steganography scheme is proposed which is a kind of spatial domain technique. In order to hide secret data in cover-image, the first component alteration technique is used. Techniques used so far focuses only on the two or four bits of a pixel in a image (at the most five bits at the edge of an image) which results in less peak to signal noise ratio and high root mea...

In the exploiting modification direction (EMD) method, a secret digit in (2n+1)-ary notational system is embedded into a group that is consisted of n pixels. Only one pixel in a group at most is being modified by either increasing or decreasing one. Therefore, the maximum embedding rate of EMD method is (log2(2n+1))/n when n≧2. In order to increase the embedding capacity of EMD method, a new ad...

We will show that • the entropy for a random variable gives a lower bound on the number of bits needed per character for a binary coding • Huffman codes are optimal in the average number of bits used per character among binary codes • the average bits per character used by Huffman codes is close to the entropy of the underlying random variable • one can get arbitrarily close to the entropy of a...

Multi-sample anti-aliasing is a popular technique for reducing geometric aliasing (jagged edges) and is supported in all modern graphics processors. With multi-sampling anti-aliasing, visibility and depth are sampled more than once per pixel, while shading is done only once per pixel per primitive. Although this significantly reduces the appearance of jagged edges around object boundaries, the ...

ABSTRACT This paper proposes a block-wise fragile watermarking scheme based on k-medoids clustering approach. Proposed scheme is effective enough to reconstruct the tampered extensive content of an image. According to the suggested algorithm, first of all image is divided into the blocks and forty eight bits are calculated for each block, which consist of forty five Recovery bits and three Auth...

A new reversible watermark scheme based on eight prediction modes is presented. In each of eight prediction modes, any modification to some pixels which account for one-fourth of all pixels is not allowed for a single embedding process. By employing smartly these unchanged pixels, each to-be-predicted pixel in any mode is guaranteed to be surrounded by several pixels which constitute a local ne...

When imperceptibility is an issue, data-hiding techniques typically become limited to small payloads. In this paper, a novel scheme proposed that allows embedding large payloads while maintaining high stego-image quality. The utilizes N×N sub-block for constructing reference matrix as secret key the symmetric and extraction of data from grayscale cover image, where N positive integer greater th...