Three-dimensional computer vision: a geometric viewpoint
Three-dimensional computer vision: a geometric viewpoint
Finding optimal solutions to Rubik's cube using pattern databases
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Point-based and region-based image moments for visual servoing of planar objects
IEEE Transactions on Robotics
A constraint satisfaction framework with Bayesian inference for model-based object recognition
ICCVG'10 Proceedings of the 2010 international conference on Computer vision and graphics: Part II
Application of the FraDIA vision framework for robotic purposes
ICCVG'10 Proceedings of the 2010 international conference on Computer vision and graphics: Part II
Hi-index | 0.00 |
The Rubik's cube puzzle is seen as a benchmark for service robots. In such an application, a computer vision subsystem is required to locate the object in space and to determine the configuration of its colored cells. This paper presents a robust algorithm for Rubik's cube reconstruction from a single view in real time. An issue of special interest is to obtain a good tade-off between the quality of results, and the computational complexity of the algorithm.