clermont@ireq.hydro.qc.ca (Clermont) (03/17/90)
We are currently working on edge detecting. We are trying to implement
the Edge focusing algorithm. That algorithm was first proposed by
Fredrik Bergholm from IUI in Stockholm, in IEEE Transactions on pattern
analysis and machine intelligence, PAMI-9 no.6 Nov.1986.
Briefly, this method proceed in two steps:
- detect the significant edges using a high degree of smoothing
(using the Gaussian average operator)
- determine precise location by focusing them (tracking them over
decreasing scale)
Has anyone, put this method in a concrete computer's algorithm and program ?
Basically, our work is progressing well. But we have a few questions.
Like with the size of the kernel of convolution. Like the borders effects.
Like, etc.
If someone can help, please contact me by e-mail.
Thanks
==========================================================================
--- Sylvain Clermont ---
- ingenieur de developpement -
- development engineer -
- Hydro-Quebec - tel: (514) 251-3141
- Division Automatisation - fax: (514) 251-3110
- 5100 rue Sherbrooke est
- 7ieme etage - e-mail: clermont@ireq.hydro.qc.ca
- Montreal, Qc Canada
- H1V 3R9
---------------------------------------------------------------------------
"Microwave fireplace: spent the entire evening in just 3 minutes"
===========================================================================