The de facto algorithm for facial landmark estimation involves running a face detector with a subsequent deformable model fitting on the bounding box. This encompasses two basic problems: i) the detection and deformable fitting steps are performed independently, while the detector might not provide best-suited initialisation for the fitting step, ii) the face appearance varies hugely across dif...

To dynamically detect the facial landmarks in the video, we propose a novel hybrid framework termed as detection-tracking-detection (DTD). First, the face bounding box is achieved from the first frame of the video sequence based on a traditional face detection method. Then, a landmark detector detects the facial landmarks, which is based on a cascaded deep convolution neural network (DCNN). Nex...

Group photos are one of the most common types of digital images found in personal image collections and on social networks. One typical post-processing task for group photos is to produce a key or legend to identify the people in the photo. This is most often done using simple bounding boxes. A more professional approach is to create a picture legend that uses either a full or partial silhouett...

In this paper we present an algorithm for face detection that is based on generic local descriptors (e.g. eyes). A generic descriptor captures the distribution of individual descriptors over a set of samples (training images). This distribution is assumed to be a Gaussian mixture model and is learnt using the minimum description length principle (MDL). A descriptor of an unknown image may then ...

Perceptual user interfaces will require the detection, tracking, and recognition of faces and other body and facial features. This paper introduces a robust, accurate, and low cost real-time solution for the eye and face detection problem. The method uses two infra-red illumination sources to generate bright and dark pupil images, which are combined to robustly detect pupils. Once the pupils ar...

We show that every set of n points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in general position has a minimum pseudo-triangulation whose maximum face degree is four (i.e. each interior face of this pseudo-triangulation has at most four vertices). Both degree bounds are tight. Minimum pseudo-trian...