Efficient Modeling Of Higher Order And Longer Range Geometry Statistics
| dc.contributor.author | Zhang, Yimeng | en_US |
| dc.contributor.chair | Chen, Tsuhan | en_US |
| dc.contributor.committeeMember | Joachims, Thorsten | en_US |
| dc.contributor.committeeMember | Reeves, Anthony P | en_US |
| dc.contributor.committeeMember | Liu, Xiaoming | en_US |
| dc.date.accessioned | 2013-09-05T15:21:23Z | |
| dc.date.available | 2013-09-05T15:21:23Z | |
| dc.date.issued | 2013-01-28 | en_US |
| dc.description.abstract | The local feature based approaches have become popular in most vision applications. A local feature captures the local appearance of objects or scenes, and is more robust to environment and view-point changes comparing to features extracted from the entire image. The shape and context information is further captured with the spatial relationships of the local features. Modeling more spatial information usually leads to exponential or polynomial increase of the computational cost. Therefore, the spatial modeling of prior work is limited to neighboring or weak geometry relationships of local features, or is not viewpoint invariant. In this thesis, we propose algorithms that model rich geometry information with little sacrifice of the computational cost. We focus on two main vision problems, the whole image representation and the pixel-level image labeling. For each of them, we present an algorithm that incorporate spatial information to its most popular and basic technique: the Bag-of-Words (BoW) representation and Conditional Random Field (CRF) model respectively. Our proposed algorithm is general enough to be applied to or combined with any other advanced technique, which utilizes BoW or CRF as part of it, to further improve its performance with only little increase of the computational cost. We show example usages of the proposed algorithms in several applications, including object recognition, object localization, image retrieval, activity recognition in videos, and object-based image segmentation. Experiment results show that our approaches improve the performance of the state-of-arts for these applications with only little increase of the computation cost. | en_US |
| dc.identifier.other | bibid: 8267706 | |
| dc.identifier.uri | https://hdl.handle.net/1813/33802 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Computer Vision | en_US |
| dc.subject | Machine Learning | en_US |
| dc.subject | Object Recognition | en_US |
| dc.subject | Event Detection | en_US |
| dc.subject | Image Retrieval | en_US |
| dc.subject | Image Segmentation | en_US |
| dc.title | Efficient Modeling Of Higher Order And Longer Range Geometry Statistics | en_US |
| dc.type | dissertation or thesis | en_US |
| thesis.degree.discipline | Electrical Engineering | |
| thesis.degree.grantor | Cornell University | en_US |
| thesis.degree.level | Doctor of Philosophy | |
| thesis.degree.name | Ph. D., Electrical Engineering |
Files
Original bundle
1 - 1 of 1