Combinatorial Optimization for Computer Vision and Biomedical Image Analysis

计算机视觉和生物医学图像分析的组合优化

• 批准号: RGPIN-2017-04960
• 负责人: Boykov, Yuri
• 金额: $ 6.18万
• 依托单位: University of Waterloo
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2019
• 资助国家: 加拿大
• 起止时间: 2019-01-01 至 2020-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=692311
• 关键词: Combinatorial; Optimization; Computer; Vision; Biomedical

Automatic computer/robot vision for manufacturing, health care, security, and multi-media is a very active area of research, but real data performance is still far from perfect in quality, speed, or both. Due to explosion in availability of ever diverse digital media and computational resources, the number of potential applications grew significantly, but so did the size and complexities of the data. Despite significant progress in the last 10-15 years, the computer vision and biomedical image analysis communities are looking for new algorithms and mathematical models even for basic problems like segmentation, reconstruction, detection. Robustness, computational efficiency, and scalability of algorithms are crucial factors. Efficient optimization methods for high-order regularization constraints in the context large real data with high-dimensional features remain a challenge. ******My approach to computer vision and biomedical image analysis is largely based on discrete models and combinatorial optimization methods. My past research demonstrated many powerful combinatorial algorithms (e.g. graph cut, a-expansion, facility location, etc.) or discrete approximation methods (e.g. based on bound optimization, trust region) computing either globally optimal or provably good solutions for mathematically justified high-order graphical models in a wide range of problems in vision and biomedical imaging. These optimization methods lead to breakthrough results for difficult problems like N-D image segmentation, multi-camera stereo, texture synthesis, motion analysis, object detection/recognition, and thin-structure estimation. ******There are many reasons to continue research in discrete algorithms for regularization, which is my long term goal. Alternative continuous approaches require GPU implementations only to generate running times comparable to discrete methods. They are also not as stable or repeatable explaining lack of publicly available code - in contrast to combinatorial algorithms (with 20-30 daily downloads from my group's web site). Other alternative methodologies lack geometric justification making it impossible to integrate principled structural/topological constraints. The problems I plan to work on in the next five years are related to efficient optimization for high-order priors, structured partially-ordered labeling, curvature-based vessel extraction, regularization constraints for clustering in high-dimensional feature spaces, and integration of principled fast multi-object segmentation techniques with machine learning methodologies for object classification based on kernel SVM and neural networks.

用于制造业、医疗保健、安全和多媒体的自动计算机/机器人视觉是一个非常活跃的研究领域，但实际数据性能在质量、速度或两者兼而有之方面仍远未达到完美。由于各种数字媒体和计算资源的爆炸性增长，潜在应用程序的数量显著增加，但数据的大小和复杂性也随之增加。尽管在过去的10-15年里取得了显著的进步，但计算机视觉和生物医学图像分析领域正在寻找新的算法和数学模型，即使是对于分割、重建、检测等基本问题也是如此。算法的健壮性、计算效率和可扩展性是至关重要的因素。在具有高维特征的海量真实数据背景下，高效的高阶正则化约束优化方法仍然是一个挑战。我对计算机视觉和生物医学图像分析的方法主要是基于离散模型和组合优化方法。我过去的研究展示了许多强大的组合算法(例如图割、a-扩展、设施选址等)。或离散近似方法(例如，基于边界优化、信赖域)，为视觉和生物医学成像中的广泛问题中的数学证明合理的高阶图形模型计算全局最优或可证明良好的解。这些优化方法在N-D图像分割、多摄像机立体、纹理合成、运动分析、目标检测/识别和薄结构估计等难题上取得了突破性的结果。*有很多理由继续研究正则化的离散算法，这是我的长期目标。替代的连续方法只需要GPU实现来产生与离散方法相当的运行时间。它们也不那么稳定或可重复地解释缺乏公开可用的代码-与组合算法(每天从我的团队的网站下载20-30次)形成对比。其他替代方法缺乏几何合理性，因此无法集成原则性的结构/拓扑约束。我计划在未来五年内研究的问题涉及高阶先验的有效优化、结构化偏序标记、基于曲率的血管提取、高维特征空间中聚类的正则化约束以及基于核支持向量机和神经网络的对象分类的机器学习方法与原则性快速多对象分割技术的集成。