|
Disclaimer:
This material is presented to ensure timely dissemination of
scholarly and technical work. Copyright and all rights therein are
retained by authors or by other copyright holders. All person copying
this information are expected to adhere to the terms and constraints
invoked by each author's copyright. In most cases, these works may not
be reposted without the explicit permission of the copyright holder.
Journal:
- V. Cevher,
R. Velmurugan, and J. H. McClellan, “Acoustic multi target tracking
using direction-of-arrival batches,”
IEEE Transactions on Signal Processing,
vol. 55, no. 6, pp. 2810-2825, June 2007.
Abstract
BiBTeX Paper:
PDF
In
this paper, we propose a particle filter acoustic
direction-of-arrival (DOA) tracker to track multiple
maneuvering targets using a state space approach. The
particle filter determines its state vector using a batch of
DOA estimates. The filter likelihood treats the observations
as an image, using template models derived from the state
update equation, and also incorporates the possibility of
missing data as well as spurious DOA observations. The
particle filter handles multiple targets, using a
partitioned state-vector approach. The particle filter
solution is compared with three other methods: the extended
Kalman filter, Laplacian filter, and another particle filter
that uses the acoustic microphone outputs directly. We
discuss the advantages and disadvantages of these methods
for our problem. In addition, we also demonstrate an
autonomous system for multiple target DOA tracking with
automatic target initialization and deletion. The
initialization system uses a track-before-detect approach
and employs the matching pursuit idea to initialize multiple
targets. Computer simulations are presented to show the
performances of the algorithms.
@article{IEEE_TSP_Cevher_MMT, author = "V.
Cevher and R. Velmurugan and J. H. McClellan", title = "Acoustic
multi target tracking using direction-of-arrival batches", journal = "IEEE
Transactions on Signal Processing", volume = "55", number = "6", pages = "2810--2825", year = "June 2007",}
- V. Cevher,
A. Sankaranarayanan, J. H. McClellan, and R. Chellappa, “Target
tracking using a joint acoustic video system,”
IEEE
Transactions on Multimedia,
vol. 9, no. 4, pp. 715-727, June 2007.
Abstract
BiBTeX Paper:
PDF
In this paper, we present a particle filter that exploits
multi modal information for robust target tracking. We
demonstrate a Bayesian framework for combining acoustic and
video information using a state space approach. A proposal
strategy for joint acoustic and video state-space tracking
using particle filters is given by carefully placing the
random support of the joint filter where the final posterior
is likely to lie. By using the Kullback-Leibler divergence
measure, it is shown that the joint filter posterior
estimate decreases the worst case divergence of the
individual modalities. Hence, the joint tracking filter is
robust against video and acoustic occlusions. We also
introduce a time-delay variable to the joint state space to
handle the acoustic-video data synchronization issue, caused
by acoustic propagation delay. Computer simulations are
presented with field and synthetic data to demonstrate the
filter’s performance.
@article{IEEE_MM05_Cevher, author = "V.
Cevher and A. Sankaranarayanan and J. H. McClellan and R.
Chellappa", title = "Target tracking using a
joint acoustic video system", journal = "IEEE
Transactions on Multimedia", volume = "9", number = "4", pages = "715--727", year = "June 2007",}
- M. Alam, V.
Cevher, J. H. McClellan, G. D. Larson, and W. R. Scott Jr. “Optimal
maneuvering of seismic sensors for localization of subsurface
targets,”
IEEE
Transactions on Geoscience and Remote Sensing,
vol. 45, no. 5, pp. 1247-1257, May 2007.
Abstract
BiBTeX Paper:
PDF
We consider the problem of detecting and locating buried
land mines and subsurface objects by using a maneuvering
array that receives scattered seismic surface waves. We
demonstrate an adaptive system that moves an array of
receivers according to an optimal positioning algorithm
based on the theory of optimal experiments. The goal is to
minimize the number of distinct measurements (array
movements) needed to localize mines. The adaptive
localization algorithm has been tested using experimental
data collected in a laboratory facility at Georgia Tech. The
performance of algorithm is exhibited for cases with one or
two targets and in the presence of common types of clutter
like rocks found in the soil. It has also been tested for
the case where the propagation properties of the medium vary
spatially. In almost all test cases the mines were located
exactly using three or four array movements. It is
envisioned that future systems could incorporate this new
method into a portable mobile mine-location system.
@article{IEEE_TGRS05_ALAM, author = "M. Alam
and V. Cevher and J. H. McClellan and G. D. Larson and W. R.
Scott Jr.", title = "Optimal maneuvering of
seismic sensors for localization of subsurface targets", journal = "IEEE
Transactions on Geosciences and Remote Sensing", volume = "45", number = "5", pages = "1247--1257", year = "May 2007",}
- M. Borkar,
V. Cevher, and J. H. McClellan, “A Monte-Carlo method for initializing
distributed tracking algorithms with acoustic propagation delay
compensation,” to appear in Journal of VLSI Signal Processing
Systems.
(invited
paper)
Abstract
BiBTeX Paper:
PDF
Decentralized processing algorithms are attractive
alternatives to centralized algorithms for target tracking
applications in smart sensor networks since they provide the
ability to scale, reduce vulnerability, reduce communication
and share processing responsibilities among individual
nodes. Sharing the processing responsibilities allows
parallel processing of raw data at the individual nodes.
However, this introduces other difficulties in multi-modal
smart sensor networks, such as non- observability of the
target state at any individual node and various delays such
as varying processing delays, communication delays and
signal propagation delays for the different modalities. In
this paper, we provide a novel algorithm to determine the
initial probability distribution of multiple target states
in a decentralized manner. The targets state vector consists
of the target positions and velocities on the 2D plane. Our
approach can determine the state vector distribution even if
the individual sensors alone are not capable of observing
it. Our approach can also compensate for varying delays
among the assorted modalities. The resulting distribution
can be used to initialize various tracking algorithms. Our
approach is based on Monte-Carlo methods, where the state
distributions are represented as a weighted set of discrete
state realizations. A robust weighting strategy is
formulated to account for missed detections, clutter and
estimation delays. To demonstrate the effectiveness of the
algorithm, we simulate a network with direction-of-arrival
nodes and range-doppler nodes.
@Unpublished{JVLSI05_Borkar, author = "M.
Borkar and V. Cevher and J. H. McClellan", title = "A
Monte-Carlo method for initializing distributed tracking
algorithms with acoustic propagation delay compensation", note = "accepted
with minor revisions to Journal of VLSI Signal Processing
Systems",}
- M. Borkar,
V. Cevher, and J. H. McClellan, “Low computation and low latency
algorithms for distributed sensor network initialization,”
Signal, Image
and Video Processing (Springer),
vol. 1, no.2, pp 133-148, June 2007.
Abstract
BiBTeX Paper:
PDF
In this paper, we show how an underlying system’s state
vector distribution can be determined in a distributed
heterogeneous sensor network with reduced subspace
observability at the individual nodes. The presented
algorithm can generate the initial state vector distribution
for networks with a variety of sensor types as long as the
collective set of measurements from all the sensors provides
full state observability. Hence the network, as a whole, can
be capable of observing the target state vector even if the
individual nodes are not capable of observing it locally.
Initialization is accomplished through a novel distributed
implementation of the particle filter that involves serial
particle proposal and weighting strategies that can be
accomplished without sharing raw data between individual
nodes. If multiple events of interest occur, their
individual states can be initialized simultaneously without
requiring explicit data association across nodes. The
resulting distributions can be used to initialize a variety
of distributed joint tracking algorithms. We present two
variants of our initialization algorithm: a low complexity
implementation and a low latency implementation. To
demonstrate the effectiveness of our algorithms we provide
simulation results for initializing the states of multiple
maneuvering targets in smart sensor networks consisting of
acoustic and radar sensors.
@article{SIVP07_Borkar, author = "M. Borkar
and V. Cevher and J. H. McClellan", title = "Low
computation and low latency algorithms for distributed
sensor network initialization", journal = "Signal,
Image and Video Processing (Springer)", volume = "1", number = "2", pages = "133--148", year = "June 2007",}
- V. Cevher
and J. H. McClellan, “Acoustic node calibration using moving sources,”
IEEE Transactions on Aerospace and Electronic Systems, vol.
42, no. 2, pp 585-600, April 2006.
Abstract
BiBTeX Paper:
PDF
Acoustic nodes, each
containing an array of microphones, can track targets in x-y
space from their received acoustic signals, if the node
positions and orientations are known exactly. However, it is
not always possible to deploy the nodes precisely, so a
calibration phase is needed to estimate the position and the
orientation of each node before doing any tracking or
localization. An acoustic node can be calibrated from
sources of opportunity such as beacons or a moving source.
In this paper, we derive and compare several calibration
methods for the case where the node can hear a moving source
whose position can be reported back to the node. Since
calibration from a moving source is, in effect, the dual of
a tracking problem, methods derived for acoustic target
trackers are used to obtain robust and high resolution
acoustic calibration processes. For example, two
direction-of-arrival-based calibration methods can be
formulated based on combining angle estimates, geometry, and
the motion dynamics of the moving source. In addition, a
maximum-likelihood (ML) solution is presented using a
narrow-band acoustic observation model, along with a
Newton-based search algorithm that speeds up the calculation
the likelihood surface. The Cramer-Rao lower bound on the
node position estimates is also derived to show that the
effect of position errors for the moving source on the
estimated node position is much less severe than the
variance in angle estimates from the microphone array. The
performance of the calibration algorithms is demonstrated on
synthetic and field data.
@article{IEEE_AES_CEVHER06, author = "V. Cevher and J. H. McClellan", title = "Acoustic node calibration using moving sources", journal = "IEEE Transactions on Aerospace and Electronic
Systems", volume = "42", number = "2", pages = "585--600", year = "April 2006",}
- V. Cevher
and J. H. McClellan, “General direction-of-arrival tracking with acoustic
nodes,” IEEE Transactions on Signal Processing, vol. 53, no.
1, pp. 1-12, January 2005.
Abstract
BiBTeX Paper:
PDF
In this paper, we propose a particle filter acoustic
direction-of-arrival (DOA) tracker to track multiple
maneuvering targets using a state space approach. The
particle filter determines its state vector using a batch of
DOA estimates. The filter likelihood treats the observations
as an image, using template models derived from the state
update equation, and also incorporates the possibility of
missing data as well as spurious DOA observations. The
particle filter handles multiple targets, using a
partitioned state-vector approach. The particle filter
solution is compared with three other methods: the extended
Kalman filter, Laplacian filter, and another particle filter
that uses the acoustic microphone outputs directly. We
discuss the advantages and disadvantages of these methods
for our problem. In addition, we also demonstrate an
autonomous system for multiple target DOA tracking with
automatic target initialization and deletion. The
initialization system uses a track-before-detect approach and employs the matching pursuit idea to initialize
multiple targets. Computer simulations are presented to show
the performances of the algorithms.
@article{IEEE_TSP_CEVHER05, author = "V. Cevher and J. H. McClellan", title = "General direction-of-arrival tracking with acoustic
nodes", journal = "IEEE Transactions on Signal Processing", volume = "53", number = "1", pages = "1--12", year = "January 2005",}
Conference:
- V. Cevher,
R. Chellappa, and J. H. McClellan, “Gaussian approximations for
energy-based detection and localization in sensor networks,” IEEE
Statistical Signal Processing Workshop, Madison, WI, 26-29 August
2007. (invited
paper)
Abstract
BiBTeX
Paper:
PDF
Energy-based detection and estimation are crucial in sensor
networks for sensor localization, target tracking, etc. In
this paper, we present novel Gaussian approximations that
are applicable to general energy-based source detection and
localization problems in sensor networks. Using our
approximations, (i) we derive receiver operating
characteristics curves and Cramer-Rao bounds, and (ii) we
provide a factorized variational Bayes approximation to the
location and source energy posterior for centralized or
decentralized estimation. When the source signal and the
sensor noise have uncorrelated Gaussian distributions, we
demonstrate that the envelope of the sensor output can be
accurately modeled with a multiplicative Gaussian noise
model, which results in smaller estimation biases than the
other Gaussian models typically used in the literature. We
also prove that additive Gaussian noise models result in
negatively biased speed estimates under the same signal
assumptions, which can be circumvented by the proposed
approximations.
@inproceedings{IEEE_SSP07-Cevher, author = "V. Cevher
and R. Chellappa and J. H.
McClellan", title = "Gaussian
approximations for energy-based detection and localization
in sensor networks", booktitle = "IEEE
Statistical Signal Processing Workshop", address= "Madison,
WI", year = "26--29 August 2007",}
- R.
Velmurugan, V. Cevher, and J. H. McClellan, “Implementation of
batch-based particle filters for multi-sensor tracking,” IEEE CAMSAP
2007, U.S. Virgin Islands, 12-14 December 2007. (invited
paper)
Abstract
BiBTeX
Paper:
PDF
Energy-based detection and estimation are crucial in sensor
networks for sensor localization, target tracking, etc. In
this paper, we present novel Gaussian approximations that
are applicable to general energy-based source detection and
localization problems in sensor networks. Using our
approximations, (i) we derive receiver operating
characteristics curves and Cramer-Rao bounds, and (ii) we
provide a factorized variational Bayes approximation to the
location and source energy posterior for centralized or
decentralized estimation. When the source signal and the
sensor noise have uncorrelated Gaussian distributions, we
demonstrate that the envelope of the sensor output can be
accurately modeled with a multiplicative Gaussian noise
model, which results in smaller estimation biases than the
other Gaussian models typically used in the literature. We
also prove that additive Gaussian noise models result in
negatively biased speed estimates under the same signal
assumptions, which can be circumvented by the proposed
approximations.
@inproceedings{IEEE_CAMSAP07-Velmurugan,
author = "R. Velmurugan and V. Cevher and J. H. McClellan", title = "Implementation
of batch-based particle filters for multi-sensor tracking", booktitle = "IEEE
CAMSAP", address= "U.S. Virgin Islands", year = "12--14
December 2007",}
-
R.
Velmurugan, S. Subramanian, V. Cevher, J. H. McClellan, and
D. V. Anderson “Mixed-mode implementation of particle
filters,” IEEE PACRIM 2007, Victoria, B.C., CA, 22-24 August
2007.
Abstract
BiBTeX Paper:
PDF
In this paper, we develop new mixed-mode
implementations for particle filters and compare
them to a digital implementation. The motivation for
the mixed-mode implementation is to achieve
low-power implementation of particle filters. The
specific application considered is a bearings-only,
single-target tracking algorithm. Specifically, we
develop mixed-mode implementations that use analog
components to realize nonlinear functions in the
particle filter algorithm. The analog implementation
of nonlinear functions use multiple-input
translinear element (MITE) networks. MITEs operate
in the subthreshold region and hence dissipate
low-power. Simulation results for one mixed-mode
implementation of the bearings-only tracker are
presented. We show that of the two mixed-mode
implementations, one approach dissipates almost same
power as that of a digital implementation. The
second approach has nearly twenty times less power
dissipation, but requires careful analog design.
@inproceedings{IEEE_PACRIM07-Velmurugan,
author = "R. Velmurugan and S.
Subramanian and V. Cevher and J. H. McClellan and D.
V. Anderson", title = "Mixed-mode
implementation of particle filters", booktitle = "IEEE PACRIM", address= "Victoria,
B.C., Canada", year = "22-24 August
2007",}
- V. Cevher,
R. Chellappa, and J. H. McClellan, “Joint acoustic-video
fingerprinting of vehicles, part I,” ICASSP 2007, Honolulu, Hawaii,
16-20 April 2007.
Abstract
BiBTeX
Paper:
PDF
We address
vehicle classification and mensuration problems using
acoustic and video sensors. In this paper, we show how to
estimate a vehicle’s speed, width, and length by jointly
estimating its acoustic wave-pattern using a single passive
acoustic sensor that records the vehicle’s drive-by noise.
The acoustic wave-pattern is approximated using three
envelope shape (ES) components, which approximate the shape
of the received signal’s power envelope. We incorporate the
parameters of the ES components along with estimates of the
vehicle engine RPM and number of cylinders to create a
vehicle profile vector that forms an intuitive
discriminatory feature space. In the companion paper, we
discuss vehicle classification and mensuration based on
silhouette extraction and wheel detection, using a video
sensor. Vehicle speed estimation and classification results
are provided using field data.
@inproceedings{IEEE_ICASSP07-Cevher1, author = "V. Cevher
and R. Chellappa and J. H.
McClellan", title = "Joint
acoustic-video fingerprinting of vehicles, Part I", booktitle = "ICASSP 2007", address= "Honolulu,
Hawaii", year = "15--20 April 2007",}
- V. Cevher,
F. Guo, A. C. Sankaranarayanan, and R. Chellappa, “Joint
acoustic-video fingerprinting of vehicles, part II,” ICASSP 2007,
Honolulu, Hawaii, 16-20 April 2007.
Abstract
BiBTeX Paper:
PDF
In this second paper, we first
show how to estimate the wheelbase length of a vehicle using
line metrology in video. We then address the vehicle
fingerprinting problem using vehicle silhouettes and color
invariants. We combine the acoustic metrology and
classification results discussed in Part I with the video
results to improve estimation performance and robustness.
The acoustic video fusion is achieved in a Bayesian
framework by assuming conditional independence of the
observations of each modality. For the metrology density
functions, Laplacian approximations are used for
computational efficiency. Experimental results are given
using field data.
@inproceedings{IEEE_ICASSP07-Cevher2,
author = "V. Cevher and F. Guo and A. C.
Sankaranarayanan and R. Chellappa and J. H.
McClellan",
title = "Joint acoustic-video fingerprinting of
vehicles, Part II",
booktitle = "ICASSP 2007",
address= "Honolulu, Hawaii",
year = "15--20 April 2007",}
- V. Cevher, F. Shah, R. Velmurugan, and J. H. McClellan, “An
acoustic multi-target tracking system using random sampling
consensus,” 2007 IEEE Aerospace Conference, Big Sky, Montana, 3-10
March 2007. (invited
paper)
Abstract
BiBTeX
Paper:
PDF
In this paper, we present an
acoustic direction-of-arrival (DOA) tracking system to track
multiple maneuvering targets using a state space approach.
The system consists of three blocks: beamformer, random
sampling, and particle filter. The beamformer block
processes the received acoustic data to output bearing
batches as point statistics. The random sampling block
determines temporal clustering of the bearings in a batch to
determine region-of-interests (ROIs). Based on the track-before-detect approach, each ROI indicates the
presence of a possible target. We describe three random
sampling algorithms called RANSAC, MSAC, and NAPSAC to use
in the random sampling block. The particle filter then
tracks the targets via its interactions with the beamformer
and the random sampling blocks. We present a computational
analysis of the random sampling blocks and show tracking
results with field data.
@Inproceedings{IEEE_AESCONF07_Cevher1, author = "V. Cevher and R. Chellappa and
F. Shah and R. Velmurugan and J. H. McClellan", title = "An
acoustic multi-target tracking system using random sampling
consensus", booktitle = "2007 IEEE Aerospace Conference", address= "Big Sky, Montana", year = "3--10 March 2007",}
- M. Borkar,
V. Cevher, and J. H. McClellan, “A Monte-Carlo approach for tracking
mobile personnel,” 2007 IEEE Aerospace Conference, Big Sky, Montana,
3-10 March 2007. (invited
paper)
Abstract
BiBTeX
Paper:
PDF
In this paper, we propose a Monte-Carlo method based on the
particle filter framework to track footfall locations
generated by mobile personnel using seismic arrays. While
the particle proposal function follows a simple bootstrap
approach, the novelty in our algorithm comes from a unique
weighting strategy that takes into account the sparse nature
of the seismic footfall signal and is robust against missed
detections and clutter which could appear in the form of
other impulsive sources or other walkers. Our weighting
strategy automatically makes use of the wavefront shape,
either planar or circular, and assigns weights in x-y space.
Data association is built into the system, eliminating the
need to explicitly associate the received footfall impulses
with different walkers. Hence our algorithm is ideal for
tracking multiple mobile personnel. We also demonstrate the
fusion of our system with range information available by
means of radar. Fusion with radar improves x-y tracking when
range resolution is lost due to a large distance between the
target and the seismic array leading to planar wavefronts.
@Inproceedings{IEEE_AESCONF07_Borkar1, author = "M.
Borkar and V. Cevher and J. H. McClellan", title = "A
Monte Carlo approach for tracking mobile personnel", booktitle = "2007 IEEE Aerospace Conference", address= "Big Sky, Montana", year = "3--10 March 2007",}
- L. Kaplan
and V. Cevher, “Design considerations for heterogeneous network of
bearings-only sensors using sensor management,” 2007 IEEE Aerospace
Conference, Big Sky, Montana, 3-10 March 2007.
Abstract
BiBTeX
Paper:
PDFThis paper presents the design characterization of a
heterogeneous sensor network with the goal of geolocation
accuracy. It is assumed that the network exploits sensor
management to conserve node usage. Each available node
modality is a bearings-only sensor of varying capability.
The optimal mixture of modalities is discussed under the
constraint of the overall network cost. Finally, simulations
verify the theory and demonstrate design choices for a
network consisting of two modes analogous to acoustic arrays
and cameras.
@Inproceedings{IEEE_AESCONF07_Kaplan1, author = "L. Kaplan and V. Cevher", title = "Design
considerations for heterogeneous network of bearings-only
sensors using sensor management", booktitle = "2007 IEEE Aerospace Conference", address= "Big Sky, Montana", year = "3--10 March 2007",}
- S. Ozgur, V.
Cevher, D. B. Williams, and J. H. McClellan, “Convergence Analysis
for Sequential Monte Carlo Receivers in Communications
Applications,” IEEE DSP Workshop 2006, Grand Teton National Park,
Wyoming, September 24-27, 2006.
Abstract
BiBTeX
Paper:
PDFRecently, sequential Monte Carlo methods have been applied
in the telecommunications field finding application in
receiver design. These receivers do not require channel
state information or training, making them bandwidth
efficient as no communication bandwidth needs to be spent on
training. The receivers are optimal in the sense that they
achieve minimum symbol error rate regardless of the noise
distribution, nonlinearities in the system, and distribution
of the transmitted symbols. Moreover, these receivers are
capable of producing soft-information outputs, which enables
the designer to utilize iterative receiver architectures for
near-optimal performance. In this work we investigate the
convergence properties of these algorithms when utilized in
various types of receivers and we quantify the convergence
rate. We describe how various parameters (e.g., noise power,
number of particles) and factors (e.g., dimensionality of
the problem) affect the convergence rate and point out
factors that should be improved first to gain speed and
accuracy in the convergence.
@inproceedings{IEEE_DSP06_Ozgur, author = "S. Ozgur and V. Cevher and D. B. Williams and J.
H. McClellan", title = "Convergence Analysis
for Sequential Monte Carlo Receivers in Communications
Applications", booktitle = "IEEE DSP Workshop
2006", address= "Grand Teton National Park,
Wyoming", year = "24--27 September 2006",}
- V.
Cevher, M. Borkar, and J. H. McClellan, “A joint
radar-acoustic particle filter tracker with acoustic
propagation delay compensation,” EUSIPCO 2006, Florence,
Italy, September 4-8, 2006.
(invited
paper)
Abstract
BiBTeX Paper:
PDF
In this paper, a novel particle filter tracker is
presented for target tracking using collocated radar
and acoustic sensors. Real-time tracking of the
target's position and velocity in Cartesian
coordinates is performed using batches of range and
direction-of-arrival estimates. For robustness, the
filter aligns the radar and acoustic data streams to
account for acoustic propagation delays. The filter
proposal function uses a Gaussian approximation to
the full tracking posterior for improved efficiency.
To incorporate the aligned acoustic data into the
tracker, a two-stage weighting strategy is proposed.
Computer simulations are provided to demonstrate the
effectiveness of the algorithm.
@inproceedings{EUSIPCO06-Cevher1, author = "V. Cevher and M. Borkar and J. H.
McClellan", title = "A joint radar-acoustic particle filter
tracker with acoustic propagation delay
compensation", booktitle = "EUSIPCO 2006", address= "Florence, Italy", year = "4--8 September 2006",}
-
R.
Velmurugan, S. Subramanian, V. Cevher, D. Abramson, K. M.
Odame, J. D. Gray, H.-J. Lo, J. H. McClellan, and D. V.
Anderson “On low-power analog implementations of particle
filters for target tracking,” EUSIPCO 2006, Florence, Italy,
September 4-8, 2006.
(invited
paper)
Abstract
BiBTeX Paper:
PDF
We propose a low-power, analog and mixed-mode,
implementation of particle filters. Low-power analog
implementation of nonlinear functions such as
exponential and arctangent functions is done using
multiple-input translinear element (MITE) networks.
These nonlinear functions are used to calculate the
probability densities in the particle filter. A
bearings-only tracking problem is simulated to
present the proposed low-power implementation of the
particle filter algorithm.
@inproceedings{EUSIPCO06-Velmurugan1,
author = "R. Velmurugan and S. Subramanian and V.
Cevher and D. Abramson and K. M. Odame and J. D.
Gray and H.-J. Lo and J. H. McClellan and D. V.
Anderson",
title = "On low-power analog implementations of
particle filters for target tracking",
booktitle = "EUSIPCO 2006",
address= "Florence, Italy",
year = "4--8 September 2006",}
-
V.Cevher, R. Velmurugan, and J. H. McClellan, “A particle
filter range tracker,” ICASSP 2006, Toulouse, France, May
15-19 2006.
Abstract
BiBTeX Paper:
PDF
We propose a particle filter tracker to track
multiple maneuvering targets using a batch of range
measurements. The state update is formulated through
a locally linear motion model and the observability
of the state vector is proved using geometrical
arguments. The data likelihood treats the range
observations as an image using template models
derived from the state update equation, and
incorporates the possibility of missing data as well
as spurious range observations. The particle filter
handles multiple targets, using a partitioned
state-vector approach. The filter proposal function
uses a Gaussian approximation of the full-posterior
to cope with target maneuvers for improved
efficiency. By treating the range measurements as
images and using smoothness constraints, the
particle filter is able to avoid the data
association problems. Computer simulations
demonstrate the performance of the tracking
algorithm.
@inproceedings{IEEE_ICASSP06-Cevher1,
author = "V. Cevher and R. Velmurugan and J. H.
McClellan",
title = "A particle filter range tracker",
booktitle = "ICASSP 2006",
address= "Toulouse, France",
year = "15--19 May 2006",}
- M.
Alam, V. Cevher, and J. H. McClellan, “Optimal
experiments with seismic sensors,” ICASSP 2006, Toulouse,
France, May 15-19 2006.
Abstract
BiBTeX Paper:
PDF
In this paper, we consider the problem of detecting
and locating buried land mines and subsurface
objects by using seismic waves. We demonstrate an
adaptive seismic system that maneuvers an array of
receivers, according to an optimal positioning
algorithm based on the theory of optimal
experiments, to minimize the number of distinct
measurements to localize the mine. The adaptive
localization algorithm is tested using numerical
model data as well as laboratory measurements
performed in a facility at Georgia Tech. It is
envisioned that the future systems should be able to
incorporate this new method into portable mobile
mine location systems.
@inproceedings{IEEE_ICASSP06-Alam1,
author = "M. Alam and V. Cevher and J. H.
McClellan",
title = "Optimal experiments with seismic sensors",
booktitle = "ICASSP 2006",
address= "Toulouse, France",
year = "15--19 May 2006",}
- M.
Borkar, V. Cevher, and J. H. McClellan, “A Monte-Carlo method
for initializing distributed tracking algorithms,” ICASSP
2006, Toulouse, France, May 15-19 2006.
Abstract
BiBTeX Paper:
PDF
Distributed processing algorithms are attractive
alternatives to centralized algorithms for target
tracking applications in sensor networks. In this
paper, we determine an initial probability
distribution of multiple target states in a
distributed manner to initialize distributed
trackers. Our approach is based on Monte-Carlo
methods, where the state distributions are
represented as a weighted set of discrete state
realizations. The filter state vector is the target
positions and velocities on the 2D plane. Our
approach can determine the state vector distribution
even if the individual sensors are not capable of
observing it. The only condition is that the network
as a whole can observe the state vector. A robust
weighting strategy is formulated to account for
missed detections and clutter. To demonstrate the
effectiveness of the algorithm, we simulate a
network with direction-of-arrival nodes and
range-Doppler nodes.
@inproceedings{IEEE_ICASSP06-Borkar1,
author = "M. Borkar and V. Cevher and J. H.
McClellan",
title = "A Monte-Carlo method for initializing
distributed tracking algorithms",
booktitle = "ICASSP 2006",
address= "Toulouse, France",
year = "15--19 May 2006",}
- V.
Cevher, R. Velmurugan, and J. H. McClellan, “Multi target
direction-of-arrival tracking using road priors,” 2006 IEEE
Aerospace Conference, Big Sky, Montana, 4-11 March 2006.
(invited
paper)
Abstract
BiBTeX Paper:
PDF
In this paper, we present a multi target particle
filter DOA tracker that can incorporate road prior
information at a single array node. The filter uses
a batch of DOA’s to determine the state vector,
based on an image template matching idea. The filter
likelihood is derived with the joint probability
density association principles so that no DOA
measurement is associated to more than one target.
The filter state update has the target DOA, the
target velocity over range ratio, and the target
heading parameters. We present two approaches for
incorporating the road information. In the first
approach, the road prior is injected at the
weighting stage of the tracker, where a raised
mixture Gaussian distribution, derived from the road
headings at the target DOA, constraints the
particles. The second approach is based on
modifying the state update function with a compound
model, where a mixture of the constant velocity
model and the road information is used. In this
case, the filter uses an online EM algorithm to
update the state vector along with the mixture
components. Computer simulations demonstrate the
performance of the approaches.
@inproceedings{IEEE_AESCONF06_Cevher,
author = "V. Cevher and R. Velmurugan and J. H.
McClellan",
title = "Multi target direction-of-arrival tracking
using road priors",
booktitle = "2006 IEEE Aerospace Conference",
address= "Big Sky, Montana",
year = "4--11 March 2006",}
- V.
Cevher and J. H. McClellan, “An acoustic multiple target
tracker,” 2005 IEEE Statistical Signal Processing
Conference, Bordeaux, France, 17-20 July 2005.
Abstract
BiBTeX Paper:
PDF
We propose a particle filter acoustic tracker to
track multiple maneuvering targets using a state
space formulation. The state update is formulated
through a locally linear motion model. The
observations are a batch of direction-of-arrival
(DOA) estimates at various frequencies. The data
likelihood incorporates the possibility of missing
data as well as spurious DOA observations. By
imposing smoothness constraints on the target
motion, the particle filter is able to avoid the
data association problems. To make the filter
computationally efficient, a proposal strategy based
on approximating the full posterior is employed.
Computer simulations are presented to show the
performance of the algorithm.
@inproceedings{IEEE_SSP05-Cevher,
author = "V. Cevher and J. H. McClellan",
title = "An acoustic multiple target tracker",
booktitle = "IEEE Statistical Signal Processing
Conference",
address= "Bordeaux, France",
year = "17--20 July 2005",}
- M.
Borkar, V. Cevher, and J. H. McClellan, “Estimating target state
distributions in a distributed sensor network using a
Monte-Carlo approach,” 2005 IEEE Workshop on Machine
Learning for Signal Processing, Mystic, Connecticut, 28-30
September 2005.
Abstract
BiBTeX Paper:
PDF
Distributed processing algorithms are attractive
alternatives to centralized algorithms for target
tracking applications in sensor net works. In this
paper, we address the issue of determining an
initial probability distribution of multiple target
states in a distributed manner to initialize
distributed trackers. Our approach is based on
Monte-Carlo methods, where the state distributions
are represented as a discrete set of weighted
particles. The target state vector is the target
positions and velocities in the 2D plane. Our
approach can determine the state vector distribution
even if the individual sensors are not capable of
observing it. The only condition is that the network
as a whole can observe the state vector. A robust
weighting strategy is formulated to account for mis-detections
and clutter. To demonstrate the effectiveness of the
algorithm, we use direction-of-arrival nodes and
range-Doppler nodes.
@inproceedings{IEEE_MLSP05-Borkar,
author = "M. Borkar and V. Cevher and J. H.
McClellan",
title = "Estimating target state distributions in a
distributed sensor network using a Monte-Carlo
approach",
booktitle = "IEEE MLSP 2005",
address= "Mystic, Connecticut",
year = "28--30 September 2005",}
- G.
Qian, V. Cevher, A. Sankaranarayanan, J. H. McClellan, and
R. Chellappa, “Vehicle tracking using acoustic and video
sensors,” in Army Science Conference 2004, Orlando, 29
November-2 December 2004.
Abstract
BiBTeX Paper:
PDF
In target tracking, fusing multi-modal sensor data
under a power-performance trade-off is becoming
increasingly important. Proper fusion of multiple
modalities can help in achieving better tracking
performance while decreasing the total power
consumption. In this paper, we present a framework
for tracking a target given joint acoustic and video
observations from a co-located acoustic array and a
video camera. We demonstrate on field data that
tracking of the direction-of-arrival of a target
improves significantly when the video information is
incorporated at time instants when the acoustic
signal-to-noise ratio is low.
@inproceedings{ASC2004-Qian,
author = "G. Qian and V. Cevher
and A. Sankaranarayanan and J. H. McClellan and R.
Chellappa",
title = "On low-power analog implementations of
particle filters for target tracking",
booktitle = "EUSIPCO 2006",
address= "Florence, Italy",
year = "4--8 September 2006",}
- V.
Cevher and J. H. McClellan, “Proposal strategies for joint
state-space tracking with particle filters,” ICASSP 2005,
Philadelphia, PA, 18-23 March 2005.
Abstract
BiBTeX Paper:
PDF
A proposal function determines the random particle
support of a particle filter. When this support is
distributed close to the true target density,
filter’s estimation performance increases for a
given number of particles. In this paper, a proposal
strategy for joint state-space tracking using
particle filters is given. The state-spaces are
assumed Markovian and not-exact; however, each
state-space is assumed to sufficiently describe the
underlying phenomenon. The joint tracking is
achieved by carefully placing the random support of
the joint filter to where the final posterior is
likely to lie. Computer simulations demonstrate
improved performance and robustness of the joint
state-space through the proposed strategy.
@inproceedings{IEEE_ICASSP05-Cevher,
author = "V. Cevher and J. H. McClellan",
title = "Proposal strategies for joint state-space
tracking with particle filters",
booktitle = "ICASSP 2005",
address= "Philadelphia, PA",
year = "18--23 March 2005",}
- V.
Cevher and J. H. McClellan, “Acoustic node calibration using
helicopter sounds and Monte Carlo Markov chain methods,”
IEEE DSP Workshop, Taos Ski Valley, NM, 1-4 August 2004.
Abstract
BiBTeX Paper:
PDF
A Monte-Carlo method is used to calibrate a randomly
placed sensor node using helicopter sounds. The
calibration is based on using the GPS information
from the helicopter and the estimated DOA’s at the
node. The related Cramer-Rao lower bound is derived
and the effects of the GPS errors on the position
estimates are derived. Issues related to the
processing of the field data, e.g., time
synchronization and data non-stationarity are
discussed. The effects of the GPS errors are shown
to be negligible under certain conditions. Finally,
the results of the calibration on field data are
given.
@inproceedings{IEEE_DSP04_Cevher,
author = "V. Cevher and J. H. McClellan",
title = "Acoustic node calibration using
helicopter sounds and Monte Carlo Markov chain
methods",
booktitle = "IEEE DSP Workshop",
address= "Taos Ski Valley, NM",
year = "1--4 August 2004",}
- V.
Cevher and J. H. McClellan, “Fast initialization of particle
filters using a modified Metropolis-Hastings algorithm:
Mode-Hungry approach,” ICASSP 2004, Montreal, CA, 17-21 May
2004.
Abstract
BiBTeX Paper:
PDF
As a recursive algorithm, the particle filter
requires initial samples to track a state vector.
These initial samples must be generated from the
received data and usually obey a complicated
distribution. The Metropolis-Hastings (M-H)
algorithm is used for sampling from intractable
multivariate target distributions and is well suited
for the initialization problem. Asymptotically, the
M-H scheme creates samples drawn from the exact
distribution. For the particle filter to track the
state, the initial samples need to cover only the
region around its current state. This region is
marked by the presence of modes. Since the particle
filter only needs samples around the mode, we modify
the M-H algorithm to generate samples distributed
around the modes of the target posterior. By
simulations, we show that this ”mode hungry”
algorithm converges an order of magnitude faster
than the original M-H scheme for both unimodal and
multi-modal distributions.
@inproceedings{IEEE_ICASSP04-Cevher,
author = "V. Cevher and J. H. McClellan",
title = "Fast initialization of particle
filters using a modified Metropolis-Hastings
algorithm: Mode-Hungry approach",
booktitle = "ICASSP 2004",
address= "Montreal, CA",
year = "17--21 May 2004",}
- V.
Cevher and J. H. McClellan, “Tracking of multiple wideband
targets using passive sensor arrays and particle filters,”
IEEE DSP Workshop, Callaway Gardens, GA, 13-16 October 2002.
Abstract
BiBTeX Paper:
PDF
In this paper, we present a way to track multiple
maneuvering targets with varying time-frequency
signatures. A particle filter is used to track
targets that have constant speeds with changing
heading directions. The target motion dynamics help
the particle filter achieve an angular resolution
otherwise not possible by the conventional
beamforming techniques. Moreover, the particle
filter has a built-in target association that
eliminates the need for heuristic techniques
commonly used in the multiple target tracking
problems. Reference priors are used to derive the
probability distribution function of the acoustic
array outputs given the state of the multiple target
states (MTS’s). Local linearization is used to
approximate the importance function used in the
particle filter by a Gaussian pdf. Finally, computer
simulations are used to demonstrate the performance
of the algorithm with synthetic data.
@inproceedings{IEEE_DSP02_Cevher,
author = "V. Cevher and J. H. McClellan",
title = "Tracking of multiple wideband targets
using passive sensor arrays and particle filters",
booktitle = "IEEE DSP Workshop",
address= "Callaway Gardens, GA",
year = "13--16 October 2002",}
- V.
Cevher and J. H. McClellan, “2-D sensor perturbation analysis:
equivalence to AWGN on array outputs,” SAM 2002 Workshop,
WDC, 4-6 August 2002.
Abstract
BiBTeX Paper:
PDF
In this paper, the performance of a subspace
beamformer, namely the multiple signal
classification algorithm (MUSIC), is scrutinized in
the presence of sensor position errors. Based on a
perturbation model, a relationship between the array
autocorrelation matrix and the source
autocorrelation matrix is established. It is shown
that under certain assumptions on the source
signals, the Gaussian sensor perturbation errors can
be modeled as additive white Gaussian noise (AWGN)
for an array where sensor positions are known
perfectly. This correspondence can be used to equate
position errors to an equivalent signal-to-noise
ratio (SNR) for AWGN in performance evaluation.
Finally, Cramer-Rao bound for the position
perturbations that can be computed using the Cramer-Rao
bound relations for the additive Gaussian noise case
at high SNR’s.
@inproceedings{SAM02-Cevher,
author = "V. Cevher and J. H.
McClellan",
title = "2-D sensor perturbation analysis:
equivalence to AWGN on array outputs",
booktitle = "SAM 2002",
address= "Washington, DC",
year = "4--6 August 2002",}
- V.
Cevher and J. H. McClellan, “Sensor array calibration via
tracking with the extended Kalman filter,” ICASSP 2001, vol.
5, pp. 2817-2820, Salt Lake City, UT, May 2001.
Abstract
BiBTeX Paper:
PDF
Starting with a randomly distributed sensor array
with unknown sensor orientations, array calibration
is needed before target localization and tracking
can be performed using classical triangulation
methods. In this paper, we assume that the sensors
are only capable of accurate direction of arrival
(DOA) estimation. The calibration problem cannot be
completely solved given the DOA estimates alone,
since the problem is not only rotationally symmetric
but also includes a range ambiguity. Our approach to
calibration is based on tracking a single target
moving at a constant velocity. In this case, the
sensor array can be calibrated from target tracks
generated by an extended Kalman filter (EKF) at each
sensor. A simple algorithm based on geometrical
matching of similar triangles will align the
separate tracks and determine the sensor positions
and orientations relative to a reference sensor.
Computer simulations show that the algorithm
performs well even with noisy DOA estimates at the
sensors.
@inproceedings{IEEE_ICASSP01-Cevher,
author = "V. Cevher and J. H. McClellan",
title = "Sensor array calibration via tracking
with the extended Kalman filter",
booktitle = "ICASSP 2001,
address= "Salt Lake City, UT",
year = "May 2001",}
- R.
M. Dansereau, W. Kinsner, and V. Cevher, “Wavelet packet
best basis search using generalized Renyi entropy,” IEEE
CCECE 2002, vol. 2, pp. 1005-1008.
Abstract
BiBTeX
This paper introduces an approach to wavelet packet
best basis searches using the generalized Renyi
entropy. The approach extends work by R.R. Coifman
and M.V. Wickerhauser who showed how Shannon entropy
can be used as an additive cost function in the
wavelet packet best basis selection (see IEEE Trans.
on Inform. Theory, vol.38, no.2, p.713-18, 1992).
This paper also extends the idea of an additive cost
function to an arithmetic mean. These extensions
allow for a redefinition of additive cost functions
as arithmetic means in a way consistent with the
approach of Coifman and Wickerhauser. The approach
using an arithmetic mean is then extended to include
the geometric mean. This extension to geometric
means allows us to introduce the Renyi generalized
entropy as a cost function in the best basis search.
These two extensions also allow the use of
incomplete probability distributions, whereas
Coifman and Wickerhauser's entropy based cost
function is limited to complete probability
distributions.
@inproceedings{IEEE_CCECE02_Dansereau,
author = "R. M. Dansereau and W. Kinsner
and V. Cevher",
title = "Wavelet packet best basis search using
generalized Renyi entropy",
booktitle = "IEEE CCECE 2002",}
Under Review/Submitted:
- V. Cevher,
R. Chellappa, and J. H. McClellan, “Vehicle speed estimation using
acoustic wave patterns,” submitted to IEEE Transactions on Signal
Processing.
Abstract
BiBTeX
Paper:
PDFWe estimate a vehicle’s speed, wheelbase length, and its
tire track length by jointly estimating its acoustic
wave-pattern using a single passive acoustic sensor that
records the vehicle’s drive-by noise. The acoustic
wave-pattern is determined using three envelope shape (ES)
components, which approximate the shape variations of the
received signal’s power envelope. We incorporate the
parameters of the ES components along with estimates of the
vehicle engine RPM and the number of cylinders, and the
vehicle’s loudness and speed to form a vehicle profile
vector. This vector provides a compressed statistics that
can be used for vehicle identification and classification.
We also provide possible reasons for why some of the
existing methods are unable to provide unbiased vehicle
speed estimates using the same framework. The approach is
illustrated using vehicle speed estimation and
classification results obtained with field data.
@Unpublished{IEEE_TSP_Cevher_UNP2, author = "V. Cevher and R. Chellappa and J. H. McClellan", title = "Vehicle speed estimation using acoustic wave
patterns", note = "under revision at IEEE Transactions on Signal
Processing",}
-
V.
Cevher, L. Kaplan, and R. Chellappa, “Acoustic sensor
network design for position estimation,” submitted to ACM
Transactions on Sensor Networks.
Abstract
BiBTeX Paper:
e-mail me for a copy of the paper and the DP code
In this paper, we develop tractable mathematical
models and approximate solution algorithms for a
class of integer optimization problems with
probabilistic and deterministic constraints, with
applications to the design of distributed sensor
networks that have limited connectivity. For a given
deployment region size, we calculate the Pareto
frontier of the sensor network utility at the
desired probabilities for d-connectivity and
k-coverage. As a result of our analysis, we
determine (i) the number of sensors of different
types to deploy from a sensor pool, which offers a
cost vs. performance trade-off for each type of
sensor, (ii) the minimum required radio transmission
ranges of the sensors to ensure connectivity, and
(iii) the lifetime of the sensor network. For
generality, we consider randomly deployed sensor
networks and formulate constrained optimization
techniques in a Bayesian experimental design
framework to obtain the best point estimates of a
given state-of-nature, represented by a finite
number of parameters. The approach is guided and
validated using an unattended acoustic sensor
network design. Finally, approximations of the
complete statistical characterization of the
acoustic sensor networks are given, which enable
average network performance predictions of any
combination of acoustic sensors.
@Unpublished{ACM_TOSN-Cevher,
author = "V. Cevher and L. Kaplan and R. Chellappa",
title = "Acoustic sensor network design for
position estimation",
note = "submitted to ACM Transactions on Sensor
Networks",}
Thesis:
V. Cevher
A Bayesian
framework for target tracking using acoustic
and image measurements,
Ph.D. thesis, Georgia
Institute of Technology, 2005.
Abstract
BiBTeX Thesis:
PDF
Target tracking is a broad subject area
extensively studied in many engineering disciplines. In
this thesis, target tracking implies the temporal
estimation of target features such as the target's
direction-of-arrival (DOA), the target's boundary pixels
in a sequence of images, and/or the target's position in
space. For multiple target tracking, we have introduced
a new motion model that incorporates an acceleration
component along the heading direction of the target. We
have also shown that the target motion parameters can be
considered part of a more general feature set for target
tracking, e.g., target frequencies, which may be
unrelated to the target motion, can be used to improve
the tracking performance. We have introduced an acoustic
multiple-target tracker using a flexible observation
model based on an image tracking approach by assuming
that the DOA observations might be spurious and that
some of the DOAs might be missing in the observation
set. We have also addressed the acoustic calibration
problem from sources of opportunity such as beacons or a
moving source. We have derived and compared several
calibration methods for the case where the node can hear
a moving source whose position can be reported back to
the node.
The particle filter, as a recursive algorithm, requires
an initialization phase prior to tracking a state
vector. The Metropolis-Hastings (MH) algorithm has been
used for sampling from intractable multivariate target
distributions and is well suited for the initialization
problem. Since the particle filter only needs samples
around the mode, we have modified the MH algorithm to
generate samples distributed around the modes of the
target posterior. By simulations, we show that this
“mode hungry” algorithm converges an order of magnitude
faster than the original MH scheme. Finally, we have
developed a general framework for the joint state-space
tracking problem. A proposal strategy for joint
state-space tracking using the particle filters is
defined by carefully placing the random support of the
joint filter in the region where the final posterior is
likely to lie. Computer simulations demonstrate improved
performance and robustness of the joint state-space when
using the new particle proposal strategy.
@phdthesis{GATECH_cevher_thesis,
author = "V. Cevher",
title = "A {Bayesian} framework for target tracking
using acoustic and image measurements",
school = "Georgia Institute of Technology",
address = "Atlanta, GA",
year = "2005",
}
|
|
|