| dc.date.accessioned | 2008-04-07T20:45:20Z | |
| dc.date.accessioned | 2018-11-26T22:25:12Z | |
| dc.date.available | 2008-04-07T20:45:20Z | |
| dc.date.available | 2018-11-26T22:25:12Z | |
| dc.date.issued | 2008-04-07 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/41070 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/41070 | |
| dc.description.abstract | LIBPMK is a C++ implementation of Grauman and Darrell's pyramid match algorithm. This toolkit provides a flexible framework with which developers can quickly match sets of image features and run experiments. LIBPMK provides functionality for $k$-means and hierarchical clustering, dealing with data sets too large to fit in memory, building multi-resolution histograms, quickly performing pyramid matches, and training and testing support vector machines (SVMs). This report provides a tutorial on how to use the LIBPMK code, and gives the specifications of the LIBPMK API. | en_US |
| dc.format.extent | 217 p. | en_US |
| dc.relation | Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.relation | | en_US |
| dc.subject | pmk | en_US |
| dc.subject | vgpmk | en_US |
| dc.subject | pyramid match kernel | en_US |
| dc.title | LIBPMK: A Pyramid Match Toolkit | en_US |
