Image Similarity Using Sparse Representation and Compression Distance
A new line of research uses compression methods to measure the similarity between signals. Two signals are considered similar if one can be compressed significantly when the information of the other is known. The existing compression-based similarity methods, although successful in the discrete one dimensional domain, do not work well in the context of images. This paper proposes a sparse representation-based approach to encode the information content of an image using information from the other image, and uses the compactness (sparsity) of the representation as a measure of its compressibility (how much can the image be compressed) with respect to the other image. The more sparse the representation of an image, the better it can be compressed and the more it is similar to the other image. The efficacy of the proposed measure is demonstrated through the high accuracies achieved in image clustering, retrieval and classification.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringImage ClusteringRetrievalSimilar Papers 제목 키워드 기반
Efficient Compression Technique for Sparse Sets
Recent technological advancements have led to the generation of huge amounts of data over the web, such as text, image, audio and video. Most of this data is high dimensional and sparse, for e.g., the bag-of-words repres…
ClusteringLossless Point Cloud Attribute Compression with Normal-based Intra Prediction
The sparse LiDAR point clouds become more and more popular in various applications, e.g., the autonomous driving. However, for this type of data, there exists much under-explored space in the corresponding compression fr…
AttributeAutonomous DrivingCPIPS: Learning to Preserve Perceptual Distances in End-to-End Image Compression
Lossy image coding standards such as JPEG and MPEG have successfully achieved high compression rates for human consumption of multimedia data. However, with the increasing prevalence of IoT devices, drones, and self-driv…
Image CompressionPerceptual DistanceSelf-Driving CarsDeltaKV: Residual-Based KV Cache Compression via Long-Range Similarity
The deployment of efficient long-context LLMs in applications like autonomous agents, long-chain reasoning, and creative writing is fundamentally bottlenecked by the linear growth of KV cache memory. Existing compression…
Asymmetric Sparse Kernel Approximations for Large-scale Visual Search
We introduce an asymmetric sparse approximate embedding optimized for fast kernel comparison operations arising in large-scale visual search. In contrast to other methods that perform an explicit approximate embedding us…
Image RetrievalRetrieval