Use of Clustering to Assist Recognition in Computer Vision
In computer vision many problems are of non-deterministic polynomial time complexity. One of these problems is graph matching. Suboptimal solutions have been proposed to efficiently do graph matching. This thesis investigates the use of unsupervised learning to cluster structured graph data in polyn...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Norges teknisk-naturvitenskapelige universitet, Institutt for datateknikk og informasjonsvitenskap
2013
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-23403 |