Towards structural analysis of solution spaces for ill-posed discrete 1D optimisation problems

To obtain a single best-suited solution, an ill-posed global optimisation problem is regularised. Conventional regularisation, that adds to the goal function a weighed smoothing term, is theoretically justified for linear and a number of non-linear ill-posed mathematical problems. But for inverse optical problems in computer vision such regularisation is mostly heuristic and thus guarantee neither unique, nor visually valid solution. Our recent...