Abstract
A scalable parallel algorithm for edge detection and surface reconstruction is presented. The algorithm is based on fitting a weak membrane to the pixel gray values by minimizing the associated energy functional. The edge detection process is modeled as a line process and used as a constraint in minimizing the energy functional of the image. The optimal edge assignment cannot be obtained directly as the energy function is non-convex. Using graduated non-convexity (GNC) approach, the energy is minimized. The proposed parallel algorithm has been implemented on a cluster of workstations using the PVM communication library. The results of parallel implementation on synthetic and natural images are presented. The speedup is observed to be near-linear, thus providing scalability with the problem size. The parallel processing approach presented here can be extended to solve similar problems (e.g., image restoration, and image compression) which use regularization techniques.
| Original language | English |
|---|---|
| Pages | 149-154 |
| Number of pages | 6 |
| State | Published - 1995 |
| Event | Proceedings of the Conference on Computer Architectures for Machine Perception, CAMP'95. - Como, Italy Duration: Sep 18 1995 → Sep 20 1995 |
Conference
| Conference | Proceedings of the Conference on Computer Architectures for Machine Perception, CAMP'95. |
|---|---|
| City | Como, Italy |
| Period | 09/18/95 → 09/20/95 |
Fingerprint
Dive into the research topics of 'Distributed edge detection and surface reconstruction algorithm'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver