A Proof That Anderson Acceleration Improves the Convergence Rate in Linearly Converging Fixed-Point Methods (But Not in Those Converging Quadratically)
- Award ID(s):
- 1852876
- NSF-PAR ID:
- 10173140
- Date Published:
- Journal Name:
- SIAM Journal on Numerical Analysis
- Volume:
- 58
- Issue:
- 1
- ISSN:
- 0036-1429
- Page Range / eLocation ID:
- 788 to 810
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
Recent advances in cloud services provide greater computing ability to edge devices on cyber-physical systems (CPS) and internet of things (IoT) but cause security issues in cloud servers and networks. This paper applies homomorphic encryption (HE) to background subtraction (BGS) in CPS/IoT. Cheon et al.'s numerical methods are adopted to implement the non-linear functions of BGS in the HE domain. In particular, square- and square root-based HE-based BGS (HEBGS) designs are proposed for the input condition of the numerical comparison operation. In addition, a fast-converging method is proposed so that the numerical comparison operation outputs more accurate results with lower iterations. Although the outer loop of the numerical comparison operation is removed, the proposed square-based HEBGS with the fast-converging method shows an average peak signal-to-noise ratio value of 20dB and an average structural similarity index measure value of 0.89 compared to the non-HE-based conventional BGS. On a PC, the execution time of the proposed design for each 128×128-sized frame is 0.34 seconds.more » « less