Computationally efficient approximate likelihood procedures for the Boolean model

DOI10.1016/S0167-9473(02)00325-0zbMath1429.60021OpenAlexW2086190013MaRDI QIDQ956820

John C. Handley

Publication date: 26 November 2008

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-9473(02)00325-0

zbMATH Keywords

parameter estimationlikelihood ratio testconfidence regionrecursionmaximum likelihoodrandom setgerm-grain model

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05)

Related Items (1)

Estimation for the simple linear Boolean model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive maximum-likelihood estimation in the one-dimensional discrete Boolean random set model
• Algebraic analysis of the generating functional for discrete random sets and statistical inference for intensity in the discrete Boolean random-set model
• Exact sampling from conditional Boolean models with applications to maximum likelihood inference
• The busy period of the queueing system M/G/∞
• Random Set Theory and Problems of Modeling
• Parameter Estimation in the Poisson Field of Discs
• Sparse Sampling and Maximum Likelihood Estimation for Boolean Models

This page was built for publication: Computationally efficient approximate likelihood procedures for the Boolean model