In this paper the well-known problem of reconstructing hv-convex polyominoes is considered from a set of noisy data. Differently from the usual approach of Binary Tomography, this leads to a probabilistic evaluation in the reconstruction algorithm, where different pixels assume different probabilities to be part of the reconstructed image. An iterative algorithm is then applied, which, starting from a random choice, leads to an explicit reconstruction matching the noisy data
We consider a class of problems of Discrete Tomography which has been deeplyinvestigated in the past...
In this thesis we study the general problem of reconstructing a function, defined on a finite lattic...
This paper uses the theoretical material developed in a previous article by the authors in order to ...
In this paper the well-known problem of reconstructing hv-convex polyominoes is considered from a se...
The aim of this paper is the description of an experiment carried out to verify the robustness of tw...
The reconstruction of discrete two-dimensional pictures from their projections is one of the central...
Several papers in the available literature tackled problems concerning convex polyominoes in discret...
AbstractMany problems of computer-aided tomography, pattern recognition, image processing and data c...
AbstractThe problem of reconstructing a convex polyominoes from its horizontal and vertical projecti...
The method of projection onto convex sets (POCS) is used in signal reconstruction to find a function...
The reconstruction of discrete two-dimensional pictures from their projections is one of the central...
The new field of research of discrete tomography will be described in this paper. It differs from st...
We study the problem of reconstructing hv-convex binary matrices from few projections. We solve a po...
AbstractReconstructing discrete bidimensional sets from their projections is involved in many differ...
Exactly 30 years ago, Attila Kuba published the first paper about the reconstruction of hv-convex bi...
We consider a class of problems of Discrete Tomography which has been deeplyinvestigated in the past...
In this thesis we study the general problem of reconstructing a function, defined on a finite lattic...
This paper uses the theoretical material developed in a previous article by the authors in order to ...
In this paper the well-known problem of reconstructing hv-convex polyominoes is considered from a se...
The aim of this paper is the description of an experiment carried out to verify the robustness of tw...
The reconstruction of discrete two-dimensional pictures from their projections is one of the central...
Several papers in the available literature tackled problems concerning convex polyominoes in discret...
AbstractMany problems of computer-aided tomography, pattern recognition, image processing and data c...
AbstractThe problem of reconstructing a convex polyominoes from its horizontal and vertical projecti...
The method of projection onto convex sets (POCS) is used in signal reconstruction to find a function...
The reconstruction of discrete two-dimensional pictures from their projections is one of the central...
The new field of research of discrete tomography will be described in this paper. It differs from st...
We study the problem of reconstructing hv-convex binary matrices from few projections. We solve a po...
AbstractReconstructing discrete bidimensional sets from their projections is involved in many differ...
Exactly 30 years ago, Attila Kuba published the first paper about the reconstruction of hv-convex bi...
We consider a class of problems of Discrete Tomography which has been deeplyinvestigated in the past...
In this thesis we study the general problem of reconstructing a function, defined on a finite lattic...
This paper uses the theoretical material developed in a previous article by the authors in order to ...