A network flow approach in finding maximum likelihood estimate of high concentration regions
暂无分享,去创建一个
[1] B. Silverman. Density estimation for statistics and data analysis , 1986 .
[2] Dimitri P. Bertsekas,et al. Dynamic Programming and Optimal Control, Two Volume Set , 1995 .
[3] Nicolas Picard,et al. Estimation of the envelope of a point set with loose boundaries , 2000, Appl. Math. Lett..
[4] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[5] E. Lehmann,et al. Testing Statistical Hypothesis. , 1960 .
[6] C. Fraley,et al. Nonparametric Maximum Likelihood Estimation of Features in Spatial Point Processes Using Voronoï Tessellation , 1997 .
[7] Ian H. Jermyn,et al. Globally optimal regions and boundaries , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[8] Alok Gupta,et al. Dynamic Programming for Detecting, Tracking, and Matching Deformable Contours , 1995, IEEE Trans. Pattern Anal. Mach. Intell..
[9] A. Raftery,et al. Detecting features in spatial point processes with clutter via model-based clustering , 1998 .
[10] C. D. Kemp,et al. Density Estimation for Statistics and Data Analysis , 1987 .
[11] A. Raftery,et al. Nearest-Neighbor Clutter Removal for Estimating Features in Spatial Point Processes , 1998 .
[12] Changming Sun,et al. Circular shortest path in images , 2003, Pattern Recognit..
[13] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .