Coping with hand-hand overlapping in bimanual movements

Hand gesture recognition plays a major role in the Human Computer Interaction (HCI), since it could be employed in many applications as a communication language. Nearly all hand gestures used in HCI are created using one hand; while other applications use gestures produced by two hands as long as both hands do not cross each other. This constraint in the bimanual gestures is due to the difficulties in reacquiring both hands correctly at the end of the hand-hand occlusion, which is addressed in this paper. Two policies, in analogy to the greedy and Hungarian algorithms, are used to solve the data association issue at the end of the hand-hand occlusion period given that the appearance of both hands does not change entirely during the overlapping period.