CHAPTER 1 INTRODUCTION 1.

Introduction to Digital Image Processing:
   Vision allows humans to perceive and understand the world surrounding us. Computer vision aims to duplicate the effect of human vision by electronically perceiving and understanding an image. Giving computers the ability to see is not an easy task - we live in a three dimensional (3D) world, and when computers try to analyze objects in 3D space, available visual sensors (e.g., TV cameras) usually give two dimensional (2D) images, and this projection to a lower number of dimensions incurs an enormous loss of information.    In order to simplify the task of computer vision understanding, two levels are usually distinguished; low-level image processing and high level image understanding. Usually very little knowledge about the content of images High level processing is based on knowledge, goals, and plans of how to achieve those goals. Artificial intelligence (AI) methods are used in many cases. High-level computer vision tries to imitate human recognition and the ability to make decisions according to the information contained in the image.   This course deals almost exclusively with low-level image processing, high level in which is a continuation of this course. Age processing is discussed in the course Image Analysis and Understanding, which is a continuation of this course.

1.1 History:
Many of the techniques of digital image processing, or digital picture processing as it was often called, were developed in the 1960s at the Jet Propulsion Laboratory, MIT, Bell Labs, University of Maryland, and few other places, with application to satellite imagery, wire photo standards conversion, medical imaging, videophone, character recognition, and photo enhancement. But the cost of processing was fairly high with the computing equipment of that era. In the 1970s, digital image processing proliferated, when cheaper computers Creating a film or electronic image of any picture or paper form. It is accomplished by scanning or photographing an object and turning it into a matrix of dots (bitmap), the meaning of which is unknown to the computer, only to the human

viewer. Scanned images of text may be encoded into computer data (ASCII or EBCDIC) with page recognition software (OCR).

1.2 Basic Concepts:
 

A signal is a function depending on some variable with physical meaning. Signals can be
o o o o

One-dimensional (e.g., dependent on time), Two-dimensional (e.g., images dependent on two co-ordinates in a plane), Three-dimensional (e.g., describing an object in space), Or higher dimensional.

1.3 Pattern recognition
Pattern recognition is a field within the area of machine learning. Alternatively, it can be defined as "the act of taking in raw data and taking an action based on the category of the data" . As such, it is a collection of methods for supervised learning. Pattern recognition aims to classify data (patterns) based on either a priori knowledge or on statistical information extracted from the patterns. The patterns to be classified are usually groups of measurements or observations, defining points in an appropriate multidimensional space. Are to represent, for example, color images consisting of three component colors.

1.4 Image functions:
 

The image can be modeled by a continuous function of two or three variables; Arguments are co-ordinates x, y in a plane, while if images change in time a third variable t might be added.

 

The image function values correspond to the brightness at image points. The function value can express other physical quantities as well (temperature, pressure distribution, distance from the observer, etc.).

The brightness integrates different optical quantities - using brightness as a basic quantity allows us to avoid the description of the very complicated process of image formation.

The image on the human eye retina or on a TV camera sensor is intrinsically 2D. We shall call such a 2D image bearing information about brightness points an intensity image.

  

The real world, which surrounds us, is intrinsically 3D. The 2D intensity image is the result of a perspective projection of the 3D scene. When 3D objects are mapped into the camera plane by perspective projection a lot of information disappears as such a transformation is not one-to-one.

 

Recognizing or reconstructing objects in a 3D scene from one image is an ill-posed problem. Recovering information lost by perspective projection is only one, mainly geometric, problem of computer vision.

The second problem is how to understand image brightness. The only information available in an intensity image is brightness of the appropriate pixel, which is dependent on a number of independent factors such as
o

Object surface reflectance properties (given by the surface material, microstructure and marking),

o O

Illumination properties, And object surface orientation with respect to a viewer and light source.

CHAPTER 2 2. DIGITAL IMAGE FORENSICS
Today's technology allows digital media to be altered and manipulated in ways that were impossible twenty years ago. We are feeling the impact of this technology in nearly every corner of our lives, from the courts to the media, politics, business, and science. As this technology continues to evolve it will become increasingly more important for the science of digital forensics to keep pace. This presentation will describe state of the art techniques in digital image forensics. Digital watermarking has been proposed as a means by which an image can be authenticated. This approach works by inserting at the time of recording an imperceptible digital code (a watermark) into the image. With the assumption that tampering will alter a watermark, an image can be authenticated by verifying that the extracted watermark is the same as that which was inserted. The major drawback of this approach is that a watermark must be inserted at precisely the time of recording, which limits this approach to specially equipped digital cameras. In contrast, recent advances in digital forensics operate in the absence of any watermark or specialized hardware. With the assumption that tampering disturbs certain underlying statistical properties of an image, these forensic techniques can detect specific forms of tampering. Air-brushing or re-touching can be detected by measuring deviations of the underlying color filter array correlations. Specifically, virtually all digital cameras record only a subset of all the pixels needed for a full-resolution color image. Instead, only a subset of the pixels is recorded by a color filter array (CFA) placed atop the digital sensor. The most frequently used CFA, the Bayer array, employs three color filters: red, green, and blue. Since only a single color sample is recorded at each pixel location, the other two color samples must be estimated from the neighboring samples in order to obtain a three-channel color image. The estimation of the missing color samples is referred to as CFA interpolation or demosaicking. In its simplest form, the missing pixels are filled in by spatially averaging the recorded values. Since the CFA is arranged in a periodic pattern, a periodic set of pixels will be precisely correlated to their neighbors according to the CFA interpolation algorithm. When an image is re-touched, it is likely that these correlations will be destroyed. As such, the presence or lack of these correlations can be used to authenticate an image, or expose it as a forgery. A digital composite of two people can be detected by measuring differences in the direction to the illuminating light sources from their faces and body. By making some initial simplifying assumptions about the light and the surface being illuminated, we can mathematically express how much light a surface should receive as a function of its position relative to the light. A surface that is

Once expressed in this form. Any inconsistencies in lighting can then be used as evidence of tampering. Since it is statistically unlikely to find identical and spatially coherent regions in an image. It is prominently used for tracing copyright infringements and for banknote authentication. If a digital watermark distorts the carrier signal in a way that it becomes perceivable.1. for example. Instead. . The needed properties of a digital watermark depend on the use case in which it is applied. It is typically used to identify ownership of the copyright of such signal.e. will be brighter than a surface that is turned away from the light. video. DIGITAL WATERMARKING A digital watermark is a kind of marker covertly embedded in a noise-tolerant signal such as audio or image data. For marking media files with copyright information.directly facing the light. Duplication or cloning is a simple and powerful form of manipulation used to remove objects or people from an image. whereas in digital watermarking. a fragile watermark would be applied. but does not need to contain a relation to the carrier signal. a region growing algorithm combines any significant number of neighboring blocks that are consistent with the cloning of an image region. their presence can then be used as evidence of tampering. texts or 3D models. pictures. the hidden information should. Digital watermarks may be used to verify the authenticity or integrity of the carrier signal or to show the identity of its owners. Unlike metadata that is added to the carrier signal. a digital watermark has to be rather robust against modifications that can be applied to the carrier signal. Traditional Watermarks may be applied to visible media (like images or video). it is of no use. With identical and highly similar blocks neighboring each other in the re-ordered sequence. standard techniques can be used to determine the direction to the light source for any object or person in an image. The blocks are then re-ordered so that they are placed a distance to each other that is proportional to the differences in their pixel colors. and imperceptible anytime else. A signal may carry several different watermarks at the same time. 2. i. if integrity has to be ensured. Like traditional watermarks. digital watermarks are only perceptible under certain conditions. a digital watermark does not change the size of the carrier signal. the signal may be audio. This form of tampering can be detected by first partitioning an image into small blocks. "Watermarking" is the process of hiding digital information in a carrier signal. after using some algorithm.

In particular. This is so that afterwards. It just marks data. One application of digital watermarking is source tracking. then the watermark may be retrieved from the copy and the source of the distribution is known. Watermarks of varying degrees of obtrusiveness are added to presentation media as a guarantee of authenticity. However. a watermark should adhere to a few requirements. This technique reportedly has been used to detect the source of illegally copied movies. The signal. digital watermarking is a passive protection tool. and makes detection. The media of focus in this paper is the still image. but does not degrade it nor controls access to the data. it should be robust. including intentional attacks to remove the watermark. this method is useless in the digital world. digital watermarking tries to control the robustness as top priority. Digital watermarking is the process of inserting a digital signal or pattern (indicative of the owner of the content) into digital content. to authenticate the content. If a copy of the work is found later.1 Principle of digital watermarks A watermark on a bank note has a different transparency than the rest of the note when a light is shined on it.Both steganography and digital watermarking employ steganographic techniques to embed data covertly in noisy signals.1. known as a watermark. and common signal processing alterations used to make the data more efficient to store and transmit. by pirates less possible. and transparent. Transparency requires a watermark to be imperceptible so that it does not affect the quality of the content. and source. the owner can still be identified. But whereas steganography aims for imperceptibility to human senses. Within this category. To be effective in its purpose. . There are a variety of image watermarking techniques. and therefore removal. ownership. and to trace illegal copies of the work. The effectiveness of a watermark is improved when the technique exploits known properties of the human visual system. Since a digital copy of data is the same as the original.2. falling into 2 main categories. . Robustness requires that it be able to survive any alterations or distortions that the watermarked content may undergo. These are known as perceptually based watermarking techniques. the class of image-adaptive watermarks proves most effective. quality. depending on in which domain the watermark is constructed: the spatial domain (producing spatial watermarks) and the frequency domain (producing spectral watermarks). A watermark is embedded into a digital signal at each point of distribution. can be used later to identify the owner of the work.

The Recording Industry Association of America (RIAA) says that the value of illegal copies of music that are distributed over the Internet could reach $2 billion a year. which has resulted in pirating. It is easy to duplicate audio and visual files. RIAA reports that "record labels see watermarking as a crucial piece of the copy protection system. Digital watermarking is being recognized as a way for improving this situation. However. they all digitally write desired information directly onto images or audio data in such a manner that the images or audio data are not damaged.Currently there are various techniques for embedding digital watermarks. sooner or later.3 PURPOSES OF DIGITAL WATERMARKS Watermarks are a way of dealing with the problems mentioned above by providing a number of services:  They aim to mark digital data permanently and unalterably. This suggests that there are many applications that could require image watermarking.1. Digital watermarks are added to images or audio data in such a way that they are invisible or inaudible Ñ unidentifiable by human eye or ear. Copyright owners can incorporate . Digital watermarking is the content protection method for the multimedia era. Embedding a watermark should not result in a significant increase or reduction in the original data. musicians and artists. Another scenario in which the enforcement of copyright is needed is in newsgathering.2 IMPORTANCE OF DIGITAL WATERMARKS The Internet has provided worldwide publishing opportunities to creators of various works. Basically. This is so that later. and satellite-delivered video. video-ondemand systems. image's origin and content can be verified. 2.1. digital libraries. surveillance imaging. including Internet imaging. the images must be watermarked as they are captured. photographers. and that digital watermarking is needed to indicate who the culprit is. Furthermore. these same opportunities provide ease of access to these works. whether their music is released over the Internet or on DVD-Audio". including writers. 2. so that the source as well as the intended recipient of the digital work is known. they can be embedded in content with a variety of file formats. An example of an area where copyright protection needs to be enforced is in the on-line music industry. image and video databases. digital cameras. and is therefore probable that duplication on the Internet occurs without the rightful owners' permission. medical imaging. They are of the opinion that any encryption system can be broken. When digital cameras are used to snapshot an event.

translation. Recompression Linear filtering such as high pass and low pass filtering. Addition of a constant offset to the pixel values Local exchange of pixels other intentional attacks: Printing and Rescanning Watermarking of watermarked image (rewatermarking) 2. watermarks are used in the protection of ownership. this section identifies digital watermarking applications and provides an overview of digital watermarking capabilities and useful benefits to customers. any unauthorized copies that s/he has distributed can be traced back to him/her. owners are able to find illegal copies of their work on the Internet.identifying information into their work. because each purchaser of the data has a unique watermark embedded in his/her copy.  By indicating the owner of the work. In addition. The various applications are:    Authentication Broadcast Monitoring Copy Prevention . they demonstrate the quality and assure the authenticity of the work.1. The presence of a watermark in a work suspected of having been copied can prove that it has been copied. Geometric Distortions: include such operations as rotation.  With a tracking service.  Watermarks can be used to identify any changes that have been made to the watermarked data. scaling and cropping. That is. Requantization.  Some more recent techniques are able to correct the alteration as well. Common Signal Processing Operations: They include the followings. D/A conversion.4 ATTACKS ON WATERMARKS            Lossy Compression: Many compression schemes like JPEG and MPEG can potentially degrade the data’s quality through irretrievable loss of data. 2. A/D conversion Resampling.5 DIGITAL WATERMARKING APPLICATIONS Digital watermarking is rapid evolving field.1.

1. so that even if the private key is exposed. a broader term that refers to any electronic data that carries the intent of a signature. copyright protection. Digital signatures are often used to implement electronic signatures.6 WATERMARKING SOFTWARE&SREVICES      Alpha-Tec: watermarking software for copyright protection and infringement tracking.[4] and members of the European Union. For messages sent through a nonsecure channel. Digital signatures employ a type of asymmetric cryptography. meaning that the signer cannot successfully claim they did not sign a message. embedded messages and more. 2. Digital signatures are commonly used for software distribution. partial encryption.[2][3] In some countries. some non-repudiation schemes offer a time stamp for the digital signature.  Forensic Tracking E-Commerce/Linking 2. Digital signature schemes in the sense used here are cryptographically based. Digital signatures are equivalent to traditional handwritten signatures in many respects. but properly implemented digital signatures are more difficult to forge than the handwritten type. Digital signatures can also provide nonrepudiation. India. MediaSec: Provide software for various media types.t. and must be implemented properly to be effective. Digimarc: For document verification. and internet tracking.[1] but not all electronic signatures use digital signatures. audio. video e. financial transactions.2 DIGITAL SIGNATURE A digital signature or digital signature scheme is a mathematical scheme for demonstrating the authenticity of a digital message or document. . Stegnosign: For creating. a properly implemented digital signature gives the receiver reason to believe the message was sent by the claimed sender. A valid digital signature gives a recipient reason to believe that the message was created by a known sender such that they cannot deny sending it (authentication and non-repudiation) and that the message was not altered in transit (integrity). and in other cases where it is important to detect forgery or tampering.c. embedding and detecting watermarks. Signum: Allow digital fingerprints to be embedded into grahics. including the United States. the signature is valid. while also claiming their private key remains secret. electronic signatures have legal significance. further.

Universities including Penn State. that information may not be accurate. and status of an electronic document as well as acknowledging informed consent and approval by a signatory. public and private laws. a valid signature shows that the message was sent by that user.  A signature verifying algorithm that. The importance of high confidence in sender authenticity is especially obvious in a financial context. The United States Government Printing Office (GPO) publishes electronic versions of the budget. either accepts or rejects the message's claim to authenticity. and congressional bills with digital signatures. produces a signature. Digital signatures can be used to authenticate the source of messages. it should be computationally infeasible to generate a valid signature for a party who does not possess the private key. and Stanford are publishing electronic student transcripts with digital signatures. a signature generated from a fixed message and fixed private key should verify the authenticity of that message by using the corresponding public key. digital signatures can provide added assurances of the evidence to provenance. Secondly.Digitally signed messages may be anything representable as a bitstring: examples include electronic mail. contracts. suppose a bank's branch office .2. 2. Below are some common reasons for applying a digital signature to communications: 2. public key and a signature. given a message. When ownership of a digital signature secret key is bound to a specific user. Two main properties are required. A digital signature scheme typically consists of three algorithms:  A key generation algorithm that selects a private key uniformly at random from a set of possible private keys.2. The algorithm outputs the private key and a corresponding public key. For example. identity.1 Uses of Digital Signature As organizations move away from paper documents with ink signatures or authenticity stamps. First. or a message sent via some other cryptographic protocol.1 Authentication Although messages may often include information about the entity sending a message. University of Chicago.1. given a message and a private key.  A signing algorithm that.

2. there is no efficient way to modify a message and its signature to produce a new message with a valid signature. 2.3 Non-repudiation Non-repudiation.1.) However. access to the public key only does not enable a fraudulent party to fake a valid signature. Although encryption hides the contents of a message. is an important aspect of digital signatures. 2. By this property. Furthermore. (Some encryption algorithms.2.sends instructions to the central office requesting a change in the balance of an account. Similarly.1. If the central office is not convinced that such a message is truly sent from an authorized source. any change in the message after signature will invalidate the signature. but others do not. or more specifically non-repudiation of origin. prevent this. The device signature may be in the form of  sensor pattern noise (SPN)  camera response function  Re sampling artifacts  Color filter array  Interpolation artifacts  JPEG compression  Lens aberration  sensor dust . known as nonmalleable ones. acting on such a request could be a grave mistake. it may be possible to change an encrypted message without understanding it. the sender and receiver of a message may have a need for confidence that the message has not been altered during transmission.2 Integrity In many scenarios. an entity that has signed some information cannot at a later time deny having signed it. because this is still considered to be computationally infeasible by most cryptographic hash functions (see collision resistance). if a message is digitally signed.

The color filters filter the light by wavelength range. Since sensors are made of semiconductors they obey solid-state physics. a color filter array (CFA). is a mosaic of tiny color filters placed over the pixel sensors of an image sensor to capture color information. The raw image data captured by the image sensor is then converted to a full-color image (with intensities of all three primary colors represented at each pixel) by a demosaicing algorithm which is tailored for each type of color filter.CHAPTER 3 COLOR FILTER ARRAY 3. such that the separate filtered intensities include information about the color of light. green. In photography. Each two-by-two submosaic contains 2 green. or color filter mosaic (CFM). Color filters are needed because the typical photosensors detect light intensity with little or no wavelength specificity. Color filter array The Bayer color filter mosaic. For example. absolute color space. the Bayer filter (shown to the right) gives information about the intensity of light in red. thus all visible colors can be distinguished. so a color translation is required to convert the tristimulus values into a common. The responses of the filters do not generally correspond to the CIEcolor matching functions. The spectral transmittance of the CFA elements along with the demosaicing algorithm jointly determine the color rendition. and blue (RGB) wavelength regions. each covering one pixel sensor. 1 blue and 1 red filter. The sensor's passbandquantum efficiency and span of the CFA's spectral responses are typically wider than the visible spectrum. and therefore cannot separate color information. .

used in a few cameras of Kodak. Bayer filter RGBE filter CYYM filter CYGM filter RGBW Bayer RGBW #1 2×2 2×2 2×2 2×2 RGBW #2 RGBW #3 Three example RGBW filters from Kodak. and one magenta. and two green. one red. Dick Merrill of Foveon distinguishes the approaches as "vertical color filter" for the Foveon X3 versus "lateral color filter" for the CFA.The Foveon X3 sensor uses a different structure such that a pixel utilizes properties of multijunctions to stack blue. (See Bayer filter#Alternatives) 4×4 2×4 3.  List of color filter arrays Pattern (pixels) 2×2 size Image Name Description Very common RGB filter. One cyan. Bayer-like with one of the green filters modified to "emerald". With one blue. and one magenta. and red sensors on top of each other. used in a few Sony cameras. One cyan. with 50% white. one yellow.1 Manufacture of the CFA . used in a few cameras. This arrangement does not require a demosaicing algorithm because each pixel has information about each color. one green. two yellow. green. Traditional RGBW similar to Bayer and RGBE patterns.

Ensuring that the dyes have the right mechanical properties—such as ease of application. though solutions have been found for this problem. thicknesses ranging up to 1 micrometre are readily available. Aoki reveals that a CYWG arrangement was used. aliasing effects. but nowadays. the individual CFA filters are usually layers of transmissive (absorptive) organic or pigment dyes. For instance. Pigment based CFAs have become the dominant option because they offer higher heat resistance and light resistance compared to dye based CFAs. moire patterns. Some sources indicate that the CFA can be manufactured separately and affixed after the sensor has been manufactured. Adams et al. and spatial frequencies of the absorptive filters. 1982). with the G filter being an overlap of the Y and C filters. A few sources discuss other specific chemical substances. CMCR106R.Diazonaphthoquinone (DNQ)-novolacphotoresist is one material used as the carrier for making color filters from color dyes. Theuwissen makes no mention of the materials utilized in CFA manufacture. . Color photoresists sometimes used include those with chemical monikers CMCR101R.[15] The gelatin is sectionalized. and subsequently dyed. durability. at best." He provides a bibliography focusing on the number. 1978) and not as a hybrid. and optimal manufacturing processes of color filter arrays. First.. Filter materials are manufacturer specific. via photolithography. and resistance to humidity and other atmospheric stresses—is a challenging task. In either case. There is some interference between the dyes and the ultraviolet light needed to properly expose the polymer. while other sensors have the CFA manufactured directly on the surface of the imager. types. At least one early example of an on-chip design utilized gelatin filters (Aoki et al. and CMCR106B. This makes it difficult. all single-chip color cameras are provided with an imager which has a color filter on-chip processed (Dillon.". CMCR101G. to fine-tune the spectral responsivities. CMCR101B. the color filter was fabricated on a separate glass plate and glued to the CCD (Ishikawa 1981). Nakamura said that materials for on-chip color filter arrays fall into two categories: pigment and dye. CMCR106G. Theuwissen says "Previously. state "Several factors influence the CFA's design. attending optical properties.

Carl Chiulli cites the use of 5 chemicals.3 IMAGE NOISE Image noise is random (not present in the object imaged) variation of brightness or color information in images. CAS Registry numbers. On the other hand.096.Given that the CFAs are deposited on the image sensor surface at the BEOL (back end of line. In U.I.808. mainly azo dyes and pyrazolone-diazenyl. three of which are C.2 Some pigment and dye molecules used in CFAs In U. the later stages of the integrated circuit manufacturing line).# 4. and is usually an aspect of electronic noise. of Fuji Photo Film company.801 Koya et al. some CVD silicon oxide processes are low temperature processes. AKA Solvent Red 8.501.S. or Colour Index numbers.I. # 5. Solvent Yellow 88. Solvent Blue 36. organics would be preferred over glass. 3. list some 150-200 chemical structures.S. and C. It can be produced by the sensor and circuitry of a scanner or digital camera.P. Image noise can also originate in film grain and in the unavoidable shot noise of an ideal photon detector.. Ocean Optics has indicated that their patented dichroic filter CFA process (alternating thin films of ZnS and Cryolite) can be applied to spectroscopic CCDs. 3. # 61551.P. Image noise is an undesirable by-product of image capture that adds spurious and extraneous information. but fail to provide chemical names. #12715. where a low-temperature regime must be rigidly observed (due to the low melting temperature of the aluminum metalized "wires" and the substrate mobility of the dopants implanted within the bulk silicon). Gersteltec sells photoresists that possesses color filter properties. .

that is. Gaussian.1 Amplifier noise (Gaussian noise) The standard model of amplifier noise is additive. to optical and radioastronomical images that are almost entirely noise.4 Types o o o o o o o Amplifier noise (Gaussian noise) Salt-and-pepper noise Shot noise Dark current noise Quantization noise (uniform noise) Read noise Anisotropic noise 3.4. 3. from which a small amount of information can be derived by sophisticated processing (a noise level that would be totally unacceptable in a photograph since it would be impossible to determine even what the subject was). By analogy unwanted electrical fluctuations themselves came to be known as "noise. The magnitude of image noise can range from almost imperceptible specks on a digital photograph taken in good light. caused primarily by Johnson–Nyquist noise (thermal noise). of the constant noise level in dark areas of the image." Image noise is. 3. In color cameras where more amplification is used in the blue color channel than in the green or red channel.2 Salt-and-pepper noise .Noise clearly visible in an image from a digital camera The original meaning of "noise" was and remains "unwanted signal". inaudible. of course. independent at each pixel and independent of the signal intensity. Amplifier noise is a major part of the "read noise" of an image sensor. unwanted electrical fluctuations in signals received by AM radios caused audible acoustic noise ("static"). including that which comes from the reset noise of capacitors ("kTC noise"). there can be more noise in the blue channel.4.

This type of noise can be caused by analog-to-digital converter errors. Dark current is greatest at "hot pixels" within the image sensor. In addition to photon shot noise. which is usually not very different from Gaussian. of the leakage. Shot noise has a root-mean-square value proportional to the square root of the image intensity. but non-random. and the noises at different pixels are independent of one another. or if the exposure time is long enough that the hot pixel charge exceeds the linear charge capacity. that is. there can be additional shot noise from the dark leakage current in the image sensor. If dark-frame subtraction is not done. It can be mostly eliminated by using dark frame subtraction and interpolating around dark/bright pixels. 3. Dead pixels in an LCD monitor produce a similar. bit errors in transmission. or random component. . leaving only the shot noise. this noise is sometimes known as "dark shot noise" or "dark-current shot noise".4. the noise will be more than just shot noise. An image containing salt-and-pepper noise will have dark pixels in bright regions and bright pixels in dark regions. etc.3 Shot noise The dominant noise in the lighter parts of an image from an image sensor is typically that caused by statistical quantum fluctuations. variation in the number of photons sensed at a given exposure level. and hot pixels appear as salt-and-pepper noise.Image with salt and pepper noise Fat-tail distributed or "impulsive" noise is sometimes called salt-and-pepper noise or spike noise. Shot noise follows a Poisson distribution. display. The variable dark charge of normal and hot pixels can be subtracted off (using "dark frame subtraction"). This noise is known as photon shot noise.

4. The generation of dark current is a thermal process wherein electrons use thermal energy to hop to an intermediate state. 3. since high read noise decreases the quality of the image.7 Anisotropic noise Some noise sources show up with a significant orientation in images. For example. with states near mid-band generating most of the dark current. image sensors are sometimes subject to row noise or column noise. It has an approximately uniform distribution. it will be signal independent if other noise sources are big enough to cause dithering.6 Read noise Read noise is a property that is inherent to the CCD of digital cameras. 3. adding to the signal measured in the pixel.3.4.[13] 3. robbing electrons of the thermal energy required to reach an intermediate state. providing a path for valence electrons to sneak into the conduction band.5 In digital cameras . Though it can be signal dependent. The efficiency of a generation center depends on its energy level.4. The read noise of a camera affects how well the image represents the actual data. These sites introduce electronic states in the forbidden gap which act as steps between the valence and conduction bands. For this reason. or if dithering is explicitly applied. Calibrating the read noise allows us know more about the quality of the CCD as well as the data distortion due to the reading of images. from which they are emitted into the conduction band. and is present in all images taken and recorded by a camera.4 Dark current noise: Dark current is the result of imperfections or impurities in the depleted bulk silicon or at the siliconsilicon dioxide interface. the most effective way to reduce dark current is to cool the CCD.4.5 Quantization noise (uniform noise) The noise caused by quantizing the pixels of a sensed image to a number of discrete levels is known as quantization noise. 3.

or both. where read noise (noise floor) is significant. or effective light collection area per pixel sensor. not how this area is divided into pixels. For images at lower signal levels (higher ISO settings). similar to shadow noise.6 Effects of sensor size The size of the image sensor. or that the f-number or focal-plane illuminance is held constant.Image on the left has exposure time of >10 seconds in low light. In the case of images bright enough to be in the shot noise limited regime. since fewer photons are counted (shot noise) and since more amplification of the signal is necessary. The relative effect of both read noise and shot noise increase as the exposure is reduced. longer shutter speeds lead to increased salt-and-pepper noise due to photodiodeleakage currents. the pixel count makes little difference to perceptible noise levels – the noise depends primarily on sensor area. 3. so larger sensors typically create lower noise images than smaller sensors. this salt-and-pepper noise can be mostly eliminated by dark frame subtraction. the sensitivity of an imager scales roughly with the sensor area. more pixels within a given sensor area will make the image noisier if the per pixel read noise is the same. for a constant f-number. higher gain (ISO sensitivity). assuming the aperture area is proportional to sensor area. In low light. At the cost of a doubling of read noise variance (41% increase in read noise standard deviation). when the image is scaled to the same size on screen. correct exposure requires the use of long shutter speeds. is the largest determinant of signal levels that determine signal-to-noise ratio and hence apparent noise levels. On most cameras. That is. Banding noise. corresponding to increased ISO sensitivity. . can be introduced through brightening shadows or through color-balance processing. or printed at the same size. The image on the right has adequate lighting and 0.1 second exposure.

There are many procedures for this. the noise level produced by a Four Thirds sensor at ISO 800 is roughly equivalent to that produced by a full frame sensor (with roughly four times the area) at ISO 3200. it is known that DSLRs will produce more noise during summer than winter. if it is irregular. whether in-camera or on a computer.5" compact camera sensor (with roughly 1/16 the area) at ISO 100. and that produced by a 1/2. With this in mind. Most noise reduction algorithms perform much more aggressive chroma noise reduction. low-contrast detail that may have characteristics similar to noise. If this is a single pixel. 3.For instance. But a definitive answer is not available.7 Sensor heat Temperature can also have an effect on the amount of noise produced by an image sensor due to leakage. This decision can be assisted by knowing the characteristics of the source image and of human vision. and average out the former while attempting to preserve the latter. it may be a defect in a group of pixels in the image-taking sensor (spurious and unwanted.8 Image noise reduction Most algorithms for converting image sensor data to an image. However. which tend to use larger sensors than compacts. but not strictly noise). Furthermore. so there is often a tradeoff made between noise removal and preservation of fine. it may be more likely to be a true feature of the image. involve some form of noise reduction. if it covers a few pixels in an absolutely regular shape. since there is little important fine chroma detail that one risks losing. it is likely (but not certain) to be spurious and noise. This ability to produce acceptable images at higher sensitivities is a major factor driving the adoption of DSLR cameras. many people find . A simplified example of the impossibility of unambiguous noise reduction: an area of uniform red in an image might have a very small black part. but all attempt to determine whether the actual differences in pixel values constitute noise or real photographic detail. 3. An example shows a DSLR sensor at ISO 400 creating less noise than a point-and-shoot sensor at ISO 100. no algorithm can make this judgment perfectly. Many cameras have settings to control the aggressiveness of the in-camera noise reduction.

In cases of extreme noise. since its textured appearance mimics the appearance of film grain. techniques are different. . most camera manufacturers increase the noise reduction aggressiveness automatically at higher sensitivities. This leads to a breakdown of image quality at higher sensitivities in two ways: noise levels increase and fine detail is smoothed out by the more aggressive noise reduction. Since noise levels increase as ISO sensitivity is increased. it is not so much a matter of noise reduction as of extracting a little information buried in a lot of noise. The high sensitivity image quality of a given camera (or RAW development workflow) may depend greatly on the quality of the algorithm used for noise reduction. such as astronomical images of very distant objects.luminance noise less objectionable to the eye. seeking small regularities in massively random data.

occurring only at certain. The term "fixed pattern noise" usually refers to two parameters. Although FPN does not change appreciably across a series of captures. . material or interference with the local circuitry. which describes the gain or ratio between optical power on a pixel versus the electrical signal output. and fixed pixel locations. which is the offset from the average across the imaging array at a particular setting (temperature. It is characterized by the same pattern of 'hot' (brighter) and cold (darker) pixels occurring with images taken under the same illumination conditions in an imaging array. Fixed pattern noise (FPN) is a general term that identifies a temporally constant lateral nonuniformity (forming a constant pattern) in an imaging system with multiple detector or picture elements (pixels). integration time) but no external illumination and the PRNU (photo response nonuniformity). degrading the image. Sometimes pixel noise[2] as the average deviation from the array average under different illumination and temperature conditions is specified. The latter can be described as the local. In practice. imager gain and incident illumination. which might strongly deteriorate if additional electrical gain (and noise) is included. Pixel noise therefore gives a number (commonly expressed in rms) that identifies FPN in all permitted imaging conditions. etc.[1] One is the DSNU (dark signal non-uniformity). imager temperature. a long exposure (integration time) emphasizes the inherent differences in pixel response so they may become a visible defect. It might be affected by changes in the environment like different temperatures.CHAPTER 4 FIXED PATTERN NOISE Fixed pattern noise is the term given to a particular noise pattern on digital imaging sensors often noticeable during longer exposure shots where particular pixels are susceptible to giving brighter intensities above the general background noise. This problem arises from small differences in the individual responsibility of the sensor array (including any local post amplification stages) that might be caused by variations in the pixel size. exposure times. it is not expressed in a random (uncorrelated or changing) spatial distribution. pixel dependent photo response nonlinearity (PRNL) and is often simplified as a single value measured at almost saturation level to permit a linear approximation of the non-linear pixel response. it may vary with integration time.

1 Background Photo Response Non-Uniformity.1.00 candelas since the brighter light is more easily detected by the camera. 4. Repeat the calculations for the different exposure times to compare the PRNU. and we also checked to ensure that the camera is focused before taking the pictures. since increasing the illumination level will enhance the difference in the photo-response of the pixels across the image and lead to a higher PRNU. we use the camera to take multiple images of a uniform scene. it is seen as the variation in pixel responsively over the CCD. The calculation of the PRNU is as follows:  Obtain the average image over the 100 images taken:   Subtract the DSNU image from this average image to eliminate the contribution from the DSNU. We kept the illumination level fixed at 3. One of the few engineering definitions for PRNU or "photoresponsenonuniformity" is in the photonics dictionary. And it is for CCD only. since the maximum value of the Opt linear device is around 4 candelas. is one source of pattern noise in digital cameras.1 PRNU (Photo Response Non-Uniformity) 4. Like DSNU.5. We took 100 exposures each for three exposure times: 1/10. However. or PRNU for short. 1/4 and 1/2. and increasing the illumination level increases the non-uniformity of the illumination .1. while DSNU occurs as a variation in pixel responsively when the CCD is not illuminated. Obtain the spatial variance of the pixel values over the entire CCD   Divide the spatial variance by the average image from (ii) to obtain the PRNU as a percentage of the actual pixel values. In our measurements. We expect the PRNU to increase with increasing illumination. produced by the Optoliner. 4.2 Methods To characterize the PRNU. PRNU is the pixel variation under illumination.

Finally. Figure 1 demonstrates the image acquisition process. primarily the JPEG format. Since is the dominating term in Eq. (1) and keeping the first two terms of the expansion where  is the denoised image and is the ensemble of the noises. This colour interpolation process is commonly known as demosaicking. the lenses let through the rays of the three colour components of the scene. a camera output model can be expressed as where I is the output image. a colour interpolation function generates the electronic signals of the other two colour components for every pixel according to the colour intensities of the neighboring pixels. after applying Taylor expansion to Eq. the PRNU can be contaminated by various types of noise introduced at different stages of the image acquisition process. R. The PRNU pattern noise K can then be formulated as . including . This colour filtering is determined by the CFA. but for every pixel only therays of one colour component is passed through the CFA and subsequently converted into electronic signals by the sensor.s andr are random noise and is the fixed pattern noise (FPN) that is associated with every camera and can be removed by subtracting a dark frame from the image taken by the same camera. The signals then undergo additional signal processing such as white balance. (1). we chose to increase the exposure times to mimic the effect of increasing illumination levels. G. shot noise. After the conversion. during the image acquisition process. gamma correction and image enhancement. For most digital cameras.e. and is the input signal of the scene. The dominating component of sensor pattern noise is photo response non-uniformity (PRNU). read-out noise and quantization (lossy Compression) noise. As formulated in [11]. In Eq. these signals are stored in the camera’s memory in a customized format. stand for dark current.455) is the gamma correction factor. In acquiring an image. (1).. g is the colour channel gain. and B). However.produced by the Opt linear. . A colour photo is represented in three colour components (i. the signal will inevitably be distorted when passing through each process and these distortions result in slight differences between the scene and the camera-captured image. (= 0. K is the zero-mean multiplicative factor responsible for the PRNU. respectively. and .

4.is the s-th image taken by device d and Note the multiplication operation in Eq. is the gamma correction factor . only one of the three colours of each pixel is physically captured by the sensor while the other two are artificially interpolated by the demosaicking process. Although various denoising filters can be used.. this inevitably introduce noise with power stronger than that of the genuine . (5) and compared against the reference PRNU Kd of each device d available to the investigator in the hope that it will match one of the reference fingerprints. The normalised cross-correlation is the noise residual extracted from . for each imaging device d.is the noise residual obtained by applying a denoising filter on image I. the noise residual patterns are extracted using Eq.. as suggested in [11]. where S is the number of images involved in the calculation. the noise residual WI of image I under investigation is extracted using Eq. thus identifying the source device that has taken the image under investigation. (5) is element-wise. al. 1) First. (6). Given the PRNU-based approaches‟ potential in resolving device identification problem to the accuracy at individual device level. (5) from a number of low-contrast images taken by device d and then the PRNU is estimated using the ML estimation procedure adopted by Chen et.e. it is important that the PRNU extracted is as close to the genuine pattern noise due to the sensor as possible. 2) Secondly. Since for most cameras. the wavelet-based denoising process (i.. has been reported as effective in producing good results. i. instead of using against the reference fingerprint . Again the multiplication operation in Eq. we used .e. (6) is element-wise. where is the mean function.2 Use of PRNU in Device Identification The basic idea of using the PRNU noise pattern in device identification can be described as follows. the discrete wavelet transform followed by a Wiener filtering operation). is used to compare the noise Note in Eq.

In Section IV. It is also known as CFA interpolation or color reconstruction.e. Many modern digital cameras can save images in a raw format allowing the user to demosaic it using software.e. 4. we will look at the impact of demosaicking on PRNU fidelity in Section II and propose an improved formula for extracting PRNU in Section III. a full set of color triples) from the spatially under sampled color channels output from the CFA. allowing the interpolation noise in the artificial components to contaminate the real PRNU in the physical components. Addressing this shortcoming is the motivation of this work. rather than using the camera's built-in firmware. such as chromatic aliases. Because the PRNU is formulated in Eq. zippering (abrupt unnatural changes of intensity over a number of neighboring pixels) and purple fringing  Maximum preservation of the image resolution . interchangeably whenever there is no need to differentiate them. as a result. as mentioned earlier that I is to apply the discrete wavelet transform followed by a Wiener filtering operation directly to the entire image I without differentiating physical components from artificial components and. so demosaicing is part of the processing pipeline required to render these images into a viewable format. we present some experiments on device identification and image content integrity verification to validate the proposed PRNU extractionformula. The aim of a demosaicing algorithm is to reconstruct a full color image (i. (4)). in the rest of the work we will use the two terms. In this work. (3) and (5) as a function of the noise residual W (i. However. (2). We can see from Eq. (3) and (4) that the accuracy of both PRNU K and noise residual W depends on the denoising operation applied to I in obtaining the most common method of obtaining . Section V concludes this work.. Eq. The algorithm should have the following traits:  Avoidance of the introduction of false color artifacts. Most modern digital cameras acquire images using a single image sensor overlaid with a CFA. PRNU and noise residual.3 DEMOSAICING A demosaicing (also de-mosaicing or demosaicking) algorithm is a digital image process used to reconstruct a full color image from the incomplete color samples output from an image sensor overlaid with a color filter array (CFA).PRNU.

demosaicking has been rigorously investigated. the discrete wavelet transform followed by a Wiener filtering operation is applied. (4) and (5) based on the definition of the output image model in Eq. Due to the fact that demosaicking is a key deterministic process that affects the quality of colour images taken by many digital devices. When wavelet transform is applied during the noise residual extraction process the interpolation noise residing in the artificial components propagates into the physical components. Low computational complexity for fast processing or efficient incamera hardware implementation  Amenability to analysis for accurate noise reduction To reconstruct a full color image from the data collected by the color filtering array. The main problem inherent to Eq. and is called demosaicing. only one fourth of the pixels‟ red colour are physical and for each pixel with physical red colour all its 8 neighbours‟ red colours are artificial. (4) and (5). To extract the PRNU using Eq.4 DEMOSAICKING IMPACT ON PRNU FIDELITY In this work. (4) is that it involves the whole image plane. The mathematics here is subject to individual implementation. in one noise residual extraction process. which contains both artificial and physical components. the colour variation between neighbouring pixels is greater. edge-adaptive or non-adaptive. in the red colour component/plane of an image taken by a camera with a Bayer CFA. However. (1) does not take this into account.g. For example. because of the low variation of the colour intensities of neighbouring pixels. The grouping process is usually content-dependent. Most demosaicking approaches group the missing colours before applying an interpolation function. As a result the interpolation noise gets diffused from the artificial components into the physical ones. Conversely.. However. the interpolation function can more accurately generate artificial components. we call the colour components physically captured by the sensor as physical colours and the ones artificially interpolated by the demosaicking function as artificial colours. in a homogeneous area. This indicates that the PRNU in physical colour components is more reliable than that in the artificial components. hence the accuracy of colour interpolation result is also content-dependent. Therefore it is desirable to devise a noise residual extraction method that can . each coefficient of the wavelet transform used in the noise residual extraction process involves multiple pixels and thus both artificial and physical components. For example. thus the interpolation noise is also more significant. 4. in inhomogeneous areas. e. a form of interpolation is needed to fill in the blanks. the existing method for extracting PRNU as formulated in Eq.

prevent the artificial components from contaminating the reliable PRNU residing in the physical components with the interpolation noise. .

e . the image output model of Eq. only one of the three colour components takes a value physically captured by the sensor and this colour is determined by the colour configuration of the CFA pattern F. Although the 2×2 Bayer CFA is the most common CFA pattern. can be determined according to The first part of Eq. the second part of Eq.1 FORMULATION OF COLOUR DECOUPLED PRNU (CD-PRNU) In this section. For each colour component of a pixel . except that it is a 2 × 2 square array. That is to say that for each pixel .CHAPTER 5 CD-PRNU (Color Decoupled Photo Response Non-Uniformity) 5. (1) proposed in can be reformulated as . a mathematical model for the CD-PRNUis derived and then an extraction algorithm is proposed to extract the noise residual that is to be used for estimating the final CD-PRNU. F. Let be an interpolation matrix with 2N+1 × 2N+1 coefficients and be a X × Y-pixel input signal from the scene consisting of three colour components. First. without prior knowledge about the CFA. (7). G (green) and B (blue) before colour interpolation. Otherwise.2 Mathematical Model of CD-PRNU A generic demosaicking process is to convolve an interpolation matrix with an image block of the same size centred at the pixel where the artificial colour is to be calculated. we will discuss the formulation and extraction of CD-PRNU. (7) means that if the colour component c is the same as the colour that the CFA pattern F allows to pass. The other two colour components are to be determined by the demosaicking process. (7) is artificially applied to calculate the colour. then no demosaicking is needed because c has been physically captured by the sensor. to make the proposed CD-PRNU versatile and applicable to cameras adopting different CFA patterns. 5. According to Eq. R (red). i. we makes no assumption about the CFA pattern.

That is where is a low-passed filtered version of the artificial components and is the corresponding ―sensor pattern noise‖. We will discuss how the physical and artificial is the interpolation noise extracted from colour components can be decoupled in simple manner without a priori knowledge about the CFA pattern in Section III.B.Eq. the PRNU remains unaffected by the interpolation noise. the PRNU is actually the interpolation noise P while. in the physicalcomponents.3 CD-PRNU Extraction Algorithm . Hence if the physical and artificial colour components can be separated / decoupled. P can be extracted in the same way as the sensor pattern noise K is extracted (i. (9) that the physical components and artificial components have similar mathematical expression. (3)). (5) to extract the reference interpolation noise d from S low-variation images taken by d such that for a particular device where is the artificial colour components of the s-th low-contrast image taken by device d and .e. We can also use the same ML estimate as in Eq. It can also be seen from Eq. which is actually the interpolation noise. (9) suggests that in the artificial components. 5. Eq..

Eq. several methods have been proposed to estimate the CFA. In this work. Note that Algorithm 1 is for extracting the noise residual pattern W from an image I. and mod is the modulo operation. these methods have to exhaust all of the possible CFA patterns in order to infer/estimate the „real‟/optimal CFA. we perform a 2:1 down-sampling across both horizontal and . so the second step is. respectively. we can prevent the artificial components from contaminating the physical components during the DWT process. .According to Eq. for each channel . such that vertical dimensions to get four sub-images. (11) is applied. manufacturers usually do not provide information about the CFA used by their cameras. We know that. we do not know (actually we do not have to know) which pixels carry the colour captured physically by the hardware and which are not. Therefore. Eq. For each colour channel. . only one of the three colour components is physical and the other two are artificial. we first separate the three colour channels of a colour image I of pixels. However. for each pixel of I. But by decomposing into four sub-images. The framework of the colour decoupled noise residual extraction process is shown in Figure 2 and the procedures are listed in Algorithm 1. Finally the CD-PRNU Wc of each colour channel c is formed by combining the four sub-noise residuals such that where. By decoupling the physical and artificial colour components in this fashion before extracting the noise residual. (10) and (11). we know that each of the four sub-images either contains only the physical colour or only the artificial colours. (4) is then used to obtain noise residual from each sub-images . from the physical and artificial components if the CFA is known. to extract the CD-PRNU. without knowing the CFA pattern used by the manufacturer. However. Unfortunately. exhaustive search is by no means acceptable. Most CFA patterns are of 2 × 2 elements and are periodically mapped to the sensors. . we can extract the sensor pattern noise and interpolation noise. To estimate the CD-PRNU Pd of a particular device d and use it as the reference signature of d.

.

The six cameras are listed in Table1. Noise residual extraction algorithm Input: original image I Output: colour decoupled noise residual W Noise residual extraction algorithm 5. Cameras used in the experiments. Source Camera Identification We have carried out source camera identification tests on 300 2048×1536-pixel photos of natural scenes taken by six cameras(C1 to C6).5 EXPERIMENTAL RESULTS In this section. The reference PRNU (i. ) of each camera Ci is generated by taking the weighted average of the PRNUs extracted from 30 photos of blue sky according to Eq. we carry out experiments on source camera identification and image content integrity verification to validate the feasibility of the proposed CD-PRNU in a comparative manner.5. For device identification purpose.1.4 Algorithm 1.5. Table 1. we need clean PRNUs (which appear as high frequency bands of images) as device . each responsible for 50. 5.e. (11).

where smaller image blocks have to be analysed. Individually speaking.e. which has been proved to be a more stable detection statistics than normalised cross-correlation when applied to the scenarios in which the images of interest may have undergone geometrical manipulations. (6) will be used to measure the similarity between PRNUs (CD-PRNUs).. the less data is available. Taking the average of the PRNUs from 30 blue sky images is to further reduce variation. Our empirical experience suggests that an average of 20 blue sky images is accurate enough. C1. PRNU performs equally well as CD-PRNU when the image size is 192 × 256 pixels and slightly outperforms CD-PRNU when the block size is 48 × 64 pixels. other images with low-variation scenes (i. the normalised cross-correlation has to be greater than a specified threshold for a camera to be identified as the source camera. WI. For C2. Another reason is that. the key point is about demonstrating the different performance of the traditional PRNU and the proposed CD-PRNU. of the image I under investigation. However. we also compare the performance of the proposed CD-PRNU against that of the traditional PRNU [11] when they are applied to blocks of 5 different sizes cropped from the centre of the fullsized PRNU (CD-PRNU). except for a few cases when images are of full size (1536 × 2048 pixels) and the identification rates are close or equal to 100% (1. The purpose of this experiment is to demonstrate the capability of the proposed CD-PRNU in dealing with the colour interpolation noise. thus giving better chance of extracting clean PRNU. therefore identification results become less reliable. Source camera identification requires similarity comparisons among PRNUs (CD-PRNUs) and therefore the feasibility of the chosen similarity metrics is important. so geometrical transformations will not be applied in order to prevent biased evaluation from happening. Therefore. Fridrich suggested the use of the Peak to Correlation Energy (PCE) measure in [15]. its reference PRNU (or CD-PRNU) is most similar to the PRNU (or CD-PRNU). such as rotation or scaling. C5 and C6 perform significantly better when CD-PRNU is used in all cases. normalised cross-correlation formulated as in Eq. in the following experiments. The reason blue-sky images are chosen in this work is because blue sky contains less scene details (high frequency signal). .0000). C3. Generally speaking. if out of the six reference PRNUs (or CDPRNUs). Because PRNU is often used in content integrity verification. Therefore. In practice.fingerprints for comparison against the PRNU extracted from individual images under investigation. a camera is identified as the source camera. Actually. C4. Table 2 lists the identification rates. We suspect that the reason C2 does not perform as expected is because the CFA pattern is not a 2 × 2 square array as we have assumed. in this experiment. because the smaller the images. scenes without significant details) can be used instead.

. Performance comparison of source camera identification a) Overall identification rates when CD-PRNU and PRNU are used as fingerprint In Figure 3(b). a ROC curve of the performance of PRNU and CD-PRNU are demonstrated. we can see that CD-PRNU still outperforms PRNU significantly. Figure 3. as listed in the Total column of Table 2. We can see that the CD-PRNU outperforms the PRNU because at all fixed False Positive rate the CDPRNU‟s True Positive rate are always higher than that of the PRNU.when the statistics of the six cameras are pooled together. This has been graphically presented in Figure 3(a).

Performance comparison of source camera identification b) Overall ROC curve when CDPRNU and PRNU are used as fingerprint For a system with a Pentium Core II 1. The amount of data processed during the extraction of PRNU and CD-PRNU is the same.567 seconds to calculate the similarity between a pair of CD-PRNUs of the same size. it takes 0. these two operations are trivial and only incur negligible increase of time complexity. .Figure 3.3G CPU and 3 GB RAM. Although extracting CD-PRNU requires down-sampling and up-sampling.526 seconds to compute the similarity between the PRNUs of two images of 2048 × 1536 pixels and 0.

5.2 Content Integrity Verification We also carried out the following three content integrity verification experiments on 640 × 480-pixel images. Source camera identification rates using traditional PRNU and proposed CD-PRNU.3 as shown in Figure 4(c).5.1 in Figure 4(a).Table 2. and pasted it at approximately the same location in Image I. The images in Figure 4(a) and (b) are taken by Olympus C730. . we copied a 160 × 390-pixel area from Image I.  In the first experiment.2 in Figure 4(b) to create the forged Image I.

1 in Figure 5(a). we cropped a 60 × 80-pixel area from Image III.3 in Figure 6(c). pasted it at the area where the face of another person is in Image III. (a) Original Image II.1 (b) Original Image III. we slid a 128 × 128-pixel window across the PRNU extracted from the image under investigation and another window of the same size across the reference PRNU of the cameras that have taken images I. which covers the face of the person.2 (c) Forged Image I. The images in Figure 5(a) and (b) are also taken by the same camera.1 (b) Original Image I.2 in Figure 6(b). to create the forged Image III.2 (c) Forged Image II.1 (b) Original Image II. we cropped an 80 × 100-pixel area from Image II.Figure 4. The original image. source image and forged images for the content verification experiments.3 To detect the manipulated areas.2 (c) Forged Image III. (a) Original Image III. the windows are .1 in Figure 6(a) taken by Canon Power Shot A400. which is taken by Olympus C730.2.3  In the third experiment. which covers the face of the person. Figure 5. Figure 6. (a) Original Image I. The original image. The original image. II.3 in Figure 5(c).3  In the second experiment.2 and III. source image and forged images for the content verification experiments. In Chen’s method [11]. pasted it at the area where the face of another person is in Image II.2. source image and forged images for the content verification experiments.2 in Figure 5(b) to create the forged Image II.

0 and use the four metrics. therefore. the block in the centre of the window is deemed as manipulated. Table 3. Number of manipulated and non-manipulated areas in each image (unit: block). By varying the value of t. we use various thresholds defined as to analyze the performance of PRNU and CD-PRNU. TN and FN are defined as TP = |{B | M(B) = 1 and Md(B) = 1}|. this method is not accurate at the pixel level [11]. Table 3 lists the number of manipulated and non-manipulated blocks of 5 × 5 pixels in the forged images. As t grows. FP = |{B | M(B) = 0 and Md(B) = 1}| and FN = |{B | M(B) = 1 and Md(B) = 0}|. the sliding step/displacement is set to 5 pixels in order to reduce the computational load without sacrificing the accuracy of the integrity verification. we can evaluate the integrity verification performance across a wide range of correlation thresholds T(t). true positive (TP). in our experiment. (6). Therefore. As discussed in [11]. Moreover. Let B be an arbitrary block and M(B) and Md(B) be defined as TP. true negative (TN) and false negative (FN) to measure the performance of integrity verifications based on PRNU and CD-PRNU. where and are the mean and standard deviation of the correlations distribution. TN = |{B | M(B) = 0 and Md(B) = 0}|. the cross-follows the Generalized Gaussian (GG) distribution. we will obtain lower TP and FP. Higher TP and TN. while higher TN and FN. which incurs a high computational load. FP. and T(t) is the threshold. To decide whether a block centered at the window superposed on the image has been manipulated or not.0 to 3. false positive (FP). and lower FP and FN indicate better performance. .moved a pixel at a time. If the cross-correlation is lower than a predetermined threshold t. respectively. the cross-correlation of the PRNU patterns inside the two windows at the same location was calculated according to Eq. In the following experiments we will allow t to vary independently in the range from 0.

It is clear that the ROC curve of the PRNU-based scheme mostly overlaps with that of Random Guess.3 across a range of correlation threshold T(t).1 Experiment on Image I. therefore the PRNU pattern noises in the two areas are almost the same. leading to higher TP. we remove all simply connected tampered regions from Z that contain less than 64×64 pixels (one quarter of the number of pixels in the block)‖. In order to simplify the comparison and to obtain a fair result.2. A lower correlation (similarity) allows the algorithm to detect more manipulated blocks. ―the block dimensions impose a lower bound on the size of tampered regions that our algorithm can identify. The final authentication result is a image with the dilated areas highlighted as the tampered areas. which is marked vertically.According to Chen‟s predication. The ROC curves for the integrity verification experiments on image I. 5. By . Let α be the number of manipulated blocks and β be the number of authentic blocks. which means the authentication result is generally as unreliable as that of a random guess.1 is at approximately the same location as the original area in image I. a low threshold also results in the situation where more authentic blocks are mistakenly detected as manipulated. the performance of the filtering / dilation operation strongly depends on parameter setting and hence many experiments must be run to obtain the best parameters for filtering.5. As a result. We can see from Figure 7(a) and 7(b) that CD-PRNU generally achieves higher TP and TN while maintaining lower FP and FN. the experiments on III. the ROC is formulated as At the same false positive rate . an algorithm with better performance will have a higher true positive rate (). This is because the area we copied from the source image I. As a result. Thus. Therefore a ROCcurve of TP rate with respect to FP rate can be used to evaluate the overall performance of the PRNU and CD-PRNU. which is marked along the horizontal axis of the ROC curve. FP and FN. the scheme cannot detect the manipulated area based on PRNU. TN.3 is illustrated as Figure 8. However.2. FP and FN when authentication is carried out on image I.3 Figure 7 shows the performance of the PRNU and CD-PRNU in terms of TP. TN. However. Chen applies erosion and dilation operations with a square kernel in order to filter small areas identified as tampered with. we use the raw data without any filtering to calculate the TP.3 demonstrate that CD-PRNU-based method significantly outperforms the PRNU-based method when the tampered area is about one quarter of the sliding window. giving rise to a higher FP.

Authentication results on image I.contrast.2.3.0 to 3. which means that by using CD-PRNU manipulated blocks can be detected more reliably. The ROC curve of Truth Positive Rate with respect to False Positive Rate of PRNU and CD-PRNU when authentication is performed on image I. Figure 7. across a range of correlation threshold T(t). 5. Figure 8.0. b) TN. the CD-PRNU-based scheme results in a curve much higher than the PRNU-based method.5.2 Experiment on Image II.3: Integrity verification performance of the PRNU and CD-PRNU in terms of a) TP. with t varying from 0.3 .

However. both PRNU and CD-PRNU can effectively detect the manipulated blocks as their ROC curves have suggested in Figure 10.0 to 3. Figure 10 also shows that the ROC curve of CD-PRNU is still slightly higher than that of PRNU. CD-PRNU‟s consistently higher TP and lower FN. Authentication results on image II. with t varying from 0. c) FP and d) FN across a range of correlation threshold T(t). again indicate its superiority to PRNU. b) TN.3: Integrity verification performance of the PRNU and CD-PRNU in terms of a) TP.0. Albeit their mixed performance in terms of TN and FP. .When verifying the integrity of image II. Figure 9. mixed performance in terms of TN and FP can be seen in Figure 9(b) and 9(c).3. indicating a slightly better performance of CD-PRNU. as shown in Figure 9(a) and 9(d).

the method based on PRNU can perform no better than a random guess. Chen predicated in that one quarter of the sliding window is the lower bound on the size of tampered regions that our algorithm can identify.3 When authenticating III. the manipulated blocks can be effectively detected by the CD-PRNU-based scheme because the areas in question are from two images taken by different cameras and thus contain different interpolation noise. By contrast. and therefore areas smaller than this should be filtered in order to remove the falsely identified noise. When the threshold t is higher than 1. approximately one quarter of the window. the CD-PRNU-based method can identify smaller areas.3. which is only about one quarter of the sliding window (128 × 128 pixels). As a result. respectively. the PRNU cannot correctly detect any manipulated blocks (i. although the performance of PRNU and CD-PRNU in terms of TN and FP are mixed. The experiment result on III. The ROC curve of Truth Positive Rate with respect to False Positive Rate of PRNU and CD-PRNU when authentication is performed on image II. as demonstrated in Figure 11(a).1.2. Since the tampered area is 60 × 80 pixels. 5. . CD-PRNU‟s significantly better performance in terms of TP and lower FN can still be seen again in Figure 11(a) and 11(d). as can be seen in Figure 11(b) and 11(c).3.5.3 Experiment on Image III. This poor performance is also reflected in the PRNU’s ROC curve in Figure 12 and is due to the fact that he manipulated area is too small (60 × 80 pixels).3 conforms to Chen’s observation.Figure 10.e.

Figure 11.3: Integrity verification performance of the PRNU and CD-PRNU in terms of a) TP. with t varying from 0. b) TN.0. . c) FP and d) FN across a range of correlation threshold T(t). Authentication results on image III.0 to 3.

Sign up to vote on this title
UsefulNot useful