The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Learning a Maximum Margin Subspace for Image Retrieval
Abstract
One of the fundamental problems in Content-Based Image Retrieval (CBIR) has been the gap between low-level visual features and high-level semantic concepts. To narrow down this gap, relevance feedback is introduced into image retrieval. With the user-provided information, a classifier can be learned to distinguish between positive and negative examples. However, in real-world applications, the number of user feedbacks is usually too small compared to the dimensionality of the image space. In order to cope with the high dimensionality, we propose a novel semisupervised method for dimensionality reduction called Maximum Margin Projection (MMP). MMP aims at maximizing the margin between positive and negative examples at each local neighborhood. Different from traditional dimensionality reduction algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA), which effectively see only the global euclidean structure, MMP is designed for discovering the local manifold structure. Therefore, MMP is likely to be more suitable for image retrieval, where nearest neighbor search is usually involved. After projecting the images into a lower dimensional subspace, the relevant images get closer to the query image; thus, the retrieval performance can be enhanced. The experimental results on Corel image database demonstrate the effectiveness of our proposed algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Cited by
Bregman Divergence-Based Regularization for Transfer Subspace Learning
Si, S., Tao, D., & Geng, B. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.126 · Cited by 477
Patch Alignment for Dimensionality Reduction
Zhang, T., Tao, D., Li, X., & Yang, J. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.212 · Cited by 381
Content-based image retrieval of digitized histopathology in boosted spectrally embedded spaces
Sridhar, A., Doyle, S., & Madabhushi, A. (2015) · Journal of Pathology Informatics · doi:10.4103/2153-3539.159441 · Cited by 34
Metadata
- Authors
- He, X., Cai, D., & Han, J.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2008-02
- Volume
- 20
- Issue
- 2
- Pages
- 189-201
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2169743536
- Cited by
- 192
- References
- 1
- FWCI
- 23.87
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.