A robust hashing method for multi-view data with noise corruptions is presented. It is to jointly learn a low-rank kernelized similarity consensus and hash functions. Approximate landmark graph is employed to make training fast. Extensive experiments are conducted on benchmarks to show the efficacy of our model.