Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Western Ontario

$42,000.00

Combinatorial Optimization Methods for Computer Vision and Bio-medical Image Analysis

EF 2012-13

Résumé
Automatic computer/robot vision for manufacturing, health care, security, and multi-media is still largely ""work in progress"" and relatively few methods produce consistently reliable results on real data. Sheer size of high-resolution volumetric images in stereo-vision, motion analysis, computer-assisted diagnosis (e.g. MRI, CT), and other applications demands very high level of efficiency from computer vision algorithms. Despite significant progress in the last 10-20 years, the vision community is still widely researching new theories and mathematical concepts that could lead to computationally feasible methods for image segmentation, shape representation, model fitting, stereo, and many other low-level problems forming the base for all computer vision systems. My research concentrates on practical computationally-efficient and mathematically solid models for low-level vision. This topic offers an exciting ground for creative interdisciplinary research linking optimization, statistical physics, information theory, learning, applied differential geometry, and other mathematical sciences. Most low-level vision problems can be formulated as optimization problems using either information-based methodology (e.g. minimum description length principle), or concepts from statistical physics (e.g. posterior energy), or differential geometry (minimum surface). The focus of my proposed research are mathematically solid models in low-level vision and the corresponding fast optimization methods computing either their global minimum or some guaranteed-quality approximation. Such optimization problems are a challenge for the state of the art in discrete combinatorial algorithms and continuous variational techniques. Firstly, it was shown that many problems in vision are intrinsically difficult (NP-hard), thus effective approximations must be explored. Secondly, computational efficiency and scalability of the proposed optimization algorithms is crucial when a solution is sought on huge 3D or 4D image volumes common in vision and medical imaging.
Programme
Discovery Grants Program - Individual
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
298299-2012
Name nom
Boykov, Yuri
Department département
Computer Science
Organization id
36
Institution établissement
University of Western Ontario
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2012
Award amount
42000
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
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
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
2605
Research subject group en
Robotics
Research subject group fr
Robotique
Research subject en
Pattern analysis and machine intelligence
Research subject fr
Analyse de formes et intelligence artificielle
Partie
1
Nb partie
5
Application title
Combinatorial Optimization Methods for Computer Vision and Bio-medical Image Analysis
Keyword
NSERC
Application summary
Automatic computer/robot vision for manufacturing, health care, security, and multi-media is still largely ""work in progress"" and relatively few methods produce consistently reliable results on real data. Sheer size of high-resolution volumetric images in stereo-vision, motion analysis, computer-assisted diagnosis (e.g. MRI, CT), and other applications demands very high level of efficiency from computer vision algorithms. Despite significant progress in the last 10-20 years, the vision community is still widely researching new theories and mathematical concepts that could lead to computationally feasible methods for image segmentation, shape representation, model fitting, stereo, and many other low-level problems forming the base for all computer vision systems. My research concentrates on practical computationally-efficient and mathematically solid models for low-level vision. This topic offers an exciting ground for creative interdisciplinary research linking optimization, statistical physics, information theory, learning, applied differential geometry, and other mathematical sciences. Most low-level vision problems can be formulated as optimization problems using either information-based methodology (e.g. minimum description length principle), or concepts from statistical physics (e.g. posterior energy), or differential geometry (minimum surface). The focus of my proposed research are mathematically solid models in low-level vision and the corresponding fast optimization methods computing either their global minimum or some guaranteed-quality approximation. Such optimization problems are a challenge for the state of the art in discrete combinatorial algorithms and continuous variational techniques. Firstly, it was shown that many problems in vision are intrinsically difficult (NP-hard), thus effective approximations must be explored. Secondly, computational efficiency and scalability of the proposed optimization algorithms is crucial when a solution is sought on huge 3D or 4D image volumes common in vision and medical imaging.