Abstract: The process comprises a data-acquisition phase with the creation of a database of multicomponent digital signatures constituting fingerprints of identity documents, linked to a central server relocated relative to a primary database comprising variable textual data and images of reference identity documents. A relocated checking phase of identity documents at a checkpoint comprises the digitizing of an identity document to be checked, the creation of a fingerprint of the digitized document, the comparison of the latter with the fingerprint of a document from the fingerprint database indexed with the same reference number and the sending of a message according to the result of the comparison.

Abstract: The process comprises a data-acquisition phase with the creation of a database of multicomponent digital signatures constituting fingerprints of identity documents, linked to a central server relocated relative to a primary database comprising variable textual data and images of reference identity documents. A relocated checking phase of identity documents at a checkpoint comprises the digitising of an identity document to be checked, the creation of a fingerprint of the digitised document, the comparison of the latter with the fingerprint of a document from the fingerprint database indexed with the same reference number and the sending of a message according to the result of the comparison.

Abstract: The method of indexing multimedia documents comprises the following steps: a) for each document identifying and extracting terms ti constituted by vectors characterizing properties of the; b) storing terms ti in a term base comprising P terms; c) determining a maximum number N of desired concepts that group together the most pertinent terms ti; d) calculating the matrix T of distances between the terms ti of the term base; e) decomposing the set P of terms ti of the term base into N portions Pj (1?j?N) such that P=P1? P2 . . . ? Pj . . .

Abstract: The method of indexing multimedia documents comprises the following steps: a) for each document identifying and extracting terms ti constituted by vectors characterizing properties of the; b) storing terms ti in a term base comprising P terms; c) determining a maximum number N of desired concepts that group together the most pertinent terms ti; d) calculating the matrix T of distances between the terms ti of the term base; e) decomposing the set P of terms ti of the term base into N portions Pj (1?j?N) such that P=P1? P2 . . . ? Pj . . .