Skip to main content

Advertisement

Springer Nature Link
Log in

New Binary Particle Swarm Optimization Algorithm for Surveillance and Camera Situation Assessments

  • Original Article
  • Published:
Journal of Electrical Engineering & Technology Aims and scope Submit manuscript

Abstract

The problem of optimal camera placement (OCP) is the objective today, to identify the configurations of camera networks that optimize the area of interest under a set of constraints. In this article, we presented a novel technique based on new binary Particle Swarm Optimization (NBPSO) stimulated probability is anticipated to solve the camera placement problem. Ensuring correct visual coverage area of the monitoring hole with a minimum number of cameras is required. The illustration coverage is defined by practical and consistent assumptions attractive into description camera characteristics. After that, we proposed evolutionary of algorithms based on NBPSO and particle swarm optimization (PSO) are adapted to answer this optimal coverage based camera placement problem. These techniques are introduced in the context of processing constrained optimizations. We consider the case of presence of obstacles which could affect the placement of the cameras. Indeed, there could be a set of points not observed because of the imposed geometry of the obstacles, which occlude the fields of view entering their areas. The performance of NBPSO method stimulated is compared by the techniques many (e.g., genetic algorithms-based (GA), binary Particle Swarm Optimization BPSO, SA…). The results of the simulation were developed for the 2D scenarios which showed the fragrances of the proposed approach. Indeed, for a major element case, NBPS stimulated gives results good the ones obtained by adapting all variants.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Kritter J, Brévilliers M, Lepagnot J, Idoumghar L (2019) On the optimal placement of cameras for surveillance and the underlying set cover problem. Appl Soft Computing 74:133–153

    Article  Google Scholar 

  2. Eberhart R, Kennedy J (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks. Citeseer, pp 1942–1948.

  3. Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In (1997) IEEE International conference on systems, man, and cybernetics. Computational cybernetics and simulation. IEEE , pp4104–4108

  4. Shi Y, Eberhart RC (1999) Empirical study of particle swarm optimization. In: Proceedings of the 1999 congress on evolutionary computation-CEC99 (Cat. No. 99TH8406). IEEE, New York, pp 1945–1950.

  5. Chuang LY, Tsai JH, Yang CH (2010) Binary particle swarm optimization for operon prediction. Nucleic Acids Res 38(12):e128–e128

    Article  Google Scholar 

  6. Taha M, Abualnadi D, Hasan O (2016) Model Order Reduction using fractional order systems. In: 2016 6th IEEE International Conference on Control System, Computing and Engineering (ICCSCE). IEEE, New York, pp 199–204.

  7. Morsly Y, Aouf N, Djouadi MS, Richardson M (2011) Particle swarm optimization inspired probability algorithm for optimal camera network placement. IEEE Sens J 12(5):1402–1412

    Article  Google Scholar 

  8. Gherboudj A, Chikhi S (2011) BPSO Algorithms for Knapsack Problem. In: Özcan A, Zizka J, Nagamalai D (eds) Recent trends in wireless and mobile networks. CoNeCo 2011, WiMo 2011. Communications in Computer and Information Science, vol 162. Springer, Berlin, Heidelberg.

  9. Chakrabarty K, Iyengar SS, Qi H, Cho E (2002) Grid coverage for surveillance and target location in distributed sensor networks. IEEE Trans Comput 51(12):1448–1453

    Article  MathSciNet  Google Scholar 

  10. Hörster E, Lienhart R (2006) On the optimal placement of multiple visual sensors. In: Proceedings of the 4th ACM international workshop on Video surveillance and sensor networks, 2006, pp 111–120.

  11. Indu S, Chaudhury S, Mittal NR, Bhattacharyya A (2009) Optimal sensor placement for surveillance of large spaces. In: 2009 Third ACM/IEEE International Conference on Distributed Smart Cameras (ICDSC). IEEE, New Year, pp 1–8.

  12. Bahrami M, Amiri MJ, Mahmoudi MR, Koochaki S (2017) Modeling caffeine adsorption by multi-walled carbon nanotubes using multiple polynomial regression with interaction effects. J Water Health 15(4):526–535

    Article  Google Scholar 

  13. Haghbin H, Mahmoudi MR, Shishebor Z (2015) Large sample inference on the ratio of two independent binomial proportions. J Math Extension.

  14. Pan JJ, Mahmoudi MR, Baleanu D, Maleki M (2019) On comparing and classifying several independent linear and non-linear regression models with symmetric errors. Symmetry 11(6):820

    Article  Google Scholar 

  15. Mahmoudi MR, Nematollahi AR, Soltani AR (2015) On the detection and estimation of the simple harmonizable processes. Iran J Sci Technol (Sciences) 39(2):239–242

    MathSciNet  Google Scholar 

  16. Holland JH (1992) Genetic algorithms. Sci Am 267(1):66–73

    Article  Google Scholar 

  17. Simon D (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12(6):702–713

    Article  Google Scholar 

  18. Ma H, Simon D, Siarry P, Yang Z, Fei M (2017) Biogeographybased optimization: a 10-year review. IEEE Trans Emerg Top Comput Intell 1(5):391–407

    Article  Google Scholar 

  19. Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82–102

    Article  Google Scholar 

  20. Beyer HG, Schwefel HP (2002) Evolution strategies—a comprehensive introduction. Nat Comput 1(1):3–52

    Article  MathSciNet  Google Scholar 

  21. Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359

    Article  MathSciNet  Google Scholar 

  22. Baluja S (1994) Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical report CMU-CS-94- 163, Carnegie Mellon University, USA.

  23. Koza JR (1994) Genetic programming as a means for programming computers by natural selection. Stat Comput 4(2):87 112.

  24. Osais Y, St-Hilaire M, Yu FR (2009) On sensor placement for directional wireless sensor networks. In: 2009 IEEE International Conference on Communications. IEEE, New York, pp 1–5.

  25. Soro S (2007) Application-aware resource management in wireless and visual sensor networks. Phd thesis, school of engineering and applied science, University of Rochester, p 43.

  26. Fusco G, Gupta H (2009) Selection and orientation of directional sensors for coverage maximization. In: 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks. IEEE, 2New York, pp 1–9.

  27. Han X, Cao X, Lloyd EL, Shen CC (2008) Deploying directional sensor networks with guaranteed connectivity and coverage. In: 5th Annual IEEE communications society conference on sensor, mesh and ad hoc communications and networks. IEEE, New York, pp 153–160

  28. Pan J, Cai L, Hou YT, Shi Y, Shen SX (2005) Optimal base-station locations in two-tiered wireless sensor networks. IEEE Trans Mob Comput 4(5):458–473

    Article  Google Scholar 

  29. Fragoudakis C, Markou E, Zachos S (2007) Maximizing the guarded boundary of an Art Gallery is APX-complete. Computational Geometry 38(3):170–180.

  30. Bose P, Guibas L, Lubiw A, Overmars M, Souvaine D, Urrutia J (1997) The floodlight problem. Int J Comput Geometry Appl 7(01n02), pp 153–163.

  31. González-Banos H (2001) A randomized art-gallery algorithm for sensor placement. In: Proceedings of the seventeenth annual symposium on Computational geometry, pp 232–240.

  32. Eidenbenz S (2006) Finding minimum hidden guard sets in polygons tight approximability results. Comput Geom 34(2):49–57

    Article  MathSciNet  Google Scholar 

  33. Hutchinson J, Kündgen A (2006) Orthogonal art galleries with interior walls. Discret Appl Math 154(11):1563–1569

    Article  MathSciNet  Google Scholar 

  34. Bottino A, Laurentini A, Rosano L (2007) A tight lower bound for art gallery sensor location algorithms. In: 2007 IEEE conference on Emerging Technologies and Factory Automation (EFTA 2007). IEEE, New York, pp 434–440.

  35. Salleh I (2009) K-vertex guarding simple polygons. Comput Geom 42(4):352–361

    Article  MathSciNet  Google Scholar 

  36. Fragoudakis C, Markou E, Zachos S (2007) Maximizing the guarded boundary of an Art Gallery is APX-complete. Comput Geom 38(3):170–180

    Article  MathSciNet  Google Scholar 

  37. Carlsson S, Nilsson BJ, Ntafos S (1991) Optimum guard covers and m-watchmen routes for restricted polygons. In: Workshop on algorithms and data structures. Springer, Berlin, pp 367–378.

  38. Efrat A, Guibas LJ, Har-Peled S, Lin DC, Mitchell JS, Murali TM (2000) Sweeping simple polygons with a chain of guards. In: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pp 927–936.

  39. Guibas LJ, Latombe JC, LaValle SM, Lin D, Motwani R (1999) A visibility-based pursuit-evasion problem. Int J Comput Geometry Appl 9(04n05):471–493.

  40. Pålsson M, Ståhl J (2008) The camera placement problem: an art gallery problem variation. Lund University, Department of Computer Science

    Google Scholar 

  41. Tóth CD (2000) Art gallery problem with guards whose range of vision is 180. Comput Geom 17(3–4):121–134

    Article  MathSciNet  Google Scholar 

  42. Tóth CD (2002) Art galleries with guards of uniform range of vision. Comput Geom 21(3):185–192

    Article  MathSciNet  Google Scholar 

  43. Kulkarni RV (2011) Senior Member, IEEE, and Ganesh Kumar Venayagamoorthy, Senior Member, IEEE, Particle Swarm Optimization in Wireless Sensor Networks: A Brief Survey. IEEE, New York.

  44. Kukunuru N, Thella BR, Davuluri RL (2010) Sensor deployment using particle swarm optimization. Int J Eng Sci Technol 2(10):5395–5401

    Google Scholar 

  45. Ngatchou PN, Fox WL, El-Sharkawi MA (2005) Distributed sensor placement with sequential particle swarm optimization. In: Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS. IEEE, pp. 385–388.

  46. Topcuoglu HR, Ermis M, Sifyan M (2009) Hybrid evolutionary algorithms for sensor placement on a 3d terrain. In: 2009 Ninth International Conference on Intelligent Systems Design and Applications. IEEE, pp 511–516.

  47. Soleimanzadeh R, Farahani BJ, Fathy M (2010) PSO based deployment algorithms in hybrid sensor networks. Int J Comput Sci Netw Secur 10:167–171

    Google Scholar 

  48. Hassan R, Cohanim B, Weck O (2004) A comparison of particle swarm optimization and the genetic algorithm. American Institute of Aeronautics and Astronautics.

  49. Uysal O, Bulkan S (2008) Comparison of genetic algorithm and particle swarm optimization for bicriteria permutation flowshop scheduling problem. Int J Comput Intell Res 4(2):159–176

    MathSciNet  Google Scholar 

  50. Khanesar MA, Teshnehlab M, Shoorehdeli MA (2007) A novel binary particle swarm optimization. In: 2007 Mediterranean Conference on Control & Automation. IEEE, pp. 1–6.

  51. Chandrasekaran, Gokul et al. (2021) Test scheduling of system-on-chip using dragonfly and ant lion optimization algorithms. J Intell Fuzzy Syst 40(3):4905–4917. https://doi.org/10.3233/JIFS-201691

  52. Chandrasekaran G, Periyasamy S, Rajamanickam KP (2020) Minimization of test time in system on chip using artificial intelligence-based test scheduling techniques. Neural Comput Appl 32:5303–5312. https://doi.org/10.1007/s00521-019-04039-6

  53. Chandrasekaran G, Periyasamy S, Karthikeyan PR (2019) Test scheduling for system on chip using modified firefly and modified ABC algorithms. SN Appl Sci 1:1079. https://doi.org/10.1007/s42452-019-1116-x

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Electrical Engineering, Djillali Liabes University of Sidi Bel Abbes, Sidi Bel Abbès, Algeria

    Chebi Hocine & Abdelkader Benaissa

Authors
  1. Chebi Hocine
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abdelkader Benaissa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chebi Hocine.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hocine, C., Benaissa, A. New Binary Particle Swarm Optimization Algorithm for Surveillance and Camera Situation Assessments. J. Electr. Eng. Technol. (2021). https://doi.org/10.1007/s42835-021-00961-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s42835-021-00961-9

Keywords

Search

Navigation

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy