Research Article
Cross-Modal Discrimination Hashing Retrieval Using Variable Length
Algorithm 2
Testing produce of the proposed method.
| Input: Testing datasets ; trained , and . | | Output: The top n cross-modal data matching the samples to be retrieved. | | Procedure: | (1) | if input independent or then | (2) | compute the corresponding hash code by or ; | (3) | end if | (4) | if input paired then: | (5) | if hash code exists in space of Y data: | | ; | (6) | else: | | ; | (7) | end if | (8) | end if | (9) | Calculate the Hamming distance between the hash code b' and the hash codes of all samples in the retrieval database | (10) | Sort the distances calculated in ascending order, and return the first n samples. |
|