SearcharxivSearch

arXiv subjects

Bruno Sauvalle

Publications and source records attributed to Bruno Sauvalle.

5 recordsLinked to original sources

Hybrid diffusion models: combining supervised and generative pretraining for label-efficient fine-tuning of segmentation models

We are considering in this paper the task of label-efficient fine-tuning of segmentation models: We assume that a large labeled dataset is available and allows to train an accurate segmentation model in one domain, and that we have to adapt this model on a related domain where only a few samples are available. We observe that this adaptation can be done using two distinct methods: The first method, supervised pretraining, is simply to take the model trained on the first domain using classical supervised learning, and fine-tune it on the second domain with the available labeled samples. The second method is to perform self-supervised pretraining on the first domain using a generic pretext task in order to get high-quality representations which can then be used to train a model on the second domain in a label-efficient way. We propose in this paper to fuse these two approaches by introducing a new pretext task, which is to perform simultaneously image denoising and mask prediction on the first domain. We motivate this choice by showing that in the same way that an image denoiser conditioned on the noise level can be considered as a generative model for the unlabeled image distribution using the theory of diffusion models, a model trained using this new pretext task can be considered as a generative model for the joint distribution of images and segmentation masks under the assumption that the mapping from images to segmentation masks is deterministic. We then empirically show on several datasets that fine-tuning a model pretrained using this approach leads to better results than fine-tuning a similar model trained using either supervised or unsupervised pretraining only.

cs.CV

Unsupervised Multi-object Segmentation Using Attention and Soft-argmax

We introduce a new architecture for unsupervised object-centric representation learning and multi-object detection and segmentation, which uses a translation-equivariant attention mechanism to predict the coordinates of the objects present in the scene and to associate a feature vector to each object. A transformer encoder handles occlusions and redundant detections, and a convolutional autoencoder is in charge of background reconstruction. We show that this architecture significantly outperforms the state of the art on complex synthetic benchmarks.

cs.CV

Autoencoder-based background reconstruction and foreground segmentation with background noise estimation

Even after decades of research, dynamic scene background reconstruction and foreground object segmentation are still considered as open problems due various challenges such as illumination changes, camera movements, or background noise caused by air turbulence or moving trees. We propose in this paper to model the background of a frame sequence as a low dimensional manifold using an autoencoder and compare the reconstructed background provided by this autoencoder with the original image to compute the foreground/background segmentation masks. The main novelty of the proposed model is that the autoencoder is also trained to predict the background noise, which allows to compute for each frame a pixel-dependent threshold to perform the foreground segmentation. Although the proposed model does not use any temporal or motion information, it exceeds the state of the art for unsupervised background subtraction on the CDnet 2014 and LASIESTA datasets, with a significant improvement on videos where the camera is moving. It is also able to perform background reconstruction on some non-video image datasets.

cs.CV

A criterion for the differential flatness of a nonlinear control system

Let's consider a control system described by the implicit equation $F(x,\dot x) = 0$. If this system is differentially flat, then the following criterion is satisfied : For some integer $r$, there exists a function $φ(y_0, y_1, ..,y_r)$ satisfying the following conditions: (1) The map $(y_0,..,y_{r+1}) \mapsto ( φ( y_0, y_1, ..,y_r), \frac {\partial φ}{\partial y_0}y_1 +\frac {\partial φ}{\partial y_1}y_2+ ..+ \frac {\partial φ}{\partial y_r} y_{r+1})$ is a submersion on the variety $F(x,p) = 0$. (2) The map $y_0 \mapsto x_0 = φ(y_0,0,..,0)$ is a diffeomorphism on the equilibrium variety $F(x,0) = 0$.

math.OC

On weak Mellin transforms, second degree characters and the Riemann hypothesis

We say that a function f defined on R or Qp has a well defined weak Mellin transform (or weak zeta integral) if there exists some function $M\_f(s)$ so that we have $Mell(ϕ\star f,s) = Mell(ϕ,s)M\_f(s)$ for all test functions $ϕ$ in $C\_c^\infty(R^*)$ or $C\_c^\infty(Q\_p^*)$. We show that if $f$ is a non degenerate second degree character on R or Qp, as defined by Weil, then the weak Mellin transform of $f$ satisfies a functional equation and cancels only for $\Re(s) = 1/2$. We then show that if $f$ is a non degenerate second degree character defined on the adele ring $A\_Q$, the same statement is equivalent to the Riemann hypothesis. Various generalizations are provided.

math.NT