Visual search for mobile devices relies on transmitting wirelessly image descriptors to a remote server. Hence, descriptors needs to be compressed to reduce bandwidth occupancy and network latency. In this paper, we investigate on the compression ratio versus accuracy of two low complexity coding schemes, based on Arithmetic and Type coding, applied to SIFT local descriptors.
Low Complexity SIFT Compression Techniques / F. Malaguti; D. Pau; L. Di Stefano. - ELETTRONICO. - (2012), pp. 6336446.250-6336446.253. (Intervento presentato al convegno 2th IEEE International Conference on Consumer Electronics tenutosi a Berlino nel 3-5 Settembre 2012) [10.1109/ICCE-Berlin.2012.6336446].
Low Complexity SIFT Compression Techniques
DI STEFANO, LUIGI
2012
Abstract
Visual search for mobile devices relies on transmitting wirelessly image descriptors to a remote server. Hence, descriptors needs to be compressed to reduce bandwidth occupancy and network latency. In this paper, we investigate on the compression ratio versus accuracy of two low complexity coding schemes, based on Arithmetic and Type coding, applied to SIFT local descriptors.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
