Skip to main content

Where’s the Weet-Bix?

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 4843))

Abstract

This paper proposes a new retrieval problem and conducts the initial study. This problem aims at finding the location of an item in a supermarket by means of visual retrieval. It is modelled as object-based retrieval and approached using the local invariant features. Two existing retrieval methods are investigated and their similarity measures are modified to better fit this new problem. More importantly, through the study this new retrieval problem proves itself to be a challenging task. An instant application of it is to help the customer find what they want without physically wandering around the shelves but a wide range of potential applications could be expected.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sivic, J., Zisserman, A.: Video google: A text retrieval approach to object matching in videos. In: IEEE International Conference on Computer Vision, pp. 1470–1477. IEEE Computer Society Press, Los Alamitos (2003)

    Chapter  Google Scholar 

  2. Nister, D., Stewenius, H.: Scalable recognition with a vocabulary tree. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 2161–2168. IEEE Computer Society Press, Los Alamitos (2006)

    Google Scholar 

  3. Lowe, D.G.: Object recognition from local scale-invariant features. In: IEEE International Conference on Computer Vision, pp. 1150–1157. IEEE Computer Society Press, Los Alamitos (1999)

    Google Scholar 

  4. Mikolajczyk, K., Schmid, C.: Scale & affine invariant interest point detectors. Interantional Journal of Computer Vision, 63–86 (2004)

    Google Scholar 

  5. Mikolajczyk, K., Tuytelaars, T., Schmid, C., Zisserman, A., Matas, J., Schaffalitzky, F., Kadir, T., Gool, L.V.: A comparison of affine region detectors. International Journal of Computer Vision 65(1/2), 43–72 (2005)

    Article  Google Scholar 

  6. Lowe, D.G.: Local feature view clustering for 3d object recognition. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 682–688. IEEE Computer Society Press, Los Alamitos (2001)

    Google Scholar 

  7. Schmid, C., Mohr, R.: Local grayvalue invariants for image retrieval. IEEE Transactions on Pattern Analysis and Machine Intelligence 19, 530–535 (1997)

    Article  Google Scholar 

  8. Duda, R.O., Stork, D.G., Hart, P.E.: Pattern Classification, 2nd edn. vol. 115. John Wiley and Sons, Chichester (2001)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Yasushi Yagi Sing Bing Kang In So Kweon Hongbin Zha

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, Y., Wang, L., Hartley, R., Li, H. (2007). Where’s the Weet-Bix?. In: Yagi, Y., Kang, S.B., Kweon, I.S., Zha, H. (eds) Computer Vision – ACCV 2007. ACCV 2007. Lecture Notes in Computer Science, vol 4843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76386-4_76

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76386-4_76

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76385-7

  • Online ISBN: 978-3-540-76386-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics