Duc-Son Pham

Prof. Dr. Duc-Son Pham

orcid

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

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

Representative Publications

View All Publications
2 December 2012 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
PDF file
DPDuc-Son Pham
Duc-Son Pham
SVSvetha Venkatesh
Svetha Venkatesh
MLMihai Lazarescu
Mihai Lazarescu
SBSaha Budhaditya
Saha Budhaditya

4 December 2014 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
DPDuc-Son Pham
Duc-Son Pham
Ognjen ArandjelovicOgnjen Arandjelovic
Ognjen Arandjelovic
SVSvetha Venkatesh
Svetha Venkatesh
Dynamically changing background (dynamic background) still presents a great challenge to many motion-based video surveillance systems. In the context of event detection, it is a major source of false alarms. There is a strong need from the security industry either to detect and suppress these false alarms, or dampen the effects of background changes, so as to increase the sensitivity to meaningful events of interest. In this paper, we restrict our focus to one of the most common causes of dynamic background changes: (1) that of swaying tree branches and (2) their shadows under windy conditions. Considering the ultimate goal in a video analytics pipeline, we formulate a new dynamic background detection problem as a signal processing alternative to the previously described but unreliable computer vision-based approaches. Within this new framework, we directly reduce the number of false alarms by testing if the detected events are due to characteristic background motions. In addition, we introduce a new data set suitable for the evaluation of dynamic background detection. It consists of real-world events detected by a commercial surveillance system from two static surveillance cameras. The research question we address is whether dynamic background can be detected reliably and efficiently using simple motion features and in the presence of similar but meaningful events, such as loitering. Inspired by the tree aerodynamics theory, we propose a novel method named local variation persistence (LVP), that captures the key characteristics of swaying motions. The method is posed as a convex optimization problem, whose variable is the local variation. We derive a computationally efficient algorithm for solving the optimization problem, the solution of which is then used to form a powerful detection statistic. On our newly collected data set, we demonstrate that the proposed LVP achieves excellent detection results and outperforms the best alternative adapted from existing art in the dynamic background literature.

31 December 2015
Verified
Book Chapter
Closed access
PDF file
SPStefan Prandl
Stefan Prandl
MLMihai Lazarescu
Mihai Lazarescu
DPDuc-Son Pham
Duc-Son Pham

14 March 2008 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
DPDuc-Son Pham
Duc-Son Pham
AZAbdelhak M. Zoubir
Abdelhak M. Zoubir
In contrast to the assumption of perfect observations by a number of developed methods for the analysis of nonstationary signals, missing observations do occur in practice which lead to performance degradation. We consider the parameter estimation problem of multicomponent polynomial phase signals (PPS) when there are randomly missing observations. The derivation shows that the Cramer-Rao bound for the missing observations case can be readily obtained from the result of perfect observations. Then, we propose an expectation-maximization-based method to estimate the PPS parameters. Simulation results show that the proposed method approaches the Cramer-Rao bound at moderate to high signal-to-noise ratios whilst standard techniques fail when there is a fair amount of missing observations.

1 March 2015 in Annals of Data Science
Verified
Journal Article
Closed access
PDF file
VNVu Nguyen
Vu Nguyen
DPDinh Phung
Dinh Phung
DPDuc-Son Pham
Duc-Son Pham
SVSvetha Venkatesh
Svetha Venkatesh

20 December 2004 in IEEE Signal Processing Letters
Verified
Journal Article
Closed access
DPDuc-Son Pham
Duc-Son Pham
AZA.M. Zoubir
A.M. Zoubir
A sequential M-estimation algorithm is proposed as an alternative to sequential least squares (LS). Being an approximation to exact M-estimation, the proposed technique is robust to non-Gaussian noise and outperforms sequential LS. A low-cost technique is introduced for initialization. We also show that sequential LS is a special case of the proposed algorithm.