Opatrec
Global Pattern Recognition using Eiffel
prototype
Contents:
To find all Hits (= space points) from the Road (= set of Hits) belonging to each Track (=circle).
The classes may be in future incorporated into the common prototype by inheritance
bringing new Pattern Recognition possibility.
Before applying the algorithm, road must be created and filled with hits.
- Find (all) 3-tuples among Hits from the Road.
- Put a circles through 3-tuples.
- Create space from the parameters of circles.
- Clusterise in the created space with a defined metric (create Tracks).
- Recall all Hits belonging to clusters (Tracks).
After this procedure, Hits for each Track may be fitted.
The algorithm really works, as you can see from the pictures.
You can look at the Hits
before
and
after
processing by the program.
There is a really working code both in
Fortran and
Eiffel.
The Eiffel code reads the sample.data on stdin and
writes run-protocol or Paw opatrec.kumac to stdout.
- Add fit in r*z plane.
- Implement better clustering algorithm.
- Merge into Prototype II.
J.Hrivnac Home Page ---
FzU Czech Home Page ---
FzU English Home Page
J.H.12/1/95
