Grant: Discovery Grants Program - Individual
University of Toronto
$48,000.00
Affinity propagation: theory and practice
EF 2012-13
Résumé
A fundamental problem in data analysis and robotic vision involves organizing pieces of data or parts of images in such a way that they can be properly interpreted. For example, to detect an object that a robot on Mars must avoid, the object must be automatically detected in the image by the robot controller. As another example, to screen large numbers of medical images for tumours or other diseased tissues, the tissue of interest should be automatically detected in the image by a computer analyzing large numbers of such images. In this proposal, we will study a new computer algorithm called ""affinity propagation"", which was introduced in the February of 2007 issue of Science, and which shows promise in a variety of areas of data analysis and computer/robotic vision. Because affinity propagation is so new, little is know about why it works so well and how it can be modified to address application-specific issues. In this project, we will extend our theoretical understanding of affinity propagation, and investigate how it can be applied to the important problem of detecting and recognizing objects in scenes. We anticipate that this work will impact a variety of areas of science and engineering.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
217657-2008
Name nom
Frey, Brendan
Department département
Electrical & Computer Engineering
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2008
Award amount
48000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2805
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Learning and inference theories
Research subject fr
Théories de l'apprentissage et l'inférence
Partie
5
Nb partie
5
Application title
Affinity propagation: theory and practice
Keyword
NSERC
Application summary
A fundamental problem in data analysis and robotic vision involves organizing pieces of data or parts of images in such a way that they can be properly interpreted. For example, to detect an object that a robot on Mars must avoid, the object must be automatically detected in the image by the robot controller. As another example, to screen large numbers of medical images for tumours or other diseased tissues, the tissue of interest should be automatically detected in the image by a computer analyzing large numbers of such images. In this proposal, we will study a new computer algorithm called ""affinity propagation"", which was introduced in the February of 2007 issue of Science, and which shows promise in a variety of areas of data analysis and computer/robotic vision. Because affinity propagation is so new, little is know about why it works so well and how it can be modified to address application-specific issues. In this project, we will extend our theoretical understanding of affinity propagation, and investigate how it can be applied to the important problem of detecting and recognizing objects in scenes. We anticipate that this work will impact a variety of areas of science and engineering.