Efficient Point-to-Subspace Query in ℓ1 with Application to Robust Object Instance Recognition

@article{Sun2014EfficientPQ,
  title={Efficient Point-to-Subspace Query in ℓ1 with Application to Robust Object Instance Recognition},
  author={Ju Sun and Y. Zhang and J. Wright},
  journal={SIAM J. Imaging Sci.},
  year={2014},
  volume={7},
  pages={2105-2138}
}
  • Ju Sun, Y. Zhang, J. Wright
  • Published 2014
  • Mathematics, Computer Science
  • SIAM J. Imaging Sci.
  • Motivated by vision tasks such as robust face and object recognition, we consider the following general problem: given a collection of low-dimensional linear subspaces in a high-dimensional ambient (image) space, and a query point (image), efficiently determine the nearest subspace to the query in $\ell^1$ distance. In contrast to the naive exhaustive search which entails large-scale linear programs, we show that the computational burden can be cut down significantly by a simple two-stage… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 55 REFERENCES
    Inactivation of microorganisms in milk and apple cider treated with ultrasound.
    117
    The lambda calculus - its syntax and semantics
    3071
    Consistent Model Speci fi cation Tests ∗
    26
    Subspace embeddings for the `1-norm with applications
    • 2011
    Convex Optimization
    34388