Dataset: "Efficient Global Minimization Methods for Sparsity and Regularity Promoting Optimization Problems in Imaging and Vision, 2014"

Abstract

The main goals of “Efficient Global Minimization Methods for Sparsity and Regularity Promoting Optimization Problems in Imaging and Vision, 2014” are design and analysis of regularity/sparsity promoting energy minimization models in image processing, computer vision and compressed sensing, and design and analysis of efficient numerical methods that can produce global or nearly global solutions of the resulting optimization problems. Imaging and vision are some of the core emerging technologies that are shaping our society. This can partly be explained by progressively better physical sensing devices for acquiring image data. Another important reason is the development of image processing and computer vision software for restoring, analyzing, simplifying and interpreting the image information. Energy minimization has been established as one of the most important paradigms for formulating problems in image processing and computer vision in a mathematical language. The problems can elegantly be formulated as finding the minimal state of some energy potential, which typically encodes the underlying assumption that the image data is regular/sparse, i.e. values at different image pixels are correlated. More recently, it has been realized that the expensive acquisition process can be greatly improved by incorporating the same assumption in an energy minimization framework, a field known as compressed sensing. A major challenge is to solve the resulting optimization problems efficiently. The most desirable models are often the most difficult to handle from an optimization perspective. Continuous optimization problems may be non-convex and contain many inferior local minima. Discrete optimization problems may be NP-hard, which means an algorithm is unlikely to exist which can always compute an exact solution without an unreasonable amount of effort. Even though the underlying problems are NP-hard, computational methods will be constructed that produce global solutions for practical input data, and otherwise close approximations.

The data are presented in various articles.

Variable Groups

Full Title

"Efficient Global Minimization Methods for Sparsity and Regularity Promoting Optimization Problems in Imaging and Vision, 2014"

Identification Number

NSD2253

Authoring Entity

Name Affiliation
Bae, Egil Department of Mathematics, University of Bergen

Producer

Name Affiliation Abbreviation Role
Bae, Egil Department of Mathematics, University of Bergen UiB Principal Investigator

Copyright

Copyright (C) 2015 Egil Bae, Department of Mathematics, UiB

Funding Agency/Sponsor

Name Abbreviation Role Grant
The Research Council of Norway RCN 214889

Data Distributor

Name Affiliation Abbreviation
NSD - Norwegian Centre for Research Data NSD

Version

Date: 2015-11-15

Notes

Original data from Egil Bae, Department of Mathematics, UiB are documented and prepared, first NSD-version.

Bibliographic Citation

"Efficient Global Minimization Methods for Sparsity and Regularity Promoting Optimization Problems in Imaging and Vision, 2014". Data collected by Egil Bae, Department of Mathematics, UiB. First  NSD edition, Bergen 2015.

List of Keywords

Topic Classification

Science and technology

Time Period Covered

Start End Cycle
2012-12-31 2014-12-31

Date of Collection

Start End Cycle
2012-12-31 2014-12-31

Country

Norway  (NO)

Geographic Coverage

Country

Unit of Analysis

Other

Kind of Data

Other

Time Method

Cross-sectional survey

Data Collector

Bae, Egil, Department of Mathematics, University of Bergen  (UiB)

Mode of Data Collection

Other

Location

Availability Status

The data are presented in various articles.

Related Publications

A Fast Continuous Max-Flow Approach to Non-convex Multi-labeling Problems

Bae E., Yuan J., Tai X.C., Boykov Y. (2014) A Fast Continuous Max-Flow Approach to Non-convex Multi-labeling Problems. In Efficient Algorithms for Global Optimization Methods in Computer Vision (pp. 134-154). Springer Berlin Heidelberg, Heidelberg.

A simple boundary reinforcement technique for segmentation without prior

Duggana N., Bae E., Jonesa E., Glavina M., Veseb L. (2014) A simple boundary reinforcement technique for segmentation without prior. Pattern Recognition Letters, 46, 27-35.

A spatially continuous max-flow and min-cut framework for binary labeling problems

Yuan J.,  Bae E., Tai X.C., Boykov Y. (2014) A spatially continuous max-flow and min-cut framework for binary labeling problems. Numerische Mathematik, 126(3), 559-587.

A Technique for Lung Nodule Candidate Detection in CT Using Global Minimization Methods

Duggan N., Bae E., Shen S., Hsu W., Bui A., Jones E., Glavin M., Vese L. (2015) A Technique for Lung Nodule Candidate Detection in CT Using Global Minimization Methods. In Energy Minimization Methods in Computer Vision and Pattern Recognition (pp. 478-491). Springer International Publishing, Switzerland.

Convex Relaxations for a Generalized Chan-Vese Model

Bae E., Lellmann J., Tai X.C. (2013) Convex Relaxations for a Generalized Chan-Vese Model. In Energy Minimization Methods in Computer Vision and Pattern Recognition (pp. 223-236). Springer Berlin Heidelberg, Heidelberg.

Efficient Global Minimization Methods for Image Segmentation Models with Four Regions

Bae E., Tai X.C. (2015) Efficient Global Minimization Methods for Image Segmentation Models with Four Regions. Journal of Mathematical Imaging and Vision, 51(1), 71-97.

Global Binary Optimization on Graphs for Classification of High-Dimensional Data

Merkurjev E., Bae E., Bertozzi A.L., Tai X.C. (2015) Global Binary Optimization on Graphs for Classification of High-Dimensional Data. Journal of Mathematical Imaging and Vision, 52(3), 414-435.

Maximizing Flows with Message-Passing: Computing Spatially Continuous Min-Cuts

Bae E., Tai X.C., Yuan J. (2015) Maximizing Flows with Message-Passing: Computing Spatially Continuous Min-Cuts. In Energy Minimization Methods in Computer Vision and Pattern Recognition (pp. 15-28). Springer International Publishing, Switzerland.

Reconstructing Open Surfaces via Graph-Cuts

Wan M., Wang Y., Bae, E., Tai X.C., Wang D. (2013)  Reconstructing Open Surfaces via Graph-Cuts. Visualization and Computer Graphics, IEEE Transactions on, 19(2), 306-318.

Simultaneous Convex Optimization of Regions and Region Parameters in Image Segmentation Models

Bae, E., Yuan J., Tai X.C. (2013) Simultaneous Convex Optimization of Regions and Region Parameters in Image Segmentation Models. In Innovations for Shape Analysis (pp. 421-438). Springer Berlin Heidelberg, Heidelberg.

Variational Time-Implicit Multiphase Level-Sets

Rajchl M., Baxter J.S.H., Bae E., Tai X.C., Fenster A., Peters T.M., Yuan J. (2015) Variational Time-Implicit Multiphase Level-Sets. In Energy Minimization Methods in Computer Vision and Pattern Recognition (pp. 278-291). Springer International Publishing, Switzerland.

Metadata Index

This is the Metadata Index for a Nesstar Server.
Nesstar is a tool used for analysing, visualising and downloading datasets.

Click the "Explore Dataset" button to open the dataset.