期刊文献+

降低车位占用告警误报率的策略与方法研究

Strategies and Methods to Lower False Alarm Rate of Parking Space Occupancy
下载PDF
导出
摘要 针对车位占用告警系统中由于车牌识别错误导致的错误告警,提出了多种告警过滤的策略和方法。本文首先阐述了车位占用告警的工作原理,然后针对告警错误的原因进行分析,对于系统抖动、环境影响等导致的车牌号码识别错误引起的错误告警分别使用不同的过滤方法,并通过程序编码降低了告警误报率,最终使得车位占用告警准确率提升到98.7%,减少了物业管理人员的人工干预,进一步提升了用户车位使用体验,在实际应用中获得了较好的效果。 In smart communities,the fixed parking spaces may be occupied by others.This paper proposes a variety of alarm filtering strategies and methods for the false alarms,which are caused by wrong recognition for license plate.This paper firstly explains the working mechanism of the parking space occupancy alarm,and then analyzes the reasons for the false alarm errors.For the false alarms caused by the license plate number recognition errors introduced by system jitter and environmental impact,different filtering methods are used to reduce the false alarm rate.And these strategies and methods are further implemented in the software.The correct alarm rate can reach up to 98.7%.This reduced the manual interference and further improve the parking experience for the owner.These strategies and methods have gained very good results in practical applications.
作者 魏慧玲 相伟 Wei Huiling;Xiang Wei(Qingdao Aruie Technologies,Shandong,Qingdao,266100,China)
出处 《仪器仪表用户》 2023年第7期106-109,共4页 Instrumentation
关键词 智慧社区 车牌识别 车位占用 告警过滤 字符编辑距离 smart community plate recognition parking space occupancy alarm filtering string editing distance
  • 相关文献

参考文献5

二级参考文献30

  • 1刘振栋,李恒武,朱大铭.计算最大堆迭的RNA二级结构预测算法[J].南京大学学报(自然科学版),2005,41(5):532-537. 被引量:4
  • 2Wagner R A, Fischer M J. The string-to-string correction problem. Journal of the ACM, 1974, 21(1) :168-173.
  • 3Hirschberg D S. A linear space algorithm for computing maximal common subsequences. Communications of the ACM, 1975, 18:341-343.
  • 4Hunt J W, Szymanski T G. A fast algorithm for computing longest common subsequences. Communications of the ACM, 1977, 20:350-353.
  • 5Hirschberg D S. Algorithms for the longest common subsequence problem. Journal of the ACM,1977, 24: 664-675.
  • 6Pevzner P A, Waterman M S. Generalized sequence alignment and duality. Advance Applied Mathematics, 1993,14 (2) :139-171.
  • 7Nakatsu N, Kambayashi Y, Yajima S. A longest common subsequence algorithm suitable for similar texts. Aeta Informatica, 1982,18 : 171 -179.
  • 8Ukkonen E. Algorithms for approximate string matching. Information and Control, 1985, 64: 100-118.
  • 9Myers E W. An O(ND) difference algorithm and its variations. Algorithmica, 1986, 1 : 251-266.
  • 10Rick C. Simple and fast linear space computation of longest common subsequences. Information Processing letters, 2000, 75:275-281.

共引文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部