An Eigenvector Method for Surface Recovery
| dc.contributor.author | Robles-Kelly, A. | en_US |
| dc.contributor.author | Hancock, E.R. | en_US |
| dc.contributor.editor | Peter Hall and Philip Willis | en_US |
| dc.date.accessioned | 2016-02-09T10:27:05Z | |
| dc.date.available | 2016-02-09T10:27:05Z | |
| dc.date.issued | 2003 | en_US |
| dc.description.abstract | In this paper we explore how spectral methods for graph seriation can be used to develop a new shape-fromshading algorithm. We characterise the field of surface normals using a transition matrix whose elements are computed from the sectional curvature between different image locations. We use a graph seriation method to define a curvature minimising surface integration path for the purposes of height reconstruction. To smooth the reconstructed surface, we fit quadric patches to the height data. The smoothed surface normal directions are updated ensuring compliance with Lambert's law. The processes of height recovery and surface normal adjustment are interleaved and iterated until a stable surface is obtained. We provide results on synthetic and real-world imagery. | en_US |
| dc.description.sectionheaders | Vision Methods 1 | en_US |
| dc.description.seriesinformation | Vision, Video, and Graphics (VVG) 2003 | en_US |
| dc.identifier.doi | 10.2312/vvg.20031005 | en_US |
| dc.identifier.isbn | 3-905673-54-1 | en_US |
| dc.identifier.pages | A. Robles-Kelly and E.R. Hancock-I.4.8 [Image Processing and Computer Vision]: Spectral-graph methods, shape-from-shading | en_US |
| dc.identifier.uri | https://doi.org/10.2312/vvg.20031005 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | I.4.8 [Image Processing and Computer Vision] | en_US |
| dc.subject | Spectral | en_US |
| dc.subject | graph methods | en_US |
| dc.subject | shape | en_US |
| dc.subject | from | en_US |
| dc.subject | shading | en_US |
| dc.title | An Eigenvector Method for Surface Recovery | en_US |
Files
Original bundle
1 - 1 of 1