Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Pierre-Yves Coulon

dblp:73/5795 · DBLP profile ↗
← Back
14ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 13Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 87% Hardware accelerators and domain-specific architectures · 13%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing
image segmentation
0.112007
Parallel Asynchronous Watershed Algorithm-Architecture · IEEE Trans. Parallel Distributed Syst. 2007
Image and video processing › image segmentation › region-based segmentation
watershed segmentation
0.112007
Parallel Asynchronous Watershed Algorithm-Architecture · IEEE Trans. Parallel Distributed Syst. 2007
Parallel and multicore computing › parallel algorithms › parallel algorithm design
asynchronous parallel algorithms
0.112007
Parallel Asynchronous Watershed Algorithm-Architecture · IEEE Trans. Parallel Distributed Syst. 2007
Parallel and multicore computing
parallel algorithms
0.112007
Parallel Asynchronous Watershed Algorithm-Architecture · IEEE Trans. Parallel Distributed Syst. 2007
Hardware accelerators and domain-specific architectures
algorithm-hardware co-design
0.012007
Parallel Asynchronous Watershed Algorithm-Architecture · IEEE Trans. Parallel Distributed Syst. 2007
YearPublicationVenuePosition
2010 Transferable Belief Model for hair mask segmentation
abstract
In this paper, we present a study of transferable belief model for automatic hair segmentation process. Firstly, we recall the transferable Belief Model. Secondly, we defined for the parameters which characterize hair (Frequency and Color) a Basic Belief assignment which represents the belief that a pixel was or not a hair pixel. Then we introduce a discounting function based on the distance to the face to increase the reliability of our sensors. At the end of this process, we segment the hair with a matting process. We compare the process with the logical fusion. Results are evaluated using semi-manual segmentation references.
Cédric Rousset, Pierre-Yves Coulon, Michèle Rombaut
ICIP2
2008 Open or Closed Mouth State Detection: Static Supervised Classification Based on Log-Polar Signature
Christian Bouvier, Alexandre Benoît, Alice Caplier, Pierre-Yves Coulon
ACIVS4
2008 Frequential and color analysis for hair mask segmentation
abstract
In this paper, we present an automatic method for hair segmentation. Our algorithm is divided into two steps. Firstly, we take information from frequential and color analysis in order to create binary masks as descriptor of the hair location. Secondly, we perform a 'matting treatment' which is a process to extract foreground object from an image. This approach is based on markers which positions are initialized from the fusion of frequential and color masks. At the end the matting treatment result is use to segment the hair. Results are evaluated using semi- manual segmentation references.
Cédric Rousset, Pierre-Yves Coulon
ICIP2
2007 Unsupervised Lips Segmentation Based on ROI Optimisation and Parametric Model
abstract
Lips segmentation is a very important step in many applications such as automatic speech reading, MPEG-4 compression, special effects, facial analysis and emotion recognition. In this paper, we present a robust method for unsupervised lips segmentation. First the color of the lips area is estimated using expectation maximization and a membership map of the lips is computed from the skin color distribution. The region of interest (ROI) is then found by automatic thresholding on the membership map. Given a mask of the ROI, we initialize a snake that is fitted on the upper and lower contour of the mouth by multi level gradient flow maximization. Finally to find the mouth corners and the final contour of the mouth, we use a parametric model composed of cubic curves and Bezier curves.
Christian Bouvier, Pierre-Yves Coulon, Xavier Maldague
ICIP (4)2
2007 Parallel Asynchronous Watershed Algorithm-Architecture
Bruno Galilée, Franck Mamalet, Marc Renaudin, Pierre-Yves Coulon
IEEE Trans. Parallel Distributed Syst.4
2006 Parametric models for facial features segmentation
Zakia Hammal, Nicolas Eveno, Alice Caplier, Pierre-Yves Coulon
Signal Process.4
2005 Statistical active model for mouth components segmentation
abstract
Mouth segmentation is an important issue which applies in many multimedia applications as speech reading, face synthesis, recognition or audiovisual communication. In this paper, we propose a method based on a statistical model of shape and appearance to detect the lips. To create the model, the outline of the lips and teeth has to be manually annotated with 30 key-points on a few visemes (450). Once the model has been trained on this set, it is used for segmentation. After a step to situate mouth corners, the goal is to find the parameters to fit the model to an unknown image. The originalities of this work are (a) an initialization step which broadly classify lip and skin pixels, (b) the mouth corners local model, and (c) the automatically extracted dynamic and static sampled-appearance which are well adapted to describe the mouth area and its components.
Pierre Gacon, Pierre-Yves Coulon, Gérard Bailly
ICASSP (2)2
2004 Accurate and quasi-automatic lip tracking
abstract
Lip segmentation is an essential stage in many multimedia systems such as videoconferencing, lip reading, or low-bit-rate coding communication systems. In this paper, we propose an accurate and robust quasi-automatic lip segmentation algorithm. First, the upper mouth boundary and several characteristic points are detected in the first frame by using a new kind of active contour: the "jumping snake." Unlike classic snakes, it can be initialized far from the final edge and the adjustment of its parameters is easy and intuitive. Then, to achieve the segmentation, we propose a parametric model composed of several cubic curves. Its high flexibility enables accurate lip contour extraction even in the challenging case of a very asymmetric mouth. Compared to existing models, it brings a significant improvement in accuracy and realism. The segmentation in the following frames is achieved by using an interframe tracking of the keypoints and the model parameters. However, we show that, with a usual tracking algorithm, the keypoints' positions become unreliable after a few frames. We therefore propose an adjustment process that enables an accurate tracking even after hundreds of frames. Finally, we show that the mean keypoints' tracking errors of our algorithm are comparable to manual points' selection errors.
Nicolas Eveno, Alice Caplier, Pierre-Yves Coulon
IEEE Trans. Circuits Syst. Video Technol.3
2003 Jumping snakes and parametric model for lip segmentation
abstract
Lip segmentation is an essential stage in many multimedia systems such as videoconferencing, lip reading, or low bit rate coding communication systems. In this paper, we propose an accurate and robust lip segmentation algorithm. First, the upper mouth boundary and several characteristic points are detected by using a new kind of active contour : the "jumping snake". Unlike classic snakes, it can be initialized far from the final edge and the adjustment of its parameters is easy and intuitive. In a second step, a parametric model composed of several cubic curves is fitted on the lips. This model is flexible enough to reproduce the specificities of very different lip shapes. Compared to existing models, it brings a significant accuracy and realism improvement.
Nicolas Eveno, Alice Caplier, Pierre-Yves Coulon
ICIP (2)3
2002 A parametric model for realistic lip segmentation
abstract
Lip segmentation is an essential stage in many multimedia systems such as videoconferencing, lip reading, or low bit rate coding communication systems. In this paper, we propose an accurate and robust lip segmentation algorithm. First, the mouth region and several characteristic points are detected by using "hybrid edges" (which combine colour and intensity information) and a priori knowledge about the lip morphology. Corners position, which is crucial, is provided by a coarse-to-fine process. Then, a parametric model is fitted on the lips. We consider that the lip boundary is composed of several independent cubic polynomial curves. It gives a low complexity global model that is flexible enough to reproduce the specificity of very different lip shapes. Compared to existing models, it brings a significant accuracy and realism improvement. Moreover, it ensures a robust convergence towards the edges because the different parts of the model are independent.
Nicolas Eveno, Alice Caplier, Pierre-Yves Coulon
ICARCV3
2002 Key points based segmentation of lips
abstract
Lip segmentation is an essential stage in many multimedia systems such as videoconferencing, lip reading, or low bit rate coding communication systems. We propose an accurate and robust lip segmentation algorithm. First, characteristic points are found by using "hybrid edges" (which combine color and intensity information) and a priori knowledge about the lip morphology. Corners position, which is crucial, is provided by a coarse-to-fine process. Then, a parametric model is fitted on the lips. We consider that the lip boundary is composed of several independent cubic polynomial curves. It gives a low complexity model that is flexible enough to reproduce the specificity of very different lip shapes. Compared to existing models, it brings a significant accuracy improvement. Moreover, it ensures a robust convergence towards the edges.
Nicolas Eveno, Alice Caplier, Pierre-Yves Coulon
ICME (2)3
2002 Watershed parallel algorithm for asynchronous processors array
abstract
A joint algorithm-architecture analysis leads to a new version of picture segmentation system adapted to multimedia mobile terminal constraints. The asynchronous processors network, with a granularity level of one processor per pixel, based on data flow model, takes less than 10 /spl mu/s to segment a SQCIF $88*72 pixels - image (about 2000 times faster than the classical sequential watershed algorithms). The main originality of the proposed algorithm is only one global synchronization point is needed in order to complete the segmentation transformation, instead of the three (or more) classical points: minima detection, labelization and flooding. Our system tends to cope with multimedia mobile phones constraints, i.e. real time computing circuit, low power. We have simulated and validated this system thanks to "SystemC" library; VHDL synchronous prototyping shows up results accordingly.
Bruno Galilée, Franck Mamalet, Marc Renaudin, Pierre-Yves Coulon
ICME (1)4
2001 New color transformation for lips segmentation
abstract
A robust pre-processing algorithm for lip segmentation is presented. We define a new transformation based on RGB color space: the chromatic curve map. It aims at increasing discrimination between lips and skin. It allows robust lips detection under non uniform lighting conditions and without any particular make-up. The motivation of the present work is to extract visual information for automatic speech recognition, videoconferencing and speaker's face synthesis under natural lighting conditions.
Nicolas Eveno, Alice Caplier, Pierre-Yves Coulon
MMSP3
1999 Automatic snakes for robust lip boundaries extraction
abstract
Active contours or snakes are widely used in object segmentation for their ability to integrate feature extraction and pixel candidate linking in a single energy minimizing process. But the sensitivity to parameters values and initialization is also a widely known problem. The performance of snakes can be enhanced by better initialization close to the desired solution. We present a fine mouth region of interest (ROI) extraction using gray level image and corresponding gradient information. We link this technique with an original snake method. The automatic snakes use spatially varying coefficients to remain along its evolution in a mouth-like shape. Our experimentations on a large image database prove its robustness regarding speakers change of the ROI mouth extraction and automatic snakes algorithms. The main application of our algorithms is video-conferencing.
Patrice Delmas, Pierre-Yves Coulon, Vincent Fristot
ICASSP2