Hash Learning with Conditional Random Field and Rank Preserving Boosting
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 102 === Transforming data into binary codes for Approximate Nearest Neighbor (ANN) search has caught lots of attention in recent years. Two major advantages of binary codes are dramatically reducing the search time and storage. To make the codes more discriminative and...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/12304719885042236924 |