MEETING-DATE:July 14, 2011
MEETING-LOCATION:DC 1331
MEETING-TIME:11:30
MEETING-CHAIR:Philippe Lamoureux
MEETING-CHAIRPIC:philippe-bright.jpg
COFFEE-HOUR-LAST-WEEK:Ben?
COFFEE-HOUR-THIS-WEEK:Xinling
COFFEE-HOUR-NEXT-WEEK:Volunteers?
FORTH-DATE1:July 21, 2011
FORTH-DATE2:July 28, 2011
FORTH-DATE3:August 4, 2011
FORTH-DATE4:August 11, 2011
FORTH-LOCATION1:DC 1331 11:30
FORTH-LOCATION2:DC 1331 11:30
FORTH-LOCATION3:DC 1331 11:30
FORTH-LOCATION4:DC 1331 11:30
FORTH-CHAIR1:Ed Lank 
FORTH-CHAIR2:Stephen Mann
FORTH-CHAIR3:Matthew McPerrin
FORTH-CHAIR4:Matei Negulescu
FORTH-CHAIRPIC1:ed.jpg
FORTH-CHAIRPIC2:smann.jpg
FORTH-CHAIRPIC3:noface3.jpg
FORTH-CHAIRPIC4:matei.png
FORTH-TP1:Craig Kaplan
FORTH-TP2:Ben Lafreniere
FORTH-TP3:Philippe Lamoureux
FORTH-TP4:Ed Lank
FORTH-TPPIC1:craig.jpg
FORTH-TPPIC2:ben.jpg
FORTH-TPPIC3:philippe-bright.jpg
FORTH-TPPIC4:ed.jpg
TPNAME:Tiffany Inglis
TPTITLE:Generating Op Art Lines
TPABSTRACT:A common technique in Op Art is the use of parallel lines to depict simple shapes such as circles and squares. Some artists have attempted to create more complex images using this technique but faced the problem of producing undesirable artifacts such as line breaks and T-junctions within their artworks. To this end, we developed a novel algorithm that takes an arbitrary image and automatically generates the corresponding Op Art composition of this style. For 2-colour images, the algorithm produces artworks without any unwanted artifacts; for images with more colours, the basic algorithm cannot guarantee the removal of all artifacts, but we use a global optimization technique to minimize the number of artifacts. The results have applications in graphics design, data visualization, puzzle creation and line drawings.
TPPIC:tiffany.jpg
DIONE:
DITWO:
DITHREE:
DIFOUR:
AIONE:Putting posters and listing publications in the CGL webpage.
AITWO:
AITHREE:
AIFOUR:
DMONE:
DMTWO:
DMTHREE:
DMFOUR:
SEMINARS:<dl><nl><nl><dt>2011 Jul 15, 11:30 </dt><nl><dd>Artificial Intelligence Lab PhD Seminar<br><nl>Ruth Urner, PhD Candidate, Cheriton School of Computer Science, Univ of Waterloo<br><nl>Access to Unlabeled Data can Speed up Prediction Time</dd><nl><nl><dt>2011 Jul 26, 14:00</dt><nl><dd>Cryptography, Security, and Privacy (CrySP) Group Talk<br><nl>Jean-Pierre Hubaux, EPFL<br><nl>Two Short Talks about the Security of Web Applications</dd><nl><nl><dt>2011 Aug 02, 09:00</dt><nl><dd>Artificial Intelligence Lab PhD Thesis Defence<br><nl>Gregory Hines, PhD candidate, David R. Cheriton School of Comp. Sci., Univ. Waterloo<br><nl>A Study in Preference Elicitation Under Uncertainty</dd><nl></dl><nl><nl><dl><nl><dt>Thursday, 14 July 2011, 3:30PM</dt><nl><dd>Pure Mathematics (Computability Learning), MC 5046<br><nl>Barbara Csima<br><nl>Degrees of Categoricity and the Hyperarithmetic Hierarchy - The Conclusion </dd><nl> <nl><dt>Friday, 15 July 2011, 3:30PM</dt><nl><dd>Pure Mathematics (Analysis Seminar), MC 5136 <br><nl>Aaron Tikuisis<br><nl>The Cuntz semigroup and its role in classification</dd> <nl> <nl><dt>Friday, 15 July 2011, 3:30PM</dt><nl><dd>Combinatorics and Optimization (Tutte Seminar), MC 5158 <nl>Maurice Cheung<br><nl>A Primal-Dual Approximation Algorithm for Min-Sum Single Machine Scheduling Problems</dd><nl></dl>