
(Our navigation buttons are at the TOP of each screen.)CramérRao Lower Bound (CRLB) Analysis & EvaluationKey Benefits:
Capabilities:
An interesting result due to A. J. Stam [24,
1959] is the derivation of WeylHeisenberg uncertainty principle in physics
using a specific version of the CRB. Further applications in physics of CRB and
Fisher information as a concept underlying the well known physical theories can
be found in the book by B. Roy Frieden, “Physics from Fisher Information”
[25]. Historical Account of our experience therein:[1] Kerr, T. H., “A New Multivariate CramerRao Inequality for Parameter Estimation (Application: Input Probing Function Specification),” Proceedings of IEEE Conference on Decision and Control, Phoenix, AZ, pp. 97103, Dec. 1974.[2] Kerr, T. H., “Status of CRLike Lower bounds for Nonlinear Filtering,” IEEE Transactions on Aerospace and Electronic Systems, Vol. 25, No. 5, pp. 590601, Sept. 1989 (Author’s reply in Vol. 26, No. 5, pp. 896898, Sept. 1990). [3] Kerr, T. H., “CramérRao Lower Bound Implementation and Analysis for NMD Radar Target Tracking,” TeK Associates Technical Report No. 97101 (for MITRE), Lexington, MA, 2630 Oct. 1997. [4] Kerr, T. H., “NMD White Paper on Designated Action Item,” MITRE, Bedford, MA, Jan. 1998. [5] Kerr, T. H., “CramérRao Lower Bound Implementation and Analysis: CRLB Target Tracking Evaluation Methodology for NMD Radars,” MITRE Technical Report, Contract No. F1962894C0001, Project No. 03984000N0, Bedford, MA, Feb. 1998. [6] Kerr, T. H., “Developing CramérRao Lower Bounds to Gauge the Effectiveness of UEWR Target Tracking Filters,” Proceedings of AIAA\BMDO Technology Readiness Conference and Exhibit, Colorado Springs, CO, 37 Aug. 1998. [7] Kerr, T. H., UEWR Design NotebookSection 2.3: Track Analysis, TeK Associates, Lexington, MA, (for XonTech, Hartwell Rd, Lexington, MA), XonTech Report No. D74410300, 29 Mar. 1999. [8] Kerr, T. H., “A Critical View of Some New and Older approaches to EWR Target Tracking: A Summary and Endorsement of Kalman FilterRelated Techniques,” a tutorial submitted to IEEE Aerospace and Electronic Systems, (yet to be submitted). [9] Hue, C., Le Cadre, J.P., Perez, P., “Posterior CramérRao Bounds for MultiTarget Tracking,” IEEE Trans. on Aerospace and Electronic Systems, Vol. 42, No. 1, pp. 3749, January 2006. [10] Gault, S., Hachem, W., Ciblat, P., “Joint Sampling Clock Offset and Channel Estimation for OFDM Signals: CramérRao Bound and Algorithm,” IEEE Trans. on Signal Processing, Vol. 54, No. 5, pp. 18751885, May 2006. [11] Yetik, I. S., Nehorai, A., “Performance Bounds on Image Registration,” IEEE Trans. on Signal Processing, Vol. 54, No. 5, pp. 17371749, May 2006. [12] Zou, Q., Lin, Z., Ober, R. J., “The CramérRao Lower Bound for Bilinear Systems,” IEEE Trans. on Signal Processing, Vol. 54, No. 5, pp. 16661680, May 2006. [13] Eldar, Y., “Uniformly Improving the CramérRao Bound and MaximumLikelihood Estimation,” IEEE Trans. on Signal Processing, Vol. 54, No. 8, pp. 29432956, Aug. 2006. [14] Brehard, T., Le Cadre, J.P., “ClosedForm Posterior CramérRao Bounds for BearingsOnly Tracking,” IEEE Trans. on Aerospace and Electronic Systems, Vol. 42, No. 4, pp. 11981223, Oct. 2006. [15] AuYueng, C. K., Wong, K. T., “CRB: SinusoidSources' Estimation using Collocated Dipoles/Loops,” IEEE Trans. on Aerospace and Electronic Systems, Vol. 45, No. 1, pp. 94109, Jan. 2009. [16] Kay, S., Xu, C., “CRLB via the Characteristic Function with Application to the KDistribution,” IEEE Trans. on Aerospace and Electronic Systems, Vol. 44, No. 3, pp. 11611168, Jul. 2008. [17] Smith, S. T., “Statistical Resolution Limits and the Complexified CramérRao Bound,” IEEE Trans. on Signal Processing, Vol. 53, No. 5, pp. 15971609, May 2005. [18] Smith, S. T., “Covariance, Subspace, and Intrinsic CramérRao Bounds,” IEEE Trans. on Signal Processing, Vol. 53, No. 5, pp. 16101630, May 2005. [19] Gini, F., Regianini, R., Mengali, U., “The Modified CramérRao Lower Bound in Vector Parameter Estimation,” IEEE Trans. on Signal Processing, Vol. 46, No. 1, pp. 5260, Jan. 1998. [20] Buzzi, S., Lops, M., Sardellitti, S., “Further Results on CramérRao Bounds for Parameter Estimation in LongCode DS/CDMA Systems,” IEEE Trans. on Signal Processing, Vol. 53, No. 3, pp. 1216 1221, Mar. 2005. [22] Boers, Y., Driessen, H., “A Note on Bounds for Target Tracking with Pd < 1,” IEEE Trans. on Aerospace and Electronic Systems, Vol. 45, No. 2, pp. 640646, Apr. 2009. [23] Bobrovsky, Wolf, and Zakai, Annals of Statistics, Vol. 15, pp. 14211438, 1987. [25] Frieden, B. Roy, Physics from Fisher
Information, Cambridge University Press, 1998. [26] Brody, D. C. and Hughston, L. P., Proceedings of the Royal Society, Vol. 454, pp. 24452475, 1998. [27] Wolf, E. Mayor, Annals of Probability, Vol. 18, pp. 840850, 1990. [28] http://www.aiaccess.net/English/Glossaries/GlosMod/e_gm_cramer_rao.htm [29] http://www.scholarpedia.org/article/CramérRao_bound [30] http://www.dauwels.com/Papers/BCRB.pdf [31] I. Rapoport and Y. Oshman, “A CramérRaotype estimation lower bound for systems with measurement faults,” IEEE Transactions on Aerospace and Electronic Systems, Vol. 50, No. 9, pp. 1234–1245, Sept. 2005. [32] R. M. Taylor, Jr., B. P. Flanagan, and J. A. Uber, “Computing the recursive posterior
CramérRao bound for a nonlinear nonstationary system,” in
IEEE International Conference on Acoustics, Speech, and Signal Processeing (ICASSP),
Vol. 6, pp. 673–676, Apr. 2003. [40] F. E. Daum, “Bounds on performance for multiple target tracking,” IEEE Transactions on Automatic Control, Vol. 35, No. 4, pp. 443–446, Apr. 1990. [41] F. E. Daum, “A CramérRao bound for multiple target tracking,” in
Proceedings of SPIE, Signal and Data Processing of Small Targets, Vol. 1481, Orlando,
FL, pp. 341–343, Apr. 1991. [43] M. L. Hernandez, A. D. Marrs, N. J. Gordon, S. R. Maskell, and C. M. Reed, “CramérRao bounds for nonlinear filtering with measurement origin uncertainty,” in Proceedings of the 5th International Conference on Information Fusion, Vol. 1, pp. 18–25, Jul. 2002. [44] X. Zhang, P. Willett, and Y. BarShalom, “Dynamic CramérRao bound for target tracking in clutter,” IEEE Transactions on Aerospace and Electronic Systems, Vol. 41, No. 5, pp. 1154–1167, Oct. 2005. [45] N. Bergman, “Recursive Bayesian estimation: Navigation and tracking applications,” Ph.D. dissertation, Linkoping University, SE581 83 Linkoping, Sweden, April 1999. [46] N. Bergman, Sequential Monte Carlo Methods in Practice, New York: Springer, New York, 2001 (Chapter: Posterior CramérRao Bounds for Sequential Estimation, pp. 321–338). [47] Justin Dauwels, “Computing Bayesian
CramerRao bounds," http://www.dauwels.com/Papers/BCRB.pdf [48] Justin Dauwels, Sascha,
Korl, “A Numerical Method to Compute CramerRaoType Bounds for Challenging Estimation
Problems,” [49] CORE https://core.ac.uk/display/23680005 (several different papers coauthored by others, as, perhaps, offshoots) [50] Frank R. Kschischang , Brendan J. Frey , HansAndrea
Loeliger, “Factor Graphs and the SumProduct Algorithm,” IEEE Transactions on Information
Theory, 1998. How to Handle Jamming Considerations: [52] Myers, L., Improved Radio Jamming Techniques: Electronic Guerilla Warfare, ISBN 0873645200, Paladin Press, Boulder, CO, 1989. [53] Chapter 8 of BarShalom, Y., Blair, W. D., (Eds.), MultitargetMultisensor Tracking Applications and Advances, Vol. III, Artech House Inc., Boston, MA, 2000.
Gaussian Confidence Region or uncertainty ellipsoid (associated with target tracking) goes from “being a pancake” (at the horizon) to “being a football” (after sufficient radar returns have accrued). When knowledge of target’s trajectory is sufficiently accurate, then the target can be successfully intercepted. Tom Kerr and Eli Brookner (Click here to view info about Eli’s recent book.) For more about Eli, please click: http://www.raytheon.com/newsroom/feature/ids_brookner06/ http://www.google.com/patents/about?id=zsR3AAAAEBAJ&dq=parachute+camera&ie=ISO88591 http://ieeeaess.org/main/index.php?option=com_content&view=article&id=57&Itemid=66 http://pipl.com/directory/name/Brookner/Eli http://www.ieee.org/about/awards/bios/picard_recipients.html http://www.mwjournal.com/Journal/Print.asp?Id=AR_5352

TeK Associates’ motto : “We work hard to make your job easier!” 