The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we developed a KANSEI communication system between human and robot based on emotional synchronization to human emotional state using facial expression recognition. And we conducted experiments to evaluate the effectiveness of the proposed system. The robot recognizes human emotion through their facial expressions, and synchronizes its own emotion with the recognized emotion dynamically...
This paper presents a novel method to describe local texture features based on triangle patterns. Different from traditional algorithms, this method is not limited to the symmetrical and neighbored pixels, and can extract information between the pixels of different locations, with flexible expression. We apply it to face recognition, and the performance and validity of the proposed method is also...
This paper presents an automatic people counting system based on face detection, where the number of people passing through a gate or door is counted by setting a video camera. The basic idea is to first use the frame difference to detect the rough edges of moving people and then use the chromatic feature to locate the people face. Based on NCC (Normalized Color Coordinates) color space, the initial...
When there is no sufficient labeled instances, supervised dimensionality reduction methods tend to perform poorly due to overfitting. In such cases, unlabeled instances are used to improve the performance. In this paper, we propose a dimensionality reduction method called semi-supervised TransductIve Discriminant Analysis (TIDA) which preserves the global and geometrical structure of the unlabeled...
Recent development in the field of face detection highlights the benefits from large scale training samples, which can be cheaply collected through Internet. However, these large training sets are usually constructed in a rather arbitrary manner. In this paper, we empirically investigate the fundamental question of how the training set effects the performance of a given state of the art face detector...
Among others, spoofing with photos is one of the most common manner to intrude a face recognition system. In this paper, we presents a novel method to deal with this problem, based on the observation that the difference between a photo and a real face usually leads to different distribution behavior in the frequency domain. In particular, we propose to first use a DoG (difference of Gaussian) filter...
Beauty is an abstract concept. How to quantify and evaluate beauty has always been a major concern among people. But few people adopt the way based on image processing and pattern recognition to assess beauty. For the first time, this paper proposed a way using computer image processing and pattern recognition for beauty assessment, and proposed a method based on the beauty- related feature points...
Kernel Fisher discriminant analysis (KFDA) has achieved great success in pattern recognition recently. However, the training process of KFDA is too time consuming (even intractable) for a large training set, because, for a training set with n examples, both its between-class and within-class scatter matrices are of n times n and the time complexity of the KFDA training process is of O(n3). Aiming...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.