Skip to content. Skip to navigation
McGill Home SOCS Home
Personal tools
You are here: Home Announcements and Events Seminars Seminar History

Seminar Home
Fall 2014 Schedule
Winter 2015 Schedule
Summer 2015 Schedule
Archives

Date
( Winter 2011 )
Category Seminar Info
2011/03/02 Vision, Graphics, and Robotics Place: ENGMC 437
Time: 13:30 - 14:30
Speaker: Shailendra Mathur
Affiliation: Avid Technology
Area: vision and graphics
Title: Stereo 3D Productions and Headaches
Abstract: Due to the proliferation of affordable and flexible digital capture, production and, display technologies, Stereo 3D (S3D) movie-making has seen a resurgence in the recent years. The ability to capture and display S3D media lets film makers expand the perceptual space they can tap into for expressing their creative intent. The same media if not properly produced can also create havoc on the audience with eye strain and visual perceptual conflict. In addition to traditional film making techniques, a good understanding of the art and science of S3D production techniques and human visual perception capabilities becomes critical to make the most effective use of the medium. This talk will focus on some of the key aspects of this art and science. Using examples, some common problems of S3D productions will be shown, together with the techniques for solving them. Biography of Speaker:

Shailendra Mathur is the Director - Chief Architect of Professional Editing Applications at Avid Technology. Avid is an Oscar, Emmy and Grammy award winning company that creates the digital audio and video technology used to make feature films, music recordings, television shows, live concert tours and news broadcasts, to music and movies made at home. In the late 80’s and early 90’s Shailendra wandered the hallowed hallways of the McGill engineering building and CIM where he obtained his Bachelors and Master’s degree. His research and engineering interests have led to publications and patents in the area of computer vision, medical imaging, visual effects, graphics and media processing architectures.


2011/02/25 CQIL - Cryptography and Quantum Information Place: McConnell 103
Time: 10:00 - 11:00
Speaker: Jan Florjanczyk
Affiliation: McGill University
Area: Quantum information
Title: The locking-decoding frontier for generic dynamics
Abstract: It is natural in physics to measure the “correlation” between two quantum physical systems using the correlation between the outcomes of measurements on those two systems. However the maximum correlation between measurement outcomes can still drastically underestimate the quantum correlations present. We quantify the distinction between classical and quantum correlations by demonstrating that after removing a logarithmic-sized quantum system from one half of a pair of perfectly correlated bitstrings, even the most sensitive pair of measurements might only yield outcomes essentially independent of each other. In another sense, we demonstrate that the classical mutual information can be arbitrarily small for a receiver decoding the logarithmically incomplete bitstring, a setting known as locking. However, we also show that with access to the complete quantum system, the receiver can decode the bitstring nearly perfectly. We thus call the logarithmic-sized region between the two settings the "locking-decoding frontier". Moreover, we find that this locking property is generic, in the sense that it occurs when removing a random subsystem. As such, the effect might be relevant to statistical mechanics or black hole physics. We assume only a min-entropy bound on the message and also explore the effect of entanglement on the width of the frontier.
2011/02/23 Theory Place: MC320
Time: 14:30 - 16:00
Speaker: Marc Kaplan
Affiliation: University of Montreal
Area: theory
Title: Quantum one-way communication is exponentially stronger than classical communication
Abstract: Continued from last week, Marc will give the last of two talks on the paper by Klartag and Regev: "Quantum one-way communication is exponentially stronger than classical communication". This talk will be devoted to proving the main lemma.
2011/02/22 CQIL - Cryptography and Quantum Information Place: McConnell Engineering 103
Time: 2:30p - 4:00p
Speaker: Graeme Smith
Affiliation: IBM - TJ Watson Research Center
Area: quantum information theory
Title: Realistic zero-capacity channels for quantum communication
Abstract: While quantum information theory is typically studied in the finite-dimensional regime, many real-world physical channels are best described in terms of continuous variables. The simplest such channels are Gaussian bosonic channels, which result from a quadratic unitary interaction between bosonic transmission modes and an inaccessible environment in the vacuum state. This class includes good approximations of most realistic optical channels. I'll review the theory of quantum information for continuous variables, then show that the set of bosonic Gaussian channels is sufficently rich to allow superactivation: there are pairs of channels, neither of which can transmit quantum information on its own, that can nevertheless be used together for reliable quantum communication. I'll discuss the potential for exhibiting this effect in the lab or, better yet, finding it "in the wild". Biography of Speaker:

Graeme Smith is a Research Staff Member in the Physics of Information group at IBM's TJ Watson Research Center. He was previously a postdoc at IBM and at the University of Bristol. Graeme got his Ph.D. in physics at Caltech as a member of the Institute for Quantum Information, and was an undergraduate at the University of Toronto.


2011/02/16 Theory Place: MC320
Time: 14:30 - 16:00
Speaker: Marc Kaplan
Affiliation: University de Montreal
Area: complexity theory
Title: Quantum one-way communication is exponentially stronger than classical communication
Abstract: Starting this week, Marc will give a series of two talks on the paper by Klartag and Regev: "Quantum one-way communication is exponentially stronger than classical communication". In the first talk, he will present the following: - The history of the problem, - Some technical background, - The quantum and classical upper bound, - A reduction of the problem to a lemma about the size of intersection of random sets on the hypersphere with equators. The second lecture will be devoted to proving the lemma.
2011/02/11 Faculty Candidate Talk Place: MC437
Time: 10:00 - 11:00
Speaker: Wenbo He
Affiliation: Department of Electrical Engineering, University of Nebraska-Lincoln
Area: Participatory Sensing
Title: Privacy-preserving Information Collection in Participatory Sensing
Abstract: The emerging applications in participatory sensing rely on individuals to share local and personal data with others to produce aggregated models and knowledge. In this setting, privacy is an important consideration, and lack of privacy could discourage widespread adoption of many exciting applications. In participatory sensing applications, multidimensional data, such as vectors of attributes that include location and time fields, provide the right perspective to understand the model of the sensed environment. In this talk, I will present a privacy-preserving participatory sensing scheme for multidimensional data, which uses negative surveys. When reporting data, the individual node (participant) randomly selects a value from the set complement of the data values, one such value for each dimension, and sends the vector of negative values to the information collection server. Hence, the server can reconstruct the histograms and probability density functions of the original distributions of sensed values, without reconstructing the individual data items. The reconstruction error decreases as the population of participants increases. I will also show that when applying the privacy preserving technique for multi- dimensional data to single dimensional continuous data, we can achieve better performance. Biography of Speaker:

Wenbo He is currently an Assistant Professor in Department of Electrical Engineering at University of Nebraska-Lincoln. Before that she was an Assistant Professor in the Department of Computer Science at the University of New Mexico. Her research focuses on Pervasive Computing, and Privacy-preserving Techniques, etc. Wenbo got Ph.D. from UIUC in 2008, and she got M.S. from ECE Department at UIUC and M.Eng. from the Department of Automation at Tsinghua University, in 2000 and 1998 respectively. She received her B.S. from the Department of Automation at the Harbin Engineering University in 1995. During August 2000 to January 2005, Wenbo was a software engineer in Cisco Systems, Inc. Wenbo received the Mavis Memorial Fund Scholarship Award from College of Engineering at UIUC in 2006, and the C. W. Gear Outstanding Graduate Award in 2007 from the Department of Computer Science at UIUC. She is also a recipient of the Vodafone Fellowship from 2005 to 2008, and the NSF TRUST Fellowship in 2007.


2011/02/09 Theory Place: MC320
Time: 14:30 - 16:00
Speaker: Omar Fawzi
Affiliation: McGill
Area: complexity theory
Title: communication lower bound for hidden matching problem
Abstract: This is the third in a series of seminars. In this talk Omar will finish the proof of the communication lower bound for the hidden matching problem that was introduced in the first lecture.
2011/02/02 Theory Place: MC320
Time: 14:30 - 16:00
Speaker: Anil Ada
Affiliation: McGill
Area: complexity theory
Title: hypercontractive inequality
Abstract: - Introduction to Fourier analysis over the boolean cube. - Statement of the hypercontractive inequality and viewing it as a generalization of Hoeffding/Chernoff bound to higher degree polynomials. - Proof of a special case of the hypercontractive inequality (which is enough for most applications). Biography of Speaker:

PhD student


2011/02/02 Vision, Graphics, and Robotics Place: MC437
Time: 13:30 - 14:30
Speaker: Derek Nowrouzezahrai
Affiliation: Disney Research, Zurich
Area: Computer Graphics
Title: Rendering: an Artist's Nightmare (and a Researcher's Dream)
Abstract: This talk will begin with a brief discussion of rendering at a high-level, including where it fits in the bigger picture of the CG pipeline. Those unfamiliar to the area will be given a quick tour of the field, as well as the diverse mathematical and computational approaches used to solve different rendering problems. Moreover, this talk will discuss how seemingly unrelated areas of computer science influence the process of generating realistic images. I will motivate and elaborate on several of my own solutions to real-time and realistic rendering problems, and why I believe that rendering is poised to change the way digital artists generate content for the next generation of feature films and interactive entertainment productions. I argue that the caliber of generated content is dependent on the ability to manipulate it interactively, and that future rendering systems will allow the quality of this imagery to grow significantly. Biography of Speaker:

Derek a Post-doctoral researcher at Disney Research Zurich working on realistic and artistic image synthesis. He completed his Ph.D in the Dynamic Graphics Project lab at the University of Toronto in September 2010 under the supervision of Dr. Eugene Fiume. His research interests are realistic image synthesis, high-performance rendering using commodity graphics hardware, non photo-realistic rendering, real-time fluid simulation and animation, geometry processing, and computer vision.


2011/01/20 Vision, Graphics, and Robotics Place: ENGMC 437
Time: 15:00 - 16:00
Speaker: Sam Hasinoff
Affiliation: Toyota Technological Institute at Chicago
Area: Computational Photography
Title: Rich Photography on a Budget
Abstract: Computation is playing an increasingly central role in how we capture and process our images, opening up richer forms of imaging that go beyond conventional photography. Recent examples of rich photography involve merging multiple shots to obtain seamless panoramas, 3D shape, deeper focus, or a wider range of tones. In this talk, I will argue that the future of photography lies in richer capture, paying special attention to our limited budget of light, time, and sensor throughput. By analyzing tradeoffs and limits in imaging, we can develop ways to enrich photography making efficient use of our cameras. First, I will address the basic problem of capturing an in-focus image in a fixed time budget. As our analysis shows, the number of shots captured is a crucial determinant of quality, and taking this into account places the conventional camera in a surprisingly favorable light. Second, I will describe how existing cameras can be used more efficiently to capture scenes with a wide range of tones. By adjusting the camera's amplifier as well as its shutter speed, we can achieve up to 10x noise reduction in the darkest parts of the scene. As both of these projects show, a deeper understanding of imaging can lead to significant gains over the state-of-the-art. Biography of Speaker:

Sam Hasinoff is a Research Assistant Professor at the Toyota Technological Institute at Chicago (TTI-C), a philanthropically endowed academic institute on the campus of the University of Chicago. From 2008-2010, he was a postdoctoral fellow at the Massachusetts Institute of Technology, supported in part by the National Sciences and Engineering Research Council of Canada. He received the BSc degree in computer science from the University of British Columbia in 2000, and the MSc and PhD degrees in computer science from the University of Toronto in 2002 and 2008, respectively. In 2006, he received an honorable mention for the Longuet-Higgins Best Paper Award at the European Conference on Computer Vision. He is the recipient of the Alain Fournier Award for the top Canadian dissertation in computer graphics in 2008.