
Iris Super-Resolution
Iris Super-Resolution is a very new topic in field of
image processing and biometric recognition. There is
no relevant information found in the literature. In the
following sections, a rough idea of how to do iris
Super-Resolution is introduced to suggest a possible
way of enhancing iris image quality by fusing informa-
tion from multiple low-resolution images.
Information fusion can be thought of as a problem
in creating a high-resolution iris image from multiple
low-resolution images. Each one of the low-resolution
images has part of information that is needed, and the
goal is trying to extract those information needed and
put them at the right position on two-dimensional
space and finally create a pattern which gives an iris
image of higher resolution.
The process of painting can be used as a metaphor
to illustrate the process of iris Super-Resolution.
When a very high-resolution painting is to be painted
by first looking at a few low-resolution images and fill
in more local details, the first thing is to select one
best image from the given low-resolution image. Let it
be called template image, and all other low-resolution
image are scene images. Secondly, the template image
is interpolated with zeros in order to enlarge to a
bigger size. The new size of the is a parameter which
can be fine tuned later. After the process of enlarging
the image, zero-value pixel will spread evenly in entire
image. They are called holes.
After the bigger image with holes is created, next
step is trying to fill up every hole with appropriate
numerical values, which are derived from combining
useful information from other low-resolution images.
In most cases, the appropriate numerical values for a
hole can be inferred from the regions that surround it,
and inside this region, the farther the points are away
from this hole, the smaller impact they have toward this
hole. Therefore, it is better to use a locality-based algo-
rithm to solve this problem. One way of processing
image locally is to cut the whole image plane into
smaller blocks. For example, if an iris image is of
size 30 360, and is cut into blocks of size 10 10,
there will be 3 36 ¼ 108 small blocks totally. Those
blocks are called ‘‘patches.’’ Processing image in patch-
based algorithms has been widely used in variety of
image processing field, such as texture analysis, edge
and boundary detection, image segmentation, object
recognition, biometric recognition, and generic image
Super-Resolution.
The patch-based Super-Resolution algorithm is
quite intuitive. The first step is to cut every scene
image into smaller patches. The second step is that
for every location, align the local patch of every scene
image with the template image. This step is important
because iris images usually suffer from image deforma-
tion problem. This is especially true for segmented iris
images since the pupil of an eye dilates when there is
strong ambient lighting, and contracts when ambient
lighting is weak. Therefore, it cannot be naively as-
sumed that every patch from different images corre-
sponds to exactly the same position on iris surface.
Patches from different images have to be aligned, so
that every pixel on the scene patch can be mapped
correctly to the template image in the corresponding
location.
After patches are locally aligned with each other,
the third step is to combine information about nu-
merical value for each pixel from scene patches and
fill the holes on template patches with new value. If
this process is illustrated with the metaphor of paint-
ing, this step is to draw details at the blank region on
the template image. There are dozens of different
algorithm to fuse information. One of the easiest
ways is the method of linear combination. Suppose
there are n numerical values from n different
scene patches to fill one blank hole, the process of
linear combination can be expressed as the following
equation:
Y ¼ a
1
x
1
þ a
2
x
2
þþa
n
x
n
¼
X
n
k¼1
a
k
x
k
where x
i
is the numerical value of the ith scene
patch, a
i
is the coefficients of linear combination, and
Y is the numerical value of the pixel after linear
combination.
After all the blank holes are filled with the new
values, the last step is to perform image smoothing
across the boundaries of the patches. There are many
existing smoothing algorithms. Linear, quadratic, or
cubic interpolation can be used to achieve this goal.
After the interpolation, the high-resolution image can
be used or it can be down-sampled to make the final
image the same size as the scene image but with much
more detailed texture within. Figure 2 illustrates the
flow chart of iris Super-Resolution algorithm.
858
I
Iris Super-Resolution