Newsgroups: sci.image.processing
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!yeshua.marcam.com!zip.eecs.umich.edu!caen!saimiri.primate.wisc.edu!aplcenmp!rmi-sdd-quadra.jhuapl.edu!user
From: cubs_win@jhunix.hcf.jhu.edu (Lloyd Weston Ison)
Subject: Re: Want to know any fastest region growing algorithm
Message-ID: <cubs_win-0411941511450001@rmi-sdd-quadra.jhuapl.edu>
Sender: usenet@aplcenmp.apl.jhu.edu
Nntp-Posting-Host: rmi-sdd-quadra.jhuapl.edu
Organization: Department of Biomedical Engineering
References: <39ash6$eku@fu.ecs.soton.ac.uk>
Date: Fri, 4 Nov 1994 22:11:45 GMT
Lines: 19

In article <39ash6$eku@fu.ecs.soton.ac.uk>, jk94r@ecs.soton.ac.uk (Joseph
Kuan) wrote:

>         I would like to know any fastest region growing algorithms. Any
> brief descriptions will be appreciated.
> 
> 

We have spent months on this problem here in our lab and the fastest one
that we found was a simple depth first search algorithm.  Ballard and
Brown, Computer Vision, offer some good ideas as well..


Lloyd Ison
Dept of Biomedical Eng.
Johns Hopkins Univ.
Baltimore, MD.

BRING BACK BASEBALL!
