Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6413Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Marroquin, J.L. | - |
| dc.date | 2004-10-04T14:55:35Z | - |
| dc.date | 2004-10-04T14:55:35Z | - |
| dc.date | 1984-08-01 | - |
| dc.date.accessioned | 2013-10-09T02:45:20Z | - |
| dc.date.available | 2013-10-09T02:45:20Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-792 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6413 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | Well-known methods for solving the shape-from-shading problem require knowledge of the reflectance map. Here we show how the shape-from-shading problem can be solved when the reflectance map is not available, but is known to have a given form with some unknown parameters. This happens, for example, when the surface is known to be Lambertian, but the direction to the light source is not known. We give an iterative algorithm that alternately estimates the surface shape and the light source direction. Use of the unit normal in parameterizing the reflectance map, rather than the gradient or stereographic coordinates, simpliflies the analysis. Our approach also leads to an iterative scheme for computing shape from shading that adjusts the current estimates of the focal normals toward or away from the direction of the light source. The amount of adjustment is proportional to the current difference between the predicted and the observed brightness. We also develop generalizations to less constrained forms of reflectance maps. | - |
| dc.format | 5501976 bytes | - |
| dc.format | 4052611 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-792 | - |
| dc.title | Surface Reconstruction Preserving Discontinuities | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.