Mark R. Morelande
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mark R. Morelande has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Branko Ristic
School of Engineering, RMIT University, Melbourne, VIC, Australia
4 shared publications - Bill Moran
Melbourne Systems Laboratory, Department of Electrical and Electronic Engineering, The University of Melbourne, Australia
2 shared publications - Alfonso Farina
SELEX Sistemi Integrati, Via Tiburtina Km. 12.400, 00131 Rome, Italy
1 shared publication D. Musicki
1 shared publication- S. O. Dulman
Ambient Systems B. V., PO Box 217, 7500 AE Enschede, the Netherlands
1 shared publication - Sofia Suvarova
Melbourne Systems Laboratory, Department of Electrical and Electronic Engineering, The University of Melbourne, Australia
1 shared publication
Latest Publications
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (15206149) , III-1417-1417
An Unscented Transformation for Conditionally Linear Models
A new method of applying the unscented transformation to conditionally linear transformations of Gaussian random variables is proposed. This method exploits the structure of the model to reduce the required number of sigma points. A common application of the unscented transformation is to nonlinear filtering where it used to approximate the moments required in the Kalman filter recursion. The proposed procedure is applied to a nonlinear filtering problem which involves tracking a falling object.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (15206149) , III-1417-1417
An Unscented Transformation for Conditionally Linear Models
A new method of applying the unscented transformation to conditionally linear transformations of Gaussian random variables is proposed. This method exploits the structure of the model to reduce the required number of sigma points. A common application of the unscented transformation is to nonlinear filtering where it used to approximate the moments required in the Kalman filter recursion. The proposed procedure is applied to a nonlinear filtering problem which involves tracking a falling object.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (15206149) , II-1105-1105
Performance Bounds and Algorithms for Tracking with a Radar Array
Target tracking using a radar array system is considered. A signal model which includes the effects of path loss, signal delay, Doppler shift and angle-of-arrival is adopted. The conventional approach to radar tracking assumes that the raw measurements are processed to produce a collection of candidate target detections. We propose a new approach in which the raw received measurements are used for tracking. Performance bounds and a simulation analysis of filters developed for each model demonstrate the performance gains which can be achieved by tracking with raw sensor measurements.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (15206149) , II-1105-1105
Performance Bounds and Algorithms for Tracking with a Radar Array
Target tracking using a radar array system is considered. A signal model which includes the effects of path loss, signal delay, Doppler shift and angle-of-arrival is adopted. The conventional approach to radar tracking assumes that the raw measurements are processed to produce a collection of candidate target detections. We propose a new approach in which the raw received measurements are used for tracking. Performance bounds and a simulation analysis of filters developed for each model demonstrate the performance gains which can be achieved by tracking with raw sensor measurements.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 354-359
Cram?r-Rao Bound for Multiple Target Tracking Using Intensity Measurements
The paper investigates the recently proposed ultimate Cramer-Rao lower bound (CRLB) for tracking multiple targets (Ristic et al., 2004). There are three main contributions: (1) The effect of interaction between targets is analysed; (2) The multi-target CRLB is verified via Monte Carlo simulations; (3) The broader implication of the CRLB is illustrated in the context of a wireless sensor network.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 354-359
Cram?r-Rao Bound for Multiple Target Tracking Using Intensity Measurements
The paper investigates the recently proposed ultimate Cramer-Rao lower bound (CRLB) for tracking multiple targets (Ristic et al., 2004). There are three main contributions: (1) The effect of interaction between targets is analysed; (2) The multi-target CRLB is verified via Monte Carlo simulations; (3) The broader implication of the CRLB is illustrated in the context of a wireless sensor network.
- 4 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01912216,p. 530-535
Fast multiple target tracking using particle filters
A fast algorithm for accurate initiation and tracking of multiple targets is developed. The basis of the approach is the linear multi-target (LM) method in which exact joint data association for multiple targets is approximated by single target data association for each target with clutter density modified to include contributions from neighbouring targets. This enables multiple target tracking to be performed with the computational expense of single target tracking. Previously the LM method has been combined with tracking using a Gaussian approximation. In this paper accurate tracking is achieved through the use of a variant of the auxiliary particle filter. Simulation results show that the use of the particle filter is particularly advantageous in demanding scenarios where targets are in close proximity for long periods.
- 4 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01912216,p. 530-535
Fast multiple target tracking using particle filters
A fast algorithm for accurate initiation and tracking of multiple targets is developed. The basis of the approach is the linear multi-target (LM) method in which exact joint data association for multiple targets is approximated by single target data association for each target with clutter density modified to include contributions from neighbouring targets. This enables multiple target tracking to be performed with the computational expense of single target tracking. Previously the LM method has been combined with tracking using a Gaussian approximation. In this paper accurate tracking is achieved through the use of a variant of the auxiliary particle filter. Simulation results show that the use of the particle filter is particularly advantageous in demanding scenarios where targets are in close proximity for long periods.
- 2 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (15206149)
Reduced Sigma Point Filtering for Partially Linear Models
A method for performing unscented Kalman filtering with a reduced number of sigma points is proposed. The procedure is applicable when either the process or measurement equations are partially linear in the sense that only a subset of the elements of the state vector undergo a nonlinear transformation. It is shown that for such models second-order accuracy in the moments required for the unscented Kalman filter recursion can be obtained using a number of sigma points determined by the number of nonlinearly transformed elements rather than the dimension of the state vector. A procedure for computing the sigma points is developed. An application of the proposed method to smoothed target state estimation from bearings measurements is presented
- 2 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (15206149)
Reduced Sigma Point Filtering for Partially Linear Models
A method for performing unscented Kalman filtering with a reduced number of sigma points is proposed. The procedure is applicable when either the process or measurement equations are partially linear in the sense that only a subset of the elements of the state vector undergo a nonlinear transformation. It is shown that for such models second-order accuracy in the moments required for the unscented Kalman filter recursion can be obtained using a number of sigma points determined by the number of nonlinearly transformed elements rather than the dimension of the state vector. A procedure for computing the sigma points is developed. An application of the proposed method to smoothed target state estimation from bearings measurements is presented
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
On Proximity-Based Range-Free Node Localisation in Wireless Sensor Networks
A new centroid formula for range-free sensor node location estimation using the proximity anchor positions is proposed. A detailed statistical analysis of the estimator is presented in one-dimension, taking into account the boundary conditions. The estimator is optimal in the minimum-mean square error sense for the one-dimensional case and outperforms the averaging centroid formula for N>2, where N is the number of proximity anchors
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
On Proximity-Based Range-Free Node Localisation in Wireless Sensor Networks
A new centroid formula for range-free sensor node location estimation using the proximity anchor positions is proposed. A detailed statistical analysis of the estimator is presented in one-dimension, taking into account the boundary conditions. The estimator is optimal in the minimum-mean square error sense for the one-dimensional case and outperforms the averaging centroid formula for N>2, where N is the number of proximity anchors
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Tracking multiple targets with a sensor network
The problem of tracking multiple targets moving through a network of sensors is considered. It is assumed that the sensors send regular returns to a central node at which all processing is performed. Two approaches to the problem are considered: the unscented Kalman filter and a simple implementation of the auxiliary particle filter. The algorithms are formulated under a general sensor model which does not assume a particular statistical model for the measurements. Monte Carlo simulations are used to assess the performances of the algorithms with both a binary sensor model and a non-thresholded sensor model. The unscented Kalman filter significantly outperforms the particle filter in both cases and has a much lower computational expense
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Tracking multiple targets with a sensor network
The problem of tracking multiple targets moving through a network of sensors is considered. It is assumed that the sensors send regular returns to a central node at which all processing is performed. Two approaches to the problem are considered: the unscented Kalman filter and a simple implementation of the auxiliary particle filter. The algorithms are formulated under a general sensor model which does not assume a particular statistical model for the measurements. Monte Carlo simulations are used to assess the performances of the algorithms with both a binary sensor model and a non-thresholded sensor model. The unscented Kalman filter significantly outperforms the particle filter in both cases and has a much lower computational expense
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Smoothing for maneuvering target tracking
Smoothing algorithms for maneuvering target tracking with nonlinear target dynamic and measurement equations are described and investigated. Target motion is represented using a multiple model approach. Techniques based on the interacting multiple model filter (IMMF), hypothesis pruning and maximum a posteriori (MAP) estimation of the maneuvering mode are described. All three techniques are based on the use of the unscented transformation with an augmented state model. A procedure for selecting the sigma points which exploits the partial lineairty of the augmented state model is used. The performances of the algorithms are analysed using a scenario involving a target which undergoes coordinated turn maneuvers. In this scenario, for a sufficiently large number of smoothing lags, the MAP approach and the pruning algorithm have almost equal performance and significantly superior performance to the augmented state IMMF. The MAP approach has the benefit of a reduced computational expense
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Smoothing for maneuvering target tracking
Smoothing algorithms for maneuvering target tracking with nonlinear target dynamic and measurement equations are described and investigated. Target motion is represented using a multiple model approach. Techniques based on the interacting multiple model filter (IMMF), hypothesis pruning and maximum a posteriori (MAP) estimation of the maneuvering mode are described. All three techniques are based on the use of the unscented transformation with an augmented state model. A procedure for selecting the sigma points which exploits the partial lineairty of the augmented state model is used. The performances of the algorithms are analysed using a scenario involving a target which undergoes coordinated turn maneuvers. In this scenario, for a sufficiently large number of smoothing lags, the MAP approach and the pruning algorithm have almost equal performance and significantly superior performance to the augmented state IMMF. The MAP approach has the benefit of a reduced computational expense