#### Filter Results:

- Full text PDF available (116)

#### Publication Year

1994

2017

- This year (19)
- Last 5 years (93)
- Last 10 years (133)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

#### Organism

Learn More

- Clément Farabet, Camille Couprie, Laurent Najman, Yann LeCun
- IEEE Transactions on Pattern Analysis and Machine…
- 2013

Scene labeling consists of labeling each pixel in an image with the category of the object it belongs to. We propose a method that uses a multiscale convolutional network trained from raw pixels to extract dense feature vectors that encode regions of multiple sizes centered on each pixel. The method alleviates the need for engineered features, and produces… (More)

- Camille Couprie, Clément Farabet, Laurent Najman, Yann LeCun
- ArXiv
- 2013

This work addresses multi-class segmentation of indoor scenes with RGB-D inputs. While this area of research has gained much attention recently, most works still rely on hand-crafted features. In contrast, we apply a multiscale convolutional network to learn features directly from the images and the depth information. We obtain state-of-the-art on the… (More)

- Laurent Najman, Michel Schmitt
- IEEE Trans. Pattern Anal. Mach. Intell.
- 1996

In a recent paper on morphological image segmentation [1], Najman and Schmitt introduce the powerful concept of edge dynamics. In this communication we show that the method that they propose to compute the edge dynamics gives erroneous results for certain spatial configurations, and we propose a new algorithm which always yields correct edge dynamics.

- Laurent Najman, Michel Couprie
- IEEE Transactions on Image Processing
- 2006

The level sets of a map are the sets of points with level above a given threshold. The connected components of the level sets, thanks to the inclusion relation, can be organized in a tree structure, that is called the component tree. This tree, under several variations, has been used in numerous applications. Various algorithms have been proposed in the… (More)

- Camille Couprie, Leo J. Grady, Laurent Najman, Hugues Talbot
- IEEE Transactions on Pattern Analysis and Machine…
- 2011

In this work, we extend a common framework for graph-based image segmentation that includes the graph cuts, random walker, and shortest path optimization algorithms. Viewing an image as a weighted graph, these algorithms can be expressed by means of a common energy function with differing choices of a parameter q acting as an exponent on the differences… (More)

- Clément Farabet, Camille Couprie, Laurent Najman, Yann LeCun
- ICML
- 2012

Scene parsing, or semantic segmentation, consists in labeling each pixel in an image with the category of the object it belongs to. It is a challenging task that involves the simultaneous detection, segmentation and recognition of all the objects in the image. The scene parsing method proposed here starts by computing a tree of segments from a graph of… (More)

- Laurent Najman, Michel Schmitt
- Signal Processing
- 1994

- Jean Cousty, Gilles Bertrand, Laurent Najman, Michel Couprie
- IEEE Transactions on Pattern Analysis and Machine…
- 2009

We study the watersheds in edge-weighted graphs. We define the watershed cuts following the intuitive idea of drops of water flowing on a topographic surface. We first establish the consistency of these watersheds: they can be equivalently defined by their "catchment basinsrdquo (through a steepest descent property) or by the "dividing linesrdquo separating… (More)

- David Menotti, Laurent Najman, Jacques Facon, Arnaldo de Albuquerque Araújo
- IEEE Trans. Consumer Electronics
- 2007

Histogram equalization (HE) has proved to be a simple and effective image contrast enhancement technique. However, it tends to change the mean brightness of the image to the middle level of the gray-level range, which is not desirable in the case of images from consumer electronics products. In the latter case, preserving the input brightness of the image… (More)

- Camille Couprie, Leo J. Grady, Laurent Najman, Hugues Talbot
- 2009 IEEE 12th International Conference on…
- 2009

In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, random walker, and shortest path optimization algorithms. Viewing an image as a weighted graph, these algorithms can be expressed by means of a common energy function with differing choices of a parameter q acting as an exponent on the differences between… (More)