Formal analysis of 2D image processing filters using higher-order logic theorem proving

被引:0
|
作者
Adnan Rashid
Sa’ed Abed
Osman Hasan
机构
[1] National University of Sciences and Technology (NUST),School of Electrical Engineering and Computer Science (SEECS)
[2] College of Engineering and Petroleum,Computer Engineering Department
[3] Kuwait University,undefined
关键词
Formal analysis; 2D image processing systems; 2D ; -transform; Theorem proving; HOL Light; Higher-order logic;
D O I
暂无
中图分类号
学科分类号
摘要
Two-dimensional (2D) image processing systems are concerned with the processing of the images represented as 2D arrays and are widely used in medicine, transportation and many other autonomous systems. The dynamics of these systems are generally modeled using 2D difference equations, which are mathematically analyzed using the 2D z-transform. It mainly involves a transformation of the difference equations-based models of these systems to their corresponding algebraic equations, mapping the 2D arrays (2D discrete-time signals) over the (z1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$z_1$$\end{document},z2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$z_2$$\end{document})-domain. Finally, these (z1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$z_1$$\end{document},z2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$z_2$$\end{document})-domain representations are used to analyze various properties of these systems, such as transfer function and stability. Conventional techniques, such as paper-and-pencil proof methods, and computer-based simulation techniques for analyzing these filters cannot assert the accuracy of the analysis due to their inherent limitations like human error proneness, limited computational resources and approximations of the mathematical expressions and results. In this paper, as a complimentary technique, we propose to use formal methods, higher-order logic (HOL) theorem proving, for formally analyzing the image processing filters. These methods can overcome the limitations of the conventional techniques and thus ascertain the accuracy of the analysis. In particular, we formalize the 2D z-transform based on the multivariate theories of calculus using the HOL Light theorem prover. Moreover, we formally analyze a generic (L1,L2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L_1,L_2$$\end{document})-order 2D infinite impulse response image processing filter. We illustrate the practical effectiveness of our proposed approach by formally analyzing a second-order image processing filter.
引用
收藏
相关论文
共 50 条
  • [1] Formal analysis of 2D image processing filters using higher-order logic theorem proving
    Rashid, Adnan
    Abed, Sa'ed
    Hasan, Osman
    EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING, 2022, 2022 (01)
  • [2] Formal Analysis of the Biological Circuits using Higher-order-logic Theorem Proving
    Abed, Sa'ed
    Rashid, Adnan
    Hasan, Osman
    PROCEEDINGS OF THE 35TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING (SAC'20), 2020, : 3 - 7
  • [3] Optimization of Executable Formal Interpreters Developed in Higher-Order Logic Theorem Proving Systems
    Yang, Zheng
    Lei, Hang
    IEEE ACCESS, 2018, 6 : 70331 - 70348
  • [4] Graph Representations for Higher-Order Logic and Theorem Proving
    Paliwal, Aditya
    Loos, Sarah M.
    Rabe, Markus N.
    Bansal, Kshitij
    Szegedy, Christian
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 2967 - 2974
  • [5] Formal Analysis of Unmanned Aerial Vehicles Using Higher-Order-Logic Theorem Proving
    Abed, Sa'ed
    Rashid, Adnan
    Hasan, Osman
    JOURNAL OF AEROSPACE INFORMATION SYSTEMS, 2020, 17 (09): : 481 - 495
  • [6] Tutorial: Using TPS for higher-order theorem proving and ETPS for teaching logic
    Andrews, PB
    Brown, CE
    AUTOMATED DEDUCTION - CADE-17, 2000, 1831 : 511 - 512
  • [7] Progress in the Development of Automated Theorem Proving for Higher-Order Logic
    Sutcliffe, Geoff
    Benzmueller, Christoph
    Brown, Chad E.
    Theiss, Frank
    AUTOMATED DEDUCTION - CADE-22, 2009, 5663 : 116 - +
  • [8] Theorem Proving in Dependently-Typed Higher-Order Logic
    Rothgang, Colin
    Rabe, Florian
    Benzmueller, Christoph
    AUTOMATED DEDUCTION, CADE 29, 2023, 14132 : 438 - 455
  • [9] A general formal memory framework for smart contracts verification based on higher-order logic theorem proving
    Yang Z.
    Lei H.
    International Journal of Performability Engineering, 2019, 15 (11) : 2998 - 3007
  • [10] Formal reasoning about synthetic biology using higher-order-logic theorem proving
    Abed, Sa'ed
    Rashid, Adnan
    Hasan, Osman
    IET SYSTEMS BIOLOGY, 2020, 14 (05) : 271 - 283