An Efficient Algorithm for 3d Binary Morphological Transformations with 3d Structuring Elements of Arbitrary Size and Shape

نویسندگان

  • Nikos Nikopoulos
  • Ioannis Pitas
چکیده

This paper proposes a fast algorithm for implementing the basic operation of Minkowski addition for the special case of binary three-dimensional images, using three-dimensional structuring elements of arbitrary size and shape. The application of the proposed algorithm for all the other morphological transformations is straightforward, as they can all be expressed in terms of Minkowski addition. The efficiency of the algorithm is analysed and some experimental results of its application are presented. As shown, the efficiency of the algorithm increases with the size of the structuring element .

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

ثبت نام

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

منابع مشابه

3 D Binary Fast Morphological

In this paper the use of a fast algorithm for implementing shape decomposition of 3D binary objects is proposed. Shape decomposition is performed by successive 3D erosions and dilations, using 3D structuring elements of arbitrary size and shape. The proposed fast shape decomposition algorithm is based on a fast implementation of the basic morphological operation of Minkowski addition for the sp...

متن کامل

Generalized Morphological 3D Shape Decomposition Grayscale Interframe Interpolation Method

One of the main image representations in Mathematical Morphology is the 3D Shape Decomposition Representation, useful for Image Compression and Representation, and Pattern Recognition. The 3D Morphological Shape Decomposition representation can be generalized a number of times, to extend the scope of its algebraic characteristics as much as possible. With these generalizations, the Morphologica...

متن کامل

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

One of the main image representations in Mathematical Morphology is the 3D Shape Decomposition Representation, useful for Image Compression, and Pattern Recognition. The 3D Morphological Shape Decomposition representation can be generalized a number of times, to extend the scope of its algebraic characteristics as much as possible. With these generalizations, the Morphological Shape Decompositi...

متن کامل

Generalized Morphological 3D Shape Decomposition Grayscale Interframe Interpolation Method

One of the main image representations in Mathematical Morphology is the 3D Shape Decomposition Representation, useful for Image Compression and Representation, and Pattern Recognition. The 3D Morphological Shape Decomposition representation can be generalized a number of times, to extend the scope of its algebraic characteristics as much as possible. With these generalizations, the Morphologica...

متن کامل

A fast implementation of 3-D binary morphological transformations

This paper proposes a fast algorithm for implementing the basic operation of Minkowski addition for the special case of binary three-dimensional (3-D) images, using 3-D structuring elements of arbitrary size and shape. The application of the proposed algorithm for all the other morphological transformations is straightforward, as they can all be expressed in terms of Minkowski addition. The eff...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997