Computers

  2010 SEP 9 - (VerticalNews.com) -- According to recent research from North Ireland, "Temporal dependency is a very important cue for modeling human actions. However, approaches using latent topics models, e.g., probabilistic latent semantic analysis (pLSA), employ the bag of words assumption therefore word dependencies are usually ignored."

  "In this work, we propose a new approach structural pLSA (SpLSA) to model explicitly word orders by introducing latent variables. More specifically, we develop an action categorization approach that learns action representations as the distribution of latent topics in an unsupervised way, where each action frame is characterized by a codebook representation of local shape context. The effectiveness of this approach is evaluated using both the WEIZMANN dataset and the MIT dataset. the proposed approach outperforms the standard pLSA. Additionally, our approach is compared favorably with six existing models including GMM, logistic regression, HMM, SVM, CRF, and HCRF given the same feature representation," wrote J.G. Zhang and colleagues, Queen's University ...read more

  2010 SEP 9 - (VerticalNews.com) -- According to a study from Shanghai, People's Republic of China, "We present an image deformation method driven by skeleton; it is based on MLS deformation algorithm (Schaefer et al. in SIGGRAPH, vol. 25, pp. 533-540, 2006). We improve the MLS deformation by defining a new weight function based on skeleton."

  "Being different from the weight function based on control points, our weight function has benefited from the shape information of undeformed object and keeps deformation local, therefore our method can achieve a realistic effect. In cartoon video, we propose a new method to track the skeleton in the video, to build new origin skeleton and new target skeleton on each frame, and to apply our image deformation method to each frame and maintain spatiotemporal consistency," wrote Y. Shen and colleagues, Shanghai Jiao Tong University ...read more

  2010 SEP 9 - (VerticalNews.com) -- According to recent research published in the journal Visual Computer, "We present an improved technique for data hiding in polygonal meshes, which is based on the work of Bogomjakov et al. (Comput. Graph. Forum 27(2):637-642, 2008). Like their method, we use an arrangement on primitives relative to a reference ordering to embed a message."

  "But instead of directly interpreting the index of a primitive in the reference ordering as the encoded/decoded bits, our method slightly modifies the mapping so that our modification doubles the chance of encoding an additional bit compared to Bogomjakov et al.'s (Comput. Graph. Forum 27(2):637-642, 2008). We illustrate the inefficiency in the original mapping of Bogomjakov et al. (Comput. Graph. Forum 27(2):637-642, 2008) with an intuitive representation using a binary tree. Although both methods have the same minimal and maximal capacities and are both only one bit per primitive less than optimal, our method improves the average capacity up to 0.63 bits per primitive," wrote S.C. Tu and colleagues ...read more