Tutorials and Guides @articleinput.com

New consumer journey in the advertising industry (04/20/2010)
(...) Making advertising an all-encompassing activity was an approach pioneered by automotive and telecommunications services – as some of the case studies in this book demonstrate. In particular, by shaping customer services with advertising techniques, brands have been able to use every bit of one-to-one customer dialogue as an opportunity to develop the user experience, which itself is an advertisement to stick with a brand. This makes for more effective returns on advertising investment. (...)

Modeling humans and shapes (12/14/2009)
(...) The epipolar geometry of a stereo pair is fully-specified by its fundamental matrix. The fundamental matrix can be inferred from eight point correspondences between two uncalibrated cameras, and it is directly available for fully-calibrated camera pairs. By using the fundamental matrix and the epipolar line, image correspondences can be computed using simple matrix multiplications, which reduces the problem to an one-dimensional search space along a line. (...)

Background subtraction and optical flow (12/14/2009)
(...) The translational components of the rigid body transformations are implicitly represented by the bone lengths and the joints model the rotational components. Since the bone lengths are constant, the pose of the skeleton is fully-specified by the rotation parameters for each joint and an additional translational parameter for the root. A method to robustly segment a person in the foreground of a scene from the background is necessary. (...)

The camera model and similar techniques (12/14/2009)
(...) In the following, we will describe the mathematical framework formapping the 3D world space to the 2D image plane, the process of camera calibration and the geometry of stereo cameras. The matrix K can be referred to as the calibration matrix and its entries are called the intrinsic parameters of the camera. The principal point in the image plane is at position at the intersection of the optical axis with the image plane. (...)

Visual computing and its research areas (12/14/2009)
(...) However, if we compare the performance, robustness and application range of even the best computer vision system today to the abilities of the human visual system, we have to humbly conclude that the field of computer vision is still in its infancy. While computer vision focuses on the functional or reconstruction side of visual computing, computer graphics focuses on the synthesis or display aspect. In recent years algorithms for creating photo-realistic virtual imagery have greatly improved. (...)

Interactive shape deformation (12/14/2009)
(...) Instead of directly modify the spatial location of each vertex in the model, they use a local differential representation of the shape, which encodes information about its local shape and the size and orientation of the local details, to obtain a detail-preserving deformation result. Deformation is performed by constructing a differential representation of the shape, manipulating it according to the given constraints, and finally reconstructing the shape from the modified differential representation.While sharing the same general framework, the two main categories of differential techniques differ by the particular representation they use. (...)

Editing methods in computer graphics (12/14/2009)
(...) While these approaches are an effective tool for enhancing fine-scale detail preservation, the generation of the hierarchy can be expensive for complex models. Moreover, it is hard to deal with large deformations in a single step. These limitations are the main reason for differential-based deformation approaches, which represent the model using its local differential coordinates instead of using its spatial coordinates. (...)

The guided poisson based method (12/14/2009)
(...) This construction allows us to manipulate M by applying the user constraints as separate transformations. At the end, we can reconstruct M in its new target configuration by computing the new vertex positions p such that the resulting mesh complies with the new, rotated gradients. This can be computed by solving the Poisson system Lsp, which is formulated as a least-squares system for each x, y and z-coordinate separately. (...)

The iterative volumetric laplacian method (12/14/2009)
(...) The approach starts by constructing the tetrahedral Laplacian system where G is the discrete gradient operator matrix for the volumetric model, D is a 4mt 4mt diagonal matrix containing the tetrahedra's volumes, g is the set of tetrahedron gradients, each being calculated as gj = Gj pj, and pj is a matrix containing the vertex coordinates of tetrahedron tt j . The constraints pcj can be factorized into the matrix Ls by eliminating the corresponding rows and columns in the matrix and incorporating the values into the right-hand side. By solving the previous tetrahedral Laplacian system, we obtain a set of new vertex positions V. (...)