In multimedia applications, dimension reduction is essential to the effectiveness and efficiency of an algorithm due to the curse of dimensionality. Recently, its adaptive variants have received considerable attention...
详细信息
A major unsolved problem in human-like agent is the construction and application of realistic human facial expression models. Human-like agents should interact with human by recognizing human facial expression and syn...
详细信息
This paper studies the problem of semi-supervised learning from the vector field perspective. Many of the existing work use the graph Laplacian to ensure the smoothness of the prediction function on the data manifold....
详细信息
ISBN:
(纸本)9781618395993
This paper studies the problem of semi-supervised learning from the vector field perspective. Many of the existing work use the graph Laplacian to ensure the smoothness of the prediction function on the data manifold. However, beyond smoothness, it is suggested by recent theoretical work that we should ensure second order smoothness for achieving faster rates of convergence for semisupervised regression problems. To achieve this goal, we show that the second order smoothness measures the linearity of the function, and the gradient field of a linear function has to be a parallel vector field. Consequently, we propose to find a function which minimizes the empirical error, and simultaneously requires its gradient field to be as parallel as possible. We give a continuous objective function on the manifold and discuss how to discretize it by using random points. The discretized optimization problem turns out to be a sparse linear system which can be solved very efficiently. The experimental results have demonstrated the effectiveness of our proposed approach.
In this paper, we propose a new scheme for marker-driven free form global mesh deformation without manually establishing a skeleton orfreeform deformation domain beforehand. It allows a user to deform a given mesh int...
详细信息
With the rapid development of 3D digital photography and 3D digital scanning devices, massive amount of point samples can be generated in acquisition of complex, real-world objects, and thus create an urgent need for ...
详细信息
With the rapid development of 3D digital photography and 3D digital scanning devices, massive amount of point samples can be generated in acquisition of complex, real-world objects, and thus create an urgent need for advanced point-based processing and editing. In this paper, we present an interactive method for blending point-based geometries by dragging-and- dropping one point-based model onto another model’s surface metaphor. We first calculate a blending region based on the polygon of interest when the user drags-and-drops the model. Radial basis function is used to construct an implicit surface which smoothly interpolates with the transition regions. Continuing the drag-and-drop operation will make the system recalculate the blending regions and reconstruct the transition regions. The drag-and-drop operation can be compound in a constructive solid geometry (CSG) manner to interactively construct a complex point-based model from multiple simple ones. Experimental results showed that our method generates good quality transition regions between two raw point clouds and can effectively reduce the rate of overlapping during the blending.
Power consumption within the memory hierarchy grows in importance as on-chip data caches occupy increasingly greater die area. Among dynamic power conservation schemes, horizontal partitioning reduces average power pe...
详细信息
ISBN:
(纸本)1595930183
Power consumption within the memory hierarchy grows in importance as on-chip data caches occupy increasingly greater die area. Among dynamic power conservation schemes, horizontal partitioning reduces average power per data access by employing multiple smaller structures or using cache subbanks. For instance, region-based caching places small caches dedicated to stack and global accesses next to the LI data cache. With respect to static power dissipation, leakage power may be addressed at both circuit and architectural levels. Drowsy caches reduce leakage power by keeping inactive lines in a low-power mode. Here we merge drowsy and region-based caching to reduce overall cache power consumption, showing that the combination yields more benefits than either alone. Applications from the MiBench suite exhibit power reductions in the cache system of up to 68-71%, depending on memory configuration, with a small increase in execution time. Copyright 2005 ACM.
Increasingly tight energy design goals require processor architects to re-think the organizational structure of microarchitectural resources. In this paper, we examine a new multilateral cache organization that replac...
详细信息
1 *** Activity Recognition(GAR),which aims to identify activities performed collectively in videos,has gained significant attention *** conventional action recognition centered on single individuals,GAR explores the c...
详细信息
1 *** Activity Recognition(GAR),which aims to identify activities performed collectively in videos,has gained significant attention *** conventional action recognition centered on single individuals,GAR explores the complex interactions between multiple individuals.
The identification of Chinese herbal powders is usually based on physical or chemical detection, but that is far from enough to identity dozens of herbal species. Microscopic images of these powders contain variety of...
详细信息
ISBN:
(纸本)9781467355339
The identification of Chinese herbal powders is usually based on physical or chemical detection, but that is far from enough to identity dozens of herbal species. Microscopic images of these powders contain variety of information, and important evidence for identification. These images usually contain variety of substance, and most of them are noises, which makes the target segmentation become a difficult job. An effective automatic target segmentation algorithm based on texture is proposed in this paper. Our method consists of two steps: "Preliminary Segmentation" and "Further Segmentation". Firstly, feature vector of texture is extracted and clustered into two groups: background and foreground;secondly, taking the continuity of edge and the locality of target into consideration, energy equations are established, and Maximum flow-Minimum cut Algorithm is applied to solve them. Three groups of images are used to test our method: microscopic images of Chinese herbal powders, Brodaze Images, and natural texture images. And the experimental results show that our method achieves a better segmentation compared with Grab-Cut, and additionally user inter-action is not required in our method.
Gaussian Mixture Model (GMM) is one of the most popular data clustering methods which can be viewed as a linear combination of different Gaussian components. In GMM, each cluster obeys Gaussian distribution and the ta...
详细信息
暂无评论