Efficient 2-D Grayscale Morphological Transformations With Arbitraly Flat_Structuring
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Active In SP

Posts: 1,124
Joined: Jun 2010
25-09-2010, 04:50 PM

.doc   Efficient_2-D_Grayscale_Morphological_Transformations_With_Arbitraly_Flat_Structuring_Elements.doc (Size: 1.14 MB / Downloads: 50)

MORPHOLOGICAL operators like dilation and erosion With structuring elements (S.E.) are the most fundamental Operators in mathematical morphology and have become Common tools for both image filtering and analysis , of binary And grayscale images, especially since the development of Efficient algorithms –. Usually, these efficient algorithms Can only be used for binary images –, 9, , , or They are limited to shapes that can (efficiently) be decomposed Into a series of linear S.E.s 8, , . Efficient implementations For specialized hardware have also been studied extensively, Such as the decomposition of arbitrary shapes into Blocks 0. A recent overview of efficient algorithms for morphological operators with linear S.E. and -D S.E. decompositions Can be found in . All methods based on decomposition Of -D S.E.s into linear S.E.s share the same limitation: many Shapes either cannot be decomposed efficiently or they cannot Be decomposed at all. In the binary case, efficient algorithms For some -D shapes like circles do exist, but these cannot efficiently Be extended to the grayscale case, for which polygonal Approximations , 6 of circles usually are used instead. For Larger circles these approximations tend be either too coarse or Manuscript received January 6, 00; revised October , 00. The associate Editor coordinating the review of this manuscript and approving it for publication Was Prof. Philippe Salem bier. The authors are with the Institute of Mathematics and Computing Science, University of Groningen, 900 AV, Groningen, the Netherlands. Digital Object Identifier 0.09/TIP.00.98 Too computationally intensive, since the number or linear S.E.s Required is proportional to the diameter of the circle. Algorithms that efficiently perform morphological operators With arbitrary S.E.s not only are important for those cases where The S.E. cannot be decomposed, but also wherever a generic algorithm Is desired such as in image processing libraries, which Often have a number of specialized routines for specific cases, And a direct implementation for arbitrary S.E. Furthermore, for Many applications the benefits of using the fastest specialized Algorithm available instead of using one slightly less efficient Generic algorithm does not outweigh the costs involved in Adapting the methods used. S.E. shape decompositions require Some design and programming efforts that can be avoided if A generic algorithm is used. Our algorithm is efficient for any S.E. and only significantly outperformed when large linear S.E.s or compositions of linear S.E.s are used with a dedicated Algorithm such as proposed by Gil and Kimmel . Commercial and open source image processing software for Performing morphological operations was found to be either Quite slow, being based on a processor optimized version of the direct algorithm (like openCV or Mat lab) or fast but limited to rectangular S.E.s (like Adobe Photoshop CS). Olena , which uses the algorithm by Van Droogenbroeck and Talbot , is one of the fewexceptions that is faster and can handle arbitrary S.E.s. Van Droogenbroeck and Talbot proposed an efficient algorithm for computing morphological operations with arbitrary -D shapes using a histogram, which makes the computing time of their algorithm dependent on the number of gray levels used. Their idea is to compute for one pixel of the image the complete histogram based on the intensities of the pixels around corresponding to elements of the S.E. The value of after erosion is the minimum intensity in the histogram which has a value 0. For all succeeding pixels of the image (by moving around the S.E. over the image), the histogram is efficiently updated and the position of its minimum intensity changes only if i) a new minimum value is shifted into the histogram, which can be kept track when the histogram is updated, or ii) when the current minimum is shifted out of the histogram, in which case the algorithm searches for the first following (brighter) intensity which is now represented in the histogram. The C source code of the following algorithms are available on request: i) our proposed (“Urbach-Wilkinson” or UW) algorithm, ii) Van Droogenbroeck and Talbot (DT) for arbitrary -D S.E.s, and iii) Gil and Kimmel (GK) for linear S.E.s. In a preliminary version 8, we presented a new method for performing morphological operators with any -D flat structuring element that always outperforms existing


Important Note..!

If you are not satisfied with above reply ,..Please


So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page
Tagged Pages: 2 d gray scale morphological synopsis doc, efficient 2 d grayscale morphological transformations with arbitraly flat structuring elements,
Popular Searches: transformations of random processes ppt, efficient 2 d gray scale morphologicaltransformations with arbitraly flat structuringelements, convert cmyk to grayscale, 2d grayscale morphological transformations with arbitrary flat structuring elements, a secretsharingbased method for authentication of grayscale document images via the, efficient 2 d grayscale morphological transformations with arbitraly flatstructuring elements pdf**##101566## **project report format for civil engg in concrete, efficient 2 d gray scale morphological transformation with arbitrary flat structuring,

Quick Reply
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  BECAN: A Bandwidth-Efficient Cooperative Authentication Scheme for Filtering report seminar projects maker 0 450 28-09-2013, 04:36 PM
Last Post: seminar projects maker
  Efficient and Robust Detection of Duplicate Videos in a Large Database Report seminar projects maker 0 432 24-09-2013, 12:47 PM
Last Post: seminar projects maker
Last Post: study tips
  Efficient Fuzzy Type-Ahead Search in XML Data pdf study tips 0 492 07-09-2013, 04:56 PM
Last Post: study tips
  Orthogonal Data Embedding for Binary Images in Morphological Transform Domain – A Hig project report helper 1 874 07-09-2013, 04:29 PM
Last Post: study tips
Last Post: Guest
  Scalable and Efficient Provable Data Possession Abstract study tips 0 23,757 16-08-2013, 05:00 PM
Last Post: study tips
  Efficient search based on data personalization with location context Report study tips 0 287 30-07-2013, 02:54 PM
Last Post: study tips
  Efficient Patient Monitoring For Multiple Patients Using WSN pdf study tips 0 366 20-07-2013, 04:57 PM
Last Post: study tips
  A Secret-Sharing-Based Method for Authentication of Grayscale Document Images pdf study tips 0 414 19-07-2013, 02:09 PM
Last Post: study tips