Matrix Factorization-based Clustering Of Image Features For Bandwidth-constrained Information Retrieval

Abstract

We consider the problem of accurately and efficiently querying a remote server to retrieve information about images captured by a mobile device. In addition to reduced transmission overhead and computational complexity, the retrieval protocol should be robust to variations in the image acquisition process, such as translation, rotation, scaling, and sensor-related differences. We propose to extract scale-invariant image features and then perform clustering to reduce the number of features needed for image matching. Principal Component Analysis (PCA) and Non-negative Matrix Factorization (NMF) are investigated as candidate clustering approaches. The image matching complexity at the database server is quadratic in the (small) number of clusters, not in the (very large) number of image features. We employ an image-dependent information content metric to approximate the model order, i.e., the number of clusters, needed for accurate matching, which is preferable to setting the model order u

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keychakareski2016matrix

Related papers

• Probability Weighted Compact Feature For Domain Adaptive Retrieval (2020)15.19
• Automatic Feature Weight Determination Using Indexing And Pseudo-relevance Feedback For Multi-feature Content-based Image Retrieval (2018)0.00
• Saliency Map-based Image Retrieval Using Invariant Krawtchouk Moments (2024)0.00
• Coarse-to-fine: Learning Compact Discriminative Representation For Single-stage Image Retrieval (2023)9.35
• Bloom Filters And Compact Hash Codes For Efficient And Distributed Image Retrieval (2016)6.34
• Exploring A Fine-grained Multiscale Method For Cross-modal Remote Sensing Image Retrieval (2022)16.73
• Wireless Image Retrieval At The Edge (2020)17.82
• Hybrid Diffusion: Spectral-temporal Graph Filtering For Manifold Ranking (2018)2.26