Photograph Signatures for the Protection of Identification Documents
Identifieur interne : 00C495 ( Main/Curation ); précédent : 00C494; suivant : 00C496Photograph Signatures for the Protection of Identification Documents
Auteurs : Bruno Bellamy [France] ; John S. Mason [Royaume-Uni] ; Michael Ellis [Australie]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1999.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Contrôle à la frontière, Codage, Passeport.
English descriptors
- KwdEn :
- Algorithm, Bellamy, Block separation distance, Border control, Bruno, Bruno bellamy, Byte, Byte signature, Centre, Coding, Counterfeiter, Elli, Encoding, Encoding algorithm, Experimental results, Face recognition, Good discrimination, Good results, Grid, Grid centre, Identification systems, Image coding, Information protection, International border control, Michael ellis, Octal, Octal case, Octal coding, Octal coding structure, Octal form, Passport, Pattern recognition, Photograph signatures, Pixel, Public key cryptography, Rabinovich, Resolution levels, Signature, Spare capacity, Step structure.
- Teeft :
- Algorithm, Bellamy, Block separation distance, Border control, Bruno, Bruno bellamy, Byte, Byte signature, Centre, Coding, Counterfeiter, Elli, Encoding, Encoding algorithm, Experimental results, Good discrimination, Good results, Grid, Grid centre, International border control, Michael ellis, Octal, Octal case, Octal coding, Octal coding structure, Octal form, Passport, Photograph signatures, Pixel, Rabinovich, Resolution levels, Signature, Spare capacity, Step structure.
Abstract
Abstract: This paper investigates a photo-signature approach to protecting personal identification documents such as passports. The approach is based on that described in a recent publication by O’Gorman and Rabinovich [1] which uses encoded data derived from comparisons of image sub-blocks across the photograph of the document. The encoded data is generated and stored at the time of document creation, and used subsequently to test document authenticity. Here we report on experiments which corroborate the fundamental findings of [1], namely that it is possible to usefully encode the photograph information in only tens of bytes of data. Furthermore we show that new block structures can improve the efficiency of the encoded data. This is important since the encoding efficiency, measured in terms of number of bytes versus discriminating performance, is particularly important when storing data on a small document such as a passport or ID card. We show that a step structure is measurably better than the original octal structure used in [1] when there are only a small number of bytes (20 to 30) in the photo-signature.
Url:
DOI: 10.1007/3-540-46665-7_13
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001A84
- to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :001A84
- to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :002158
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :00D468
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :006051
- to stream PascalFrancis, to step Curation: Pour aller vers cette notice dans l'étape Curation :000119
- to stream PascalFrancis, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :005F47
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :00D660
Links to Exploration step
ISTEX:8E0FE04B9611C159FD52364ABF7DC7869D225BBCLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Photograph Signatures for the Protection of Identification Documents</title><author><name sortKey="Bellamy, Bruno" sort="Bellamy, Bruno" uniqKey="Bellamy B" first="Bruno" last="Bellamy">Bruno Bellamy</name></author><author><name sortKey="Mason, John S" sort="Mason, John S" uniqKey="Mason J" first="John S." last="Mason">John S. Mason</name></author><author><name sortKey="Ellis, Michael" sort="Ellis, Michael" uniqKey="Ellis M" first="Michael" last="Ellis">Michael Ellis</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:8E0FE04B9611C159FD52364ABF7DC7869D225BBC</idno><date when="1999" year="1999">1999</date><idno type="doi">10.1007/3-540-46665-7_13</idno><idno type="url">https://api.istex.fr/document/8E0FE04B9611C159FD52364ABF7DC7869D225BBC/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001A84</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001A84</idno><idno type="wicri:Area/Istex/Curation">001A84</idno><idno type="wicri:Area/Istex/Checkpoint">002158</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002158</idno><idno type="wicri:doubleKey">0302-9743:1999:Bellamy B:photograph:signatures:for</idno><idno type="wicri:Area/Main/Merge">00D468</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:00-0108873</idno><idno type="wicri:Area/PascalFrancis/Corpus">006051</idno><idno type="wicri:Area/PascalFrancis/Curation">000119</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">005F47</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">005F47</idno><idno type="wicri:doubleKey">0302-9743:1999:Bellamy B:photograph:signatures:for</idno><idno type="wicri:Area/Main/Merge">00D660</idno><idno type="wicri:Area/Main/Curation">00C495</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Photograph Signatures for the Protection of Identification Documents</title><author><name sortKey="Bellamy, Bruno" sort="Bellamy, Bruno" uniqKey="Bellamy B" first="Bruno" last="Bellamy">Bruno Bellamy</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>ENIB, Brest</wicri:regionArea><placeName><region type="region">Région Bretagne</region><region type="old region">Région Bretagne</region><settlement type="city">Brest</settlement></placeName></affiliation></author><author><name sortKey="Mason, John S" sort="Mason, John S" uniqKey="Mason J" first="John S." last="Mason">John S. Mason</name><affiliation wicri:level="1"><country xml:lang="fr">Royaume-Uni</country><wicri:regionArea>Department of Electrical & Electronic Engineering, University of Wales Swansea, SA2 8PP</wicri:regionArea><wicri:noRegion>SA2 8PP</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Royaume-Uni</country></affiliation></author><author><name sortKey="Ellis, Michael" sort="Ellis, Michael" uniqKey="Ellis M" first="Michael" last="Ellis">Michael Ellis</name><affiliation wicri:level="1"><country xml:lang="fr">Australie</country><wicri:regionArea>Dynjab Technologies, Canberra</wicri:regionArea><wicri:noRegion>Canberra</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1999</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term><term>Bellamy</term><term>Block separation distance</term><term>Border control</term><term>Bruno</term><term>Bruno bellamy</term><term>Byte</term><term>Byte signature</term><term>Centre</term><term>Coding</term><term>Counterfeiter</term><term>Elli</term><term>Encoding</term><term>Encoding algorithm</term><term>Experimental results</term><term>Face recognition</term><term>Good discrimination</term><term>Good results</term><term>Grid</term><term>Grid centre</term><term>Identification systems</term><term>Image coding</term><term>Information protection</term><term>International border control</term><term>Michael ellis</term><term>Octal</term><term>Octal case</term><term>Octal coding</term><term>Octal coding structure</term><term>Octal form</term><term>Passport</term><term>Pattern recognition</term><term>Photograph signatures</term><term>Pixel</term><term>Public key cryptography</term><term>Rabinovich</term><term>Resolution levels</term><term>Signature</term><term>Spare capacity</term><term>Step structure</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Codage image</term><term>Cryptographie clé publique</term><term>Protection information</term><term>Reconnaissance forme</term><term>Reconnaissance visage</term><term>Système identification</term></keywords><keywords scheme="Teeft" xml:lang="en"><term>Algorithm</term><term>Bellamy</term><term>Block separation distance</term><term>Border control</term><term>Bruno</term><term>Bruno bellamy</term><term>Byte</term><term>Byte signature</term><term>Centre</term><term>Coding</term><term>Counterfeiter</term><term>Elli</term><term>Encoding</term><term>Encoding algorithm</term><term>Experimental results</term><term>Good discrimination</term><term>Good results</term><term>Grid</term><term>Grid centre</term><term>International border control</term><term>Michael ellis</term><term>Octal</term><term>Octal case</term><term>Octal coding</term><term>Octal coding structure</term><term>Octal form</term><term>Passport</term><term>Photograph signatures</term><term>Pixel</term><term>Rabinovich</term><term>Resolution levels</term><term>Signature</term><term>Spare capacity</term><term>Step structure</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Contrôle à la frontière</term><term>Codage</term><term>Passeport</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This paper investigates a photo-signature approach to protecting personal identification documents such as passports. The approach is based on that described in a recent publication by O’Gorman and Rabinovich [1] which uses encoded data derived from comparisons of image sub-blocks across the photograph of the document. The encoded data is generated and stored at the time of document creation, and used subsequently to test document authenticity. Here we report on experiments which corroborate the fundamental findings of [1], namely that it is possible to usefully encode the photograph information in only tens of bytes of data. Furthermore we show that new block structures can improve the efficiency of the encoded data. This is important since the encoding efficiency, measured in terms of number of bytes versus discriminating performance, is particularly important when storing data on a small document such as a passport or ID card. We show that a step structure is measurably better than the original octal structure used in [1] when there are only a small number of bytes (20 to 30) in the photo-signature.</div></front></TEI><double idat="0302-9743:1999:Bellamy B:photograph:signatures:for"><INIST><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Photograph signatures for the protection of identification documents</title><author><name sortKey="Bellamy, B" sort="Bellamy, B" uniqKey="Bellamy B" first="B." last="Bellamy">B. Bellamy</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>ENIB</s1><s2>Brest</s2><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region">Région Bretagne</region><region type="old region">Région Bretagne</region><settlement type="city">Brest</settlement></placeName></affiliation></author><author><name sortKey="Mason, J S" sort="Mason, J S" uniqKey="Mason J" first="J. S." last="Mason">J. S. Mason</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Electrical & Electronic Engineering, University of Wales Swansea</s1><s2>SA2 8PP</s2><s3>GBR</s3><sZ>2 aut.</sZ></inist:fA14><country>Royaume-Uni</country><wicri:noRegion>SA2 8PP</wicri:noRegion></affiliation></author><author><name sortKey="Ellis, M" sort="Ellis, M" uniqKey="Ellis M" first="M." last="Ellis">M. Ellis</name><affiliation wicri:level="1"><inist:fA14 i1="03"><s1>Dynjab Technologies</s1><s2>Canberra</s2><s3>AUS</s3><sZ>3 aut.</sZ></inist:fA14><country>Australie</country><wicri:noRegion>Dynjab Technologies</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">00-0108873</idno><date when="1999">1999</date><idno type="stanalyst">PASCAL 00-0108873 INIST</idno><idno type="RBID">Pascal:00-0108873</idno><idno type="wicri:Area/PascalFrancis/Corpus">006051</idno><idno type="wicri:Area/PascalFrancis/Curation">000119</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">005F47</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">005F47</idno><idno type="wicri:doubleKey">0302-9743:1999:Bellamy B:photograph:signatures:for</idno><idno type="wicri:Area/Main/Merge">00D660</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Photograph signatures for the protection of identification documents</title><author><name sortKey="Bellamy, B" sort="Bellamy, B" uniqKey="Bellamy B" first="B." last="Bellamy">B. Bellamy</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>ENIB</s1><s2>Brest</s2><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region">Région Bretagne</region><region type="old region">Région Bretagne</region><settlement type="city">Brest</settlement></placeName></affiliation></author><author><name sortKey="Mason, J S" sort="Mason, J S" uniqKey="Mason J" first="J. S." last="Mason">J. S. Mason</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Electrical & Electronic Engineering, University of Wales Swansea</s1><s2>SA2 8PP</s2><s3>GBR</s3><sZ>2 aut.</sZ></inist:fA14><country>Royaume-Uni</country><wicri:noRegion>SA2 8PP</wicri:noRegion></affiliation></author><author><name sortKey="Ellis, M" sort="Ellis, M" uniqKey="Ellis M" first="M." last="Ellis">M. Ellis</name><affiliation wicri:level="1"><inist:fA14 i1="03"><s1>Dynjab Technologies</s1><s2>Canberra</s2><s3>AUS</s3><sZ>3 aut.</sZ></inist:fA14><country>Australie</country><wicri:noRegion>Dynjab Technologies</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno><imprint><date when="1999">1999</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Face recognition</term><term>Identification systems</term><term>Image coding</term><term>Information protection</term><term>Pattern recognition</term><term>Public key cryptography</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Cryptographie clé publique</term><term>Système identification</term><term>Protection information</term><term>Reconnaissance forme</term><term>Reconnaissance visage</term><term>Codage image</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">This paper investigates a photo-signature approach to protecting personal identification documents such as passports. The approach is based on that described in a recent publication by O'Gorman and Rabinovich [1] which uses encoded data derived from comparisons of image sub-blocks across the photograph of the document. The encoded data is generated and stored at the time of document creation, and used subsequently to test document authenticity. Here we report on experiments which corroborate the fundamental findings of [1], namely that it is possible to usefully encode the photograph information in only tens of bytes of data. Furthermore we show that new block structures can improve the efficiency of the encoded data. This is important since the encoding efficiency, measured in terms of number of bytes versus discriminating performance, is particularly important when storing data on a small document such as a passport or ID card. We show that a step structure is measurably better than the original octal structure used in [1] when there are only a small number of bytes (20 to 30) in the photo-signature.</div></front></TEI></INIST><ISTEX><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Photograph Signatures for the Protection of Identification Documents</title><author><name sortKey="Bellamy, Bruno" sort="Bellamy, Bruno" uniqKey="Bellamy B" first="Bruno" last="Bellamy">Bruno Bellamy</name></author><author><name sortKey="Mason, John S" sort="Mason, John S" uniqKey="Mason J" first="John S." last="Mason">John S. Mason</name></author><author><name sortKey="Ellis, Michael" sort="Ellis, Michael" uniqKey="Ellis M" first="Michael" last="Ellis">Michael Ellis</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:8E0FE04B9611C159FD52364ABF7DC7869D225BBC</idno><date when="1999" year="1999">1999</date><idno type="doi">10.1007/3-540-46665-7_13</idno><idno type="url">https://api.istex.fr/document/8E0FE04B9611C159FD52364ABF7DC7869D225BBC/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001A84</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001A84</idno><idno type="wicri:Area/Istex/Curation">001A84</idno><idno type="wicri:Area/Istex/Checkpoint">002158</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002158</idno><idno type="wicri:doubleKey">0302-9743:1999:Bellamy B:photograph:signatures:for</idno><idno type="wicri:Area/Main/Merge">00D468</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Photograph Signatures for the Protection of Identification Documents</title><author><name sortKey="Bellamy, Bruno" sort="Bellamy, Bruno" uniqKey="Bellamy B" first="Bruno" last="Bellamy">Bruno Bellamy</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>ENIB, Brest</wicri:regionArea><placeName><region type="region">Région Bretagne</region><region type="old region">Région Bretagne</region><settlement type="city">Brest</settlement></placeName></affiliation></author><author><name sortKey="Mason, John S" sort="Mason, John S" uniqKey="Mason J" first="John S." last="Mason">John S. Mason</name><affiliation wicri:level="1"><country xml:lang="fr">Royaume-Uni</country><wicri:regionArea>Department of Electrical & Electronic Engineering, University of Wales Swansea, SA2 8PP</wicri:regionArea><wicri:noRegion>SA2 8PP</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Royaume-Uni</country></affiliation></author><author><name sortKey="Ellis, Michael" sort="Ellis, Michael" uniqKey="Ellis M" first="Michael" last="Ellis">Michael Ellis</name><affiliation wicri:level="1"><country xml:lang="fr">Australie</country><wicri:regionArea>Dynjab Technologies, Canberra</wicri:regionArea><wicri:noRegion>Canberra</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1999</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term><term>Bellamy</term><term>Block separation distance</term><term>Border control</term><term>Bruno</term><term>Bruno bellamy</term><term>Byte</term><term>Byte signature</term><term>Centre</term><term>Coding</term><term>Counterfeiter</term><term>Elli</term><term>Encoding</term><term>Encoding algorithm</term><term>Experimental results</term><term>Good discrimination</term><term>Good results</term><term>Grid</term><term>Grid centre</term><term>International border control</term><term>Michael ellis</term><term>Octal</term><term>Octal case</term><term>Octal coding</term><term>Octal coding structure</term><term>Octal form</term><term>Passport</term><term>Photograph signatures</term><term>Pixel</term><term>Rabinovich</term><term>Resolution levels</term><term>Signature</term><term>Spare capacity</term><term>Step structure</term></keywords><keywords scheme="Teeft" xml:lang="en"><term>Algorithm</term><term>Bellamy</term><term>Block separation distance</term><term>Border control</term><term>Bruno</term><term>Bruno bellamy</term><term>Byte</term><term>Byte signature</term><term>Centre</term><term>Coding</term><term>Counterfeiter</term><term>Elli</term><term>Encoding</term><term>Encoding algorithm</term><term>Experimental results</term><term>Good discrimination</term><term>Good results</term><term>Grid</term><term>Grid centre</term><term>International border control</term><term>Michael ellis</term><term>Octal</term><term>Octal case</term><term>Octal coding</term><term>Octal coding structure</term><term>Octal form</term><term>Passport</term><term>Photograph signatures</term><term>Pixel</term><term>Rabinovich</term><term>Resolution levels</term><term>Signature</term><term>Spare capacity</term><term>Step structure</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Contrôle à la frontière</term><term>Codage</term><term>Passeport</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This paper investigates a photo-signature approach to protecting personal identification documents such as passports. The approach is based on that described in a recent publication by O’Gorman and Rabinovich [1] which uses encoded data derived from comparisons of image sub-blocks across the photograph of the document. The encoded data is generated and stored at the time of document creation, and used subsequently to test document authenticity. Here we report on experiments which corroborate the fundamental findings of [1], namely that it is possible to usefully encode the photograph information in only tens of bytes of data. Furthermore we show that new block structures can improve the efficiency of the encoded data. This is important since the encoding efficiency, measured in terms of number of bytes versus discriminating performance, is particularly important when storing data on a small document such as a passport or ID card. We show that a step structure is measurably better than the original octal structure used in [1] when there are only a small number of bytes (20 to 30) in the photo-signature.</div></front></TEI></ISTEX></double></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00C495 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 00C495 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Asie
|area= AustralieFrV1
|flux= Main
|étape= Curation
|type= RBID
|clé= ISTEX:8E0FE04B9611C159FD52364ABF7DC7869D225BBC
|texte= Photograph Signatures for the Protection of Identification Documents
}}
| This area was generated with Dilib version V0.6.33. |  |