Geometric masking via adaptive circle placement for image and signal processing

Öz

This study offers a novel algorithm for representing any segmented irregular geometric domain through circle decomposition, intended for applications in signal and image processing. The proposed algorithm optimizes the placement of the largest circles within a dynamic boundary, providing an efficient method for both masking and filtering operations. By utilizing user-defined boundary information, the algorithm identifies the maximum-sized, non-overlapping or overlapping by a tolerance value circles within irregular domains, creating a geometric summary of the area. This summary can be applied in various tasks such as image recognition, local filtering, segmentation, and feature extraction. The results demonstrate the high performance of the proposed method and introduce a fast, dynamic, and parametrically controllable approach to the literature for representing closed-shaped objects as simpler and more effective datasets.

Anahtar Kelimeler

• Circle Packing
• Adaptive Filtering
• Signal Processing
• Image Processing

Görüntü ve sinyal işleme için adaptif daire yerleşimi yoluyla geometrik maskeleme

Öz

Bu çalışma, sinyal ve görüntü işleme uygulamaları için herhangi bir bölümlenmiş düzensiz geometrik alanı daire ayrıştırmasıyla temsil etmek üzere yenilikçi bir algoritma sunmaktadır. Önerilen algoritma, dinamik bir sınır içinde en büyük dairelerin yerleşimini optimize ederek hem maskeleme hem de filtreleme işlemleri için verimli bir yöntem sağlar. Kullanıcı tanımlı sınır bilgilerini kullanarak algoritma, düzensiz alanlar içinde maksimum boyutlu, çakışmayan veya ir tolerans dahilinde çakışan daireleri tanımlar ve alanın geometrik bir özetini oluşturur. Bu özet, görüntü tanıma, yerel filtreleme, segmentasyon ve özellik çıkarma gibi çeşitli görevlerde kullanılabilir. Sonuçlar, önerilen yöntemin yüksek performansını gösterirken, kapalı şekilli nesnelerin daha basit ve etkili veri kümeleri olarak temsil edilmesi için hızlı, dinamik ve parametrik olarak kontrol edilebilir bir yaklaşımı literatüre kazandırmaktadır.

Anahtar Kelimeler

• Daire Yerleştirme
• Adaptif Filtreleme
• Sinyal İşleme
• Görüntü İşleme

Kaynakça

1. [1 ] S. S. Haykin, ve B. Van Veen, “Signals and systems,” p. 802, 2004.
2. [2] A. V. Oppenheim, R. W. Schafer, ve J. R. Buck, “Discrete-time signal processing,” p. 864, 1999.
3. [3] R. C. Gonzales, R. E. Woods, “Digital Image Processing Digital Image Fundamental,” Radiol Technol, 2018.
4. [4] C. Solomon, ve T. Breckon, “Fundamentals of digital image processing : a practical approach with examples in matlab,” 2013, Accessed: Ara. 20, 2024. [Online]. Available: https://www.everand.com/book/149045666/Fundamentals-of-Digital-Image-Processing-A-Practical-Approach-with-Examples-in-Matlab
5. [5] G. Fejes Tóth, “Multiple packing and covering of the plane with circles,” Acta Mathematica Academiae Scientiarum Hungaricae, vol. 27, no. 1–2, pp. 135–140, Mar. 1976, doi: 10.1007/BF01896768.
6. [6] Y. D. Marr, ve D. E. Hildreth, “Theory of edge detection,” Proc R Soc Lond B Biol Sci, vol. 207, no. 1167, pp. 187–217, Şub. 1980, doi: 10.1098/rspb.1980.0020.
7. [7] T. McInerney, ve D. Terzopoulos, “Deformable models in medical image analysis: a survey,” Med Image Anal, vol. 1, no. 2, pp. 91–108, Oca. 1996, doi: 10.1016/S1361-8415(96)80007-7.
8. [8] G. L. Orick, K. Stephenson, ve C. Collins, “A linearized circle packing algorithm,” Computational Geometry, vol. 64, pp. 13–29, Ağu. 2017, doi: 10.1016/j.comgeo.2017.03.002.

9. [9] Y. J. Ahn, C. M. Hoffmann, ve P. Rosen, “A note on circle packing,” Journal of Zhejiang University SCIENCE C, vol. 13, no. 8, pp. 559–564, Ağu. 2012, doi: 10.1631/jzus.C1200010.
10. [10] S. J. Gortler, C. Gotsman, ve D. Thurston, “Discrete one-forms on meshes and applications to 3D mesh parameterization,” Comput Aided Geom Des, vol. 23, no. 2, pp. 83–112, Şub. 2006, doi: 10.1016/j.cagd.2005.05.002.
11. [11] R. L. Graham, B. D. Lubachevsky, K. J. Nurmela, ve P. R. J. Östergård, “Dense packings of congruent circles in a circle,” Discrete Math, vol. 181, no. 1–3, pp. 139–154, Şub. 1998, doi: 10.1016/S0012-365X(97)00050-2.
12. [12] R. L. Lubachevsky, ve B. D. Graham, “Dense Packings of Equal Disks in an Equilateral Triangle: From 22 to 34 and Beyond,” Combinatorics, no. 1, pp. 1–39, Jun. 2004, Accessed: Ara. 14, 2024. [Online]. Available: http://arxiv.org/abs/math/0406252.
13. [13] Sh. I. Galiev, ve M. A. Karpova, “Optimization of multiple covering of a bounded set with circles,” Computational Mathematics and Mathematical Physics, vol. 50, no. 4, pp. 721–732, Nis. 2010, doi: 10.1134/S0965542510040135.
14. [14] G. F. Tóth, “Multiple packing and covering of spheres,” Acta Mathematica Academiae Scientiarum Hungaricae, vol. 34, no. 1–2, pp. 165–176, Mar. 1979, doi: 10.1007/BF01902605.
15. [15] C. T. J. Zahn, “Black box maximization of circular coverage:,” Gaithersburg, MD, 1962. doi: 10.6028/NBS.RPT.7386.
16. [16] F. Aurenhammer, “Voronoi diagrams—a survey of a fundamental geometric data structure,” ACM Comput Surv, vol. 23, no. 3, pp. 345–405, Eyl. 1991, doi: 10.1145/116873.116880.
17. [17] J. W. Cannon, W. J. Floyd, ve W. R. Parry, “Introduction to circle packing: the theory of discrete analytic functions,” The Mathematical Intelligencer, vol. 29, no. 3, pp. 63–66, Haz. 2007, doi: 10.1007/BF02985693.
18. [18] H. Haslach, “Random Heterogeneous Materials: Microstructure and Macroscopic Properties,” Appl Mech Rev, vol. 55, no. 4, pp. B62–B63, Tem. 2002, doi: 10.1115/1.1483342.
19. [19] K. A. Dowsland, M. Gilbert, ve G. Kendall, “A local search approach to a circle cutting problem arising in the motor cycle industry,” Journal of the Operational Research Society, vol. 58, no. 4, pp. 429–438, Nis. 2007, doi: 10.1057/palgrave.jors.2602170.
20. [20] Y. Jiao, F. H. Stillinger, ve S. Torquato, “Optimal Packings of Superdisks and the Role of Symmetry,” Phys Rev Lett, vol. 100, no. 24, p. 245504, Haz. 2008, doi: 10.1103/PhysRevLett.100.245504.
21. [21] M. S. Bayzid, T. Hunt, ve T. Warnow, “Disk covering methods improve phylogenomic analyses,” BMC Genomics, vol. 15, no. S6, p. S7, Eki. 2014, doi: 10.1186/1471-2164-15-S6-S7.
22. [22] Jianbo Shi, ve J. Malik, “Normalized cuts and image segmentation,” IEEE Trans Pattern Anal Mach Intell, vol. 22, no. 8, pp. 888–905, Ağu. 2000, doi: 10.1109/34.868688.
23. [23] S. S. Skiena, The Algorithm Design Manual. in Texts in Computer Science. Cham: Springer International Publishing, 2020. doi: 10.1007/978-3-030-54256-6.
24. [24] A. S. Elfishawy, S. B. Kesler, ve A. S. Abutaleb, “Adaptive algorithms for change detection in image sequence,” Signal Processing, vol. 23, no. 2, pp. 179–191, May 1991, doi: 10.1016/0165-1684(91)90072-Q.
25. [25] T. H. Cormen, C. E. Leiserson, R. L. Rivest, ve C. Stein, “Introduction to algorithms, 4 Edition,” The MIT Press Cambridge, Massachusetts London, England, p. 1291, 2022, Accessed: Nis. 13, 2025. [Online]. Available: http://lccn.loc.gov/2021037260
26. [26] S. S. Skiena, The Algorithm Design Manual. Cham: Springer International Publishing, 2020. doi: 10.1007/978-3-030-54256-6.