Barbara F. La Scala
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
Research Subjects
Barbara F. La Scala has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Craig O. Savage
Electrical and Electronic Engineering, University of Melbourne, Australia
3 shared publications - Bill Moran
Melbourne Systems Laboratory, Department of Electrical and Electronic Engineering, The University of Melbourne, Australia
2 shared publications B. Moran
Centre of Expertise in Networked Decision Sensor Systems, Department of Electrical and Electronic Engineering, University of Melbourne, Victoria 3010, Australia
1 shared publication- Mahendra Mallick
Toyon Research Corporation, 75 Aero Camino, Suite A, Goleta, CA 93117-3139, USA
1 shared publication - Robin James Evans
The University of Melbourne
1 shared publication - Xuezhi Wang
Melbourne Systems Laboratory, Dept of Electrical and Electronic Engineering, The University of Melbourne, Melbourne, Australia
1 shared publication
Latest Publications
- 13 November 2007
- Published by Elsevier in Digital Signal Processing
- Vol. 19 (6) , 968-977
Sensor management for tracking smart targets
- 13 November 2007
- Published by Elsevier in Digital Signal Processing
- Vol. 19 (6) , 968-977
Sensor management for tracking smart targets
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 188-192
Node Self-Localisation in Large Scale Sensor Networks
Efficient collaborative self-localisation is a vital component of large scale sensor network applications. This paper presents a computationally efficient algorithm for performing this task using radio interferometric positioning. In this way it is possible to localise the nodes in the network without needing additional sensors. Simulation results show performance that is similar to that obtained with a centralised approach but with significantly lower computation and transmission costs.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 188-192
Node Self-Localisation in Large Scale Sensor Networks
Efficient collaborative self-localisation is a vital component of large scale sensor network applications. This paper presents a computationally efficient algorithm for performing this task using radio interferometric positioning. In this way it is possible to localise the nodes in the network without needing additional sensors. Simulation results show performance that is similar to that obtained with a centralised approach but with significantly lower computation and transmission costs.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 248-253
Accurate Target Geolocation using Cooperative Observers
We consider the problem of geolocating a target using relatively simple ground-based sensors with a high degree of accuracy. We show that by using cooperative receivers, it is possible to achieve the desired level of accuracy for a stationary target by utilizing time difference of arrival measurements. We then extend this approach to provide a recursive solution for tracking moving targets using the unscented Kalman filter. Simulation results indicate improved performance over traditional geolocation results with a single receiver.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 248-253
Accurate Target Geolocation using Cooperative Observers
We consider the problem of geolocating a target using relatively simple ground-based sensors with a high degree of accuracy. We show that by using cooperative receivers, it is possible to achieve the desired level of accuracy for a stationary target by utilizing time difference of arrival measurements. We then extend this approach to provide a recursive solution for tracking moving targets using the unscented Kalman filter. Simulation results indicate improved performance over traditional geolocation results with a single receiver.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 185-190
Activation Scheduling for a Binary Sensor Network
This paper examines a sensor scheduling problem for target tracking using a network of distributed passive sensors. It considers how to schedule sensor activation to minimise bandwidth and battery usage while maintaining track accuracy. The sensor network is made up of simple acoustic, binary proximity sensors. Four different scheduling methods are considered. Two of these methods are heuristic while the other two are optimal, one-step ahead schedulers for differing objectives. The performance of all four algorithms is compared using simulations. The results show that it is possible to obtain adequate performance with only a subset of the sensor field active at any one time.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 185-190
Activation Scheduling for a Binary Sensor Network
This paper examines a sensor scheduling problem for target tracking using a network of distributed passive sensors. It considers how to schedule sensor activation to minimise bandwidth and battery usage while maintaining track accuracy. The sensor network is made up of simple acoustic, binary proximity sensors. Four different scheduling methods are considered. Two of these methods are heuristic while the other two are optimal, one-step ahead schedulers for differing objectives. The performance of all four algorithms is compared using simulations. The results show that it is possible to obtain adequate performance with only a subset of the sensor field active at any one time.
- 4 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01912216,p. 6966-6971
Minimum Necessary Data Rates for Accurate Track Fusion
Advances in technology are making distributed networks of sensor platforms a reality for surveillance systems. Such networks provide many benefits including the ability to cover a broader area, to compute more accurate target estimates and provide a reduction in susceptibility to countermeasures. In spite of these advantages, many practical issues remain in the deployment of such networks. One such significant issue is bandwidth limitations on the communication channels between the sensor platforms. This paper examines the effect of bandwidth restrictions on a decentralised system architecture. In such a structure, each sensor tracks targets within its individual surveillance region and then transmits its track data to a global fusion centre. The minimum necessary data rates required to permit reconstruction of the global track estimates to a given level of accuracy are presented in the case when the track state can be represented by a Gauss-Markov system.
- 4 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01912216,p. 6966-6971
Minimum Necessary Data Rates for Accurate Track Fusion
Advances in technology are making distributed networks of sensor platforms a reality for surveillance systems. Such networks provide many benefits including the ability to cover a broader area, to compute more accurate target estimates and provide a reduction in susceptibility to countermeasures. In spite of these advantages, many practical issues remain in the deployment of such networks. One such significant issue is bandwidth limitations on the communication channels between the sensor platforms. This paper examines the effect of bandwidth restrictions on a decentralised system architecture. In such a structure, each sensor tracks targets within its individual surveillance region and then transmits its track data to a global fusion centre. The minimum necessary data rates required to permit reconstruction of the global track estimates to a given level of accuracy are presented in the case when the track state can be represented by a Gauss-Markov system.
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
IMM Estimator for Ground Target Tracking with Variable Measurement Sampling Intervals
Common ground target dynamic models include the nearly constant velocity (NCV), nearly constant acceleration (NCA), and nearly constant turn (NCT) models. Most of the papers on the interacting multiple model (IMM) estimator use a constant Markov chain transition probability matrix (TPM) corresponding to a constant measurement sampling interval. However, a multi-sensor ground target tracking system usually employs ground moving target indicator radar, electro-optical, infrared, video, acoustic, and seismic sensors, for which the sampling intervals are different. Modeling such systems requires using a variable sampling interval in the IMM estimator, which in turn requires the use of a non-constant TPM. An analytic expression for the TPM with variable sampling interval exists for two dynamic models. When the number of dynamic models is greater than two, the TPM can be numerically calculated efficiently. We present the technical approach for the IMM estimator with variable sampling intervals. Preliminary numerical results are presented for a maneuvering target with the NCV, NCA, and NCT models using 200 Monte Carlo simulations
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
IMM Estimator for Ground Target Tracking with Variable Measurement Sampling Intervals
Common ground target dynamic models include the nearly constant velocity (NCV), nearly constant acceleration (NCA), and nearly constant turn (NCT) models. Most of the papers on the interacting multiple model (IMM) estimator use a constant Markov chain transition probability matrix (TPM) corresponding to a constant measurement sampling interval. However, a multi-sensor ground target tracking system usually employs ground moving target indicator radar, electro-optical, infrared, video, acoustic, and seismic sensors, for which the sampling intervals are different. Modeling such systems requires using a variable sampling interval in the IMM estimator, which in turn requires the use of a non-constant TPM. An analytic expression for the TPM with variable sampling interval exists for two dynamic models. When the number of dynamic models is greater than two, the TPM can be numerically calculated efficiently. We present the technical approach for the IMM estimator with variable sampling intervals. Preliminary numerical results are presented for a maneuvering target with the NCV, NCA, and NCT models using 200 Monte Carlo simulations
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Scheduling Binary Proximity Sensors for Robust Target Tracking
This paper describes two scheduling algorithms designed to improve target tracking performance in a distributed network of binary proximity sensors. Tracking with such sensors is a difficult problem as they only transmit a single binary digit regarding the presence of a target. In addition, the operational status of these sensors may not be accurately known. This paper describes extensions to a Gaussian mixture-based tracking algorithm which aid in addressing these problems. These extensions reduce computational complexity and improve accuracy by scheduling status queries to selected sensors
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Scheduling Binary Proximity Sensors for Robust Target Tracking
This paper describes two scheduling algorithms designed to improve target tracking performance in a distributed network of binary proximity sensors. Tracking with such sensors is a difficult problem as they only transmit a single binary digit regarding the presence of a target. In addition, the operational status of these sensors may not be accurately known. This paper describes extensions to a Gaussian mixture-based tracking algorithm which aid in addressing these problems. These extensions reduce computational complexity and improve accuracy by scheduling status queries to selected sensors
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Optimal Scheduling for State Estimation Using a Terminal Cost Function
In this paper we consider state estimation problems where there are multiple independent processes evolving but the estimation scheme can only select a limited set of processes to measure at each time step. Within a Gauss-Markov framework, we show the optimality of a scheduling scheme under various scenarios. These types of problems are common in sensor scheduling applications
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Optimal Scheduling for State Estimation Using a Terminal Cost Function
In this paper we consider state estimation problems where there are multiple independent processes evolving but the estimation scheme can only select a limited set of processes to measure at each time step. Within a Gauss-Markov framework, we show the optimality of a scheduling scheme under various scenarios. These types of problems are common in sensor scheduling applications
- 30 May 2006
- Published by Elsevier in Digital Signal Processing
- Vol. 16 (5) , 479-487
Optimal target tracking with restless bandits
- 30 May 2006
- Published by Elsevier in Digital Signal Processing
- Vol. 16 (5) , 479-487
Optimal target tracking with restless bandits