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

Hung Gia Hoang

dblp:84/7050 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2015
0000-0002-3058-3484ORCID · verified

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorTheory of computation · 1 · 1 first-author

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.

Theoretical computer science
1 paper
Information theory · 100%
Computer networks
1 paper
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › information measures
divergence measures
0.212015
The Cauchy-Schwarz Divergence for Poisson Point Processes · IEEE Trans. Inf. Theory 2015
Information theory › probability theory › stochastic processes
point processes
0.212015
The Cauchy-Schwarz Divergence for Poisson Point Processes · IEEE Trans. Inf. Theory 2015
Information theory › probability theory › stochastic processes › point processes
poisson point process
0.212015
The Cauchy-Schwarz Divergence for Poisson Point Processes · IEEE Trans. Inf. Theory 2015
Internet of things and sensor networks › wireless sensor network
sensor management
0.112015
The Cauchy-Schwarz Divergence for Poisson Point Processes · IEEE Trans. Inf. Theory 2015

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

hellinger distance · 0.4bhattacharyya distance · 0.4gaussian mixtures · 0.2gaussian mixture · 0.2
YearPublicationVenuePosition
2015 A fast implementation of the generalized labeled multi-Bernoulli filter with joint prediction and update
Hung Gia Hoang, Ba-Tuong Vo, Ba-Ngu Vo
FUSION1
2015 The Cauchy-Schwarz Divergence for Poisson Point Processes
abstract
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.
Hung Gia Hoang, Ba-Ngu Vo, Ba-Tuong Vo, Ronald Paxton-Sheets Mahler
IEEE Trans. Inf. Theory1
2009 Analog flat filter design
abstract
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.
Hung Gia Hoang, Hoang Duong Tuan, Truong Q. Nguyen
ICASSP1
2007 Frequency Selective KYP Lemma and its Applications to IIR Filter Bank Design
abstract
For a transfer function/filter F(ejω) of order n, Kalman-Yakubovich-Popov (KYP) lemma characterizes the intractable semi-infinite programming (SIP) condition F(e-jω)1 Θ [F(ejω)1]T≥ 0 ∀ ω in frequency domain by a tractable semi-definite programming (SDP) in state-space domain. Some recent results generalize this lemma to SDP for SIP of frequency selectivity (FS-SIP). All these SDP characterizations are given at the expense of the introduced Lyapunov matrix variable of dimension n × n, making them impractical for high order problem. Moreover, the existing SDP characterizations for FS-SIP do not allow to formulate synthesis/design problems as SDPs. In this paper, we propose a completely new SDP characterization of general FS-SIP, which is of moderate size and is free from Lyapunov variables. Extensive examples are provided to validate the effectiveness of our result.
Hung Gia Hoang, Hoang Duong Tuan, Truong Q. Nguyen
ICASSP (3)1