Iterative generalization of morphological skeleton

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Map Generalization by Skeleton Retraction

Much work has been done in the last few years on various aspects of automated map generalization. However, many of these efforts have been directed to the generalization of individual objects houses, roads, etc. while ignoring the spatial relationships between the objects themselves. This problem is particularly apparent where map generalization includes the simplification of contour lines (whi...

متن کامل

Morphological reduction of skeleton redundancy

In this work we study morphological methods to reduce the amount of redundant points in the Skeleton representation of images. The advantage of removing redundant points using morphological operations only, lies in the computational eeciency of these operations, when implemented on parallel machines. We present a generic approach to obtain redundancy-reduced Skeletons, which yields morphologica...

متن کامل

Skeleton-based morphological coding of binary images

This paper presents new properties of the discrete morphological skeleton representation of binary images, along with a novel coding scheme for lossless binary image compression that is based on these properties. Following a short review of the theoretical background, two sets of new properties of the discrete morphological skeleton representation of binary images are proved. The first one lead...

متن کامل

a generalization of strong causality

در این رساله t_n - علیت قوی تعریف می شود. این رده ها در جدول علیت فضا- زمان بین علیت پایدار و علیت قوی قرار دارند. یک قضیه برای رده بندی آنها ثابت می شود و t_n- علیت قوی با رده های علی کارتر مقایسه می شود. همچنین ثابت می شود که علیت فشرده پایدار از t_n - علیت قوی نتیجه می شود. بعلاوه به بررسی رابطه نظریه دامنه ها با نسبیت عام می پردازیم و ثابت می کنیم که نوع خاصی از فضا- زمان های علی پایدار, ب...

Skeleton Redundancy Reduction Based on a Generalization of Convexity

We present a generalization of the concept of Convex Sets, based on the Morphological Closing operation, and study some of its properties. We also deene Extreme Points of such Generalized Convex Sets, which generalize the notion of Extreme Points of Convex Sets. Moreover, we apply the above notions to skeleton redundancy removal, and present an algorithm for obtaining an Error-Free Skeleton rep...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Electronic Imaging

سال: 2007

ISSN: 1017-9909

DOI: 10.1117/1.2713739