Efficient algorithms for math. morphology : where are you ?

Thread View: sci.image.processing

2 messages

[T] Back to Threads [V] Tree View [G] Group Articles

2 total messages Started by Laurent PONTHIEU Fri, 08 Jan 1993 13:10

#940

Author: Laurent PONTHIEU
Date: Fri, 08 Jan 1993 13:10

51 lines
2645 bytes

Path: cli23ne!ponthieu
Newsgroups: sci.image.processing
Distribution: world
Followup-To: 
From: ponthieu@cli23ne.edf.fr ( Laurent PONTHIEU )
Reply-To: ponthieu@cli23ne.edf.fr ( Laurent PONTHIEU )
Organization: Electricite de France - DER , Clamart FRANCE
Subject: Efficient algorithms for math. morphology : where are you ?
Keywords: 

There seems to be some interest here about mathematical morphology,
thus my question :

Does anybody know about _efficient_ algorithms for MM on binary images ?
Either article, book, ftp or _even_ commercial software.

Following Jose E. Hernandez's hint (of 14 Oct 92, in this newsgroup), I've 
bought
	"Morphological Methods in Image & Signal Processing" by C.R. Giardina
	& E.R. Dougherty, Prentice Hall, 1987, ISBN 0-13-601295-7,
which does not cover the question of algorithms efficiency.

I've also digged Khoros' lib without success : there, as everywhere I've
looked, opening and closings are implemented by composition of erosion and
dilatation, which in turn are made with brute force four level nested loops.

I must say that we work here on symbol recognition on binary images which,
at least for now, are 3000x3000 pixels large. Size is to increase for the
real application, and the results we've got make us think that we must not
abandon this method !

I have developed some algorithms inspired by classical string searching in
texts but I'm not fully satisfied because they do not work for arbitrary
structuring elements.

I've been told that contour or distance coding might be the good way.

What's you experience with all that ?

Feel free to answer. Thanks.
(I'll post a summary of personal answers, if any).

------------------------------------------------------------------------
  Laurent PONTHIEU			|
  Electricite de France			| Tel: (+33 1) 47 65 56 38
  Direction des Etudes et Recherches	|
  Dept Traitement de l'Information	| Fax: (+33 1) 47 65 54 28
	et Etudes Mathematiques		|
  1, Avenue du General de Gaulle	| E-m: Laurent.Ponthieu@der.edf.fr
  92141 CLAMART Cedex, FRANCE		|      ponthieu@cli23ne.def.fr
------------------------------------------------------------------------

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

#979

Author: 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.

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads