Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Fusing Points and Lines for High Performance Tracking
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
Stanford GraphBase: A Platform for Combinatorial Computing, The
Stanford GraphBase: A Platform for Combinatorial Computing, The
Real-Time video annotations for augmented reality
ISVC'05 Proceedings of the First international conference on Advances in Visual Computing
A hybrid approach to domino portrait generation
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Characterization and automation of matching-based neighborhoods
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
A domino portrait is an approximation of an image using a given number of sets of dominoes. This problem was first stated in 1981. 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 our portraits to be visually indistinguishable from those found optimally. Empirically, we show that we obtain many orders of magnitude reduction in search time.