On the problem of algebraic completeness for the invariants of the Riemann Tensor: I

We present a new determining set, CZ, of Riemann invariants which possesses the minimum degree property. From an analysis on the possible independence of CZ, we are led to the division of all space-times into two distinct, invariantly characterized, classes: a general class M_G+, and a special, singular class M_S For each class, we provide an independent set of invariants (I_G+) ⊂ CZ and I_S ⊂ CZ, respectively) which, with the results of a sequel paper, will be shown to be algebraically complete.

On the problem of algebraic completeness for the invariants of the Riemann tensor. III.

We study the set CZ of invariants [Zakhary and Carminati, J. Math. Phys. 42, 1474 (2001)] for the class of space-times whose Ricci tensors possess a null eigenvector. We show that all cases are maximally backsolvable, in terms of sets of invariants from CZ, but that some cases are not completely backsolvable and these all possess an alignment between an eigenvector of the Ricci tensor with a repeated principal null vector of the Weyl tensor. We provide algebraically complete sets for each canonically different space-time and hence conclude with these results and those of a previous article [Carminati, Zakhary, and McLenaghan, J. Math. Phys. 43, 492 (2002)] that the CZ set is determining or maximal.

The determination of all syzygies for the dependent polynomial invariants of the Riemann tensor. I. Pure Ricci and pure Weyl invariants

In this paper, we shall consider all pure Ricci and pure Weyl scalar invariants of any degree, in a four-dimensional Lorentzian space. We present a general graph-theoretic based reduction algorithm which decomposes, using syzygies, any pure invariant in terms of the independent base invariants {r₁,r₂,r₃} or {w₁,w₂}

The determination of all syzygies for the dependent polynomial invariants of the Riemann Tensor. II. mixed invariants of Eeven degree in the Ricci Spinor

We continue our analysis of the polynomial invariants of the Riemann tensor in a four-dimensional Lorentzian space. We concentrate on the mixed invariants of even degree in the Ricci spinor Φ_ABȦḂ and show how, using constructive graph-theoretic methods, arbitrary scalar contractions between copies of the Weyl spinor ψ_ABCD, its conjugate ψ_ȦḂĊḊ and an even number of Ricci spinors can be expressed in terms of paired contractions between these spinors. This leads to an algorithm for the explicit expression of dependent invariants as polynomials of members of the complete set. Finally, we rigorously prove that the complete set as given by Sneddon [J. Math. Phys. 39, 1659-1679 (1998)] for this case is both complete and minimal.

Determination of all syzygies for the dependent polynomial invariants of the Riemann Tensor. III. mixed invariants of arbitrary degree in the Ricci Spinor

In this paper, we rigorously prove that the complete set of Riemann tensor invariants given by Sneddon [J. Math. Phys. 40, 5905 (1999)] is both minimal and complete. Furthermore, we provide a two-stage algorithm for the explicit construction of polynomial syzygies relating any dependent Riemann tensor invariant to members of the complete set.

On the problem of algebraic completeness for the invariants of the Riemann tensor. II

We study the set of invariants CZ [E. Zakhary and J. Carminati, J. Math. Phys. 42, 1474 (2001)] for the class of space-times whose Ricci tensors do not possess a null eigenvector. We show that all cases are completely backsolvable in terms of sets of invariants from CZ. We provide algebraically complete sets for each canonically different space-time.

Syzygies of the polynomial invariants of the Riemann tensor

This thesis introduces a novel way of writing polynomial invariants as network graphs, and applies this diagrammatic notation scheme, in conjunction with graph theory, to derive algorithms for constructing relationships (syzygies) between different invariants. These algorithms give rise to a constructive solution of a longstanding classical problem in invariant theory.

Colour invariants for machine face recognition

Illumination invariance remains the most researched, yet the most challenging aspect of automatic face recognition. In this paper we investigate the discriminative power of colour-based invariants in the presence of large illumination changes between training and test data, when appearance changes due to cast shadows and non-Lambertian effects are significant. Specifically, there are three main contributions: (i) we employ a more sophisticated photometric model of the camera and show how its parameters can be estimated, (ii) we derive several novel colour-based face invariants, and (iii) on a large database of video sequences we examine and evaluate the largest number of colour-based representations in the literature. Our results suggest that colour invariants do have a substantial discriminative power which may increase the robustness and accuracy of recognition from low resolution images.

Eiffel assertions and the external structure of classes and objects

The “external structure” in an object oriented system refers here to the  graphs of objects and classes. The class structure graph or class model is derived from the object structure graph or object model, and in this operation structural information is lost, or never made explicit. Although object oriented programming languages capture the class model as declarations,  contradictory assumptions about object model properties may be made introducing faults into the design. Consistent assumptions about the object model can be specified in the code using assertions such as Eiffel’s  invariants, preconditions and postconditions. Three examples specifying the external structure are considered.

A modified moment-based image watermarking method robust to cropping attack

Developing a watermarking method that is robust to cropping attack is a challenging task in image watermarking. The moment-based watermarking schemes show good robustness to common signal processing attacks and some geometric attacks but are sensitive to cropping attack. In this paper, we modify the moment-based approach to deal with cropping attack. Firstly, we find the probability density function (pdf) of the pixel value distribution from the original image. Secondly, we reshape and normalize the pdf of the pixel value distribution (PPVD) to form a two dimensional image. Then, the moment invariants are calculated from the PPVD image. Since PPVD is insensitive to cropping, the proposed method is robust to cropping attack. Besides, it also has high robustness against other common attacks. Experimental results demonstrate the effectiveness of the proposed method.

Modified moment-based image watermarking method robust to cropping attack

Developing a watermarking method that is robust to cropping attack is a challenging task in image watermarking. The moment-based watermarking schemes show good robustness to common signal processing attacks and some geometric attacks but are sensitive to cropping attack. In this paper, we modify the moment-based approach to deal with cropping attack. Firstly, we find the probability density function (PDF) of the pixel value distribution from the original image. Secondly, we reshape and normalize the pdf of the pixel value distribution (PPVD) to form a two dimensional image. Then, the moment invariants are calculated from the PPVD image. Since PPVD is insensitive to cropping, the proposed method is robust to cropping attack. Besides, it also has high robustness against other common attacks. Theoretical analysis and experimental results demonstrate the effectiveness of the proposed method.