Update of the Linear Focus Algorithm--v2
ClosedPublic

Authored by murveit on Mon, Jan 13, 6:28 AM.

Details

Summary

Refactoring in focus.cpp to separate this algorithm from the other algorithms.
Uses a polynomial fit to estimage when the first pass is done, and how far the current sample is from the minimum.
Improved logging.
Improved plotting when running the algorithm.
Algorithm applies to timer-based focusers as well as position-based ones.

Test Plan

Using the simulator, in the focus tab select the linear focus algorithm,
set the step size to about 1000. Set the MaxTravel to be large (e.g. 100K),
probably use "Full field" (that's less noisy). Should autofocus starting from 50K
(the solution will be about 38K). Should also find a solution if you start too low (20K),
and too high (75K) though would probably exceed the max number of steps (30) if you start higher.

Diff Detail

Repository
R321 KStars
Lint
Automatic diff as part of commit; lint not applicable.
Unit
Automatic diff as part of commit; unit tests not applicable.
murveit created this revision.Mon, Jan 13, 6:28 AM
Restricted Application added a project: KDE Edu. · View Herald TranscriptMon, Jan 13, 6:28 AM
Restricted Application added a subscriber: kde-edu. · View Herald Transcript
murveit requested review of this revision.Mon, Jan 13, 6:28 AM
mutlaqja accepted this revision.Tue, Jan 14, 4:37 AM
This revision is now accepted and ready to land.Tue, Jan 14, 4:37 AM
This revision was automatically updated to reflect the committed changes.