Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Image Pre-Processing Techniques and Transformations, Lecture notes of Computer Science

An in-depth exploration of image pre-processing, a crucial step in image analysis. It discusses various categories of pre-processing methods, including pixel brightness transformations, geometric transformations, and methods using local neighborhoods. The document also covers image restoration and gray scale transformations, offering insights into their applications and techniques. It is a valuable resource for students and researchers in computer vision, image processing, and related fields.

Typology: Lecture notes

2023/2024

Uploaded on 03/24/2024

shesna
shesna 🇮🇳

1 document

1 / 43

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Image Pre-Processing
Ashish Khare
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b

Partial preview of the text

Download Image Pre-Processing Techniques and Transformations and more Lecture notes Computer Science in PDF only on Docsity!

Image Pre-Processing

Ashish Khare

 (^) Pre-processing is a common name for operations with images at the lowest level of abstraction -- both input and output are intensity images.  (^) The aim of pre-processing is an improvement of the image data that suppresses unwanted distortions or enhances some image features important for further processing.

 (^) Image pre-processing methods use the considerable redundancy in images.  (^) Neighboring pixels corresponding to one object in real images have essentially the same or similar brightness value.  (^) Thus, distorted pixel can often be restored as an average value of neighboring pixels.  (^) Do you remember the example of filtering impulse noise?

 (^) If pre-processing aims to correct some degradation in the image, the nature of a priori information is important:  (^) knowledge about the nature of the degradation; only very general properties of the degradation are assumed.  (^) knowledge about the properties of the image acquisition device, and conditions under which the image was obtained. The nature of noise (usually its spectral characteristics) is sometimes known.  (^) knowledge about objects that are searched for in the image, which may simplify the pre-processing very considerably.

Pixel Brightness Transformations  (^) Brightness transformations modify pixel brightness -- the transformation depends on the properties of a pixel itself.  (^) Brightness corrections  (^) Gray scale transformations.  (^) Brightness correction  (^) considers original brightness  (^) pixel position in the image.  Gray scale transformations  (^) change brightness without regard to position in the image.

Position dependent brightness correction  (^) Ideally, the sensitivity of image acquisition and digitization devices should not depend on position in the image, but this assumption is not valid in many practical cases.  Sources of degradation.  (^) Uneven sensitivity of light sensors  (^) Uneven object illumination  (^) Systematic degradation can be suppressed by brightness correction.

 (^) If a reference image g(i,j) is known (e.g., constant brightness c) then  (^) the degraded result is f c(i,j)  (^) systematic brightness errors can be suppressed:

 (^) Image degradation process must be stable,  (^) the device should be calibrated time to time (find error coefficients e(i,j))  (^) This method implicitly assumes linearity of the transformation, which is not true in reality as the brightness scale is limited into some interval.  (^) overflow is possible  (^) the best reference image has brightness that is far enough from both limits.

Gray Scale Transformations  (^) Grey scale transformations do not depend on the position of the pixel in the image.  (^) Brightness transform

a - Negative transformation b - contrast enhancement (between p and p2) c - Brightness thresholding

 (^) A geometric transform is a vector function T that maps the pixel (x,y) to a new position (x',y').  (^) The transformation equations are either known in advance or can be determined from known original and transformed images.  (^) Several pixels in both images with known correspondence are used to derive the unknown transformation.