InforLorV4, Istex, Corpus, bibRecord, 000345

Properties of Minimal Ghosts

Identifieur interne : 000345 ( Istex/Corpus ); précédent : 000344; suivant : 000346

Properties of Minimal Ghosts

Auteurs : Imants Svalbe ; Nicolas Normand

Source :

Lecture Notes in Computer Science [ 0302-9743 ]

RBID : ISTEX:0F6C776B347266959A934464E7F3EF27F7C53D11

Abstract

Abstract: A ghost image is an array of signed pixel values so positioned as to create zero-sums in all discrete projections taken across that image for a pre-defined set of angles. The discrete projection scheme used here is the finite Radon transform. Minimal ghosts employ just 2N pixels to generate zero-sum projections at N projection angles. We describe efficient methods to construct $N^\text{th}$ order minimal ghost images on prime-sized 2D arrays. Ghost images or switching components are important in discrete image reconstruction. Ghosts usually grow larger as they are constrained by more projection angles. When ghosts become too large to be added to an image, image reconstruction from projections becomes unique and exact. Ghosts can be used to synthesize image/anti-image data that will also exhibit zero-sum projections at N pre-defined angles. We examine the remarkable symmetry, cross- and auto-correlation properties of minimal ghosts. The geometric properties of minimal ghost images may make them suitable to embed in data as watermarks.

Url:

https://api.istex.fr/ark:/67375/HCB-DNSKV6GK-Z/fulltext.pdf

DOI: 10.1007/978-3-642-19867-0_35

Links to Exploration step

ISTEX:0F6C776B347266959A934464E7F3EF27F7C53D11

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Properties of Minimal Ghosts</title>
<author><name sortKey="Svalbe, Imants" sort="Svalbe, Imants" uniqKey="Svalbe I" first="Imants" last="Svalbe">Imants Svalbe</name>
<affiliation><mods:affiliation>School of Physics, Monash University, Melbourne, Australia</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Normand, Nicolas" sort="Normand, Nicolas" uniqKey="Normand N" first="Nicolas" last="Normand">Nicolas Normand</name>
<affiliation><mods:affiliation>School of Physics, Monash University, Melbourne, Australia</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>IRCCyN, University of Nantes, Nantes, France</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:0F6C776B347266959A934464E7F3EF27F7C53D11</idno>
<date when="2011" year="2011">2011</date>
<idno type="doi">10.1007/978-3-642-19867-0_35</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-DNSKV6GK-Z/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000345</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000345</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Properties of Minimal Ghosts</title>
<author><name sortKey="Svalbe, Imants" sort="Svalbe, Imants" uniqKey="Svalbe I" first="Imants" last="Svalbe">Imants Svalbe</name>
<affiliation><mods:affiliation>School of Physics, Monash University, Melbourne, Australia</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Normand, Nicolas" sort="Normand, Nicolas" uniqKey="Normand N" first="Nicolas" last="Normand">Nicolas Normand</name>
<affiliation><mods:affiliation>School of Physics, Monash University, Melbourne, Australia</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>IRCCyN, University of Nantes, Nantes, France</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: A ghost image is an array of signed pixel values so positioned as to create zero-sums in all discrete projections taken across that image for a pre-defined set of angles. The discrete projection scheme used here is the finite Radon transform. Minimal ghosts employ just 2N pixels to generate zero-sum projections at N projection angles. We describe efficient methods to construct $N^\text{th}$ order minimal ghost images on prime-sized 2D arrays. Ghost images or switching components are important in discrete image reconstruction. Ghosts usually grow larger as they are constrained by more projection angles. When ghosts become too large to be added to an image, image reconstruction from projections becomes unique and exact. Ghosts can be used to synthesize image/anti-image data that will also exhibit zero-sum projections at N pre-defined angles. We examine the remarkable symmetry, cross- and auto-correlation properties of minimal ghosts. The geometric properties of minimal ghost images may make them suitable to embed in data as watermarks.</div>
</front>
</TEI>
<istex><corpusName>springer-ebooks</corpusName>
<author><json:item><name>Imants Svalbe</name>
<affiliations><json:string>School of Physics, Monash University, Melbourne, Australia</json:string>
</affiliations>
</json:item>
<json:item><name>Nicolas Normand</name>
<affiliations><json:string>School of Physics, Monash University, Melbourne, Australia</json:string>
<json:string>IRCCyN, University of Nantes, Nantes, France</json:string>
</affiliations>
</json:item>
</author>
<arkIstex>ark:/67375/HCB-DNSKV6GK-Z</arkIstex>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>OriginalPaper</json:string>
</originalGenre>
<abstract>Abstract: A ghost image is an array of signed pixel values so positioned as to create zero-sums in all discrete projections taken across that image for a pre-defined set of angles. The discrete projection scheme used here is the finite Radon transform. Minimal ghosts employ just 2N pixels to generate zero-sum projections at N projection angles. We describe efficient methods to construct $N^\text{th}$ order minimal ghost images on prime-sized 2D arrays. Ghost images or switching components are important in discrete image reconstruction. Ghosts usually grow larger as they are constrained by more projection angles. When ghosts become too large to be added to an image, image reconstruction from projections becomes unique and exact. Ghosts can be used to synthesize image/anti-image data that will also exhibit zero-sum projections at N pre-defined angles. We examine the remarkable symmetry, cross- and auto-correlation properties of minimal ghosts. The geometric properties of minimal ghost images may make them suitable to embed in data as watermarks.</abstract>
<qualityIndicators><refBibsNative>false</refBibsNative>
<abstractWordCount>160</abstractWordCount>
<abstractCharCount>1059</abstractCharCount>
<keywordCount>0</keywordCount>
<score>8.92</score>
<pdfWordCount>5116</pdfWordCount>
<pdfCharCount>25870</pdfCharCount>
<pdfVersion>1.6</pdfVersion>
<pdfPageCount>12</pdfPageCount>
<pdfPageSize>429.442 x 659.895 pts</pdfPageSize>
</qualityIndicators>
<title>Properties of Minimal Ghosts</title>
<chapterId><json:string>35</json:string>
<json:string>Chap35</json:string>
</chapterId>
<genre><json:string>conference</json:string>
</genre>
<serie><title>Lecture Notes in Computer Science</title>
<language><json:string>unknown</json:string>
</language>
<copyrightDate>2011</copyrightDate>
<issn><json:string>0302-9743</json:string>
</issn>
<eissn><json:string>1611-3349</json:string>
</eissn>
<editor><json:item><name>David Hutchison</name>
<affiliations><json:string>Lancaster University, Lancaster, UK</json:string>
</affiliations>
</json:item>
<json:item><name>Takeo Kanade</name>
<affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Josef Kittler</name>
<affiliations><json:string>University of Surrey, Guildford, UK</json:string>
</affiliations>
</json:item>
<json:item><name>Jon M. Kleinberg</name>
<affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Friedemann Mattern</name>
<affiliations><json:string>ETH Zurich, Zurich, Switzerland</json:string>
</affiliations>
</json:item>
<json:item><name>John C. Mitchell</name>
<affiliations><json:string>Stanford University, Stanford, CA, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Moni Naor</name>
<affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string>
</affiliations>
</json:item>
<json:item><name>Oscar Nierstrasz</name>
<affiliations><json:string>University of Bern, Bern, Switzerland</json:string>
</affiliations>
</json:item>
<json:item><name>C. Pandu Rangan</name>
<affiliations><json:string>Indian Institute of Technology, Madras, India</json:string>
</affiliations>
</json:item>
<json:item><name>Bernhard Steffen</name>
<affiliations><json:string>University of Dortmund, Dortmund, Germany</json:string>
</affiliations>
</json:item>
<json:item><name>Madhu Sudan</name>
<affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Demetri Terzopoulos</name>
<affiliations><json:string>University of California, Los Angeles, CA, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Doug Tygar</name>
<affiliations><json:string>University of California, Berkeley, CA, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Moshe Y. Vardi</name>
<affiliations><json:string>Rice University, Houston, TX, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Gerhard Weikum</name>
<affiliations><json:string>Max-Planck Institute of Computer Science, Saarbrücken, Germany</json:string>
</affiliations>
</json:item>
</editor>
</serie>
<host><title>Discrete Geometry for Computer Imagery</title>
<language><json:string>unknown</json:string>
</language>
<copyrightDate>2011</copyrightDate>
<doi><json:string>10.1007/978-3-642-19867-0</json:string>
</doi>
<issn><json:string>0302-9743</json:string>
</issn>
<eissn><json:string>1611-3349</json:string>
</eissn>
<eisbn><json:string>978-3-642-19867-0</json:string>
</eisbn>
<bookId><json:string>978-3-642-19867-0</json:string>
</bookId>
<isbn><json:string>978-3-642-19866-3</json:string>
</isbn>
<volume>6607</volume>
<pages><first>417</first>
<last>428</last>
</pages>
<genre><json:string>book-series</json:string>
</genre>
<editor><json:item><name>Isabelle Debled-Rennesson</name>
<affiliations><json:string>LORIA, Equipe ADAGIo, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy Cedex, France</json:string>
<json:string>E-mail: isabelle.debled-rennesson@loria.fr</json:string>
</affiliations>
</json:item>
<json:item><name>Eric Domenjoud</name>
<affiliations><json:string>LORIA, Equipe ADAGIo, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy Cedex, France</json:string>
<json:string>E-mail: eric.domenjoud@loria.fr</json:string>
</affiliations>
</json:item>
<json:item><name>Bertrand Kerautret</name>
<affiliations><json:string>LORIA, Equipe ADAGIo, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy Cedex, France</json:string>
<json:string>E-mail: bertrand.kerautret@loria.fr</json:string>
</affiliations>
</json:item>
<json:item><name>Philippe Even</name>
<affiliations><json:string>LORIA, Equipe ADAGIo, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy Cedex, France</json:string>
<json:string>E-mail: philippe.even@loria.fr</json:string>
</affiliations>
</json:item>
</editor>
<subject><json:item><value>Computer Science</value>
</json:item>
<json:item><value>Computer Science</value>
</json:item>
<json:item><value>Computer Graphics</value>
</json:item>
<json:item><value>Image Processing and Computer Vision</value>
</json:item>
<json:item><value>Computer Imaging, Vision, Pattern Recognition and Graphics</value>
</json:item>
<json:item><value>Pattern Recognition</value>
</json:item>
<json:item><value>Discrete Mathematics in Computer Science</value>
</json:item>
<json:item><value>Algorithm Analysis and Problem Complexity</value>
</json:item>
</subject>
</host>
<ark><json:string>ark:/67375/HCB-DNSKV6GK-Z</json:string>
</ark>
<publicationDate>2011</publicationDate>
<copyrightDate>2011</copyrightDate>
<doi><json:string>10.1007/978-3-642-19867-0_35</json:string>
</doi>
<id>0F6C776B347266959A934464E7F3EF27F7C53D11</id>
<score>1</score>
<fulltext><json:item><extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-DNSKV6GK-Z/fulltext.pdf</uri>
</json:item>
<json:item><extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-DNSKV6GK-Z/bundle.zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-DNSKV6GK-Z/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Properties of Minimal Ghosts</title>
</titleStmt>
<publicationStmt><authority>ISTEX</authority>
<availability><licence>Springer-Verlag Berlin Heidelberg</licence>
</availability>
<date when="2011">2011</date>
</publicationStmt>
<notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note>
<note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Properties of Minimal Ghosts</title>
<author><persName><forename type="first">Imants</forename>
<surname>Svalbe</surname>
</persName>
<affiliation><orgName type="department">School of Physics</orgName>
<orgName type="institution">Monash University</orgName>
<address><settlement>Melbourne</settlement>
<country key="AU">AUSTRALIA</country>
</address>
</affiliation>
</author>
<author><persName><forename type="first">Nicolas</forename>
<surname>Normand</surname>
</persName>
<affiliation><orgName type="department">School of Physics</orgName>
<orgName type="institution">Monash University</orgName>
<address><settlement>Melbourne</settlement>
<country key="AU">AUSTRALIA</country>
</address>
</affiliation>
<affiliation><orgName type="department">IRCCyN</orgName>
<orgName type="institution">University of Nantes</orgName>
<address><settlement>Nantes</settlement>
<country key="FR">FRANCE</country>
</address>
</affiliation>
</author>
<idno type="istex">0F6C776B347266959A934464E7F3EF27F7C53D11</idno>
<idno type="ark">ark:/67375/HCB-DNSKV6GK-Z</idno>
<idno type="DOI">10.1007/978-3-642-19867-0_35</idno>
</analytic>
<monogr><title level="m" type="main">Discrete Geometry for Computer Imagery</title>
<title level="m" type="sub">16th IAPR International Conference, DGCI 2011, Nancy, France, April 6-8, 2011. Proceedings</title>
<title level="m" type="part">Discrete Tomography</title>
<idno type="DOI">10.1007/978-3-642-19867-0</idno>
<idno type="book-id">978-3-642-19867-0</idno>
<idno type="ISBN">978-3-642-19866-3</idno>
<idno type="eISBN">978-3-642-19867-0</idno>
<idno type="chapter-id">Chap35</idno>
<idno type="part-id">Part6</idno>
<editor><persName><forename type="first">Isabelle</forename>
<surname>Debled-Rennesson</surname>
</persName>
<email>isabelle.debled-rennesson@loria.fr</email>
<affiliation><orgName type="institution">LORIA, Equipe ADAGIo</orgName>
<address><street>Campus Scientifique, BP 239</street>
<postCode>54506</postCode>
<settlement>Vandœuvre-lès-Nancy Cedex</settlement>
<country key="FR">FRANCE</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Eric</forename>
<surname>Domenjoud</surname>
</persName>
<email>eric.domenjoud@loria.fr</email>
<affiliation><orgName type="institution">LORIA, Equipe ADAGIo</orgName>
<address><street>Campus Scientifique, BP 239</street>
<postCode>54506</postCode>
<settlement>Vandœuvre-lès-Nancy Cedex</settlement>
<country key="FR">FRANCE</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Bertrand</forename>
<surname>Kerautret</surname>
</persName>
<email>bertrand.kerautret@loria.fr</email>
<affiliation><orgName type="institution">LORIA, Equipe ADAGIo</orgName>
<address><street>Campus Scientifique, BP 239</street>
<postCode>54506</postCode>
<settlement>Vandœuvre-lès-Nancy Cedex</settlement>
<country key="FR">FRANCE</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Philippe</forename>
<surname>Even</surname>
</persName>
<email>philippe.even@loria.fr</email>
<affiliation><orgName type="institution">LORIA, Equipe ADAGIo</orgName>
<address><street>Campus Scientifique, BP 239</street>
<postCode>54506</postCode>
<settlement>Vandœuvre-lès-Nancy Cedex</settlement>
<country key="FR">FRANCE</country>
</address>
</affiliation>
</editor>
<imprint><biblScope unit="vol">6607</biblScope>
<biblScope unit="page" from="417">417</biblScope>
<biblScope unit="page" to="428">428</biblScope>
<biblScope unit="chapter-count">43</biblScope>
<biblScope unit="part-chapter-count">5</biblScope>
</imprint>
</monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<editor><persName><forename type="first">David</forename>
<surname>Hutchison</surname>
</persName>
<affiliation><orgName type="institution">Lancaster University</orgName>
<address><settlement>Lancaster</settlement>
<country key="GB">UNITED KINGDOM</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Takeo</forename>
<surname>Kanade</surname>
</persName>
<affiliation><orgName type="institution">Carnegie Mellon University</orgName>
<address><settlement>Pittsburgh</settlement>
<region>PA</region>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Josef</forename>
<surname>Kittler</surname>
</persName>
<affiliation><orgName type="institution">University of Surrey</orgName>
<address><settlement>Guildford</settlement>
<country key="GB">UNITED KINGDOM</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Jon</forename>
<forename type="first">M.</forename>
<surname>Kleinberg</surname>
</persName>
<affiliation><orgName type="institution">Cornell University</orgName>
<address><settlement>Ithaca</settlement>
<region>NY</region>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Friedemann</forename>
<surname>Mattern</surname>
</persName>
<affiliation><orgName type="institution">ETH Zurich</orgName>
<address><settlement>Zurich</settlement>
<country key="CH">SWITZERLAND</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">John</forename>
<forename type="first">C.</forename>
<surname>Mitchell</surname>
</persName>
<affiliation><orgName type="institution">Stanford University</orgName>
<address><settlement>Stanford</settlement>
<region>CA</region>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Moni</forename>
<surname>Naor</surname>
</persName>
<affiliation><orgName type="institution">Weizmann Institute of Science</orgName>
<address><settlement>Rehovot</settlement>
<country key="IL">ISRAEL</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Oscar</forename>
<surname>Nierstrasz</surname>
</persName>
<affiliation><orgName type="institution">University of Bern</orgName>
<address><settlement>Bern</settlement>
<country key="CH">SWITZERLAND</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">C.</forename>
<surname>Pandu Rangan</surname>
</persName>
<affiliation><orgName type="institution">Indian Institute of Technology</orgName>
<address><settlement>Madras</settlement>
<country key="IN">INDIA</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Bernhard</forename>
<surname>Steffen</surname>
</persName>
<affiliation><orgName type="institution">University of Dortmund</orgName>
<address><settlement>Dortmund</settlement>
<country key="DE">GERMANY</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Madhu</forename>
<surname>Sudan</surname>
</persName>
<affiliation><orgName type="institution">Massachusetts Institute of Technology</orgName>
<address><region>MA</region>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Demetri</forename>
<surname>Terzopoulos</surname>
</persName>
<affiliation><orgName type="institution">University of California</orgName>
<address><settlement>Los Angeles</settlement>
<region>CA</region>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Doug</forename>
<surname>Tygar</surname>
</persName>
<affiliation><orgName type="institution">University of California</orgName>
<address><settlement>Berkeley</settlement>
<region>CA</region>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Moshe</forename>
<forename type="first">Y.</forename>
<surname>Vardi</surname>
</persName>
<affiliation><orgName type="institution">Rice University</orgName>
<address><settlement>Houston</settlement>
<region>TX</region>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Gerhard</forename>
<surname>Weikum</surname>
</persName>
<affiliation><orgName type="institution">Max-Planck Institute of Computer Science</orgName>
<address><settlement>Saarbrücken</settlement>
<country key="DE">GERMANY</country>
</address>
</affiliation>
</editor>
<idno type="pISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="seriesID">558</idno>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><abstract xml:lang="en"><head>Abstract</head>
<p>A ghost image is an array of signed pixel values so positioned as to create zero-sums in all discrete projections taken across that image for a pre-defined set of angles. The discrete projection scheme used here is the finite Radon transform. Minimal ghosts employ just 2<hi rend="italic">N</hi>
 pixels to generate zero-sum projections at <hi rend="italic">N</hi>
 projection angles. We describe efficient methods to construct <formula xml:id="IEq1" notation="TEX"><media mimeType="image" url=""></media>$N^\text{th}$
</formula>
 order minimal ghost images on prime-sized 2D arrays. Ghost images or switching components are important in discrete image reconstruction. Ghosts usually grow larger as they are constrained by more projection angles. When ghosts become too large to be added to an image, image reconstruction from projections becomes unique and exact. Ghosts can be used to synthesize image/anti-image data that will also exhibit zero-sum projections at <hi rend="italic">N</hi>
 pre-defined angles. We examine the remarkable symmetry, cross- and auto-correlation properties of minimal ghosts. The geometric properties of minimal ghost images may make them suitable to embed in data as watermarks.</p>
</abstract>
<textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label>
<item><term>Computer Science</term>
</item>
</list>
</keywords>
</textClass>
<textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label>
<item><term type="Primary">Computer Science</term>
</item>
<label>I22013</label>
<item><term type="Secondary" subtype="priority-1">Computer Graphics</term>
</item>
<label>I22021</label>
<item><term type="Secondary" subtype="priority-2">Image Processing and Computer Vision</term>
</item>
<label>I22005</label>
<item><term type="Secondary" subtype="priority-3">Computer Imaging, Vision, Pattern Recognition and Graphics</term>
</item>
<label>I2203X</label>
<item><term type="Secondary" subtype="priority-4">Pattern Recognition</term>
</item>
<label>I17028</label>
<item><term type="Secondary" subtype="priority-5">Discrete Mathematics in Computer Science</term>
</item>
<label>I16021</label>
<item><term type="Secondary" subtype="priority-6">Algorithm Analysis and Problem Complexity</term>
</item>
</list>
</keywords>
</textClass>
<langUsage><language ident="EN"></language>
</langUsage>
</profileDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item><extension>txt</extension>
<original>false</original>
<mimetype>text/plain</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-DNSKV6GK-Z/fulltext.txt</uri>
</json:item>
</fulltext>
<metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration>
<istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType>
<istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName>
<PublisherLocation>Berlin, Heidelberg</PublisherLocation>
</PublisherInfo>
<Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID>
<SeriesPrintISSN>0302-9743</SeriesPrintISSN>
<SeriesElectronicISSN>1611-3349</SeriesElectronicISSN>
<SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle>
</SeriesInfo>
<SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName>
<FamilyName>Hutchison</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName>
<FamilyName>Kanade</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName>
<FamilyName>Kittler</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName>
<GivenName>M.</GivenName>
<FamilyName>Kleinberg</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName>
<FamilyName>Mattern</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName>
<GivenName>C.</GivenName>
<FamilyName>Mitchell</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName>
<FamilyName>Naor</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName>
<FamilyName>Nierstrasz</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName>
<FamilyName>Pandu Rangan</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName>
<FamilyName>Steffen</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName>
<FamilyName>Sudan</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName>
<FamilyName>Terzopoulos</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName>
<FamilyName>Tygar</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName>
<GivenName>Y.</GivenName>
<FamilyName>Vardi</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName>
<FamilyName>Weikum</FamilyName>
</EditorName>
</Editor>
<Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName>
<OrgAddress><City>Lancaster</City>
<Country>UK</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName>
<OrgAddress><City>Pittsburgh</City>
<State>PA</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName>
<OrgAddress><City>Guildford</City>
<Country>UK</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff4"><OrgName>Cornell University</OrgName>
<OrgAddress><City>Ithaca</City>
<State>NY</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName>
<OrgAddress><City>Zurich</City>
<Country>Switzerland</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff6"><OrgName>Stanford University</OrgName>
<OrgAddress><City>Stanford</City>
<State>CA</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName>
<OrgAddress><City>Rehovot</City>
<Country>Israel</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff8"><OrgName>University of Bern</OrgName>
<OrgAddress><City>Bern</City>
<Country>Switzerland</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName>
<OrgAddress><City>Madras</City>
<Country>India</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName>
<OrgAddress><City>Dortmund</City>
<Country>Germany</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName>
<OrgAddress><State>MA</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff12"><OrgName>University of California</OrgName>
<OrgAddress><City>Los Angeles</City>
<State>CA</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff13"><OrgName>University of California</OrgName>
<OrgAddress><City>Berkeley</City>
<State>CA</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff14"><OrgName>Rice University</OrgName>
<OrgAddress><City>Houston</City>
<State>TX</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName>
<OrgAddress><City>Saarbrücken</City>
<Country>Germany</Country>
</OrgAddress>
</Affiliation>
</EditorGroup>
</SeriesHeader>
<Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-642-19867-0</BookID>
<BookTitle>Discrete Geometry for Computer Imagery</BookTitle>
<BookSubTitle>16th IAPR International Conference, DGCI 2011, Nancy, France, April 6-8, 2011. Proceedings</BookSubTitle>
<BookVolumeNumber>6607</BookVolumeNumber>
<BookSequenceNumber>6607</BookSequenceNumber>
<BookDOI>10.1007/978-3-642-19867-0</BookDOI>
<BookTitleID>217662</BookTitleID>
<BookPrintISBN>978-3-642-19866-3</BookPrintISBN>
<BookElectronicISBN>978-3-642-19867-0</BookElectronicISBN>
<BookChapterCount>43</BookChapterCount>
<BookCopyright><CopyrightHolderName>Springer Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2011</CopyrightYear>
</BookCopyright>
<BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject>
<BookSubject Code="I22013" Priority="1" Type="Secondary">Computer Graphics</BookSubject>
<BookSubject Code="I22021" Priority="2" Type="Secondary">Image Processing and Computer Vision</BookSubject>
<BookSubject Code="I22005" Priority="3" Type="Secondary">Computer Imaging, Vision, Pattern Recognition and Graphics</BookSubject>
<BookSubject Code="I2203X" Priority="4" Type="Secondary">Pattern Recognition</BookSubject>
<BookSubject Code="I17028" Priority="5" Type="Secondary">Discrete Mathematics in Computer Science</BookSubject>
<BookSubject Code="I16021" Priority="6" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject>
<SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection>
</BookSubjectGroup>
<BookContext><SeriesID>558</SeriesID>
</BookContext>
</BookInfo>
<BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Isabelle</GivenName>
<FamilyName>Debled-Rennesson</FamilyName>
</EditorName>
<Contact><Email>isabelle.debled-rennesson@loria.fr</Email>
</Contact>
</Editor>
<Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Eric</GivenName>
<FamilyName>Domenjoud</FamilyName>
</EditorName>
<Contact><Email>eric.domenjoud@loria.fr</Email>
</Contact>
</Editor>
<Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Bertrand</GivenName>
<FamilyName>Kerautret</FamilyName>
</EditorName>
<Contact><Email>bertrand.kerautret@loria.fr</Email>
</Contact>
</Editor>
<Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Philippe</GivenName>
<FamilyName>Even</FamilyName>
</EditorName>
<Contact><Email>philippe.even@loria.fr</Email>
</Contact>
</Editor>
<Affiliation ID="Aff16"><OrgName>LORIA, Equipe ADAGIo</OrgName>
<OrgAddress><Street>Campus Scientifique, BP 239</Street>
<Postcode>54506</Postcode>
<City>Vandœuvre-lès-Nancy Cedex</City>
<Country>France</Country>
</OrgAddress>
</Affiliation>
</EditorGroup>
</BookHeader>
<Part ID="Part6"><PartInfo TocLevels="0"><PartID>6</PartID>
<PartSequenceNumber>6</PartSequenceNumber>
<PartTitle>Discrete Tomography</PartTitle>
<PartChapterCount>5</PartChapterCount>
<PartContext><SeriesID>558</SeriesID>
<BookTitle>Discrete Geometry for Computer Imagery</BookTitle>
</PartContext>
</PartInfo>
<Chapter ID="Chap35" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>35</ChapterID>
<ChapterDOI>10.1007/978-3-642-19867-0_35</ChapterDOI>
<ChapterSequenceNumber>35</ChapterSequenceNumber>
<ChapterTitle Language="En">Properties of Minimal Ghosts</ChapterTitle>
<ChapterFirstPage>417</ChapterFirstPage>
<ChapterLastPage>428</ChapterLastPage>
<ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2011</CopyrightYear>
</ChapterCopyright>
<ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant>
<AbstractGrant Grant="OpenAccess"></AbstractGrant>
<BodyPDFGrant Grant="Restricted"></BodyPDFGrant>
<BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant>
<BibliographyGrant Grant="Restricted"></BibliographyGrant>
<ESMGrant Grant="Restricted"></ESMGrant>
</ChapterGrants>
<ChapterContext><SeriesID>558</SeriesID>
<PartID>6</PartID>
<BookID>978-3-642-19867-0</BookID>
<BookTitle>Discrete Geometry for Computer Imagery</BookTitle>
</ChapterContext>
</ChapterInfo>
<ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff17"><AuthorName DisplayOrder="Western"><GivenName>Imants</GivenName>
<FamilyName>Svalbe</FamilyName>
</AuthorName>
</Author>
<Author AffiliationIDS="Aff17 Aff18"><AuthorName DisplayOrder="Western"><GivenName>Nicolas</GivenName>
<FamilyName>Normand</FamilyName>
</AuthorName>
</Author>
<Affiliation ID="Aff17"><OrgDivision>School of Physics</OrgDivision>
<OrgName>Monash University</OrgName>
<OrgAddress><City>Melbourne</City>
<Country>Australia</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff18"><OrgDivision>IRCCyN</OrgDivision>
<OrgName>University of Nantes</OrgName>
<OrgAddress><City>Nantes</City>
<Country>France</Country>
</OrgAddress>
</Affiliation>
</AuthorGroup>
<Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading>
<Para>A ghost image is an array of signed pixel values so positioned as to create zero-sums in all discrete projections taken across that image for a pre-defined set of angles. The discrete projection scheme used here is the finite Radon transform. Minimal ghosts employ just 2<Emphasis Type="Italic">N</Emphasis>
 pixels to generate zero-sum projections at <Emphasis Type="Italic">N</Emphasis>
 projection angles. We describe efficient methods to construct <InlineEquation ID="IEq1"><InlineMediaObject><ImageObject FileRef="978-3-642-19867-0_35_Chapter_TeX2GIF_IEq1.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"></ImageObject>
</InlineMediaObject>
<EquationSource Format="TEX">$N^\text{th}$</EquationSource>
</InlineEquation>
 order minimal ghost images on prime-sized 2D arrays. Ghost images or switching components are important in discrete image reconstruction. Ghosts usually grow larger as they are constrained by more projection angles. When ghosts become too large to be added to an image, image reconstruction from projections becomes unique and exact. Ghosts can be used to synthesize image/anti-image data that will also exhibit zero-sum projections at <Emphasis Type="Italic">N</Emphasis>
 pre-defined angles. We examine the remarkable symmetry, cross- and auto-correlation properties of minimal ghosts. The geometric properties of minimal ghost images may make them suitable to embed in data as watermarks.</Para>
</Abstract>
</ChapterHeader>
<NoBody></NoBody>
</Chapter>
</Part>
</Book>
</Series>
</Publisher>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>Properties of Minimal Ghosts</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA"><title>Properties of Minimal Ghosts</title>
</titleInfo>
<name type="personal"><namePart type="given">Imants</namePart>
<namePart type="family">Svalbe</namePart>
<affiliation>School of Physics, Monash University, Melbourne, Australia</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Nicolas</namePart>
<namePart type="family">Normand</namePart>
<affiliation>School of Physics, Monash University, Melbourne, Australia</affiliation>
<affiliation>IRCCyN, University of Nantes, Nantes, France</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre>
<originInfo><publisher>Springer Berlin Heidelberg</publisher>
<place><placeTerm type="text">Berlin, Heidelberg</placeTerm>
</place>
<dateIssued encoding="w3cdtf">2011</dateIssued>
<copyrightDate encoding="w3cdtf">2011</copyrightDate>
</originInfo>
<language><languageTerm type="code" authority="rfc3066">en</languageTerm>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<abstract lang="en">Abstract: A ghost image is an array of signed pixel values so positioned as to create zero-sums in all discrete projections taken across that image for a pre-defined set of angles. The discrete projection scheme used here is the finite Radon transform. Minimal ghosts employ just 2N pixels to generate zero-sum projections at N projection angles. We describe efficient methods to construct $N^\text{th}$ order minimal ghost images on prime-sized 2D arrays. Ghost images or switching components are important in discrete image reconstruction. Ghosts usually grow larger as they are constrained by more projection angles. When ghosts become too large to be added to an image, image reconstruction from projections becomes unique and exact. Ghosts can be used to synthesize image/anti-image data that will also exhibit zero-sum projections at N pre-defined angles. We examine the remarkable symmetry, cross- and auto-correlation properties of minimal ghosts. The geometric properties of minimal ghost images may make them suitable to embed in data as watermarks.</abstract>
<relatedItem type="host"><titleInfo><title>Discrete Geometry for Computer Imagery</title>
<subTitle>16th IAPR International Conference, DGCI 2011, Nancy, France, April 6-8, 2011. Proceedings</subTitle>
</titleInfo>
<name type="personal"><namePart type="given">Isabelle</namePart>
<namePart type="family">Debled-Rennesson</namePart>
<affiliation>LORIA, Equipe ADAGIo, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy Cedex, France</affiliation>
<affiliation>E-mail: isabelle.debled-rennesson@loria.fr</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Eric</namePart>
<namePart type="family">Domenjoud</namePart>
<affiliation>LORIA, Equipe ADAGIo, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy Cedex, France</affiliation>
<affiliation>E-mail: eric.domenjoud@loria.fr</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Bertrand</namePart>
<namePart type="family">Kerautret</namePart>
<affiliation>LORIA, Equipe ADAGIo, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy Cedex, France</affiliation>
<affiliation>E-mail: bertrand.kerautret@loria.fr</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Philippe</namePart>
<namePart type="family">Even</namePart>
<affiliation>LORIA, Equipe ADAGIo, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy Cedex, France</affiliation>
<affiliation>E-mail: philippe.even@loria.fr</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre>
<originInfo><publisher>Springer</publisher>
<copyrightDate encoding="w3cdtf">2011</copyrightDate>
<issuance>monographic</issuance>
</originInfo>
<subject><genre>Book-Subject-Collection</genre>
<topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic>
</subject>
<subject><genre>Book-Subject-Group</genre>
<topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I22013">Computer Graphics</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I22021">Image Processing and Computer Vision</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I22005">Computer Imaging, Vision, Pattern Recognition and Graphics</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I2203X">Pattern Recognition</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I17028">Discrete Mathematics in Computer Science</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic>
</subject>
<identifier type="DOI">10.1007/978-3-642-19867-0</identifier>
<identifier type="ISBN">978-3-642-19866-3</identifier>
<identifier type="eISBN">978-3-642-19867-0</identifier>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="eISSN">1611-3349</identifier>
<identifier type="BookTitleID">217662</identifier>
<identifier type="BookID">978-3-642-19867-0</identifier>
<identifier type="BookChapterCount">43</identifier>
<identifier type="BookVolumeNumber">6607</identifier>
<identifier type="BookSequenceNumber">6607</identifier>
<identifier type="PartChapterCount">5</identifier>
<part><date>2011</date>
<detail type="part"><title>Discrete Tomography</title>
</detail>
<detail type="volume"><number>6607</number>
<caption>vol.</caption>
</detail>
<extent unit="pages"><start>417</start>
<end>428</end>
</extent>
</part>
<recordInfo><recordOrigin>Springer Berlin Heidelberg, 2011</recordOrigin>
</recordInfo>
</relatedItem>
<relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title>
</titleInfo>
<name type="personal"><namePart type="given">David</namePart>
<namePart type="family">Hutchison</namePart>
<affiliation>Lancaster University, Lancaster, UK</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Takeo</namePart>
<namePart type="family">Kanade</namePart>
<affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Josef</namePart>
<namePart type="family">Kittler</namePart>
<affiliation>University of Surrey, Guildford, UK</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Jon</namePart>
<namePart type="given">M.</namePart>
<namePart type="family">Kleinberg</namePart>
<affiliation>Cornell University, Ithaca, NY, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Friedemann</namePart>
<namePart type="family">Mattern</namePart>
<affiliation>ETH Zurich, Zurich, Switzerland</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">John</namePart>
<namePart type="given">C.</namePart>
<namePart type="family">Mitchell</namePart>
<affiliation>Stanford University, Stanford, CA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Moni</namePart>
<namePart type="family">Naor</namePart>
<affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Oscar</namePart>
<namePart type="family">Nierstrasz</namePart>
<affiliation>University of Bern, Bern, Switzerland</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">C.</namePart>
<namePart type="family">Pandu Rangan</namePart>
<affiliation>Indian Institute of Technology, Madras, India</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Bernhard</namePart>
<namePart type="family">Steffen</namePart>
<affiliation>University of Dortmund, Dortmund, Germany</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Madhu</namePart>
<namePart type="family">Sudan</namePart>
<affiliation>Massachusetts Institute of Technology, MA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Demetri</namePart>
<namePart type="family">Terzopoulos</namePart>
<affiliation>University of California, Los Angeles, CA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Doug</namePart>
<namePart type="family">Tygar</namePart>
<affiliation>University of California, Berkeley, CA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Moshe</namePart>
<namePart type="given">Y.</namePart>
<namePart type="family">Vardi</namePart>
<affiliation>Rice University, Houston, TX, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Gerhard</namePart>
<namePart type="family">Weikum</namePart>
<affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<originInfo><publisher>Springer</publisher>
<copyrightDate encoding="w3cdtf">2011</copyrightDate>
<issuance>serial</issuance>
</originInfo>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="eISSN">1611-3349</identifier>
<identifier type="SeriesID">558</identifier>
<recordInfo><recordOrigin>Springer Berlin Heidelberg, 2011</recordOrigin>
</recordInfo>
</relatedItem>
<identifier type="istex">0F6C776B347266959A934464E7F3EF27F7C53D11</identifier>
<identifier type="ark">ark:/67375/HCB-DNSKV6GK-Z</identifier>
<identifier type="DOI">10.1007/978-3-642-19867-0_35</identifier>
<identifier type="ChapterID">35</identifier>
<identifier type="ChapterID">Chap35</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Springer Berlin Heidelberg, 2011</accessCondition>
<recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource>
<recordOrigin>Springer-Verlag Berlin Heidelberg, 2011</recordOrigin>
</recordInfo>
</mods>
<json:item><extension>json</extension>
<original>false</original>
<mimetype>application/json</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-DNSKV6GK-Z/record.json</uri>
</json:item>
</metadata>
</istex>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000345 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000345 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Istex
   |étape=   Corpus
   |type=    RBID
   |clé=     ISTEX:0F6C776B347266959A934464E7F3EF27F7C53D11
   |texte=   Properties of Minimal Ghosts
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Properties of Minimal Ghosts

Properties of Minimal Ghosts

Source :

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri