Publication

Sequential Monte Carlo Video Text Segmentation

Publications associées (87)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Search for lepton flavor violating decays τ- → ℓ- π0, ℓ- η, ℓ- η′

Olivier Schneider, Chao Wang, Lei Zhang, Sun Hee Kim, Sanjeev Kumar, Jing Li

We have searched for lepton flavor violating semileptonic τ- decays using a data sample of 153.8 fb-1 accumulated with the Belle detector at the KEKB e+e- collider. For the six decay modes studied, the observed yield is compatible with the estimated backgr ...

2005

Power spectra of random spike fields and related processes

Andrea Ridolfi, Pierre Bremaud

This article reviews known results and contains new ones concerning the power spectra of large classes of signals and random fields driven by an underlying point process, such as spatial shot noises (with random impulse response and arbitrary basic station ...

2005

An Evaluation of Stratified Sampling of Microarchitecture Simulations

Babak Falsafi

Recent research advocates applying sampling to accelerate microarchitecture simulation. Simple random sampling offers accurate performance estimates (with a high quantifiable confidence) by taking a large number (e.g., 10,000) of short performance measurem ...

2004

Bounds on the k-neighborhood for locally uniformly sampled surfaces

Mark Pauly, Jean Jouve

Given a locally uniform sample set P of a smooth surface S. We derive upper and lower bounds on the number k of nearest neighbors of a sample point p that have to be chosen from P such that this neighborhood contains all restricted Delaunay neighbors of p. ...

Eurographics Association2004

Video Text Segmentation Using Particle Filters

Jean-Marc Odobez, Datong Chen

This paper presents a probabilistic algorithm for segmenting and recognizing text embedded in video sequences based on adaptive thresholding using a Bayes filtering method. The algorithm approximates the posterior distribution of segmentation thresholds of ...

IDIAP2003

Monte Carlo Video Text Segmentation

Jean-Marc Odobez, Datong Chen

This paper presents a probabilistic algorithm for segmenting text embedded in video based on Monte Carlo sampling. The algorithm approximates the posterior of segmentation thresholds of video text by a set of weighted samples, referred to as particles. The ...

IDIAP2003

Object Localization in Metric Spaces for Video Linking

Daniel Gatica-Perez

While objects often constitute the desired level of access for browsing and retrieval in video databases, an inherent problem for on-line object definition is that of model construction from a few examples. In this paper, we present a probabilistic methodo ...

IDIAP2003

Microelectrical impedance tomography for biophysical characterization of thin film biomaterials

Philippe Renaud, Olof Pontus Linderholm, Reto Bruno Schoch

We present a new method for measuring the electrical resistivities of a stratified sample of thin biomaterials or tissue layers. The presented technique makes use of impedance measurements between It pairs of electrodes separated by varying distances. The ...

2003

Object Localization in Metric Spaces for Video Linking

Daniel Gatica-Perez

2002

Sampling innovations

Pina Marziliano

Sampling theory has prospered extensively in the last century. The elegant mathematics and the vast number of applications are the reasons for its popularity. The applications involved in this thesis are in signal processing and communications and call out ...

EPFL2002