Talbot Room 909.
1130-1230 Smaller visual computing group (staff) – discuss scientific groups and grant support (with regards to recent research away day)
1230-1330 Lunch (larger group also including PGs, RAs and staff)
1330-1430 Rynson W. H. Lau
David George, Deep Learning Driven Active Framework for Segmentation of Large 3D Shape Collections
Mike Edwards, Deep Learning in Irregular Domains
Joss Whittle, Good architecture choices for generative models
Rectangle packing algorithm for tree and graph visualization
Robert Recorde, Monday July 27th at 3pm
Abstract This talk introduces the speaker’s techniques on space-filling tree and network visualization. The former part of the talk introduces a tree visualization technique which represents hierarchy of the tree structure as nested rectangular regions. The latter part of the talk introduces a network visualization technique which clusters nodes according to their categories and connectivity, and then displays the clusters as rectangular regions. Both techniques are based on a rectangle packing algorithm which efficiently places the rectangular regions onto a display space. This talk also introduces several applications of the tree and network visualization techniques.
Biography Professor Takayuki Itoh is a full professor of the department of information sciences in Ochanomizu University, Japan since 2011. His research interest includes visualization, computer graphics, and multimedia. He is a vice director of the society for art and science in Japan, and a track chair of ACM Symposium on Applied Computing, Multimedia and Visualization track.
Takayuki Itoh has received his B.S., M.S., and Ph.D. degrees from Waseda University in 1990, 1992, and 1997, respectively. He has been a researcher at Tokyo Research Laboratory of IBM Japan during 1992 to 2005. He was also a visiting researcher at Carnegie Mellon University in 2000, and Kyoto University during 2003 to 2005. He has been an associate professor in Ochanomizu University since 2005, and a full professor since 2011.
Here’s an upcoming seminar at 2pm in Robert Recorde room, Thursday May 1st.
Much effort has been spent on designing algorithms for the automatic layout of graphs. Typically, the worth of these algorithms has been determined by their computational efficiency and by the extent to which the graph drawings they produce conform to pre-defined “aesthetics” (for example, minimising the number of edge crosses and edge bends, or maximising symmetry).
Prior experimental work has focussed on the extent to which the layout of a graph drawing assists with the comprehension of the embodied relational information. This seminar presents an alternate approach to determining the relative worth of graph layout aesthetics, based on how users create their own graph drawings. The seminar will present the results of both the published research experiments, as well as two follow-up studies.
Dr Helen Purchase is Senior Lecturer in the School of Computing Science at the University of Glasgow. She has worked in the area of empirical studies of graph layout for several years, and also has research interests in visual aesthetics, task-based empirical design, collaborative learning in higher education, and sketch tools for design. She has recently written a book on Empirical methods for HCI research.
A healthy critical attitude: Revisiting the results of a graph drawing study, Journal of Graph Algorithms and Applications, vol. 18, no. 2, pp. 281-311 (2014) DOI: 10.7155/jgaa.00323