Serveur d'exploration sur l'Université de Trèves

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.

Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography

Identifieur interne : 001072 ( Istex/Corpus ); précédent : 001071; suivant : 001073

Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography

Auteurs : P. Gritzmann ; D. Prangenberg ; S. De Vries ; M. Wiegelmann

Source :

RBID : ISTEX:FFD2155AA91883CAFC91CD412220C0B738588AED

Abstract

At the conference on discrete tomography in Szeged, 24–27 August, 1997, various algorithms were presented for reconstructing and deciding (partial) uniqueness of finite lattice sets that are given by their discrete X‐rays in a number m of directions. The present article discusses such procedures from the point of view of their worst‐case running time and their approximation error. © 1998 John Wiley & Sons, Inc. Int J Imaging Syst Technol, 9, 101–109, 1998

Url:
DOI: 10.1002/(SICI)1098-1098(1998)9:2/3<101::AID-IMA6>3.0.CO;2-F

Links to Exploration step

ISTEX:FFD2155AA91883CAFC91CD412220C0B738588AED

Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct">
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography</title>
<author>
<name sortKey="Gritzmann, P" sort="Gritzmann, P" uniqKey="Gritzmann P" first="P." last="Gritzmann">P. Gritzmann</name>
<affiliation>
<mods:affiliation>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</mods:affiliation>
</affiliation>
<affiliation>
<mods:affiliation>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</mods:affiliation>
</affiliation>
</author>
<author>
<name sortKey="Prangenberg, D" sort="Prangenberg, D" uniqKey="Prangenberg D" first="D." last="Prangenberg">D. Prangenberg</name>
<affiliation>
<mods:affiliation>FB IV, Mathematik, Universität Trier, D‐54286 Trier, Germany</mods:affiliation>
</affiliation>
</author>
<author>
<name sortKey="De Vries, S" sort="De Vries, S" uniqKey="De Vries S" first="S." last="De Vries">S. De Vries</name>
<affiliation>
<mods:affiliation>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</mods:affiliation>
</affiliation>
</author>
<author>
<name sortKey="Wiegelmann, M" sort="Wiegelmann, M" uniqKey="Wiegelmann M" first="M." last="Wiegelmann">M. Wiegelmann</name>
<affiliation>
<mods:affiliation>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:FFD2155AA91883CAFC91CD412220C0B738588AED</idno>
<date when="1998" year="1998">1998</date>
<idno type="doi">10.1002/(SICI)1098-1098(1998)9:2/3<101::AID-IMA6>3.0.CO;2-F</idno>
<idno type="url">https://api.istex.fr/document/FFD2155AA91883CAFC91CD412220C0B738588AED/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001072</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001072</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a" type="main" xml:lang="en">Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography</title>
<author>
<name sortKey="Gritzmann, P" sort="Gritzmann, P" uniqKey="Gritzmann P" first="P." last="Gritzmann">P. Gritzmann</name>
<affiliation>
<mods:affiliation>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</mods:affiliation>
</affiliation>
<affiliation>
<mods:affiliation>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</mods:affiliation>
</affiliation>
</author>
<author>
<name sortKey="Prangenberg, D" sort="Prangenberg, D" uniqKey="Prangenberg D" first="D." last="Prangenberg">D. Prangenberg</name>
<affiliation>
<mods:affiliation>FB IV, Mathematik, Universität Trier, D‐54286 Trier, Germany</mods:affiliation>
</affiliation>
</author>
<author>
<name sortKey="De Vries, S" sort="De Vries, S" uniqKey="De Vries S" first="S." last="De Vries">S. De Vries</name>
<affiliation>
<mods:affiliation>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</mods:affiliation>
</affiliation>
</author>
<author>
<name sortKey="Wiegelmann, M" sort="Wiegelmann, M" uniqKey="Wiegelmann M" first="M." last="Wiegelmann">M. Wiegelmann</name>
<affiliation>
<mods:affiliation>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="j">International Journal of Imaging Systems and Technology</title>
<title level="j" type="abbrev">Int. J. Imaging Syst. Technol.</title>
<idno type="ISSN">0899-9457</idno>
<idno type="eISSN">1098-1098</idno>
<imprint>
<publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher>
<pubPlace>Hoboken</pubPlace>
<date type="published" when="1998">1998</date>
<biblScope unit="volume">9</biblScope>
<biblScope unit="issue">2‐3</biblScope>
<biblScope unit="page" from="101">101</biblScope>
<biblScope unit="page" to="109">109</biblScope>
</imprint>
<idno type="ISSN">0899-9457</idno>
</series>
<idno type="istex">FFD2155AA91883CAFC91CD412220C0B738588AED</idno>
<idno type="DOI">10.1002/(SICI)1098-1098(1998)9:2/3<101::AID-IMA6>3.0.CO;2-F</idno>
<idno type="ArticleID">IMA6</idno>
</biblStruct>
</sourceDesc>
<seriesStmt>
<idno type="ISSN">0899-9457</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass></textClass>
<langUsage>
<language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">At the conference on discrete tomography in Szeged, 24–27 August, 1997, various algorithms were presented for reconstructing and deciding (partial) uniqueness of finite lattice sets that are given by their discrete X‐rays in a number m of directions. The present article discusses such procedures from the point of view of their worst‐case running time and their approximation error. © 1998 John Wiley & Sons, Inc. Int J Imaging Syst Technol, 9, 101–109, 1998</div>
</front>
</TEI>
<istex>
<corpusName>wiley</corpusName>
<author>
<json:item>
<name>P. Gritzmann</name>
<affiliations>
<json:string>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</json:string>
<json:string>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</json:string>
</affiliations>
</json:item>
<json:item>
<name>D. Prangenberg</name>
<affiliations>
<json:string>FB IV, Mathematik, Universität Trier, D‐54286 Trier, Germany</json:string>
</affiliations>
</json:item>
<json:item>
<name>S. de Vries</name>
<affiliations>
<json:string>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</json:string>
</affiliations>
</json:item>
<json:item>
<name>M. Wiegelmann</name>
<affiliations>
<json:string>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</json:string>
</affiliations>
</json:item>
</author>
<articleId>
<json:string>IMA6</json:string>
</articleId>
<language>
<json:string>eng</json:string>
</language>
<originalGenre>
<json:string>article</json:string>
</originalGenre>
<abstract>At the conference on discrete tomography in Szeged, 24–27 August, 1997, various algorithms were presented for reconstructing and deciding (partial) uniqueness of finite lattice sets that are given by their discrete X‐rays in a number m of directions. The present article discusses such procedures from the point of view of their worst‐case running time and their approximation error. © 1998 John Wiley & Sons, Inc. Int J Imaging Syst Technol, 9, 101–109, 1998</abstract>
<qualityIndicators>
<score>5.876</score>
<pdfVersion>1.3</pdfVersion>
<pdfPageSize>612 x 792 pts (letter)</pdfPageSize>
<refBibsNative>true</refBibsNative>
<abstractCharCount>459</abstractCharCount>
<pdfWordCount>7840</pdfWordCount>
<pdfCharCount>37864</pdfCharCount>
<pdfPageCount>9</pdfPageCount>
<abstractWordCount>73</abstractWordCount>
</qualityIndicators>
<title>Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography</title>
<refBibs>
<json:item>
<author>
<json:item>
<name>C. Kisielowski</name>
</json:item>
<json:item>
<name>P. Schwander</name>
</json:item>
<json:item>
<name>F. H. Baumann</name>
</json:item>
<json:item>
<name>M. Seibt</name>
</json:item>
<json:item>
<name>Y. Kim</name>
</json:item>
<json:item>
<name>A. Ourmazd</name>
</json:item>
</author>
<host>
<volume>58</volume>
<pages>
<last>155</last>
<first>131</first>
</pages>
<author></author>
<title>Ultramicroscopy</title>
</host>
<title>An approach to quantitative high‐resolution transmission electron microscopy of crystalline materials</title>
</json:item>
<json:item>
<author>
<json:item>
<name>P. Schwander</name>
</json:item>
<json:item>
<name>C. Kisielowski</name>
</json:item>
<json:item>
<name>M. Seibt</name>
</json:item>
<json:item>
<name>F. H. Baumann</name>
</json:item>
<json:item>
<name>Y. Kim</name>
</json:item>
<json:item>
<name>A. Ourmazd</name>
</json:item>
</author>
<host>
<volume>71</volume>
<pages>
<last>4153</last>
<first>4150</first>
</pages>
<author></author>
<title>Phys. Rev. Lett.</title>
</host>
<title>Mapping projected potential, interfacial roughness and composition in general crystalline solids by quantitative transmission electron microscopy</title>
</json:item>
<json:item>
<host>
<author></author>
<title>Computational complexity issues in discrete tomography: On the reconstruction of finite lattice sets from their line X‐rays</title>
</host>
</json:item>
<json:item>
<host>
<author></author>
<title>A. Schrijver,Theory of Linear and Integer Programming(Wiley‐Interscience,Chichester),1986.</title>
</host>
</json:item>
<json:item>
<author>
<json:item>
<name>H. J. Ryser</name>
</json:item>
</author>
<host>
<volume>9</volume>
<pages>
<last>377</last>
<first>371</first>
</pages>
<author></author>
<title>Can. J. Math.</title>
</host>
<title>Combinatorial properties of matrices of zeros and ones</title>
</json:item>
<json:item>
<author>
<json:item>
<name>S. K. Chang</name>
</json:item>
</author>
<host>
<volume>14</volume>
<pages>
<last>25</last>
<first>21</first>
</pages>
<author></author>
<title>Commun. ACM</title>
</host>
<title>The reconstruction of binary patterns from their projections</title>
</json:item>
<json:item>
<author>
<json:item>
<name>J. J. Gerbrands</name>
</json:item>
<json:item>
<name>C. H. Slump</name>
</json:item>
</author>
<host>
<volume>18</volume>
<pages>
<last>36</last>
<first>18</first>
</pages>
<author></author>
<title>Comput. Graphics Image Process.</title>
</host>
<title>A network flow approach to reconstruction of the left ventricle from two projections</title>
</json:item>
<json:item>
<host>
<author></author>
<title>M. R. Garey andD. S. Johnson,Computers and Intractability: A Guide to the Theory of NP‐Completeness(Freeman,San Francisco),1979.</title>
</host>
</json:item>
<json:item>
<author>
<json:item>
<name>D. B. Shmoys</name>
</json:item>
</author>
<host>
<volume>20</volume>
<pages>
<last>397</last>
<first>355</first>
</pages>
<author></author>
<title>Combinatorial Optimization</title>
</host>
<title>Computing near‐optimal solutions to combinatorial optimization problems</title>
</json:item>
<json:item>
<author>
<json:item>
<name>P. M. Salzberg</name>
</json:item>
<json:item>
<name>P. I. Rivera‐Vega</name>
</json:item>
<json:item>
<name>A. Rodriguez</name>
</json:item>
</author>
<host>
<volume>9</volume>
<pages>
<last>154</last>
<first>147</first>
</pages>
<author></author>
<title>Int. J. Imaging Syst. Technol.</title>
</host>
<title>A network flow model for binary tomography on lattices</title>
</json:item>
<json:item>
<host>
<author></author>
<title>Matchings in colored networks</title>
</host>
</json:item>
<json:item>
<author>
<json:item>
<name>C. H. Papadimitriou</name>
</json:item>
<json:item>
<name>M. Yannakakis</name>
</json:item>
</author>
<host>
<volume>43</volume>
<pages>
<last>440</last>
<first>425</first>
</pages>
<author></author>
<title>J. Comput. System Sci.</title>
</host>
<title>Optimization, approximation and complexity classes</title>
</json:item>
<json:item>
<author>
<json:item>
<name>P. C. Fishburn</name>
</json:item>
<json:item>
<name>J. C. Lagarias</name>
</json:item>
<json:item>
<name>J. A. Reeds</name>
</json:item>
<json:item>
<name>L. A. Shepp</name>
</json:item>
</author>
<host>
<volume>91</volume>
<pages>
<last>159</last>
<first>149</first>
</pages>
<author></author>
<title>Discrete Math.</title>
</host>
<title>Sets uniquely determined by projections on axes. II: Discrete case</title>
</json:item>
<json:item>
<author>
<json:item>
<name>P. C. Fishburn</name>
</json:item>
<json:item>
<name>P. Schwander</name>
</json:item>
<json:item>
<name>L. A. Shepp</name>
</json:item>
<json:item>
<name>J. Vanderbei</name>
</json:item>
</author>
<host>
<volume>75</volume>
<pages>
<last>62</last>
<first>39</first>
</pages>
<author></author>
<title>Discrete Appl. Math.</title>
</host>
<title>The discrete Radon transform and its approximate inversion via linear programming</title>
</json:item>
<json:item>
<author>
<json:item>
<name>T. Y. Kong</name>
</json:item>
<json:item>
<name>G. T. Herman</name>
</json:item>
</author>
<host>
<volume>9</volume>
<pages>
<last>125</last>
<first>118</first>
</pages>
<author></author>
<title>Int. J. Imaging Syst. Technol.</title>
</host>
<title>On which grids can tomographic equivalence of binary pictures be characterized in terms of elementary switching operations</title>
</json:item>
<json:item>
<host>
<author></author>
<title>On the approximate reconstruction of binary images from their discrete X‐rays</title>
</host>
</json:item>
<json:item>
<author>
<json:item>
<name>R. Aharoni</name>
</json:item>
<json:item>
<name>G. T. Herman</name>
</json:item>
<json:item>
<name>A. Kuba</name>
</json:item>
</author>
<host>
<volume>171</volume>
<pages>
<last>16</last>
<first>1</first>
</pages>
<author></author>
<title>Discrete Math.</title>
</host>
<title>Binary vectors partially determined by linear equation systems</title>
</json:item>
<json:item>
<author>
<json:item>
<name>Y. Vardi</name>
</json:item>
<json:item>
<name>D. Lee</name>
</json:item>
</author>
<host>
<volume>9</volume>
<pages>
<last>173</last>
<first>155</first>
</pages>
<author></author>
<title>Int. J. Imaging Syst. Techno.</title>
</host>
<title>The discrete Radon transform and its approximate inversion via the ELM algorithm</title>
</json:item>
<json:item>
<host>
<author></author>
<title>On the facial structure of tomography polytopes</title>
</host>
</json:item>
</refBibs>
<genre>
<json:string>article</json:string>
</genre>
<host>
<volume>9</volume>
<publisherId>
<json:string>IMA</json:string>
</publisherId>
<pages>
<total>9</total>
<last>109</last>
<first>101</first>
</pages>
<issn>
<json:string>0899-9457</json:string>
</issn>
<issue>2‐3</issue>
<genre>
<json:string>journal</json:string>
</genre>
<language>
<json:string>unknown</json:string>
</language>
<eissn>
<json:string>1098-1098</json:string>
</eissn>
<title>International Journal of Imaging Systems and Technology</title>
<doi>
<json:string>10.1002/(ISSN)1098-1098</json:string>
</doi>
</host>
<categories>
<wos>
<json:string>science</json:string>
<json:string>optics</json:string>
<json:string>imaging science & photographic technology</json:string>
<json:string>engineering, electrical & electronic</json:string>
</wos>
<scienceMetrix>
<json:string>applied sciences</json:string>
<json:string>information & communication technologies</json:string>
<json:string>artificial intelligence & image processing</json:string>
</scienceMetrix>
</categories>
<publicationDate>1998</publicationDate>
<copyrightDate>1998</copyrightDate>
<doi>
<json:string>10.1002/(SICI)1098-1098(1998)9:2/3>101::AID-IMA6>3.0.CO;2-F</json:string>
</doi>
<id>FFD2155AA91883CAFC91CD412220C0B738588AED</id>
<score>0.35124362</score>
<fulltext>
<json:item>
<extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/document/FFD2155AA91883CAFC91CD412220C0B738588AED/fulltext/pdf</uri>
</json:item>
<json:item>
<extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/document/FFD2155AA91883CAFC91CD412220C0B738588AED/fulltext/zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/document/FFD2155AA91883CAFC91CD412220C0B738588AED/fulltext/tei">
<teiHeader>
<fileDesc>
<titleStmt>
<title level="a" type="main" xml:lang="en">Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography</title>
</titleStmt>
<publicationStmt>
<authority>ISTEX</authority>
<publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher>
<pubPlace>Hoboken</pubPlace>
<availability>
<p>Copyright © 1998 John Wiley & Sons, Inc.</p>
</availability>
<date>1998</date>
</publicationStmt>
<notesStmt>
<note>German Federal Ministry of Education, Science, Research, and Technology - No. 03‐GR7TM1;</note>
<note>Deutsche Forschungsgemeinschaft</note>
</notesStmt>
<sourceDesc>
<biblStruct type="inbook">
<analytic>
<title level="a" type="main" xml:lang="en">Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography</title>
<author xml:id="author-1">
<persName>
<forename type="first">P.</forename>
<surname>Gritzmann</surname>
</persName>
<affiliation>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</affiliation>
<affiliation>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</affiliation>
</author>
<author xml:id="author-2">
<persName>
<forename type="first">D.</forename>
<surname>Prangenberg</surname>
</persName>
<affiliation>FB IV, Mathematik, Universität Trier, D‐54286 Trier, Germany</affiliation>
</author>
<author xml:id="author-3">
<persName>
<forename type="first">S.</forename>
<surname>de Vries</surname>
</persName>
<affiliation>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</affiliation>
</author>
<author xml:id="author-4">
<persName>
<forename type="first">M.</forename>
<surname>Wiegelmann</surname>
</persName>
<affiliation>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</affiliation>
</author>
</analytic>
<monogr>
<title level="j">International Journal of Imaging Systems and Technology</title>
<title level="j" type="abbrev">Int. J. Imaging Syst. Technol.</title>
<idno type="pISSN">0899-9457</idno>
<idno type="eISSN">1098-1098</idno>
<idno type="DOI">10.1002/(ISSN)1098-1098</idno>
<imprint>
<publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher>
<pubPlace>Hoboken</pubPlace>
<date type="published" when="1998"></date>
<biblScope unit="volume">9</biblScope>
<biblScope unit="issue">2‐3</biblScope>
<biblScope unit="page" from="101">101</biblScope>
<biblScope unit="page" to="109">109</biblScope>
</imprint>
</monogr>
<idno type="istex">FFD2155AA91883CAFC91CD412220C0B738588AED</idno>
<idno type="DOI">10.1002/(SICI)1098-1098(1998)9:2/3<101::AID-IMA6>3.0.CO;2-F</idno>
<idno type="ArticleID">IMA6</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<creation>
<date>1998</date>
</creation>
<langUsage>
<language ident="en">en</language>
</langUsage>
<abstract xml:lang="en">
<p>At the conference on discrete tomography in Szeged, 24–27 August, 1997, various algorithms were presented for reconstructing and deciding (partial) uniqueness of finite lattice sets that are given by their discrete X‐rays in a number m of directions. The present article discusses such procedures from the point of view of their worst‐case running time and their approximation error. © 1998 John Wiley & Sons, Inc. Int J Imaging Syst Technol, 9, 101–109, 1998</p>
</abstract>
</profileDesc>
<revisionDesc>
<change when="1998">Published</change>
</revisionDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item>
<extension>txt</extension>
<original>false</original>
<mimetype>text/plain</mimetype>
<uri>https://api.istex.fr/document/FFD2155AA91883CAFC91CD412220C0B738588AED/fulltext/txt</uri>
</json:item>
</fulltext>
<metadata>
<istex:metadataXml wicri:clean="Wiley, elements deleted: body">
<istex:xmlDeclaration>version="1.0" encoding="UTF-8" standalone="yes"</istex:xmlDeclaration>
<istex:document>
<component version="2.0" type="serialArticle" xml:lang="en">
<header>
<publicationMeta level="product">
<publisherInfo>
<publisherName>Wiley Subscription Services, Inc., A Wiley Company</publisherName>
<publisherLoc>Hoboken</publisherLoc>
</publisherInfo>
<doi registered="yes">10.1002/(ISSN)1098-1098</doi>
<issn type="print">0899-9457</issn>
<issn type="electronic">1098-1098</issn>
<idGroup>
<id type="product" value="IMA"></id>
</idGroup>
<titleGroup>
<title type="main" xml:lang="en" sort="INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY">International Journal of Imaging Systems and Technology</title>
<title type="short">Int. J. Imaging Syst. Technol.</title>
</titleGroup>
</publicationMeta>
<publicationMeta level="part" position="20">
<doi origin="wiley" registered="yes">10.1002/(SICI)1098-1098(1998)9:2/3<>1.0.CO;2-C</doi>
<numberingGroup>
<numbering type="journalVolume" number="9">9</numbering>
<numbering type="includedIssue">2</numbering>
<numbering type="includedIssue">3</numbering>
<numbering type="journalIssue">2‐3</numbering>
</numberingGroup>
<coverDate startDate="1998">1998</coverDate>
</publicationMeta>
<publicationMeta level="unit" type="article" position="60" status="forIssue">
<doi origin="wiley" registered="yes">10.1002/(SICI)1098-1098(1998)9:2/3<101::AID-IMA6>3.0.CO;2-F</doi>
<idGroup>
<id type="unit" value="IMA6"></id>
</idGroup>
<countGroup>
<count type="pageTotal" number="9"></count>
</countGroup>
<copyright ownership="publisher">Copyright © 1998 John Wiley & Sons, Inc.</copyright>
<eventGroup>
<event type="firstOnline" date="1998-12-07"></event>
<event type="publishedOnlineFinalForm" date="1998-12-07"></event>
<event type="xmlConverted" agent="Converter:JWSART34_TO_WML3G version:2.3.2 mode:FullText source:HeaderRef result:HeaderRef" date="2010-03-06"></event>
<event type="xmlConverted" agent="Converter:WILEY_ML3G_TO_WILEY_ML3GV2 version:3.8.8" date="2014-01-28"></event>
<event type="xmlConverted" agent="Converter:WML3G_To_WML3G version:4.1.7 mode:FullText,remove_FC" date="2014-10-23"></event>
</eventGroup>
<numberingGroup>
<numbering type="pageFirst">101</numbering>
<numbering type="pageLast">109</numbering>
</numberingGroup>
<correspondenceTo>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</correspondenceTo>
<linkGroup>
<link type="toTypesetVersion" href="file:IMA.IMA6.pdf"></link>
</linkGroup>
</publicationMeta>
<contentMeta>
<countGroup>
<count type="figureTotal" number="6"></count>
<count type="tableTotal" number="0"></count>
<count type="referenceTotal" number="19"></count>
<count type="wordTotal" number="7782"></count>
</countGroup>
<titleGroup>
<title type="main" xml:lang="en">Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography</title>
</titleGroup>
<creators>
<creator xml:id="au1" creatorRole="author" affiliationRef="#af1" corresponding="yes">
<personName>
<givenNames>P.</givenNames>
<familyName>Gritzmann</familyName>
</personName>
</creator>
<creator xml:id="au2" creatorRole="author" affiliationRef="#af2">
<personName>
<givenNames>D.</givenNames>
<familyName>Prangenberg</familyName>
</personName>
</creator>
<creator xml:id="au3" creatorRole="author" affiliationRef="#af1">
<personName>
<givenNames>S.</givenNames>
<familyName>de Vries</familyName>
</personName>
</creator>
<creator xml:id="au4" creatorRole="author" affiliationRef="#af1">
<personName>
<givenNames>M.</givenNames>
<familyName>Wiegelmann</familyName>
</personName>
</creator>
</creators>
<affiliationGroup>
<affiliation xml:id="af1" countryCode="DE" type="organization">
<unparsedAffiliation>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</unparsedAffiliation>
</affiliation>
<affiliation xml:id="af2" countryCode="DE" type="organization">
<unparsedAffiliation>FB IV, Mathematik, Universität Trier, D‐54286 Trier, Germany</unparsedAffiliation>
</affiliation>
</affiliationGroup>
<fundingInfo>
<fundingAgency>German Federal Ministry of Education, Science, Research, and Technology</fundingAgency>
<fundingNumber>03‐GR7TM1</fundingNumber>
</fundingInfo>
<fundingInfo>
<fundingAgency>Deutsche Forschungsgemeinschaft</fundingAgency>
</fundingInfo>
<abstractGroup>
<abstract type="main" xml:lang="en">
<title type="main">Abstract</title>
<p>At the conference on discrete tomography in Szeged, 24–27 August, 1997, various algorithms were presented for reconstructing and deciding (partial) uniqueness of finite lattice sets that are given by their discrete X‐rays in a number
<i>m</i>
of directions. The present article discusses such procedures from the point of view of their worst‐case running time and their approximation error. © 1998 John Wiley & Sons, Inc. Int J Imaging Syst Technol, 9, 101–109, 1998</p>
</abstract>
</abstractGroup>
</contentMeta>
</header>
</component>
</istex:document>
</istex:metadataXml>
<mods version="3.6">
<titleInfo lang="en">
<title>Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA" lang="en">
<title>Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography</title>
</titleInfo>
<name type="personal">
<namePart type="given">P.</namePart>
<namePart type="family">Gritzmann</namePart>
<affiliation>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</affiliation>
<affiliation>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</affiliation>
<role>
<roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">D.</namePart>
<namePart type="family">Prangenberg</namePart>
<affiliation>FB IV, Mathematik, Universität Trier, D‐54286 Trier, Germany</affiliation>
<role>
<roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">S.</namePart>
<namePart type="family">de Vries</namePart>
<affiliation>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</affiliation>
<role>
<roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">M.</namePart>
<namePart type="family">Wiegelmann</namePart>
<affiliation>Technische Universität München, Zentrum Mathematik, D‐80290 Munich, Germany</affiliation>
<role>
<roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre type="article" displayLabel="article"></genre>
<originInfo>
<publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher>
<place>
<placeTerm type="text">Hoboken</placeTerm>
</place>
<dateIssued encoding="w3cdtf">1998</dateIssued>
<copyrightDate encoding="w3cdtf">1998</copyrightDate>
</originInfo>
<language>
<languageTerm type="code" authority="rfc3066">en</languageTerm>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<physicalDescription>
<internetMediaType>text/html</internetMediaType>
<extent unit="figures">6</extent>
<extent unit="references">19</extent>
<extent unit="words">7782</extent>
</physicalDescription>
<abstract lang="en">At the conference on discrete tomography in Szeged, 24–27 August, 1997, various algorithms were presented for reconstructing and deciding (partial) uniqueness of finite lattice sets that are given by their discrete X‐rays in a number m of directions. The present article discusses such procedures from the point of view of their worst‐case running time and their approximation error. © 1998 John Wiley & Sons, Inc. Int J Imaging Syst Technol, 9, 101–109, 1998</abstract>
<note type="funding">German Federal Ministry of Education, Science, Research, and Technology - No. 03‐GR7TM1; </note>
<note type="funding">Deutsche Forschungsgemeinschaft</note>
<relatedItem type="host">
<titleInfo>
<title>International Journal of Imaging Systems and Technology</title>
</titleInfo>
<titleInfo type="abbreviated">
<title>Int. J. Imaging Syst. Technol.</title>
</titleInfo>
<genre type="journal">journal</genre>
<identifier type="ISSN">0899-9457</identifier>
<identifier type="eISSN">1098-1098</identifier>
<identifier type="DOI">10.1002/(ISSN)1098-1098</identifier>
<identifier type="PublisherID">IMA</identifier>
<part>
<date>1998</date>
<detail type="volume">
<caption>vol.</caption>
<number>9</number>
</detail>
<detail type="issue">
<caption>no.</caption>
<number>2‐3</number>
</detail>
<extent unit="pages">
<start>101</start>
<end>109</end>
<total>9</total>
</extent>
</part>
</relatedItem>
<identifier type="istex">FFD2155AA91883CAFC91CD412220C0B738588AED</identifier>
<identifier type="DOI">10.1002/(SICI)1098-1098(1998)9:2/3<101::AID-IMA6>3.0.CO;2-F</identifier>
<identifier type="ArticleID">IMA6</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Copyright © 1998 John Wiley & Sons, Inc.</accessCondition>
<recordInfo>
<recordContentSource>WILEY</recordContentSource>
<recordOrigin>Wiley Subscription Services, Inc., A Wiley Company</recordOrigin>
</recordInfo>
</mods>
</metadata>
<serie></serie>
</istex>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001072 | SxmlIndent | more

Ou

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

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

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Istex
   |étape=   Corpus
   |type=    RBID
   |clé=     ISTEX:FFD2155AA91883CAFC91CD412220C0B738588AED
   |texte=   Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography
}}

Wicri

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024