The ordinal relation preserving binary codes
An effective and efficient binary coding framework which enjoys the merits of lookup-based and hamming-based methods is proposed. Relative error is proposed to preserve the relative sensitivity. The effective tangent planes are adopted as hashing functions to avoid computing the complex classification problem. The encoding error guarantees that the selected hashing functions have good performance.
binary codes hashing algorithm approximate nearest neighbor search image retrieval