Re: Efficient algorithms for math. morphology : where are you ?

Article View: sci.image.processing

Article #979

Back to sci.image.processing Previous Next

#979

From: Thomas M. Breuel
Date: Sun, 10 Jan 1993 12:09

11 lines
1077 bytes

In article <1993Jan8.131010.2436@edf.fr> ponthieu@cli23ne.edf.fr ( Laurent PONTHIEU ) writes:

   [need to do morphological operations on large images fast]

For convex structuring elements, you can use the distance transform,
which can be computed relatively quickly.  If your images are mostly
white, a quad-tree based approach may work well.  But on complex
3000x3000 images, anything is going to be slow (several minutes for
the DT on a SS2).

					Thomas.

Technical Details

Message-ID: <TMB.93Jan10120939@arolla.idiap.ch>

Path: arc1-ca.pugleaf.net!sparky!uunet!think.com!enterpoop.mit.edu!mintaka.lcs.mit.edu!ai-lab!life.ai.mit.edu!tmb

References: <1993Jan8.131010.2436@edf.fr>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!think.com!enterpoop.mit.edu!mintaka.lcs.mit.edu!ai-lab!life.ai.mit.edu!tmb
From: tmb@arolla.idiap.ch (Thomas M. Breuel)
Newsgroups: sci.image.processing
Subject: Re: Efficient algorithms for math. morphology : where are you ?
Date: 10 Jan 93 12:09:39
Organization: IDIAP (Institut Dalle Molle d'Intelligence Artificielle
 Perceptive)
Lines: 11
Message-ID: <TMB.93Jan10120939@arolla.idiap.ch>
References: <1993Jan8.131010.2436@edf.fr>
Reply-To: tmb@idiap.ch
NNTP-Posting-Host: arolla.idiap.ch
In-reply-to: ponthieu@cli23ne.edf.fr's message of Fri, 8 Jan 1993 13:10:10 GMT

Reply to Parent Message