Refrence Image Captured Image: Figure 5.1 Sequence Diagram
Refrence Image Captured Image: Figure 5.1 Sequence Diagram
Refrence Image Captured Image: Figure 5.1 Sequence Diagram
IMAGE IMAGE
ENHANCEMENT ENHANCEMENT
IMAGE MATCHING
TIMING
ALLOCATION
Above figure 5.1 shows the Sequence Diagram of Under sampled Face Recognition via Robust
Auxiliary Dictionary Learning (proposed algorithm)
The Block diagram above gives an overview of Under sampled Face Recognition via
Robust Auxiliary Dictionary Learning. Various boxes in Block diagram are explained below:
Fig.5.2: Robust auxiliary dictionary learning
We have some conditions for forming an image f(x, y) as values of image are
proportional to energy radiated by a physical source. So f(x, y) must be nonzero and finite.
i.e. 0< f(x, y) < .
5.2.3 IMAGE PRE-PROCESSING
Image scaling occurs in all digital photos at some stage whether this be in Bayer
demosaicing or in photo enlargement. It happens anytime you resize your image from one pixel
grid to another. Image resizing is necessary when you need to increase or decrease the total
number of pixels. Even if the same image resize is performed, the result can vary significantly
depending on the algorithm.
Images are resized because of number of reasons but one of them is very important in our
project. Every camera has its resolution, so when a system is designed for some camera
specifications it will not run correctly for any other camera depending on specification
similarities. so it is necessary to make the resolution constant for the application and hence
perform image resizing.
Humans perceive colour through wavelength-sensitive sensory cells called cones. There
are three different varieties of cones, each has a different sensitivity to electromagnetic radiation
(light) of different wavelength. One cone is mainly sensitive to green light, one to red light, and
one to blue light. By emitting a restricted combination of these three colours (red, green and
blue), and hence stimulate the three types of cones at will, we are able to generate almost any
detectable colour. This is the reason behind why colour images are often stored as three separate
image matrices; one storing the amount of red (R) in each pixel, one the amount of green (G) and
one the amount of blue (B). We call such colour images as stored in an RGB format.
Image enhancement is the process of adjusting digital images so that the results are more
suitable for display or further analysis. For example, we can eliminate noise, which will make it
more easier to identify the key characteristics.
In poor contrast images, the adjacent characters merge during binarization. We have to
reduce the spread of the characters before applying a threshold to the word image. Hence, we
introduce POWER- LAW TRANSFORMATION which increases the contrast of the
characters and helps in better segmentation. The basic form of power-law transformation is
s = cr ,
where r and s are the input and output intensities, respectively; c and are positive
constants.
A variety of devices used for image capture, printing, and display respond according to a
power-law. By convention, the exponent in the power-law equation is referred to as gamma.
Hence, the process used to correct these power-law response phenomena is called gamma
correction. Gamma correction is important, if displaying an image accurately on a computer
screen is of concern.
Different colours have different brightness values of particular colour. Green image has
more bright than red and blue image or blue image is blurred image and red image is the high
noise image.
In our project we use CANNY EDGE DETECTION TECHNIQUE because of its various
advantages over other edge detection techniques
The Canny Edge Detector is one of the most commonly used image processing tools
detecting edges in a very robust manner. It is a multi-step process, which can be implemented
on the GPU as a sequence of filters. Canny edge detection technique is based on three basic
objectives.
All edges should be found, and there should be no spurious responses. That is, the edges must be
as close as possible to the true edges.
The edges located must be as close as possible to the true edges. That is, the distance between a
point marked as an edge by the detector and the centre of the true edge should be minimum.
The essence of Cannys work was in expressing the preceding three criteria
mathematically and then attempting to find optimal solution to these formulations, in general, it
is difficult to find a close form solution that satisfies all the preceding objectives. However,
using numerical optimization with 1-D step edges corrupted by additive while Gaussian noise
led to the conclusion that a good approximation to the optimal step edge detector is the first
derivative of Gaussian
Generalizing this result to 2-D involves recognizing that the 1-D approach still applies in
the direction of the edge normal. Because the direction of the normal is unknown beforehand,
this would require applying the 1-D edge detector in all possible directions. This task can be
approximated by first smoothing the image with circular 2-D Gaussian function, computing the
gradient of the result, and then using the gradient magnitude and direction to estimate edge
strength and direction at every point