Algorithmic approaches to real and complex geometry in computer vision applications
Farhadeeba Shaikhfarhadeeba.shaikh@mitwpu.edu.inDepartment of PolytechnicDVK MIT World Peace UniversityPune, Maharashtra, IndiaView full profile → , Mohammad Sohail Pervezsohailnuz37@gmail.comDepartment of Mechanical EngineeringAnjuman College of Engineering and TechnologyNagpur, Maharashtra, 440001, IndiaView full profile → , *Satish S. BanaitCorresponding authorsatish.banait@vit.eduDepartment of Computer Science and Engineering (AI)Vishwakarma Institute of TechnologyPune, Maharashtra, 411037, IndiaView full profile → , Shubham Goswamishubham.goswami@niu.edu.inDepartment of Computer Science & EngineeringNoida International UniversityNoida, Uttar Pradesh, IndiaView full profile → , Anil Kumaranilkumar@poornima.orgDepartment of Computer Science and EngineeringPoornima Institute of Engineering & TechnologyJaipur, Rajasthan, 302022, IndiaView full profile → , Uday Chandrakant Patkarudaypatkarcomp@gmail.comDepartment of Computer EngineeringBharati Vidyapeeth’s College of Engineering LavalePune, Maharashtra, 412115, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 10 Dec 2024
- Published Online:
- 30 Sep 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIM-2377
- Pages:
- 2349–2357
Abstract
Keywords
Subject Classifications
References
[1] M. C. Tsakiris, L. Peng, A. Conca, L. Kneip, Y. Shi, and H. Choi, “An algebraic-geometric approach for linear regression without correspondences,” IEEE Trans. Inf. Theory, vol. 66, no. 8, pp. 5130–5144 (Aug. 2020).
[2] A. Pananjady, M. J. Wainwright, and T. A. Courtade, “Linear regression with shuffled data: Statistical and computational limits of permutation recovery,” IEEE Trans. Inf. Theory, vol. 64, no. 5, pp. 3286–3300 (May 2018).
[3] J. Unnikrishnan, S. Haghighatshoar, and M. Vetterli, “Unlabeled sensing with random linear measurements,” IEEE Trans. Inf. Theory, vol. 64, no. 5, pp. 3237–3253 (May 2018).
[4] A. U. Chaudhari and A. S. Lajurkar, “Implementing a passive aggressive classifier to detect false information,” Int. J. Adv. Res. Comput. Commun. Eng., vol. 12, no. 4, pp. 767–774 (2023).
[5] J. S. Sawale, P. V. Barekar, J. M. Gandhi, S. N. Gujar, S. Limkar, and S. N. Ajani, “Deep learning for image-based diagnosis: Applications in medical imaging for drug development,” J. Stat. Manage. Syst., vol. 27, no. 2, pp. 201–212 (2024).
[6] M. Slawski and E. Ben-David, “Linear regression with sparsely permuted data,” Electron. J. Statist., vol. 13, no. 1, pp. 1–36 (2019).
[7] L. Jin and C. Xing, “Algebraic geometry codes with complementary duals exceed the asymptotic Gilbert-Varshamov bound,” IEEE Trans. Inf. Theory, vol. 64, no. 9, pp. 6277–6282 (Sep. 2018).
[8] D. Dhabliya, S. Kunche, S. Dingankar, S. S. Dari, R. Dhabliya, and V. Khetani, “Blockchain technology as a paradigm for enhancing cyber security in distributed systems,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 2-B, pp. 729–740 (2024).
[9] P. Sahane, M. Gulhane, N. Rakesh, S. M. M. Naidu, M. Grover, and V. Mahajan, “Evaluating lightweight encryption schemes for resource-constrained devices in wireless sensor networks,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 28, no. 5-A, pp. 1803–1812 (2025).
[10] A. Godbole, R. Dhabliya, V. Deshpande, S. A. Sivakumar, B. M. Shankar, and V. Khetani, “Ethical hacking and penetration testing strengthening cybersecurity posture through offensive security measures,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 4, pp. 1295–1305 (2024).
[11] P. Siva, G. B. Pujitha, G. S. Krishna, G. Hemanth, and B. M. Sai Teja, “Smart Surveillance Systems Using YOLOv8: A Scalable Approach for Crowd and Threat Detection”, IJRAET, vol. 14, no. 1, pp. 44–53 (Apr. 2025).
[12] W. N. Anandpwar, S. M. Barhate, and M. P. Dhore, “Designing an Efficient Machine Learning-Based Intrusion Detection System for Enhanced Cyber Security in Modern Networks”, Int Journal Adv Comp Theory Engg, vol. 14, no. 1, pp. 70–75 (Apr. 2025).
