<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462012000100006</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Incorporating Angular Ratio Images into Two-Frame Stereo Algorithms]]></article-title>
<article-title xml:lang="es"><![CDATA[Incorporación de las imágenes de relación angular en algoritmos de estéreo binocular]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Martínez González]]></surname>
<given-names><![CDATA[Pablo Arturo]]></given-names>
</name>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Castelán]]></surname>
<given-names><![CDATA[Mario]]></given-names>
</name>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Centro de Investigación y de Estudios Avanzados Robótica y Manufactura Avanzada ]]></institution>
<addr-line><![CDATA[Ramos Arizpe Coah]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2012</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2012</year>
</pub-date>
<volume>16</volume>
<numero>1</numero>
<fpage>53</fpage>
<lpage>69</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462012000100006&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462012000100006&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462012000100006&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Light Transport Constancy (LTC) asserts that the reflectance ratio obtained from two different illumination variations remains constant for any given view of the observed scene. LTC was proposed in [21] as a rank constraint for solving the correspondence problem in multiple view stereo. In two-frame stereo, the simplest setting for LTC requires only two illumination variations and a single light source. Under this scenario, the rank constraint can be formulated through ratio images, and standard stereo algorithms can be applied in order to obtain a disparity map. Unfortunately, a ratio image may be subject to saturated pixel values, and this may diminish the quality of disparity maps. To solve this problem, as a first contribution in this work, we propose a post-processing operation based on slope angles related to the ratio values. Experiments show that new angular ratio images are more robust and deliver improved disparity maps. A second contribution of this paper consists in performing an experimental evaluation of angular ratio images under the standard test bed for two-view stereo algorithms, i.e., using different aggregation and optimization approaches. The results of our research are consistent with previously reported conclusions for two-view stereo surveys. It means that LTC may benefit from a vast variety of existent methods to solve the two-view stereo problem.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[La Constancia de Transportación de la Luz (LTC) establece que la relación de reflectancia obtenida de dos diferentes variaciones en iluminación permanece constante para cualquier vista dada de la escena observada. En [21] LTC fue propuesta como una restricción de rango para resolver el problema de la correspondencia en estéreo de múltiples vistas. En estéreo binocular, el escenario más simple para LTC requiere solamente dos variaciones en iluminación y una sola fuente de luz. Bajo este escenario, la restricción de rango puede ser formulada a través de las imágenes de relación y los algoritmos estéreo estándar son aplicados con el objeto de obtener un mapa de disparidad. Desafortunadamente, una imagen de relación puede ser sujeta a valores de pixeles saturados, los cuales pueden disminuir la calidad de los mapas de disparidad. Para superar este problema, como una primera contribución en este artículo presentamos una operación de post-procesado basada en los ángulos de pendiente relacionados a los valores de relación. Los experimentos muestran que las nuevas imágenes de relación son más robustas y ofrecen mejores mapas de disparidad. Como una segunda contribución, realizamos evaluación experimental de las imágenes de relación angular bajo una cama de pruebas estándar para algoritmos de estéreo binocular, i.e., usando diferentes enfoques de agregación y optimización. Los resultados de esta investigación son consistentes con conclusiones previamente reportadas en estudios sobre estéreo. Esto significa que LTC puede beneficiarse de una vasta variedad de métodos existentes para el problema de estéreo binocular.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Light Transport Constancy]]></kwd>
<kwd lng="en"><![CDATA[two-frame stereo]]></kwd>
<kwd lng="en"><![CDATA[ratio images]]></kwd>
<kwd lng="es"><![CDATA[Constancia de Transportación de la Luz]]></kwd>
<kwd lng="es"><![CDATA[estéreo binocular]]></kwd>
<kwd lng="es"><![CDATA[imágenes de relación]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[  	    <p align="justify"><font face="verdana" size="4">Art&iacute;culos</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="center"><font face="verdana" size="4"><b>Incorporating Angular Ratio Images into Two&#45;Frame Stereo Algorithms</b></font></p>  	    <p align="center"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="center"><font face="verdana" size="3"><b>Incorporaci&oacute;n de las im&aacute;genes de relaci&oacute;n angular en algoritmos de est&eacute;reo binocular</b></font></p>  	    <p align="center"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="center"><font face="verdana" size="2"><b>Pablo Arturo Mart&iacute;nez Gonz&aacute;lez and Mario Castel&aacute;n</b></font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><i>Rob&oacute;tica y Manufactura Avanzada, CINVESTAV &#45; Unidad Saltillo Carretera Saltillo&#45;Monterrey Km. 13.5, C.P. 25900, Ramos Arizpe, Coah. Mexico. Correo:</i> <a href="mailto:pablo.martinez@cinvestav.edu.mx">pablo.martinez@cinvestav.edu.mx</a>, <a href="mailto:mario.castelan@cinvestav.edu.mx">mario.castelan@cinvestav.edu.mx</a>.</font></p>  	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2">Article received on 01/02/2010.    <br> 	Accepted on 10/01/2011.</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Abstract</b></font></p>  	    <p align="justify"><font face="verdana" size="2">Light Transport Constancy (LTC) asserts that the reflectance ratio obtained from two different illumination variations remains constant for any given view of the observed scene. LTC was proposed in &#91;21&#93; as a rank constraint for solving the correspondence problem in multiple view stereo. In two&#45;frame stereo, the simplest setting for LTC requires only two illumination variations and a single light source. Under this scenario, the rank constraint can be formulated through ratio images, and standard stereo algorithms can be applied in order to obtain a disparity map. Unfortunately, a ratio image may be subject to saturated pixel values, and this may diminish the quality of disparity maps. To solve this problem, as a first contribution in this work, we propose a post&#45;processing operation based on slope angles related to the ratio values. Experiments show that new angular ratio images are more robust and deliver improved disparity maps. A second contribution of this paper consists in performing an experimental evaluation of angular ratio images under the standard test bed for two&#45;view stereo algorithms, i.e., using different aggregation and optimization approaches. The results of our research are consistent with previously reported conclusions for two&#45;view stereo surveys. It means that LTC may benefit from a vast variety of existent methods to solve the two&#45;view stereo problem.</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Keywords:</b> Light Transport Constancy, two&#45;frame stereo, ratio images.</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Resumen</b></font></p>  	    <p align="justify"><font face="verdana" size="2">La Constancia de Transportaci&oacute;n de la Luz (LTC) establece que la relaci&oacute;n de reflectancia obtenida de dos diferentes variaciones en iluminaci&oacute;n permanece constante para cualquier vista dada de la escena observada. En &#91;21&#93; LTC fue propuesta como una restricci&oacute;n de rango para resolver el problema de la correspondencia en est&eacute;reo de m&uacute;ltiples vistas. En est&eacute;reo binocular, el escenario m&aacute;s simple para LTC requiere solamente dos variaciones en iluminaci&oacute;n y una sola fuente de luz. Bajo este escenario, la restricci&oacute;n de rango puede ser formulada a trav&eacute;s de las im&aacute;genes de relaci&oacute;n y los algoritmos est&eacute;reo est&aacute;ndar son aplicados con el objeto de obtener un mapa de disparidad. Desafortunadamente, una imagen de relaci&oacute;n puede ser sujeta a valores de pixeles saturados, los cuales pueden disminuir la calidad de los mapas de disparidad. Para superar este problema, como una primera contribuci&oacute;n en este art&iacute;culo presentamos una operaci&oacute;n de post&#45;procesado basada en los &aacute;ngulos de pendiente relacionados a los valores de relaci&oacute;n. Los experimentos muestran que las nuevas im&aacute;genes de relaci&oacute;n son m&aacute;s robustas y ofrecen mejores mapas de disparidad. Como una segunda contribuci&oacute;n, realizamos evaluaci&oacute;n experimental de las im&aacute;genes de relaci&oacute;n angular bajo una cama de pruebas est&aacute;ndar para algoritmos de est&eacute;reo binocular, i.e., usando diferentes enfoques de agregaci&oacute;n y optimizaci&oacute;n. Los resultados de esta investigaci&oacute;n son consistentes con conclusiones previamente reportadas en estudios sobre est&eacute;reo. Esto significa que LTC puede beneficiarse de una vasta variedad de m&eacute;todos existentes para el problema de est&eacute;reo binocular.</font></p>  	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2"><b>Palabras clave:</b> Constancia de Transportaci&oacute;n de la Luz, est&eacute;reo binocular, im&aacute;genes de relaci&oacute;n.</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><a href="/pdf/cys/v16n1/v16n1a6.pdf" target="_blank">DESCARGAR ART&Iacute;CULO EN FORMATO PDF</a></font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Acknowledgements</b></font></p>  	    <p align="justify"><font face="verdana" size="2">This work has been supported by Project Conacyt Ciencia B&aacute;sica 61593.</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>References</b></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>1. Bobick, A.F. &amp; Intille, S.S. (1999).</b> Large occlusion stereo. <i>International Journal of Computer Vision,</i> 33(3), 181&#45;200.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055629&pid=S1405-5546201200010000600001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>2. Bolles, R.C., Baker, H.H., &amp; Hannah, M.J. (1993).</b> The JISCT stereo evaluation. <i>Image Understanding Workshop</i> (263&#45;274). San Francisco, CA.: Morgan Kaufmann Publishers.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055631&pid=S1405-5546201200010000600002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>3. Boykov, Y., Veksler, O., &amp; Zabih, R. (2001).</b> Fast approximate energy minimization via graph cuts. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence,</i> 23(11), 1222&#45;1239.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055633&pid=S1405-5546201200010000600003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>4. Brown, M.Z., Burschka, D., &amp; Hager, G.D. (2003).</b> Advances in computational stereo. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence,</i> 25(8), 993&#45;1008.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055635&pid=S1405-5546201200010000600004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>5. Burt, P.J. &amp; Adelson, E.H. (1983).</b> The Laplacian pyramid as a compact image code. <i>IEEE Transactions on Communications,</i> 31(4), 532&#45;540.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055637&pid=S1405-5546201200010000600005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>6. Georghiades, A.S., Belhumeur, P.N., &amp; Kriegman, D.J. (2001).</b> From few to many: illumination cone models for face recognition under variable lighting and pose. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence,</i> 23(6), 643&#45;660.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055639&pid=S1405-5546201200010000600006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>7. Geman, S. &amp; Geman, D. (1984).</b> Stochastic relaxation, Gibbs distribution, and the Bayesian restoration of images. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence,</i> 6(6), 721&#45;741.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055641&pid=S1405-5546201200010000600007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>8. Gong, M., Yang, R., Wang, L., &amp; Gong, M. (2007).</b> A Performance Study on Different Cost Aggregation Approaches Used in Real&#45;Time Stereo Matching. <i>International Journal of Computer Vision,</i> 75(2), 283&#45;296.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055643&pid=S1405-5546201200010000600008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>9. Heo, Y.S., Lee, K.M., &amp; Lee, S.U. (2008).</b> Illumination and Camera Invariant Stereo Matching. <i>IEEE Conference on Computer Vision and Pattern Recognition.</i> Anchorage, Alaska, 1&#45;8.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055645&pid=S1405-5546201200010000600009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>10. Hernandez, C., Vogiatzis, G., &amp; Cipolla, R. (2008).</b> Multiview Photometric Stereo. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence,</i> 30(3), 548&#45;554.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055647&pid=S1405-5546201200010000600010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>11. Hirschm&uuml;ller, H. &amp; Scharstein, D. (2009).</b> Evaluation of Stereo Matching Costs on Images with Radiometric Differences. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence,</i> 31(9), 1582&#45;1599.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055649&pid=S1405-5546201200010000600011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>12. Liao, M., Wang, L., Yang, R., &amp; Gong, M. (2007).</b> Light Fall&#45;off Stereo. <i>IEEE Conference on Computer Vision and Pattern Recognition,</i> Minneapolis, USA, 1&#45;8.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055651&pid=S1405-5546201200010000600012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>13. Magda, S., Kriegman, D.J., Zickler, T., &amp; Belhumeur, P.N. (2001).</b> Beyond Lambert: Reconstructing surfaces with arbitrary BRDFs. <i>Eighth IEEE International Conference on Computer Vision,</i> Vancouver, Canada, 2, 391&#45;398.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055653&pid=S1405-5546201200010000600013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>14. Marroquin, J., Mitter, S., &amp; Poggio, T. (1987).</b> Probabilistic solution of ill&#45;posed problems in computational vision. <i>Journal of the American Statistical Association,</i> 82(397), 76&#45;89.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055655&pid=S1405-5546201200010000600014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>15. Scharstein, D. &amp; Szeliski, R. (1998).</b> Stereo matching with nonlinear diffusion. <i>International Journal of Computer Vision,</i> 28(2), 155&#45;174.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055657&pid=S1405-5546201200010000600015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>16. Scharstein, D. &amp; Szelisky, R. (2002).</b> A Taxonomy and Evaluation of Dense Two&#45;Frame Stereo Correspondence Algorithms. <i>International Journal of Computer Vision,</i> 47(1&#45;3), 7&#45;42.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055659&pid=S1405-5546201200010000600016&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>17. Scharstein, D. &amp; Szeliski, R. (2003).</b> High accuracy stereo depth maps using structured light. <i>2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition,</i> Wisconsin, USA, 1, 195&#45;202.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055661&pid=S1405-5546201200010000600017&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>18. Seitz, S.M., Curless, B., Diebel, J., Scharstein, D., &amp; Szeliski, R. (2006).</b> A Comparison and Evaluation of Multi&#45;View Stereo Reconstruction Algorithms. <i>2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition,</i> New York, USA, 1, 519&#45;528.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055663&pid=S1405-5546201200010000600018&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>19. Szeliski, R. &amp; Zabih, R. (1999).</b> An experimental comparison of stereo algorithms. In Springer: Berlin, <i>International Workshop on Vision Algorithms,</i> Keyra, Greece, 1&#45;19.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055665&pid=S1405-5546201200010000600019&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>20. Tao, H., Sawhney, H., &amp; Kumar, R. (2001).</b> A global matching frame&#45;work for stereo computation. <i>Eighth IEEE International Conference on Computer Vision,</i> Vancouver, Canada, 1, 532&#45;539.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055667&pid=S1405-5546201200010000600020&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>21. Wang, L., Yang, R., &amp; Davis, J.E. (2007).</b> BRDF Invariant Stereo Using Light Transport Constancy. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence,</i> 29(9), 1616&#45;1626.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055669&pid=S1405-5546201200010000600021&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>22. Woodham, R.J. (1980).</b> Photometric method for determining surface orientation from multiple images. <i>Optical Engineering,</i> 19(1), 139&#45;144.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055671&pid=S1405-5546201200010000600022&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>23. Zabih, R. &amp; Woodfill, J. (1994).</b> Non&#45;parametric local transforms for computing visual correspondence. <i>Third European Conference on Computer Vision,</i> Stockholm, Sweden, 2, 151&#45;158.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055673&pid=S1405-5546201200010000600023&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>24. Zickler, T.E., Belhumeur, P.N., &amp; Kriegman, D.J. (2002).</b> Helmholtz stereopsis: exploiting reciprocity for surface reconstruction. <i>International Journal of Computer Vision,</i> 49(2&#45;3), 215&#45;227.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2055675&pid=S1405-5546201200010000600024&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bobick]]></surname>
<given-names><![CDATA[A.F.]]></given-names>
</name>
<name>
<surname><![CDATA[Intille]]></surname>
<given-names><![CDATA[S.S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Large occlusion stereo]]></article-title>
<source><![CDATA[International Journal of Computer Vision]]></source>
<year>1999</year>
<volume>33</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>181-200</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bolles]]></surname>
<given-names><![CDATA[R.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Baker]]></surname>
<given-names><![CDATA[H.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Hannah]]></surname>
<given-names><![CDATA[M.J.]]></given-names>
</name>
</person-group>
<source><![CDATA[The JISCT stereo evaluation. Image Understanding Workshop]]></source>
<year>1993</year>
<page-range>263-274</page-range><publisher-loc><![CDATA[San Francisco^eCA CA]]></publisher-loc>
<publisher-name><![CDATA[Morgan Kaufmann Publishers]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boykov]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Veksler]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Zabih]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Fast approximate energy minimization via graph cuts]]></article-title>
<source><![CDATA[IEEE Transactions on Pattern Analysis and Machine Intelligence]]></source>
<year>2001</year>
<volume>23</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>1222-1239</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Brown]]></surname>
<given-names><![CDATA[M.Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Burschka]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Hager]]></surname>
<given-names><![CDATA[G.D.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Advances in computational stereo]]></article-title>
<source><![CDATA[IEEE Transactions on Pattern Analysis and Machine Intelligence]]></source>
<year>2003</year>
<volume>25</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>993-1008</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Burt]]></surname>
<given-names><![CDATA[P.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Adelson]]></surname>
<given-names><![CDATA[E.H.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[The Laplacian pyramid as a compact image code]]></article-title>
<source><![CDATA[IEEE Transactions on Communications]]></source>
<year>1983</year>
<volume>31</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>532-540</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Georghiades]]></surname>
<given-names><![CDATA[A.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Belhumeur]]></surname>
<given-names><![CDATA[P.N.]]></given-names>
</name>
<name>
<surname><![CDATA[Kriegman]]></surname>
<given-names><![CDATA[D.J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[From few to many: illumination cone models for face recognition under variable lighting and pose]]></article-title>
<source><![CDATA[IEEE Transactions on Pattern Analysis and Machine Intelligence]]></source>
<year>2001</year>
<volume>23</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>643-660</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Geman]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Geman]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Stochastic relaxation, Gibbs distribution, and the Bayesian restoration of images]]></article-title>
<source><![CDATA[IEEE Transactions on Pattern Analysis and Machine Intelligence]]></source>
<year>1984</year>
<volume>6</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>721-741</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gong]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Gong]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A Performance Study on Different Cost Aggregation Approaches Used in Real-Time Stereo Matching]]></article-title>
<source><![CDATA[International Journal of Computer Vision]]></source>
<year>2007</year>
<volume>75</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>283-296</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Heo]]></surname>
<given-names><![CDATA[Y.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[K.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[S.U.]]></given-names>
</name>
</person-group>
<source><![CDATA[Illumination and Camera Invariant Stereo Matching]]></source>
<year>2008</year>
<conf-name><![CDATA[ IEEE Conference on Computer Vision and Pattern Recognition]]></conf-name>
<conf-loc>Anchorage </conf-loc>
<page-range>1-8</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hernandez]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Vogiatzis]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Cipolla]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Multiview Photometric Stereo]]></article-title>
<source><![CDATA[IEEE Transactions on Pattern Analysis and Machine Intelligence]]></source>
<year>2008</year>
<volume>30</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>548-554</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hirschmüller]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Scharstein]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Evaluation of Stereo Matching Costs on Images with Radiometric Differences]]></article-title>
<source><![CDATA[IEEE Transactions on Pattern Analysis and Machine Intelligence]]></source>
<year>2009</year>
<volume>31</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>1582-1599</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liao]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Gong]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Light Fall-off Stereo]]></source>
<year>2007</year>
<conf-name><![CDATA[ IEEE Conference on Computer Vision and Pattern Recognition]]></conf-name>
<conf-loc>Minneapolis </conf-loc>
<page-range>1-8</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Magda]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Kriegman]]></surname>
<given-names><![CDATA[D.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Zickler]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Belhumeur]]></surname>
<given-names><![CDATA[P.N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Beyond Lambert: Reconstructing surfaces with arbitrary BRDFs]]></source>
<year>2001</year>
<volume>2</volume>
<conf-name><![CDATA[Eighth IEEE International Conference on Computer Vision]]></conf-name>
<conf-loc>Vancouver </conf-loc>
<page-range>391-398</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Marroquin]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Mitter]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Poggio]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Probabilistic solution of ill-posed problems in computational vision]]></article-title>
<source><![CDATA[Journal of the American Statistical Association]]></source>
<year>1987</year>
<volume>82</volume>
<numero>397</numero>
<issue>397</issue>
<page-range>76-89</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Scharstein]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Szeliski]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Stereo matching with nonlinear diffusion]]></article-title>
<source><![CDATA[International Journal of Computer Vision]]></source>
<year>1998</year>
<volume>28</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>155-174</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Scharstein]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Szelisky]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms]]></article-title>
<source><![CDATA[International Journal of Computer Vision]]></source>
<year>2002</year>
<volume>47</volume><volume>1-3</volume>
<page-range>7-42</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Scharstein]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Szeliski]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[High accuracy stereo depth maps using structured light]]></source>
<year>2003</year>
<conf-name><![CDATA[ IEEE Computer Society Conference on Computer Vision and Pattern Recognition]]></conf-name>
<conf-date>2003</conf-date>
<conf-loc>Wisconsin Wisconsin</conf-loc>
<page-range>195-202</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Seitz]]></surname>
<given-names><![CDATA[S.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Curless]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Diebel]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Scharstein]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Szeliski]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[A Comparison and Evaluation of Multi-View Stereo Reconstruction Algorithms]]></source>
<year>2006</year>
<volume>1</volume>
<conf-name><![CDATA[ IEEE Computer Society Conference on Computer Vision and Pattern Recognition]]></conf-name>
<conf-date>2006</conf-date>
<conf-loc>New York </conf-loc>
<page-range>519-528</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Szeliski]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Zabih]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[An experimental comparison of stereo algorithms]]></article-title>
<source><![CDATA[]]></source>
<year>1999</year>
<conf-name><![CDATA[ International Workshop on Vision Algorithms]]></conf-name>
<conf-loc>BerlinKeyra </conf-loc>
<page-range>1-19</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tao]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Sawhney]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[A global matching frame-work for stereo computation]]></source>
<year>2001</year>
<volume>1</volume>
<conf-name><![CDATA[Eighth IEEE International Conference on Computer Vision]]></conf-name>
<conf-loc>Vancouver </conf-loc>
<page-range>532-539</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Davis]]></surname>
<given-names><![CDATA[J.E.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[BRDF Invariant Stereo Using Light Transport Constancy]]></article-title>
<source><![CDATA[IEEE Transactions on Pattern Analysis and Machine Intelligence]]></source>
<year>2007</year>
<volume>29</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>1616-1626</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Woodham]]></surname>
<given-names><![CDATA[R.J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Photometric method for determining surface orientation from multiple images]]></article-title>
<source><![CDATA[Optical Engineering]]></source>
<year>1980</year>
<volume>19</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>139-144</page-range></nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zabih]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Woodfill]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Non-parametric local transforms for computing visual correspondence]]></source>
<year>1994</year>
<volume>2</volume>
<conf-name><![CDATA[Third European Conference on Computer Vision]]></conf-name>
<conf-loc>Stockholm </conf-loc>
<page-range>151-158</page-range></nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zickler]]></surname>
<given-names><![CDATA[T.E.]]></given-names>
</name>
<name>
<surname><![CDATA[Belhumeur]]></surname>
<given-names><![CDATA[P.N.]]></given-names>
</name>
<name>
<surname><![CDATA[Kriegman]]></surname>
<given-names><![CDATA[D.J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Helmholtz stereopsis: exploiting reciprocity for surface reconstruction]]></article-title>
<source><![CDATA[International Journal of Computer Vision]]></source>
<year>2002</year>
<volume>49</volume>
<numero>2-3</numero>
<issue>2-3</issue>
<page-range>215-227</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
