Skip to main content

Arc-Consistency Checking with Bilevel Constraints: An Optimization

  • Conference paper
Book cover Graph-Based Representations in Pattern Recognition (GbRPR 2009)

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

  • 782 Accesses

Abstract

Arc-consistency checking has been adapted to be able to interpret over-segmented image. This adaptation lead to the arc-consistency algorithm with bilevel constraints. In this paper we propose an optimization of this algorithm. This new way to solve arc-consistency checking with bilevel constraints gives the possibility to parallelize the algorithm. Some experiments shows the efficiency of this approach.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bessière, C.: Arc-consistency and arc-consistency again. Artificial intelligence 65, 179–190 (1994)

    Article  Google Scholar 

  2. Kokèny, T.: A new arc consistency algorithm for csps with hierarchical domains. In: Proceedings 6th IEEE International Conference on Tools for Artificial Intelligence, pp. 439–445 (1994)

    Google Scholar 

  3. Mohr, R., Henderson, T.: Arc and path consistency revisited. Artificial Intelligence 28, 225–233 (1986)

    Article  Google Scholar 

  4. Mohr, R., Masini, G.: Good old discrete relaxation. In: Proceedings ECAI 1988, pp. 651–656 (1988)

    Google Scholar 

  5. Hentenryck, P.V., Deville, Y., Teng, C.: A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57(2), 291–321 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Mackworth, A., Freuder, E.: The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence 25, 65–74 (1985)

    Article  Google Scholar 

  7. Freuder, E., Wallace, R.: Partial constraint satisfaction. Artificial Intelligence 58, 21–70 (1992)

    Article  MathSciNet  Google Scholar 

  8. Deruyver, A., Hodé, Y.: Constraint satisfaction problem with bilevel constraint: application to interpretation of over segmented images. Artificial Intelligence 93, 321–335 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  9. Deruyver, A., Hodé, Y.: Qualitative spatial relationships for image interpretation by using a conceptual graph. In: Image and Vision Computing (2008) (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Deruyver, A., Hodé, Y. (2009). Arc-Consistency Checking with Bilevel Constraints: An Optimization. In: Torsello, A., Escolano, F., Brun, L. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2009. Lecture Notes in Computer Science, vol 5534. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02124-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02124-4_18

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics