返回
An adaptive graph cut algorithm for video moving objects detection
DOI:10.1007/s11042-013-1566-x.png)
摘要
En 中文
The algorithms based on graph cut have the advantage to detect the moving objects effectively and robustly. The main trouble of the algorithm based on graph cut is that its model parameters will be determined empirically. In this paper, a novel algorithm of adaptive graph cut is proposed to detect video moving objects. Based on Markov random field model, the proposed algorithm uses the numbers of moving objects pixels and objectives-background pixel-pairs to describe the geometric features of the moving objects. And the relationship between the geometric features of the moving objects and the model parameters are set up. In this paper, the model parameters are adaptively optimized through the extraction and prediction of the geometric features of moving objects. Then the detection based on the graph cut is preformed on ROI, which well achieves the balance between the computation and accuracy. Finally, the experimental results show the proposed algorithm can hold the details of moving objects more effectively compared with other algorithms, and improve the detection performance of moving object in the video surveillance.
Keyword:
Moving objects detection
Graph cut
Region of interest
Markov random field
Kalman prediction
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
2.0W
被引数:
3.2W
机构
引用论文
Renal Failure Among Multiple Myeloma Patients Utilizing Carfilzomib and Associated Factors in the “Real World卡非佐米治疗的多发性骨髓瘤患者中的肾功能衰竭及其相关因素:真实世界研究
Burkholderia cenocepacia Type VI Secretion System Mediates Escape of Type II Secreted Proteins into the Cytoplasm of Infected Macrophages
PLoS ONE
IF0
Mining miRNAs’ Expressions in Glioma Based on GEO Database and Their Effects on Biological Functions基于GEO数据库的胶质瘤miRNAs表达挖掘及其对生物功能的影响

