Sébastien Bougleux

Sébastien Bougleux

Auto-generated profile, based on publicly available information

Sébastien Bougleux

Université Caen Normandie, ENSICAEN, CNRS, Normandie Univ, GREYC UMR 6072, F-14000 Caen, France

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 May 2008 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
AEAbderrahim Elmoataz
Abderrahim Elmoataz
Olivier LezorayOlivier Lezoray
Olivier Lezoray
SBSébastien Bougleux
Sébastien Bougleux
We introduce a nonlocal discrete regularization framework on weighted graphs of the arbitrary topologies for image and manifold processing. The approach considers the problem as a variational one, which consists of minimizing a weighted sum of two energy terms: a regularization one that uses a discrete weighted -Dirichlet energy and an approximation one. This is the discrete analogue of recent continuous Euclidean nonlocal regularization functionals. The proposed formulation leads to a family of simple and fast nonlinear processing methods based on the weighted -Laplace operator, parameterized by the degree of regularity, the graph structure and the graph weight function. These discrete processing methods provide a graph-based version of recently proposed semi-local or nonlocal processing methods used in image and mesh processing, such as the bilateral filter, the TV digital filter or the nonlocal means filter. It works with equal ease on regular 2-D and 3-D images, manifolds or any data. We illustrate the abilities of the approach by applying it to various types of images, meshes, manifolds, and data represented as graphs.

1 June 2019
Verified
Conference Paper
Closed access
XNXuan Son Nguyen
Xuan Son Nguyen
LBLuc Brun
Luc Brun
OLOlivier Lezoray
Olivier Lezoray
SBSebastien Bougleux
Sebastien Bougleux
This paper proposes a new neural network based on SPD manifold learning for skeleton-based hand gesture recognition. Given the stream of hand’s joint positions, our approach combines two aggregation processes on respectively spatial and temporal domains. The pipeline of our network architecture consists in three main stages. The first stage is based on a convolutional layer to increase the discriminative power of learned features. The second stage relies on different architectures for spatial and temporal Gaussian aggregation of joint features. The third stage learns a final SPD matrix from skeletal data. A new type of layer is proposed for the third stage, based on a variant of stochastic gradient descent on Stiefel manifolds. The proposed network is validated on two challenging datasets and shows state-of-the-art accuracies on both datasets.

1 January 2008
Verified
Book Chapter
Closed access
PDF file
GPGabriel Peyré
Gabriel Peyré
SBSébastien Bougleux
Sébastien Bougleux
LCLaurent Cohen
Laurent Cohen

1 February 2017 in Pattern Recognition Letters
Verified
Journal Article
Closed access
SBSébastien Bougleux
Sébastien Bougleux
LBLuc Brun
Luc Brun
VCVincenzo Carletti
Vincenzo Carletti
PFPasquale Foggia
Pasquale Foggia
BGBenoit Gauzere
Benoit Gauzere
MVMario Vento
Mario Vento

1 January 2011 in Inverse Problems and Imaging
Verified
Journal Article
Open access
PDF file
GPGabriel Peyré
Gabriel Peyré
SBSébastien Bougleux
Sébastien Bougleux
LCLaurent Cohen
Laurent Cohen
This article proposes a new framework to regularize imaging linear inverse problems using an adaptive non-local energy. A non-local graph is optimized to match the structures of the image to recover. This allows a better reconstruction of geometric edges and textures present in natural images. A fast algorithm computes iteratively both the solution of the regularization process and the non-local graph adapted to this solution. The graph adaptation is efficient to solve inverse problems with randomized measurements such as inpainting random pixels or compressive sensing recovery. Our non-local regularization gives state-of-the-art results for this class of inverse problems. On more challenging problems such as image super-resolution, our method gives results comparable to sparse regularization in a translation invariant wavelet frame.

28 August 2008 in International Journal of Computer Vision
Verified
Journal Article
Closed access
PDF file
SBSébastien Bougleux
Sébastien Bougleux
AEAbderrahim Elmoataz
Abderrahim Elmoataz
MMMahmoud Melkemi
Mahmoud Melkemi