Background: Sprite coding is a very effective technique for clarifying the background video object. The sprite generation is an open issue because of the foreground objects which prevent the precision of camera motion estimation and blurs the created sprite. Objective: In this paper, a quick and basic static method for sprite area detection in video data is presented. Two statistical methods are applied; the mean and standard deviation of every pixel (over all group of video frame) to determine whether the pixel is a piece of the selected static sprite range or not. A binary map array is built for demonstrating the allocated sprite (as 1) while the non-sprite (as 0) pixels valued. Likewise, holes and gaps filling strategy was utilized to restore the artifacts happened in the binary map. Results: The tests results specified that the proposed method is a fast static sprite area detection algorithm that leads quickly to remarkable sprite location. Conclusion: It is found that the proposed strategies can allocate the sprite (survive) areas easily and in appropriate way and distinguish static sprite region which demonstrate survived region.
The research abstract included introduction and the importance of the research, also included display of the problem represented by weakness for the players when performing some of the basic skills in badminton and the shuttle not reaching to the back corners of the court which gives the player the opportunity to win through applying the pressure on the opponent and make him away from the control center(T) which definitely required level of a collection muscular strength contributed in performance perhaps this related to a number of reasons related with weakness in physical changes especially explosive and characterized by speed forces for the badminton players and be acquainted with them and knowing the extent of their effect in performanc
... Show More
(13)
(2)
(1)
(1)
