Meeting Agenda

Date:	November 22, 2012
Location:	DC 1331
Time:	11:30
Chair:	Elodie Fourquet

1. Acceptance of the Agenda - additions or deletions

2. Coffee Hour

Coffee hour last week:: Zainab- thanks!
Coffee hour this week:: Volunteers?
Coffee hour next week:: Volunteers?

3. Forthcoming

Date:	November 29, 2012	December 6, 2012	December 13, 2012	December 20, 2012
Location:	DC 1331 11:30	DC 1331 11:30	DC 1331 11:30	DC 1331 11:30
Chair:	Bill Cowan	Tiffany Inglis	Craig Kaplan	Marta Kryven
Technical Presentation:	Zainab AlMeraj	Bill Cowan	Elodie Fourquet	Tiffany Inglis

4. Technical Presentation

Grace Yao	Title : An algorithm which represents objects in a background using discriminative non-orthogonal binary space(DNBS) Abstract: In visual tracking problem, how to represent the object is a crucial problem. This DNBS is a succinct and discriminative representation of the object spanned by Harr-like feature. However, the problem of finding the DNBS bases from an over-complete dictionary is NP-hard. The previous D-OOMP can be done in a greedy way and make it faster. Due to the huge search space, the algorithm is still expensive. At the same time they only care about the foreground with only one template which is not that stable. The DNBS is an efficient, generative and discriminative method. I will explain the original one, the iterative one and the hierarchical one in my tech presentation.

Grace Yao

Title : An algorithm which represents objects in a background using discriminative non-orthogonal binary space(DNBS)
Abstract:
In visual tracking problem, how to represent the object is a crucial problem. This DNBS is a succinct and discriminative representation of the object spanned by Harr-like feature. However, the problem of finding the DNBS bases from an over-complete dictionary is NP-hard. The previous D-OOMP can be done in a greedy way and make it faster. Due to the huge search space, the algorithm is still expensive. At the same time they only care about the foreground with only one template which is not that stable. The DNBS is an efficient, generative and discriminative method. I will explain the original one, the iterative one and the hierarchical one in my tech presentation.

5. Discussion Items

6. Action Items

Papier Mache painting

7. Lab Events

8. Conferences and Special Journal Issues

Recent Additions

VRCAI 2012

Upcoming Deadlines

9. Directors' Meeting

10. Seminars and Events

Friday, Nov. 23, 10 a.m. in DC1316: Master's Thesis Presentation/Software Engineering Research Group: Software Journeys, Adrian Filip.

Friday, Nov. 23, 10:30 a.m. in DC 2585: PhD Defence/Algorithms and Complexity Research Group: Algorithms for Geometric Covering and Piercing Problems, Robert Fraser.

Friday, Nov. 23, 11:30 a.m. in DC 2306C(AI Lab): Artificial Intelligence/Centre for Theoretical Neuroscience: Grid Search is a Bad Hyperparameter Optimization Algorithm, James Bergstra, Postdoctoral researcher, Centre for Theoretical Neuroscience

Friday, November 23, 2:00 p.m. in DC 2585: Algorithms and Complexity Seminar: Computing with Uncertainty Thomas Erlebach, University of Leicester.

Tuesday, Nov. 27, 11:00 a.m. in DC 2310: Master's Essay Presentation/Databases Research Group: Materialized Views for Eventually-Consistent Record Stores, Changjiu Jin.

Tuesday, No.v 27, 1:30 in DC 1304: Symbolic Computation Group PhD Seminar: Computing Column Bases of Polynomial Matrices, Wei Zhou.

Thursday, Nov. 29, 1:00 p.m. in DC 2310: PhD Defence/Computer Graphics Research Group: Perspective in Two Dimensions for Computer Graphics, Elodie Fourquet.

Also see other Math and CS postings.