We prove two small results on the reconstruction of binary matrices from their absorbed projections: (1) If the absorption constant is the positive root of x 2 + x – 1 = 0, then every row is uniquely determined by its left and right projections. (2) If the absorption constant is the root of x 4 – x 3 – x 2 – x + 1 = 0 with 0 <x <1, then in general a row is not uniquely determined by its left and right projections.
|Title of host publication||Discrete Geometry for Computer Imagery (Proceedings 12th International Conference, DGCI, Poitiers, France, April 13-15, 2005)|
|Editors||E. Andres, G. Damiand, P. Lienhardt|
|Place of Publication||Berlin|
|Publication status||Published - 2005|
|Name||Lecture Notes in Computer Science|