Brand awareness is an important issue for the advertising. How to know the effective of every ad for business is always being studied. This paper present a face detection based on the use of eyes tracking system, that...
详细信息
ISBN:
(纸本)9781509034383
Brand awareness is an important issue for the advertising. How to know the effective of every ad for business is always being studied. This paper present a face detection based on the use of eyes tracking system, that can track how long, does the consumer pays attention on current advertising. Firstly, we use the harr-likes features to capture the faces in the image. Secondly, with the similar feature we can locate eyes on each face, which is called the ROI. For each eye region, we then decide whether the consumer is interested to the advertising or not by considering the position of the eye ball. Usually when a consumer is attracted by an ad, their eye ball will locate at the center of the eye. With this manner, we can observe the user behavior sustained and then give the feedback to the business. Finally, we provided a user friendly interface to demonstrate the advertising results. Testing results show that our system can easily be used for business such that business can integrated other marketing strategies for further advertising.
Heterogeneous system architectures are evolving towards tighter integration among devices, with emerging features such as shared virtual memory, memory coherence, and systemwide atomics. Languages, device architecture...
详细信息
ISBN:
(纸本)9781538638910
Heterogeneous system architectures are evolving towards tighter integration among devices, with emerging features such as shared virtual memory, memory coherence, and systemwide atomics. Languages, device architectures, system specifications, and applications are rapidly adapting to the challenges and opportunities of tightly integrated heterogeneous platforms. Programming languages such as OpenCL 2.0, CUDA 8.0, and C++ AMP allow programmers to exploit these architectures for productive collaboration between CPU and GPU threads. To evaluate these new architectures and programming languages, and to empower researchers to experiment with new ideas, a suite of benchmarks targeting these architectures with close CPU-GPU collaboration is needed. In this paper, we classify applications that target heterogeneous architectures into generic collaboration patterns including data partitioning, fine-grain task partitioning, and coarse-grain task partitioning. We present Chai, a new suite of 14 benchmarks that cover these patterns and exercise different features of heterogeneous architectures with varying intensity. Each benchmark in Chai has seven different implementations in different programming models such as OpenCL, C++ AMP, and CUDA, and with and without the use of the latest heterogeneous architecture features. We characterize the behavior of each benchmark with respect to varying input sizes and collaboration combinations, and evaluate the impact of using the emerging features of heterogeneous architectures on application performance.
This paper considers 2.5D printing in a number of ways: by exploring the relationship between textural appearance of objects as seen in the real world and how these are interpreted by artists and rendered as paintings...
详细信息
Conformal maps between planar domains are an important tool in geometry processing, used for shape deformation and image warping. The Riemann mapping theorem guarantees that there exists a conformal map between any tw...
详细信息
Conformal maps between planar domains are an important tool in geometry processing, used for shape deformation and image warping. The Riemann mapping theorem guarantees that there exists a conformal map between any two simply connected planar domains, yet computing this map efficiently remains challenging. In practice, one of the main algorithmic questions is the correspondence between the boundaries of the domains. On the one hand, there exist a number of conformal maps between any two domains, thus many potential boundary correspondences, yet on the other, given full boundary prescription a conformal map might not exist. Furthermore, an approximate boundary fitting can be enough for many applications. We therefore propose an alternating minimization algorithm for finding a boundary-approximating conformal map given only an initial global alignment of the two input domains. We utilize the Cauchy-Green complex barycentric coordinates to parameterize the space of conformal maps from the source domain, and thus compute a continuous map without requiring the discretization of the domain, and without mapping to intermediate domains. This yields a very efficient method which allows to interactively modify additional user-provided constraints, such as point-to-point and stroke-to-stroke correspondences. Furthermore, we show how to easily generalize this setup to quasi-conformal maps, thus enriching the space of mappings and reducing the area distortion. We compare our algorithm to state-of-the-art methods for mapping between planar domains, and demonstrate that we achieve less distorted maps on the same inputs. Finally, we show applications of our approach to stroke based deformation and constrained texture mapping.
In this work the authors present a novel image abstraction and stylization framework based on the analysis of natural scene in the multi-resolution Laguerre Gauss (LG) domain. The extraction of complex LG image sketch...
详细信息
We propose a new methodology to detect social aspects of crowds in video sequences based on pedestrian features, which are obtained through imageprocessing/computer vision techniques. The main idea is to apply and ex...
详细信息
ISBN:
(纸本)9781509035694;9781509035687
We propose a new methodology to detect social aspects of crowds in video sequences based on pedestrian features, which are obtained through imageprocessing/computer vision techniques. The main idea is to apply and extend the concepts of Fundamental Diagram (FD) with more features, such as grouping and collectivity. Using crowd features we identify the crowd type and the main characteristics. In addition, we also investigated two further results: the visual assessment of people in real video sequences in order to detect crowd characteristics, and the usage of our method to detect similarity of crowds in videos.
Given a planar point set sampled from an object boundary, the process of approximating the original shape is called curve reconstruction. In this paper, a novel non-parametric curve reconstruction algorithm based on D...
详细信息
Given a planar point set sampled from an object boundary, the process of approximating the original shape is called curve reconstruction. In this paper, a novel non-parametric curve reconstruction algorithm based on Delaunay triangulation has been proposed and it has been theoretically proved that the proposed method reconstructs the original curve under epsilon-sampling. Starting from an initial Delaunay seed edge, the algorithm proceeds by finding an appropriate neighbouring point and adding an edge between them. Experimental results show that the proposed algorithm is capable of reconstructing curves with different features like sharp corners, outliers, multiple objects, objects with holes, etc. The proposed method also works for open curves. Based on a study by a few users, the paper also discusses an application of the proposed algorithm for reconstructing hand drawn skip stroke sketches, which will be useful in various sketch based interfaces.
We introduce two methods to limit the reconstruction volume in binary tomography. The first one can be used when the CT scanner is equipped with a laser distance measurement device which gives information of the outer...
详细信息
image simplification has been proved useful in several imageprocessing applications as an additional step for more complex tasks, such as segmentation and feature extraction. In this work, we explore a graph-based si...
详细信息
image simplification has been proved useful in several imageprocessing applications as an additional step for more complex tasks, such as segmentation and feature extraction. In this work, we explore a graph-based simplification method that guarantees a well-behaved suppression of the image extrema (maxima/minima) by taking into account both information of distance and contrast, as well as some interesting aspects of the scale-space theory. By highlighting some new properties of the method, we define a local update of the graph which implies in an interesting bypass in the whole algorithm structure which, originally, is very time-consuming. Finally, we illustrate how to combine this simplification process with well-known morphological tools to approach problems related mainly with multi-scale image segmentation and homogenization.
Three-dimensional thinning is an important task in medical imageprocessing when performing quantitative analysis on structures, such as bones and vessels. For researchers of this domain a fast, robust and easy to acc...
详细信息
暂无评论