Along with Walter Kosters, Joost Batenburg researches on Nonograms, picture logic puzzles where a pixel grid has to be filled with black and white pixels, based on a description that indicates the lengths of the consecutive black segments for each row and column. In this puzzle type, the numbers are a form of discrete tomography that measures how many unbroken lines of filled-in squares there are in any given row or column. While the Nonograms that can be found in puzzle books can typically be solved by applying a series of highly local reasoning steps regarding single rows and columns, the general Nonogram problem is NP-hard.

^ Dr. Joost Batenburg takes us to the ASTRA-lab where he explains why we need a powerful desktop supercomputer, and the design ideas behind the FASTRA II system

Home * People * Joost BatenburgKees Joost Batenburg,a Dutch computer scientist and mathematician with a M.Sc. in CS and Ph.D. in mathematics from Leiden University, researcher at Centrum Wiskunde & Informatica, Science Park Amsterdam, The Netherlands, and professor at Vision Lab, University of Antwerp, Wilrijk, Belgium. His research interests include discrete and electron tomography, combinatorial optimization, evolutionary algorithms, GPU computing for large-scale scientific computing, image processing, computer vision and inverse problems. He is member of the research team behind the

Little Green Machine^{[1]}, a GPU Beowulf cluster.^{[2]}## Table of Contents

## Nonograms

Along with Walter Kosters, Joost Batenburg researches on Nonograms, picture logic puzzles where a pixel grid has to be filled with black and white pixels, based on a description that indicates the lengths of the consecutive black segments for each row and column. In this puzzle type, the numbers are a form of discrete tomography that measures how many unbroken lines of filled-in squares there are in any given row or column. While the Nonograms that can be found in puzzle books can typically be solved by applying a series of highly local reasoning steps regarding single rows and columns, the general Nonogram problem is NP-hard.## Selected Publications

^{[3]}^{[4]}2003).An evolutionary algorithm for discrete tomography. M.Sc. thesis in Computer Science, Leiden University2006).Network flow algorithms for discrete tomography. Ph.D. thesis, Leiden University, advisors Robert Tijdeman, Herman te Riele2009).Solving Nonograms by combining relaxations. Pattern Recognition, Vol. 42, No. 82011).Discrete Tomography: A Neural Network Approach. pdf2012).Nonograms. LIACS - Leiden Institute of Advanced Computer Science, pdf2012).On the Difficulty of Nonograms. ICGA Journal, Vol. 35, No. 4## External Links

^{[5]}, YouTube Video## References

## What links here?

Up one level