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

Dinh-Tuan Pham

dblp:p/DTPham · also Antoine Dinh-Tuan Pham · DBLP profile ↗
← Back
18ranked-venue papers
8as first author
0since 2021 · last 2011
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 12 · 6 first-authorArtificial intelligence and machine learning · 3 · 1 first-authorTheory of computation · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 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 graphics and multimedia
2 papers
Audio and music processing · 100%
Theoretical computer science
1 paper
Information theory · 100%
Artificial intelligence
1 paper
3D vision · 67% Reinforcement learning · 33%

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

TopicWeightPapersLastEvidence papers
Audio and music processing › source separation
blind source separation
0.112007
Mixing and Non-Mixing Local Minima of the Entropy Contrast for Blind Source Separation · IEEE Trans. Inf. Theory 2007
Information theory › signal processing
blind source separation
0.012002
Mutual information approach to blind separation of stationary sources · IEEE Trans. Inf. Theory 2002
Information theory
mutual information analysis
0.012002
Mutual information approach to blind separation of stationary sources · IEEE Trans. Inf. Theory 2002
Information theory › probability theory › stochastic processes
stationary processes
0.012002
Mutual information approach to blind separation of stationary sources · IEEE Trans. Inf. Theory 2002
Computer vision › 3D vision
camera pose estimation
0.011993
Optimal estimation of object pose from a single perspective view · ICCV 1993
Computer vision › 3D vision
object pose estimation
0.011993
Optimal estimation of object pose from a single perspective view · ICCV 1993
Machine learning › Reinforcement learning › policy optimization
trust region methods
0.011993
Optimal estimation of object pose from a single perspective view · ICCV 1993
Audio and music processing
noise cancellation
0.011990
Estimating the order of a FIR filter for noise cancellation · IEEE Trans. Inf. Theory 1990

Methods — techniques the papers use, named apart from their topics

taylor expansion · 0.1entropy approximation · 0.1mutual information contrast · 0.0estimating equations · 0.0trust region optimization · 0.0dual number quaternion · 0.0noise reduction criterion · 0.0covariance matrix estimation · 0.0
YearPublicationVenuePosition
2011 On the probability distribution of a moving target. Asymptotic and non-asymptotic results
Mathieu Chouchane, Sébastien Paris, François Le Gland, Christian Musso, Dinh-Tuan Pham
FUSION5
2010 On optimal orthogonal transforms at high bit-rates using only second order statistics in multicomponent image coding with JPEG2000
Isidore Paul Akam Bita, Michel Barret, Dinh-Tuan Pham
Signal Process.3
2010 On optimal transforms in lossy compression of multicomponent images with JPEG2000
Isidore Paul Akam Bita, Michel Barret, Dinh-Tuan Pham
Signal Process.3
2008 ICA based algorithms for computing optimal 1-D linear block transforms in variable high-rate source coding
Michel Narozny, Michel Barret, Dinh-Tuan Pham
Signal Process.3
2007 Minimum range approach to blind partial simultaneous separation of bounded sources: Contrast and discriminacy properties
Frédéric Vrins, Dinh-Tuan Pham
Neurocomputing2
2007 Generalized mutual information approach to multichannel blind deconvolution
Dinh-Tuan Pham
Signal Process.1
2007 Mixing and Non-Mixing Local Minima of the Entropy Contrast for Blind Source Separation
abstract
In this paper, both non-mixing and mixing local minima of the entropy are analyzed from the viewpoint of blind source separation (BSS); they correspond respectively to acceptable and spurious solutions of the BSS problem. The contribution of this work is twofold. First, a Taylor development is used to show that the exact output entropy cost function has a non-mixing minimum when this output is proportional to any of the non-Gaussian sources, and not only when the output is proportional to the lowest entropic source. Second, in order to prove that mixing entropy minima exist when the source densities are strongly multimodal, an entropy approximator is proposed. The latter has the major advantage that an error bound can be provided. Even if this approximator (and the associated bound) is used here in the BSS context, it can be applied for estimating the entropy of any random variable with multimodal density
Frédéric Vrins, Dinh-Tuan Pham, Michel Verleysen
IEEE Trans. Inf. Theory2
2006 Discriminacy of the minimum range approach to blind separation of bounded sources
Dinh-Tuan Pham, Frédéric Vrins
ESANN1
2005 Criteria based on mutual information minimization for blind source separation in post nonlinear mixtures
Sophie Achard, Dinh-Tuan Pham, Christian Jutten
Signal Process.2
2005 Fast approximation of nonlinearities for improving inversion algorithms of PNL mixtures and Wiener systems
Jordi Solé i Casals, Christian Jutten, Dinh-Tuan Pham
Signal Process.3
2005 Entropy of a variable slightly contaminated with another
abstract
This work provides the expansion up to second order of the (differential) entropy of a random variable contaminated with another small variable. It is motivated by the blind source separation problem, in which it is of interest to consider the entropy of a mixture of random variables and study how it changes with respect to the mixing proportions.
Dinh-Tuan Pham
IEEE Signal Process. Lett.1
2005 Local minima of information-theoretic criteria in blind source separation
abstract
Recent simulation results have indicated that spurious minima in information-theoretic criteria with an orthogonality constraint for blind source separation may exist. Nevertheless, those results involve approximations (e.g., density estimation), so that they do not constitute an absolute proof. In this letter, the problem is tackled from a theoretical point of view. An example is provided for which it is rigorously proved that spurious minima can exist in both mutual information and negentropy optima. The proof is based on a Taylor expansion of the entropy.
Dinh-Tuan Pham, Frédéric Vrins
IEEE Signal Process. Lett.1
2004 Flexible parametrization of postnonlinear mixtures model in blind sources separation
abstract
This letter introduces a flexible parametrization for the nonlinear compensator in the postnonlinear mixture model. The idea is to parametrize not the compensator but a set of quantiles of the distribution of its output. They are specified by the density-quantiles which are parametrized through a spline basis. Good results can be achieved with only a few splines.
Dinh-Tuan Pham
IEEE Signal Process. Lett.1
2002 Mutual information approach to blind separation of stationary sources
abstract
This paper presents a unified approach to the problem of blind separation of sources, based on the concept of mutual information. This concept is applied to the whole source sequences as stationary processes and thus provides a universal contrast applicable to both the instantaneous and convolutive mixture cases. For practical implementation, we introduce several degraded forms of this contrast, computable from a finite-dimensional distribution of the reconstructed source processes only. From them, we derive several sets of estimating equations, generalizing those considered earlier.
Dinh-Tuan Pham
IEEE Trans. Inf. Theory1
2001 Image segmentation using probabilistic fuzzy c-means clustering
abstract
A new approach for gray-level image segmentation is presented using a probabilistic fuzzy c-means clustering algorithm. This approach combines the spatial probabilistic information and the fuzzy membership function in the clustering process. The proposed probabilistic fuzzy c-means method can deal effectively with image segmentation in a noisy environment.
Dinh-Tuan Pham
ICIP (1)1
2001 Blind separation of instantaneous mixture of sources via the Gaussian mutual information criterion
Dinh-Tuan Pham
Signal Process.1
1993 Optimal estimation of object pose from a single perspective view
abstract
The authors present a method for robustly and accurately estimating the rotation and translation between a camera and a 3-D object from point and line correspondences. First they devise an error function and then show how to minimize this error function. The quadratic nature of this function is made possible by representing rotation and translation with a dual number quaternion. A detailed account is provided of the computational aspects of a trust-region optimization method. This method compares favourably with Newton's method, which has extensively been used to solve the problem, and with Faugeras-Toscani's linear method (1986) for calibrating a camera. Some experimental results are presented which demonstrate the robustness of the method with respect to image noise and matching errors.>
Thai Quynh Phong, Radu Horaud, Adnan Yassine, Dinh-Tuan Pham
ICCV4
1990 Estimating the order of a FIR filter for noise cancellation
abstract
The problem of designing a finite impulse response filter devoted to the joint process problem, and in particular to noise cancellation, is investigated. The goal is restricted to how to choose an optimal order of the FIR filter. The analysis is based on the maximization of a noise reduction criterion which is in fact perfectly matched to the desired performance, namely the minimization of residuals. The criterion includes estimation errors introduced by the substitution of the true covariance matrices for estimates. Since true covariance matrices again enter the noise reduction criterion, they must be replaced by estimates. The criterion is then modified in order to take this fact into account, but the scheme is not iterated any further. Simulations are presented for various simple cases.>
Pierre Comon, Dinh-Tuan Pham
IEEE Trans. Inf. Theory2