{'fraction_non_alphanumeric': 0.018668831168831168, 'fraction_numerical': 0.003246753246753247, 'mean_word_length': 5.455497382198953, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
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 concurrent propagation algorithm forms and stores in a compact graphical form an entire solution space for an one-dimensional (1D) discrete global optimisation, being ill posed due to a multiplicity of solutions. We discuss possibilities of guiding the selection of a valid solution by structural properties of the solution space. In application to ill-posed computational stereo vision, to match human 3D perception, the regularised solutions should keep boundaries of objects producing partially occluded regions of an observed 3D scene. Experiments with real stereo pairs show that a sizeable part of such boundaries and regions can be detected by analysing the entire solution space.