IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v184y2011i1p79-9510.1007-s10479-010-0738-6.html
   My bibliography  Save this article

Domino portrait generation: a fast and scalable approach

Author

Listed:
  • Hadrien Cambazard
  • John Horan
  • Eoin O’Mahony
  • Barry O’Sullivan

Abstract

A domino portrait is an approximation of an image using a given number of sets of dominoes. This problem was first formulated in 1981 by Ken Knowlton in a patent application, which was finally granted in 1983. Domino portraits have been generated most often using integer linear programming techniques that provide optimal solutions, but these can be slow and do not scale well to larger portraits. In this paper we propose a new approach that overcomes these limitations and provides high quality portraits. Our approach combines techniques from operations research, artificial intelligence, and computer vision. Starting from a randomly generated template of blank domino shapes, a subsequent optimal placement of dominoes can be achieved in constant time when the problem is viewed as a minimum cost flow. The domino portraits one obtains are good, but not as visually attractive as optimal ones. Combining techniques from computer vision and large neighborhood search we can quickly improve the portraits. Empirically, we show that we obtain many orders of magnitude reduction in search time. Copyright Springer Science+Business Media, LLC 2011

Suggested Citation

  • Hadrien Cambazard & John Horan & Eoin O’Mahony & Barry O’Sullivan, 2011. "Domino portrait generation: a fast and scalable approach," Annals of Operations Research, Springer, vol. 184(1), pages 79-95, April.
  • Handle: RePEc:spr:annopr:v:184:y:2011:i:1:p:79-95:10.1007/s10479-010-0738-6
    DOI: 10.1007/s10479-010-0738-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-010-0738-6
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10479-010-0738-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:184:y:2011:i:1:p:79-95:10.1007/s10479-010-0738-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.