KMITL
Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/123456789/1
Browse
3 results
Search Results
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, A comparative study of feature point matching versus foreground detection for computer detection of dairy cows in video frames(2015-12-01) ;Pasupa, Kitsuchart ;Pantuwong, NataponNopparit, SuthasineeBehaviours of dairy cows reflect their health and emotions. Behavioural analysis by video surveillance is an accepted technique for helping cow-keepers to spot their cows' health problems. To perform a behavioural analysis, the presence and location of the cows need to be detected first. In this study, we used feature point matching method and foreground detection method to detect them. Two experiments were conducted in a dairy farm to detect cows in video frames recorded by a video camera installed over the top of a free-stall barn. A total of 800 frames of recorded cows' activities were captured. True and false positive and negative results were statistically confirmed by t test. We found that the accuracies of the feature point matching and foreground detection methods were 38.55 and 75.95 %, respectively; hence, for our setup, the foreground detection was a better method. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, A kinetic energy-based feature for unsupervised motion clustering(2013-01-01) ;Nopparit, Suthasinee ;Pantuwong, NataponSugimoto, MasanoriMotion databases usually contain sequences of movements and searching these vast databases is not an easy task. Motion clustering can reduce this difficulty by grouping sample movements into various motion groups containing similar actions. The pose distance is often used as a feature during motion-clustering tasks. However, the main weakness of this strategy is its computational complexity. Query motions are also required to cluster motion sequences. To address these problems, we propose a motion-clustering algorithm based on the use of kinetic energy to cluster sample motions. Our method does not require query motions during the clustering process, so the clustering results can be generated without supervision. Our experimental results confirmed that our proposed method delivered comparable performance to pose distance-based methods, while its computational complexity was significantly lower than that of existing methods. © 2013 IEEE. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, A parametric motion concatenation method using cubic Bézier interpolation(2013-01-01) ;Nopparit, Suthasinee ;Pantuwong, NataponSugimoto, MasanoriThis paper presents a novel motion concatenation method for parametric motion synthesis techniques. First, motion groups are created based on the actions in each motion. We then extract all of the parameters that control the synthesized motions. To connect the motion groups, we propose a motion concatenation algorithm based on cubic Bézier interpolation that can be used to connect any pair of motions. All of the poses are pre-calculated before interpolation, so that the concatenated motions can be synthesized rapidly during the concatenation phase. Although there is no intersection region between the parameter spaces, the proposed method guarantees that transitions between motions can be generated for any consecutive motions, which is a problem found in existing methods. © 2013 IEEE.
