About: CHESSBOARD SQUARE OCCUPANCY ANALYSIS THROUGH K-MEANS CLUSTERING BASED VISUAL MARKER DETECTION     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • In 2012, Accessible chessboard for blind that is mouse and keyboard free was developed, using Kinect depth camera to detect presence of chess pieces. However, Kinect failed to be the right device for the task. Occasionally and unpredictably, depth data coming from the device contained large blobs of noise that reported zero distance from the Kinect. This prevented proper detection of square occupancy, requiring new algorithm that would be stable and robust. This paper presents such a new algorithm. It no longer users depth sensor, but USB web camera, and analyses captured image of the board. Colorful circular markers are stick to every square to help detection. Paper compares k-means clustering algorithm to other approaches that detect markers' visibility: Mathematical formulae for HSV statistics and neural network trained on the HSV statistics. Neural network based approach properly detected 19 out of 19 test images, but due to over fitting was failing in real game experiment. K-means clustering algorithm showed second-best results, detecting properly 16 out of 19 test images. Nevertheless it was chosen as the best algorithm due to its robustness. In an experiment of 3 chess games, all 15552 squares were detected properly by this winning algorithm.
  • In 2012, Accessible chessboard for blind that is mouse and keyboard free was developed, using Kinect depth camera to detect presence of chess pieces. However, Kinect failed to be the right device for the task. Occasionally and unpredictably, depth data coming from the device contained large blobs of noise that reported zero distance from the Kinect. This prevented proper detection of square occupancy, requiring new algorithm that would be stable and robust. This paper presents such a new algorithm. It no longer users depth sensor, but USB web camera, and analyses captured image of the board. Colorful circular markers are stick to every square to help detection. Paper compares k-means clustering algorithm to other approaches that detect markers' visibility: Mathematical formulae for HSV statistics and neural network trained on the HSV statistics. Neural network based approach properly detected 19 out of 19 test images, but due to over fitting was failing in real game experiment. K-means clustering algorithm showed second-best results, detecting properly 16 out of 19 test images. Nevertheless it was chosen as the best algorithm due to its robustness. In an experiment of 3 chess games, all 15552 squares were detected properly by this winning algorithm. (en)
Title
  • CHESSBOARD SQUARE OCCUPANCY ANALYSIS THROUGH K-MEANS CLUSTERING BASED VISUAL MARKER DETECTION
  • CHESSBOARD SQUARE OCCUPANCY ANALYSIS THROUGH K-MEANS CLUSTERING BASED VISUAL MARKER DETECTION (en)
skos:prefLabel
  • CHESSBOARD SQUARE OCCUPANCY ANALYSIS THROUGH K-MEANS CLUSTERING BASED VISUAL MARKER DETECTION
  • CHESSBOARD SQUARE OCCUPANCY ANALYSIS THROUGH K-MEANS CLUSTERING BASED VISUAL MARKER DETECTION (en)
skos:notation
  • RIV/00216275:25530/13:39896723!RIV14-MSM-25530___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 65264
http://linked.open...ai/riv/idVysledku
  • RIV/00216275:25530/13:39896723
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • k-means clustering, computer vision, visually impaired, OpenCV, chess, marker detection. (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [51C451BDB7A1]
http://linked.open...v/mistoKonaniAkce
  • Pardubice
http://linked.open...i/riv/mistoVydani
  • Pardubice
http://linked.open...i/riv/nazevZdroje
  • Conference Proceedings The 13th Conference of Postgraduate Students and Young Scientists in Informatics, Management, Economics and Administration IMEA 2013
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Jetenský, Pavel
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Univerzita Pardubice
https://schema.org/isbn
  • 978-80-7395-696-7
http://localhost/t...ganizacniJednotka
  • 25530
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software