We conducted a number of experiments to affirm the validity of the
formulations in the previous section. Extensive experimentations were
carried out on synthetic images, natural images with simulated
transformations and real natural images. In the rest of this section, we
demonstrate the performance of the proposed schemes with quantitative
results. For simulation of views, transformations were applied on a
reference view and then the boundary representations were shifted by random amounts in each view
to simulate lack of correspondence. In experiments on real images, objects of interest were segmented out
and their boundaries were sampled to 1024 boundary points. The ranks of
the matrices
,
and
were determined using
the Singular Value Decomposition algorithm, wherein the number of non-zero
singular values gives the rank of the matrix. When the boundary
representation is in the form of integer coordinates, discretization
introduces quantization noise that make the rank constraint an
approximation of the true one derived, but nonetheless enforceable. To
verify whether a matrix has an approximate rank
, we give the ratio of
th to
th singular values (arranged in descending order). This ratio is high if the matrix has
an approximate rank of
. Also all the following singular values are
very small in magnitude.
In the first example, we considered four views of a dinosaur as in
Figure 1(a), (b), (c) and (d). These views are related by
affine transformations. One may observe that
the Euclidean measures are no longer preserved under these
transformation. However, the rank constraints allow us to recognise a
dinosaur image given another view. Ranks of
and
were computed. Ratio of the
th and
th
singular values are used to verify the ranks. All constraints
provided the ratio to be much more than 100
in all cases. The ratios of singular values for each pairs of images for
the invariant and magnitude constraints are arranged in Table 1.
In all cases, the
th singular value (
= 1 for
and
= 3 for
)
was found to be greater than the
th one
by a factor of
or
.
Now, we demonstrate the performance when a zero mean random noise is added to the position of the synthetically transformed shape for an affine homography. The two singular values of interest of matrix
|
The recognition is clearly very good in all cases with the degradation in performance along expected lines. We have achieved recognition between two planar shapes under the assumption that the homography between them has a specific form, without knowing the correspondence between points.
Though the theory was primarily developed for affine homographies,
the rank constraints are practically valid for images under projective
transformation. The logo of the International Institute of Information Technology
was imaged from various viewing positions. These images are known to be
related by projective homographies. Three views are shown in Figure 2.
Ratios of the two highest singular values of the
matrix for various combinations of those views are given in Table 3. All pairs are clearly
recognisable and the ratios are more than 250 in all cases.