Shape Representation and Indexing Based on Region Connection Calculus and Oriented Matroid Theory

  • Ernesto Staffetti
  • Antoni Grau
  • Francesc Serratosa
  • Alberto Sanfeliu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2886)


In this paper a novel method for indexing views of 3D objects is presented. The topological properties of the regions of the views of a set of objects are used to define an index based on the region connection calculus and oriented matroid theory. Both are formalisms for qualitative spatial representation and reasoning and are complementary in the sense that whereas the region connection calculus encodes information about connectivity of pairs of connected regions of the view, oriented matroids encode relative position of the disjoint regions of the view and give local and global topological information about their spatial distribution. This indexing technique is applied to 3D object hypothesis generation from single views to reduce candidates in object recognition processes.


Convex Hull Object Recognition Single View Planar Point Oriented Matroid 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Serratosa, F., Alquézar, R., Sanfeliu, A.: Function-described for modeling objects represented by attributed graphs. Pattern Recognition 36, 781–798 (2003)CrossRefGoogle Scholar
  2. 2.
    Cohn, A., Bennett, B., Gooday, J., Gotts, N.M.: Qualitative spatial representation and reasoning with the region connection calculus. GeoInformatica 1, 275–316 (1997)CrossRefGoogle Scholar
  3. 3.
    Björner, A., Vergnas, M.L., Sturmfels, B., White, N., Ziegler, G.M.: Oriented Matroids. Encyclopedia of Mathematics and its Applications, vol. 43. Cambridge University Press, Cambridge (1993)zbMATHGoogle Scholar
  4. 4.
    Lamdan, Y., Schwartz, J.T., Wolfson, H.J.: Affine invariant model-based object recognition. IEEE Transactions on Robotics and Automation 6 (1990)Google Scholar
  5. 5.
    Carlsson, S.: Combinatorial geometry for shape representation and indexing. In: Proceedings of the International Workshop on Object Representation for Computer Vision (1996)Google Scholar
  6. 6.
    Egenhofer, M.J., Franzosa, R.D.: Point set topological relations. International Journal of Geographical Information Systems 5, 161–174 (1991)CrossRefGoogle Scholar
  7. 7.
    Bokowski, J., Sturmfels, B.: Computational Synthetic Geometry. In: Darnell, M.J. (ed.) Cryptography and Coding 1997. LNCS, vol. 1355. Springer, Heidelberg (1989)Google Scholar
  8. 8.
    Richter-Gebert, J., Ziegler, G.M.: Oriented matroids. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton (1997)Google Scholar
  9. 9.
    Rourke, J.O.: Computational Geometry in C. Cambridge University Press, Cambridge (1999)Google Scholar
  10. 10.
    Toussaint, G.T.: Solving geometric problems with the rotating calipers. In: Proceedings of IEEE MELECON 1983, Athens, Greece (1983)Google Scholar
  11. 11.
    Comaniciu, D., Meer, P.: Mean shift: A robust approach toward feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence 24, 603–619 (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Ernesto Staffetti
    • 1
  • Antoni Grau
    • 2
  • Francesc Serratosa
    • 3
  • Alberto Sanfeliu
    • 1
  1. 1.Institute of Industrial Robotics (CSIC-UPC)BarcelonaSpain
  2. 2.Department of Automatic ControlTechnical University of CataloniaBarcelonaSpain
  3. 3.Department of Computer Engineering and MathematicsRovira i Virgili UniversityTarragonaSpain

Personalised recommendations