<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">475793269</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180406123716.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170329e20001001xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/PL00003978</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/PL00003978</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Szkutnik</subfield>
   <subfield code="D">Zbigniew</subfield>
   <subfield code="u">Department of Applied Mathematics, University of Mining and Metallurgy, Al. Mickiewicza 30, 30-059 Cracow, Poland (e-mail: szkutnik@mat.agh.edu.pl), PL</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Unfolding intensity function of a Poisson process in models with approximately specified folding operator</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Zbigniew Szkutnik]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Abstract.: Quasi-maximum likelihood histogram sieve estimators of the intensity function of an indirectly observed Poisson process are studied. The setup differs from the standard one in that the exact form of the folding operator may not be known. Instead, approximate knowledge on its discretized version is available. Conditions for strong L 2-consistency are given and admissible discretization rates are studied. In non-folding problems, the number of histogram bins may essentially increase at the usual maximal rate while folding reduces the allowed discretization rates. It is shown that, even in moderately ill-posed problems, the discretization effects may be critical for the strong L 2-convergence and that there is an essential need both for further regularization and for imposing stronger conditions on the estimated function. Not surprisingly, the most restrictive factor is the low approximation power of piecewise constant functions. A regularization method is proposed which suitably modifies the discrete approximation of the folding operator and ensures the strong consistency. Since no penalty term is being introduced, the EM algorithm can be used in its factorized, efficient form. Convergence rates are obtained in terms of the discrete problem.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag Berlin Heidelberg, 2000</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Key words: Quasi-Maximum Likelihood, Poisson process, intensity function, unfolding, discretization</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/PL00003978</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/PL00003978</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Szkutnik</subfield>
   <subfield code="D">Zbigniew</subfield>
   <subfield code="u">Department of Applied Mathematics, University of Mining and Metallurgy, Al. Mickiewicza 30, 30-059 Cracow, Poland (e-mail: szkutnik@mat.agh.edu.pl), PL</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
