Carl Olsson
Titel
Bitr lektor
Organisation
046-2228565
Carl [dot] Olsson [at] math [dot] lth [dot] se
Publikationer (hämtat ur Lunds universitets publikationsdatabas)
författare
- 2013
- 2012
- 2011
- 2010
- 2009
- A Convex Approach to Low Rank Matrix Approximation with Missing Data
- Branch-and-Bound Methods for Euclidean Registration Problems.
- Extending Continuous Cuts: Anisotropic Metrics and Expansion Moves
- Global Optimization in Computer Vision: Convexity, Cuts and Approximation Algorithms
- Globally Optimal Least Squares Solutions for Quasiconvex 1D Vision Problems
- Projective Least-Squares: Global Solutions with Local Optimization
- 2008
- 2007
- An L-infinity Approach to Structure and Motion Problems in 1D-Vision
- Efficient Optimization for L-infinity Problems using Pseudoconvexity
- Efficiently Solving the Fractional Trust Region Problem
- Global optimization and approximation algorithms in computer vision
- Image segmentation with context
- Normalized Cuts Revisited: A Reformulation for Segmentation with Linear Grouping Constraints
- Solving large scale binary quadratic problems: Spectral methods vs. Semidefinite programming
- 2006
