Hung Gia Hoang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Hung Gia Hoang has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Ba-Ngu Vo
School of Electrical Engineering, Computing and Mathematical Sciences, Curtin University, Bentley, WA, Australia
6 shared publications Hoang Duong Tuan
Sch. of Electr. Eng. & Telecommun., Univ. of New South Wales, Sydney, NSW, Australia
5 shared publications- Ba-Tuong Vo
School of Electrical Engineering, Computing and Mathematical Sciences, Curtin University, Bentley, WA, Australia
3 shared publications H.D. Tuan
School of Electrical Engineering and Telecommunication, University of New South Wales, UNSW Sydney, 2052, AUSTRALIA
3 shared publicationsTruong Q. Nguyen
Dept. of Electr. & Comput. Eng., Univ. of California in San Diego, La Jolla, CA, USA
3 shared publications- Hoang Duong Tuan
School of Electrical Engineering and Telecommunications, The University of New South Wales, Sydney, NSW 2052, Australia
2 shared publications
Latest Publications
- 4 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 61 (8) , 4475-4485
The Cauchy–Schwarz Divergence for Poisson Point Processes
In this paper, we extend the notion of Cauchy-Schwarz divergence to point processes and establish that the Cauchy-Schwarz divergence between the probability densities of two Poisson point processes is half the squared L2-distance between their intensity functions. Extension of this result to mixtures of Poisson point processes and, in the case where the intensity functions are Gaussian mixtures, closed form expressions for the Cauchy-Schwarz divergence are presented. Our result also implies that the Bhattacharyya distance between the probability distributions of two Poisson point processes is equal to the square of the Hellinger distance between their intensity measures. We illustrate the result via a sensor management application where the system states are modeled as point processes.
- 4 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 61 (8) , 4475-4485
The Cauchy–Schwarz Divergence for Poisson Point Processes
In this paper, we extend the notion of Cauchy-Schwarz divergence to point processes and establish that the Cauchy-Schwarz divergence between the probability densities of two Poisson point processes is half the squared L2-distance between their intensity functions. Extension of this result to mixtures of Poisson point processes and, in the case where the intensity functions are Gaussian mixtures, closed form expressions for the Cauchy-Schwarz divergence are presented. Our result also implies that the Bhattacharyya distance between the probability distributions of two Poisson point processes is equal to the square of the Hellinger distance between their intensity measures. We illustrate the result via a sensor management application where the system states are modeled as point processes.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 93-98
Sensor selection for multi-target tracking via closed form Cauchy-Schwarz divergence
In this paper, we present an novel sensor selection technique for multi-target tracking where the sensor selection criterion is the Cauchy-Schwarz divergence between the predicted and updated densities. The proposed approach is attractive in that the multi-target states are modeled as Poisson random finite sets (RFS) that allow the objective function to be calculated in closed form. Simulation results are presented to demonstrate the viability of the proposed approach.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 93-98
Sensor selection for multi-target tracking via closed form Cauchy-Schwarz divergence
In this paper, we present an novel sensor selection technique for multi-target tracking where the sensor selection criterion is the Cauchy-Schwarz divergence between the predicted and updated densities. The proposed approach is attractive in that the multi-target states are modeled as Poisson random finite sets (RFS) that allow the objective function to be calculated in closed form. Simulation results are presented to demonstrate the viability of the proposed approach.
- 1 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 46 (23730803) , 240-243
The Cauchy-Schwarz divergence for poisson point processes
Information theoretic divergences are fundamental tools used to measure the difference between the information conveyed by two random processes. In this paper, we show that the Cauchy-Schwarz divergence between two Poisson point processes is the half the squared L 2 -distance between their respective intensity functions. Moreover, this can be evaluated in closed form when the intensities are Gaussian mixtures.
- 1 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 46 (23730803) , 240-243
The Cauchy-Schwarz divergence for poisson point processes
Information theoretic divergences are fundamental tools used to measure the difference between the information conveyed by two random processes. In this paper, we show that the Cauchy-Schwarz divergence between two Poisson point processes is the half the squared L 2 -distance between their respective intensity functions. Moreover, this can be evaluated in closed form when the intensities are Gaussian mixtures.
- Open Access
- 1 April 2014
- Published by Elsevier in Automatica
- Vol. 50 (4) , 1135-1142
Sensor management for multi-target tracking via multi-Bernoulli filtering
- 1 April 2014
- Published by Elsevier in Automatica
- Vol. 50 (4) , 1135-1142
Open AccessSensor management for multi-target tracking via multi-Bernoulli filtering
- 1 November 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 7-12
Control of a mobile sensor for multi-target tracking using multi-target/object Multi-Bernoulli filter
In multi-object stochastic systems, the issue of sensor control is a theoretically and computationally challenging problem. In this paper, we present a novel random finite set (RFS) approach to the multi-target sensor management problem. Our approach is based on a partially observed Markov decision process (POMDP) where the reward function is a measure of information gain. The multi-target state is modelled as Multi-Bernoulli RFS, and the Multi-Bernoulli filter is used in conjunction with two different reward functions: maximizing the expected Rényi divergence between the predicted and updated densities, and minimizing the expected cardinality variance. Numerical studies and discussions are presented with range only measurements.
- 1 November 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 7-12
Control of a mobile sensor for multi-target tracking using multi-target/object Multi-Bernoulli filter
In multi-object stochastic systems, the issue of sensor control is a theoretically and computationally challenging problem. In this paper, we present a novel random finite set (RFS) approach to the multi-target sensor management problem. Our approach is based on a partially observed Markov decision process (POMDP) where the reward function is a measure of information gain. The multi-target state is modelled as Multi-Bernoulli RFS, and the Multi-Bernoulli filter is used in conjunction with two different reward functions: maximizing the expected Rényi divergence between the predicted and updated densities, and minimizing the expected cardinality variance. Numerical studies and discussions are presented with range only measurements.
- 4 August 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 58 (2) , 901-906
Optimized Analog Flat Filter Design
This paper proposes a systematic approach for the optimized design of analog filters, which includes all well-known classical analog filters as a special case. All specifications including the conventional ones and also filter flatness degrees are explicitly incorporated into design process. Several numerical examples are presented to demonstrate the efficiency and flexibility of the proposed method.
- 4 August 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 58 (2) , 901-906
Optimized Analog Flat Filter Design
This paper proposes a systematic approach for the optimized design of analog filters, which includes all well-known classical analog filters as a special case. All specifications including the conventional ones and also filter flatness degrees are explicitly incorporated into design process. Several numerical examples are presented to demonstrate the efficiency and flexibility of the proposed method.
- 1 April 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3225-3228
Analog flat filter design
This paper proposes a systematic approach for the design of a general class of analog infinite-impulse-response (IIR) filters, which includes all well-known classical analog filters as a special case. All specifications including the conventional ones and also filter flatness degrees are explicitly incorporated into design process. Several numerical examples are presented to demonstrate the efficiency and flexibility of the proposed method.
- 1 April 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3225-3228
Analog flat filter design
This paper proposes a systematic approach for the design of a general class of analog infinite-impulse-response (IIR) filters, which includes all well-known classical analog filters as a special case. All specifications including the conventional ones and also filter flatness degrees are explicitly incorporated into design process. Several numerical examples are presented to demonstrate the efficiency and flexibility of the proposed method.
- 22 December 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 53 (11) , 2669-2673
A Lyapunov Variable-Free KYP Lemma for SISO Continuous Systems
This technical note proposes a novel frequency-selective Kalman-Yakubovich-Popov (FS-KYP) lemma for analysis of single-input single-output (SISO) continuous systems. In contrast to existing approaches, the proposed method only uses a minimal number of variables due to the absence of Lyapunov variables in semidefinite programming (SDP) formulation. The SDP formulation is extended to polytopic uncertain systems also without any additional variable and yields an efficient method for computation of the H infin gain for polytopic systems. The viability of the proposed method are demonstrated through several numerical examples.
- 22 December 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 53 (11) , 2669-2673
A Lyapunov Variable-Free KYP Lemma for SISO Continuous Systems
This technical note proposes a novel frequency-selective Kalman-Yakubovich-Popov (FS-KYP) lemma for analysis of single-input single-output (SISO) continuous systems. In contrast to existing approaches, the proposed method only uses a minimal number of variables due to the absence of Lyapunov variables in semidefinite programming (SDP) formulation. The SDP formulation is extended to polytopic uncertain systems also without any additional variable and yields an efficient method for computation of the H infin gain for polytopic systems. The viability of the proposed method are demonstrated through several numerical examples.
- 7 November 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 57 (3) , 956-965
Frequency-Selective KYP Lemma, IIR Filter, and Filter Bank Design
For a transfer function F(ejomega) of order n , Kalman-Yakubovich-Popov (KYP) lemma characterizes a general intractable semi-infinite programming (SIP) condition by a tractable semidefinite programming (SDP) for the entire frequency range. Some recent results generalize this lemma for a certain frequency interval. All these SDP characterizations are given at the expense of the introduced Lyapunov matrix variable of dimension ntimesn. Consequently, formulation and design of high dimensional problem is challenging. Moreover, existing SDP characterizations for frequency-selective SIP (FS-SIP) do not allow to formulate synthesis problems as SDPs. In this paper, we propose a completely new SDP characterization of general FS-SIP involving SDPs of moderate size and free from Lyapunov variables. Furthermore, a systematic IIR filter and filter bank design is developed in a similar vein, with several simulations provided to validate the effectiveness of our SDP formulation.
- 7 November 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 57 (3) , 956-965
Frequency-Selective KYP Lemma, IIR Filter, and Filter Bank Design
For a transfer function F(ejomega) of order n , Kalman-Yakubovich-Popov (KYP) lemma characterizes a general intractable semi-infinite programming (SIP) condition by a tractable semidefinite programming (SDP) for the entire frequency range. Some recent results generalize this lemma for a certain frequency interval. All these SDP characterizations are given at the expense of the introduced Lyapunov matrix variable of dimension ntimesn. Consequently, formulation and design of high dimensional problem is challenging. Moreover, existing SDP characterizations for frequency-selective SIP (FS-SIP) do not allow to formulate synthesis problems as SDPs. In this paper, we propose a completely new SDP characterization of general FS-SIP involving SDPs of moderate size and free from Lyapunov variables. Furthermore, a systematic IIR filter and filter bank design is developed in a similar vein, with several simulations provided to validate the effectiveness of our SDP formulation.
- 7 November 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 57 (3) , 944-955
Optimized Analog Filter Designs With Flat Responses by Semidefinite Programming
Analog filters constitute indispensable components of analog circuits. Inspired by recent advances in digital filter design, this paper provides a flexible design for analog filters. All-pole filters have maximally flat passband, so our design minimizes their passband distortion. Analogously, maximally flat filters have maximally flat passband, so our design maximizes their stopband attenuation. Its particular cases provide flexible alternatives to the classical counterparts. Semidefinite program (SDP) formulations for the posed filter design problems are presented, which are efficiently solved by existing optimization software. Several examples and comparisons are provided to validate the viability of our design.
- 7 November 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 57 (3) , 944-955
Optimized Analog Filter Designs With Flat Responses by Semidefinite Programming
Analog filters constitute indispensable components of analog circuits. Inspired by recent advances in digital filter design, this paper provides a flexible design for analog filters. All-pole filters have maximally flat passband, so our design minimizes their passband distortion. Analogously, maximally flat filters have maximally flat passband, so our design maximizes their stopband attenuation. Its particular cases provide flexible alternatives to the classical counterparts. Semidefinite program (SDP) formulations for the posed filter design problems are presented, which are efficiently solved by existing optimization software. Several examples and comparisons are provided to validate the viability of our design.