An inverse problem for the collapsing sum
From MaRDI portal
Abstract: Gaussian filters have applications in a variety of areas in computer science, from computer vision to speech recognition. The collapsing sum is a matrix operator that was recently introduced to study Gaussian filters combinatorially. In this paper, we view the collapsing sum from a discrete tomographical perspective and examine the recoverability of its preimages as a matrix completion problem. Using bipartite graphs, we derive a necessary and sufficient condition for a partial matrix to be extended to a preimage of a given matrix.
Recommendations
- The inverse problem on subset sums
- On the simplest inverse problem for sums of sets in several dimensions
- Some inverse problems in zero-sum theory
- An Invariance Problem in Summability
- Inverse problems associated with subsequence sums in \(C_p \oplus C_p\)
- A note on the inverse problems associated with subsequence sums
- scientific article; zbMATH DE number 6272434
- Some inverse results of sumsets
- Inverse zero-sum problems
- Inverse Theorems for Subset Sums
Cites work
- A theorem on flows in networks
- Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
- An algebraic framework for discrete tomography: revealing the structure of dependencies
- Binary matrices under the microscope: A tomographical problem
- Combinatorial Properties of Matrices of Zeros and Ones
- Discrete tomography. Foundations, algorithms, and applications
- Homogeneous subsets of Z^2 and plane tilings
- Matrix completion problems
- Perspectives of Monge properties in optimization
- Scanning integer matrices by means of two rectangular windows
- Theory Is Forever
This page was built for publication: An inverse problem for the collapsing sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4990115)
