{'fraction_non_alphanumeric': 0.013404825737265416, 'fraction_numerical': 0.0, 'mean_word_length': 5.495652173913044, '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}}
Probabilistic Matrix Completion for Image Phase Retrieval

In this paper we address the Phase Retrieval problem, which aims to recover the phase of the Fourier transform of a signal when only magnitude measurements are available. Following recent developments in Phase Retrieval, the problem can be transformed into a convex semidefinite programming optimization problem, which can be solved using Matrix Completion techniques. In this paper the acquisition process is modeled using a likelihood function, which splits the original problem into two convex optimization problems, and alternates between the solution of each of them. To relate both convex problems we introduce a heuristic, which results in fast convergence of the proposed method.