| |
 |
|
|
Science Forum Index » Image Processing Forum » Fast Connected Components
Page 1 of 1
|
| Author |
Message |
| Moon2 |
 Posted: Tue Dec 05, 2006 4:42 pm |
|
|
|
Guest
|
Hi all I have implemented a connected components algorithm that takes some
time processing images of sizes 1280x1024, time 10-12 secs. Does anyone know
where I can find implementations which are relatively faster, any papers,
books, sites would be appreciated.
Thanks Mike |
|
|
| Back to top |
|
| Abhishek |
| Posted: Wed Dec 06, 2006 11:45 am |
|
|
|
Guest
|
Hi,
Reply back and I shall send across some of the papers I have on Fast
Implementation of connected components analysis.
Sorry I have no time to attach it right now.Send me a mail and I shall
reply back soon.
With Regards,
Abhishek S
Moon2 wrote:
Quote: Hi all I have implemented a connected components algorithm that takes some
time processing images of sizes 1280x1024, time 10-12 secs. Does anyone know
where I can find implementations which are relatively faster, any papers,
books, sites would be appreciated.
Thanks Mike |
|
|
| Back to top |
|
| Steve Eddins |
| Posted: Wed Dec 06, 2006 2:46 pm |
|
|
|
Guest
|
Abhishek wrote:
Quote: Hi,
Reply back and I shall send across some of the papers I have on Fast
Implementation of connected components analysis.
Sorry I have no time to attach it right now.Send me a mail and I shall
reply back soon.
With Regards,
Abhishek S
Moon2 wrote:
Hi all I have implemented a connected components algorithm that takes some
time processing images of sizes 1280x1024, time 10-12 secs. Does anyone know
where I can find implementations which are relatively faster, any papers,
books, sites would be appreciated.
Thanks Mike
The Image Processing Toolbox function bwlabel uses the general algorithm
outlined in Haralick and Shapiro, Computer and Robot Vision, Volume I,
Addison-Wesley, 1992, pp. 40-48:
1. Run-length encode the input image.
2. Scan the runs, assigning preliminary labels and recording label
equivalences in a local equivalence table.
3. Resolve the equivalence classes. (We use a union-find procedure for
this step, instead of what's described in Haralick and Shapiro.)
4. Relabel the runs based on the resolved equivalence classes.
It runs (on my laptop, an IBM Thinkpad T60) in about 25 milliseconds on
a 1024-by-1024 binary image of text.
--
Steve Eddins
http://blogs.mathworks.com/steve |
|
|
| Back to top |
|
| |
|
Page 1 of 1
All times are GMT - 5 Hours
The time now is Tue Oct 07, 2008 11:49 pm
|
|