<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">606199454</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100938.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150701xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s11045-013-0262-3</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s11045-013-0262-3</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A wavelet based method for image reconstruction from gradient data with applications</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Ioana Sevcenco, Peter Hampton, Panajotis Agathoklis]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In this paper, an algorithm for image reconstruction from gradient data based on the Haar wavelet decomposition is proposed. The proposed algorithm has two main stages. First, the Haar decomposition of the image to be reconstructed is obtained from the given gradient data set. Then, the Haar wavelet synthesis is employed to produce the image. The proposed algorithm is based on the relationship between the Haar analysis and synthesis filters and the model for the discretized gradient. The approach presented here is based on the one by Hampton et al. (IEEE J Sel Top Signal Process 2(5):781-792, 2008) for wavefront reconstruction in adaptive optics. The main strength of the proposed algorithm lies in its multiresolution nature, which allows efficient processing in the wavelet domain with complexity $${\fancyscript{O}}(N)$$ O ( N ) . In addition, obtaining the wavelet decomposition of the image to be reconstructed provides the possibility for further enhancements of the image, such as denoising or smoothing via iterative Poisson solvers at each resolution during Haar synthesis. To evaluate the performance of the proposed algorithm, it is applied to reconstruct ten standard test images. Experiments demonstrate that the algorithm yields results comparable in terms of solution accuracy to those produced by well-known benchmark algorithms. Further, experiments show that the proposed algorithm is suitable to be employed as a final step to reconstruct an image from a gradient data set, in applications such as image stitching or image morphing.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media New York, 2013</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Image reconstruction</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Gradient</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Haar decomposition</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Poisson solver</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Sevcenco</subfield>
   <subfield code="D">Ioana</subfield>
   <subfield code="u">Department of Electrical and Computer Engineering, University of Victoria, V8P 5C2, Victoria, BC, Canada</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Hampton</subfield>
   <subfield code="D">Peter</subfield>
   <subfield code="u">307-720 Eighth Avenue, V3M 2R3, New Westminster, Canada</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Agathoklis</subfield>
   <subfield code="D">Panajotis</subfield>
   <subfield code="u">Department of Electrical and Computer Engineering, University of Victoria, V8P 5C2, Victoria, BC, Canada</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Multidimensional Systems and Signal Processing</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">26/3(2015-07-01), 717-737</subfield>
   <subfield code="x">0923-6082</subfield>
   <subfield code="q">26:3&lt;717</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">26</subfield>
   <subfield code="o">11045</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s11045-013-0262-3</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</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="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="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</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/s11045-013-0262-3</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">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Sevcenco</subfield>
   <subfield code="D">Ioana</subfield>
   <subfield code="u">Department of Electrical and Computer Engineering, University of Victoria, V8P 5C2, Victoria, BC, Canada</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Hampton</subfield>
   <subfield code="D">Peter</subfield>
   <subfield code="u">307-720 Eighth Avenue, V3M 2R3, New Westminster, Canada</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Agathoklis</subfield>
   <subfield code="D">Panajotis</subfield>
   <subfield code="u">Department of Electrical and Computer Engineering, University of Victoria, V8P 5C2, Victoria, BC, Canada</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Multidimensional Systems and Signal Processing</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">26/3(2015-07-01), 717-737</subfield>
   <subfield code="x">0923-6082</subfield>
   <subfield code="q">26:3&lt;717</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">26</subfield>
   <subfield code="o">11045</subfield>
  </datafield>
 </record>
</collection>
