Share Email Print

Proceedings Paper

Author(s): Terrance E. Boult; Robert A. Melter; Frank Skorina; Ivan Stojmenovic
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Image processing often involves operations using `neighbor' pixels. This paper combines the usual definition of 4 or 8 connected neighbors with image information to produce local neighbor definitions that are signal dependent. These generalized neighbors, G-neighbors, can be used for a variety of image processing tasks. The paper examines their use for detail preserving smoothing and morphology. The simple/local nature of G-neighbor definitions make them ideal for implementation on low-level pixel parallel hardware. A near real-time parallel implementation of the G-neighbor computation, including G-neighbor-based detail preserving smoothing and G-neighbor morphology, is discussed. The paper also provides a qualitative comparison of G-neighbor-based algorithms to previous work.

Paper Details

Date Published: 1 December 1993
PDF: 14 pages
Proc. SPIE 2060, Vision Geometry II, (1 December 1993); doi: 10.1117/12.165007
Show Author Affiliations
Terrance E. Boult, Columbia Univ. (United States)
Robert A. Melter, Long Island Univ. (United States)
Frank Skorina, Key Technology, Inc. (United States)
Ivan Stojmenovic, Univ. of Ottawa (Canada)

Published in SPIE Proceedings Vol. 2060:
Vision Geometry II
Robert A. Melter; Angela Y. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top