sider important the patch locations identified by our
algorithm.
2 COMPUTATIONAL
EVALUATION
The idea here is to determine those areas of a given
face-image that differ most from any other face-
image. In brief, we achieve this by projecting into a
feature space two sets of image patches, sampled from
two face-images, and scoring the patches by their mu-
tual distances. The most distant features found in the
feature space are likely to be the more distinctive face
areas for the specific faces.
In detail, our algorithm extracts, from the two
face-images, a set of patches centered upon specific
points—where these points are uniformly distributed
across the face-image such that most, or all, of the
face area is covered by the sampling process. Each
patch maps on to a coordinate in a multi-dimensional
feature space by virtue of its sample grey-levels. We
adopt simple feature formulation approach by con-
sidering the sample grey-levels in each patch as or-
dered coordinate values as resulting from the log polar
sampling—in practice defining a 400-D space. The
patches from one face-image will tend to form their
own cluster in this space: the other face-image ought
to form a different cluster. Our extracted patches thus
constitute two data-clusters of location-independent
features, each of which characterize one of the two
faces. Based on the distribution of those patches
within feature space, degrees of distinctiveness of
each face patch can be formulated according to its
distance from the projection of the other data-cluster.
Patches with the highest weights are then interpreted
as encoding the most important differences between
the two face-images.
Since face recognition involves information appar-
ent at a various spatial resolutions a multi-scale analy-
sis should provide an advantage over any single scale
analysis A multi-scale analysis could repeat the clas-
sification procedure with patches of various sizes, and
then judiciously combine the results to obtain the im-
portant differences. We adopt a variant multi-scale
approach designed to avoid two notable pitfalls: (a)
blind analysis - whereby information revealed at one
scale is not usefully available at other scales, and (b)
repeated image processing - which adds to the overall
computational expense.
Our solution is to sample the face-image using
patches derived from a log-polar mapping (Grosso
and Tistarelli, 2000). This mapping can also be moti-
vated by its resemblance to the distribution of the re-
ceptive fields in the human retina, where the sampling
resolution is higher at the central fovea and decreases
toward the periphery. The resultant sampling process
ensures that each patch contains both low scale (fine
resolution) and contextual (low resolution) informa-
tion.
Facial features are then selected in two steps:
1. two distinct sets of patches are extracted from the
two face-images at specific image locations;
2. for each of the two faces, the patches are ranked
according to their distances from the other cluster
in feature space.
2.1 Multi-scale Face Sampling
The patches sampled from the original face-image are
centered at a pre-specified set of points. To ensure
translation-independence the locations of these points
ideally ought to be selected randomly (Bicego et al.,
2005). Yet since that would require very many sam-
pling points, in order to completely cover the two
faces we adopt here a regular sampling regime for
which the faces have been manually registered before-
hand.
The face-image is re-sampled at each point follow-
ing a log-polar scheme (Grosso and Tistarelli, 2000)
so that the resulting set of patches represents a local
space-variant remapping of the original image, cen-
tered at that point. Analytically, the log-polar scheme
describes the mapping postulated to occur between
the retina (retinal plane (r, q)) and the visual cor-
tex log-polar or cortical plane (x, h)). The size of
the “receptive fields” follows a linear increment mov-
ing from the central region (fovea) outwards into the
periphery. Due to lack of space, full details of the
log-polar transformation are not given here, interested
reader are referred to (Grosso and Tistarelli, 2000).
The set of log-polar image patches, sampled from
each face-image, are vectorized, and represent the
face in feature space.
2.2 Determining Face Differences
As stated early, the “distinctiveness” of each patch is
related to its locus in feature space with respect to the
other face. In particular, those patches of the first face,
found near loci of the second face in feature space
are less distinctive since they may easily be confused
with the patches of that second face. On the other
hand, patches located near the first face-set should be
usefully representative.
More formally, let S
A
,S
B
the set of patches of face
A and B, respectively. The weight of distinctiveness
ω of a patch p
A
(x, y), centered at the position (x, y)
in the face A is computed as:
ω(p
A
(x, y)) = d(p
A
(x, y),S
B
) (1)
COMPARING FACES: A COMPUTATIONAL AND PERCEPTUAL STUDY
189