Tetsuo Asano Professor
School of Information Science(Department of Information Science・Theoretical Information Science)
■Degrees
B.E., M.E.and Ph.D.from Osaka University (1972,1974,1977)
■Professional Career
Lecturer (1977), Associate Professor (1979), Professor (1988) at Osaka Electro-Communication University,Professor at JAIST (1998), Presidential Advisor at JAIST (1999-2000), Senator at JAIST (2002-2004), Assitant to the president (2008-)
■Specialties
Algorithm and Computational Geometry: theory and applications, Combinatorial Geometry,Combinatorial optimization
■Research Keywords
Algorithm, Computational Geometry, Combinatorial Optimization
■Research Interests
Theoretical Studies: Computational Geometry is one of the fields in theoretical computer science whose goals are to develop efficient algorithms for solving geometric problems and to analyze their computational complexities. I am especially interested in giving mathematical formulation for practical problems to obtain efficient solutions. For practical applications, problems of handling computation errors and degeneracy are important. Robot motion planning which discusses optimal sequence of robot motion from a given starting configuration to a goal configuration is also an interesting topic. Application Studies: My recent activities are concerned with applications of computational geometric techniques to computer vision. The basic idea behind them is a geometric representation of an image by using contour lines. Such a representation enables approaches completely different from conventional ones based on matrix representation of an image. Current hot topics is how to approximate rectilinear contour lines by smooth curves while keeping several basic properties inherent in contour lines. These applications are closely related to digital geometry in which vertices have integer coordinates. Digital halftoning which is a technique to convert a grey image into a binary (black and white) image is also an interesting researchtheme. My theoretical interests are how to generate a binary image that is optimal in the sense that it is most similar to an input image and analyze the computational complexity of the combinatorial optimization problem.
■Publications
◇Books
- Site Consistency in Phylogenetic Networks with Recombination, in Algorithmics in Bioniformatics,Tetsuo Asano, Patricia Evans, Ryuhei Uehara, and Gabriel Valiente,College Publications,2006,15-26
- Handbook on Computational Geometry, Chapter 19: Visibility,J. Sack, edited,Elsevier Science,2000,1027
◇Published Papers
- Constant Working Space Algorithms with Applications,T. Asano,Abstracts of 5th International Conference of Applied Mathematics and Computing,p.I-47,2008/08/12
- Constant Working Space Algorithms with Applications,T. Asano,Abstracts of 5th International Conference of Applied Mathematics and Computing,p.I-47,2008/08/12
- Constant-Working-Space Image Scan with a Given Angle,T. Asano,Proc. 24th European Workshop on Computational Geometry,pp.165−168,2008/03/18
Display All
◇Lectures and Presentations
- Algorithmic Approaches to Digital Halftoning,T. Asano,15th Canadian Conference on Computational Geometry,Halifax, Canada,August 2003
- Similarity between image and terrain: Geometric approaches to computer vision,T. Asano,19th European Workshop on Computational Geometry,Bonn, Germany,March, 2003
- Digital Halftoning: Its Computational Complexity and Approximation Algorithms based on Network Flow,T. Asano, N. Fujikawa, N. Katoh, T. Matsui, H. Nagamochi, K. Obokata, T. Tokuyama,6th Korea-Japan Joint Workshop on Algorihtms and Computation,June 28-29, 2001
Display All
■Extramural Activities
◇Other Activities
- International Conference on Computational Science and Applications,Preliminary Talk,2005/05/09 - 2005/05/12
- ACM Symposium on Computational Geometry,Program committee member (1997)
- Guest Editor of Theory of Computing Systems for a special issue on ISAAC'96 (1997)
Display All
■Academic Awards Received
- Fellow, Information Processing Society of Japan,Information Processing Society of Japan
|