| Summary: | Due to the correlation among hashing bits, the retrieval performance improvement becomes slower when the hashing code length becomes longer. Existing methods try to regularize the projection matrix as an orthogonal matrix to decorrelate hashing codes. However, the binarization of projected data may completely break the orthogonality. In this paper, we propose a minimum correlation regularization (MCR) for multimodal hashing. Rather than being imposed on projection matrix, MCR is imposed on a differentiable function which approximates the binarization. On the other hand, binary labels could not precisely reflect the distances among data. Hence, we propose a label relaxation scheme to achieve better performance.
|
|---|
