Combinatorial and Computational Problems Related to Digital Halftoning

ATTENTION: THIS WEB SITE HAS MOVED. The pages you are looking at are no longer being maintained. Please go to http://www.poly.edu/cis/ to visit the new site of the Department of Computer and Information Science at Polytechnic University.
Combinatorial and Computational Problems Related to Digital Halftoning

Tetsuo Asano

Japan Advanced Institute of Science and Technology (JAIST)

Monday, Nov. 15, 1:00pm
LC 400, Brooklyn Campus, Polytechnic University

Abstract
      Digital halftoning is a technique to convert a continuous-tone image into a binary image to print it out on a printer. The ultimate goal is to produce a binary image that "looks similar" to an input image. We could define this conversion problem as a combinatorial optimization problem based on a reasonable model for human perception. Since this optimization problem is intractable and even a small image consists of a million pixels, we need to introduce approximation and restrictions on optimization criterion. In this talk I will survey algorithmic and combinatorial approaches toward digital halftoning. I will also give some recent progress.

Bio:

      Tetsuo Asano received the B.E., and M.E., and Ph.D. degrees in Engineering from Osaka University in 1972, 1974, and 1977, respectively. He is currently a professor of JAIST (Japan Advanced Institute of Science and Technology). He served as a Presidential Advisor during 1999-2000 and a senator during 2002-2004 at JAIST.
      He used to work in VLSI layout design, especially in channel routing. Around 1985 he redirected his research focus to a more theoretical area such as computational geometry and combinatorial optimization. He is currently interested in theory and application-oriented studies such as digital halftoning and image processing.
      Dr. Asano is a Fellow of ACM and a member of IEEE, SIAM, IPSJ, and ORS. He served as a chair of SIG Algorithms in Japan Information Processing Society during 1994-1996. He was Program Chair or Co-Chair of International Symposium on Algorithms and Computation in 1990 and 1996, and Program Committee Member for the ACM Annual Symposium on Computational Geometry in 1989, 1994, and 1997 (and 2005).
      He is a member of the editorial boards of Discrete and Computational Geometry, Computational Geometry: Theory and Applications, International Journal of Computational Geometry and Applications, etc.

      For further information please contact Boris Aronov