OneEye Changeset - 500e573f202d

Changeset - 500e573f202d

Parent rev.

Child rev.

[Not reviewed]

default

0 1 0

Kallithea Admin (Laman) - 10 years ago 2015-08-31 22:36:24
t.berkman@email.cz

readme.md edited online with Bitbucket

1 file changed with 12 insertions and 13 deletions:

readme.md

0 comments (0 inline, 0 general)

readme.md

➞

Show inline comments

 OneEye
 ======
 Program to extract moves of a go game from a video and save them to SGF or broadcast them online.
 Modules:
   * Video: grabbing still frames from a video file / stream. Planning to use FFmpeg.
   * Graphic: extracting game position from an image. Using Pillow.
   * Watcher: interpreting sequence of game positions as a sequence of moves.
   * Broadcaster: interfacing with a go server.
 * Video: grabbing still frames from a video file / stream. Planning to use FFmpeg.
 * Graphic: extracting game position from an image. Using Pillow.
 * Watcher: interpreting sequence of game positions as a sequence of moves.
 * Broadcaster: interfacing with a go server.
 Graphic
 -------
 Interpolating the board grid from specified corner points.
@@ @@ -21,15 +21,14 @@ Autodetection of the board? @@
 Watcher
 -------
 Base case: we have two correctly recognized positions differing by a single move (single added stone). Easy.
 Issues:
   * illegal positions -> ignorable
   * positions unreachable from the previous state
     * reachable from any past state. (Incorrect states inbetween). How to pick the correct leaf of such a tree?
     * reachable by more than one move. Issues with branching factor.
   * board shifts -> repaired manually (or automatically), further positions have to be reevaluated
   * stone shifts
     * stone stops being recognized -> fixable manually and even ignorable
     * stone is recognized at an empty intersection. It can be occupied later for real. What do?
 * illegal positions -> ignorable
 * positions unreachable from the previous state
   * reachable from any past state. (Incorrect states inbetween). How to pick the correct leaf of such a tree?
   * reachable by more than one move. Issues with branching factor.
 * board shifts -> repaired manually (or automatically), further positions have to be reevaluated
 * stone shifts
   * stone stops being recognized -> fixable manually and even ignorable
   * stone is recognized at an empty intersection. It can be occupied later for real. What do?
@@ \ No newline at end of file @@

0 comments (0 inline, 0 general)