Reconstruction of planar boundaries from incomplete information
β Scribed by Hemraj Nair
- Publisher
- Elsevier Science
- Year
- 1987
- Weight
- 26 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0734-189X
No coin nor oath required. For personal study only.
β¦ Synopsis
In many applications such as machine vision and object identification, boundaries of objects are used for recognition purposes. Very often, due to poor edge detection, boundary detection, or very low signal-to-noise ratio, some portion of the boundary may be missing. In this short note we present a technique based on the Gerchberg-Papoulis algorithm to till in the missing portions of the boundary. The algorithm works reasonably well even if only 50% of the boundary data is present.
π SIMILAR VOLUMES
We reconstruct a two-dimensional obstacle D from knowledge of its Dirichletto-Neumann map on the boundary of a domain enclosing D. To do so, we first prove existence and uniqueness of exponentially growing solutions to an exterior problem which is of independent interest.
This article discusses the reverse engineering problem of reconstructing objects with planar faces. We will present the main geometric features of a modeling system which are the detection of planar faces and the generation of a cad model. The algorithms are applied to the problem of reconstruction
A new representation of signals by sign information alone is derived. This representation is based on the fact that the si~qn information in the frequency domain is directly related to the zero distribution of the z-transform of the signal. Algorithms to reconstruct signals from sign information alo
Tomographic techniques are used for the investigation of complex flow fields by means of deflectometric methods. In this experiment, a modified algebraic reconstruction technique (ART) was applied to moire Β΄deflection tomography. The algorithm was derived from the basic deflection formula and the de