D26615: Update of the Linear Focus Algorithm--v2

[Hy Murveit]

murveit created this revision.
murveit added a reviewer: mutlaqja.
Herald added a project: KDE Edu.
Herald added a subscriber: kde-edu.
murveit requested review of this revision.

REVISION 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.

REPOSITORY
  R321 KStars

BRANCH
  linear-focuser-v2 (branched from master)

REVISION DETAIL
  https://phabricator.kde.org/D26615

AFFECTED FILES
  kstars/ekos/focus/focus.cpp
  kstars/ekos/focus/focus.h
  kstars/ekos/focus/focus.ui
  kstars/ekos/focus/focusalgorithms.cpp
  kstars/ekos/focus/focusalgorithms.h
  kstars/ekos/focus/polynomialfit.cpp
  kstars/ekos/focus/polynomialfit.h

To: murveit, mutlaqja
Cc: kde-edu, narvaez, apol
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.kde.org/pipermail/kde-edu/attachments/20200113/0b71387f/attachment.html>