Skip to main content
SpringerLink
Log in

Graph Matching on a Low-Cost and Parallel Architecture

  • Conference paper
Pattern Recognition and Image Analysis (IbPRIA 2011)

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

Included in the following conference series:

  • 3025 Accesses

Abstract

This paper presents a new parallel algorithm to compute the graph-matching based on the Graduated Assignment. The aim of this paper is to perform graph matching in a current desktop computer, but, instead of executing the code in the generic processor, we execute a parallel code in the graphic processor unit. This computer can be embedded in a low-cost pattern recognition system or a mobile robot. Experiments show a speed-up of the run time around 400 times, which makes the use of attributed graphs to represent objects a valid solution.

This research was partially supported by Consolider Ingenio 2010; project CSD2007-00018 and by the CICYT project DPI 2010-17112.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE TPAMI 18(4), 377–388 (1996)

    Article  Google Scholar 

  2. Owens, J.: Streaming architectures and technology trends. GPU Gems 2, 457–470 (2005)

    Google Scholar 

  3. Kuhn, H.W.: The Hungarian method for the assignment problem Export. Naval Research Logistics Quarterly 2(1-2), 83–97 (1955)

    Article  MathSciNet  Google Scholar 

  4. Sinkhorn, R.: A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices. The Annals of Mathematical Statistics 35(2), 876–879 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  5. Zenios, S.A., Iu, S.-L.: Vector and parallel computing for matrix balancing. Annals of Operations Research 22, 161–180 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  6. Zenios, S.A.: Matrix balancing on a massively parallel Connection Machine. ORSA Journal on Computing 2, 112–125 (1990)

    Article  MATH  Google Scholar 

  7. NVIDIA CUDA, http://developer.nvidia.com/object/cuda.html

Download references

Author information

Authors and Affiliations

  1. Departament d’Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, Spain

    David Rodenas, Francesc Serratosa & Albert Solé

Authors
  1. David Rodenas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francesc Serratosa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Albert Solé
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Matemàtica Aplicada i Anàlisi, Universitat de Barcelona, Facultat de Matemàtiques, Gran Via de les Corts Catalanes 585, 08007, Barcelona, Spain

    Jordi Vitrià

  2. Instituto de Sistemas e Robótica / Instituto Superior Técnico, Av. Rovisco Pais, 1, 1049-001, Lisbon, Portugal

    João Miguel Sanches

  3. Institute for Intelligent Systems and Numerical Applications in Engineering (SIANI), Edificio de Informática y Matemáticas, University of Las Palmas de Gran Canaria, Campus Universitario de Tafira, 35017, Las Palmas, Spain

    Mario Hernández

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rodenas, D., Serratosa, F., Solé, A. (2011). Graph Matching on a Low-Cost and Parallel Architecture. In: Vitrià, J., Sanches, J.M., Hernández, M. (eds) Pattern Recognition and Image Analysis. IbPRIA 2011. Lecture Notes in Computer Science, vol 6669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21257-4_63

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21257-4_63

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21256-7

  • Online ISBN: 978-3-642-21257-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation