Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/60254
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chojnacki, W. | - |
dc.contributor.author | Brooks, M. | - |
dc.contributor.author | Van Den Hengel, A. | - |
dc.contributor.editor | Wang, J. | - |
dc.date.issued | 2000 | - |
dc.identifier.citation | Proceedings of ICARV 2000 - Sixth International Conference on Control, Automation, Robotics and Vision, 2000. | - |
dc.identifier.isbn | 9810434456 | - |
dc.identifier.uri | http://hdl.handle.net/2440/60254 | - |
dc.description.abstract | The renormalisation method of Kanatani is intended to find the minimisers of cost functions of a certain form. As such, it has applicability to a wide spectrum of computer vision problems that may be couched in these terms. However, despite its sophistication, the method of Kanatani has been slow to gain broad acceptance, perhaps because of the complexity of its original derivation. In this paper we present an alternative and simpler treatment of this important method. | - |
dc.description.statementofresponsibility | Wojciech Chojnacki, Michael J. Brooks and Anton van den Hengel | - |
dc.language.iso | en | - |
dc.publisher | School of Electrical & Electronic Engineering, NTU | - |
dc.rights | Copyright status unknown | - |
dc.source.uri | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.9793 | - |
dc.title | A simplified treatment of Kanatani's renormalisation method | - |
dc.type | Conference paper | - |
dc.contributor.conference | International Conference on Control, Automation, Robotics and Vision (6th : 2000 : Singapore) | - |
dc.publisher.place | Singapore | - |
pubs.publication-status | Published | - |
dc.identifier.orcid | Chojnacki, W. [0000-0001-7782-1956] | - |
dc.identifier.orcid | Van Den Hengel, A. [0000-0003-3027-8364] | - |
Appears in Collections: | Aurora harvest Computer Science publications |
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.