This paper describes the design and implementation of a architecture that can continously monitor and track selected face in real time by controlling camera motion around. Dection and tracking of face has been an significant and dynamic investigation domain because it provides many application, primarily in video coding, video surveillance, biometry or Video Identity Resolution. But detection a...

Given an edge-weighted graph G and a list of source-sink pairs of terminal vertices of G, the minimum multicut problem consists in selecting a minimum weight set of edges of G whose removal leaves no path from the ith source to the ith sink, for each i. Few tractable special cases are known for this problem. In this paper, we give a simple polynomial-time algorithm solving it in undirected plan...

We investigate embeddings of graphs on orientable 2-dimensional surfaces such that all face boundaries have fewer edges than every noncontractible cycle. We show that such embeddings are always minimum genus embeddings and that they share many properties with planar embeddings. For example, if the graph is 3-connected, then the embedding is unique. We use this to obtain a polynomially bounded a...

In this paper we study the problem of equalizing a communications channel from an H 1 point of view. H 1 estimation theory has been recently introduced as a method for designing lters that have acceptable performance in the face of model uncertainty and lack of statistical information on the exogenous signals. The approach may therefore be attractive for channel equalization problems where rapi...

The principle of maximum information preservation has been successfully used to derive learning algorithms for self-organizing neural networks. In this paper, we state and apply the corresponding principle for supervised networks: the principle of minimum information loss. We do not propose a new learning algorithm, but rather a pruning algorithm which works to achieve minimum information loss ...

Recently, it was shown that excellent results can be achieved in both face landmark localization and pose-invariant face recognition. These breakthroughs are attributed to the efforts of the community to manually annotate facial images in many different poses and to collect 3D faces data. In this paper, we propose a novel method for joint face landmark localization and frontal face reconstructi...

Let P be a simple polyhedron, possibly non-convex, whose boundary is composed of n triangular faces, and in which each face has an associated positive weight. The cost of travel through each face is the distance traveled multiplied by the face's weight. We present an-approximation algorithm for computing a weighted shortest path on P, i.e. the ratio of the length of the computed path with respe...

Extended Abstract Summary: A convex quadrangulation with respect to a point set S is a planar subdivision whose vertices are the points of S, where the boundary of the unbounded outer face is the boundary of the convex hull of S, and every bounded interior face is convex and has four points from S on its boundary. A minimum weight convex quadrangulation with respect to S is a convex quadrangula...

Given an edge-weighted undirected graph and a list of k source-sink pairs of vertices, the well-known minimum multicut problem consists in selecting a minimum-weight set of edges whose removal leaves no path between every source and its corresponding sink. We give the first polynomial-time algorithm to solve this problem in planar graphs, when k is fixed. Previously, this problem was known to r...