Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
MTZ-Fachkongress

Antriebe und Energiesysteme von morgen


Austausch von Automobil- und Energiewirtschaft

Am 14./15. Mai geht es in Chemnitz um die Mobilitätswende durch Elektro- und Wasserstofffahrzeuge.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
A New Scoring Method for Directional Dominance in Images Kapitel lesen Erstes Kapitel lesen

2017 | OriginalPaper | Buchkapitel

Labeling Color 2D Digital Images in Theoretical Near Logarithmic Time

verfasst von : F. Díaz-del-Río, P. Real, D. Onchis

Erschienen in: Computer Analysis of Images and Patterns

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

A design of a parallel algorithm for labeling color flat zones (precisely, 4-connected components) of a gray-level or color 2D digital image is given. The technique is based in the construction of a particular Homological Spanning Forest (HSF) structure for encoding topological information of any image. HSF is a pair of rooted trees connecting the image elements at inter-pixel level without redundancy. In order to achieve a correct color zone labeling, our proposal here is to correctly building a sub-HSF structure for each image connected component, modifying an initial HSF of the whole image. For validating the correctness of our algorithm, an implementation in OCTAVE/MATLAB is written and its results are checked. Several kinds of images are tested to compute the number of iterations in which the theoretical computing time differs from the logarithm of the width plus the height of an image. Finally, real images are to be computed faster than random images using our approach.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Hybrid Cascade Model for Face Detection in the Wild Based on Normalized Pixel Difference and a Deep Convolutional Neural Network
Nächstes Kapitel What Is the Best Depth-Map Compression for Depth Image Based Rendering?
Literatur
1.
Abubaker, A., Qahwaji, R., Ipson, S., Saleh, M.: One scan connected component labeling technique. In: IEEE International Conference on Signal Processing and Communications, pp. 1283–1286. IEEE (2007)
2.
Alnuweiri, H.M., Prasanna, V.K.: Parallel architectures and algorithms for image component labeling. IEEE T. Pattern Anal. 10, 1014–1034 (1992)CrossRef
3.
Ballard, D.H., Brown, C.M.: Computer Vision. Prentice-Hall, Upper Saddle River (1982)
4.
Braquelaire, J.P., Brun, L.: Image segmentation with topological maps and inter-pixel representation. J. Vis. Commun. Image R. 9(1), 62–79 (1998)CrossRef
5.
Chang, F., Chen, C.J., Lu, C.J.: A linear-time component-labeling algorithm using contour tracing technique. Comput. Vis. Image Und. 93(2), 206–220 (2004)CrossRef
6.
Crespo, J., Schafer, R.W.: The flat zone approach and color images. In: Serra, J., Soille, P. (eds.) Mathematical Morphology and Its Applications to Image Processing Computational Imaging and Vision, vol. 2, pp. 85–92. Springer, Dordrecht (1994)CrossRef
7.
Diaz-del-Rio, F., Real, P., Onchis, D.M.: A parallel homological spanning forest framework for 2D topological image analysis. Pattern Recogn. Lett. 83, 49–58 (2016)CrossRef
8.
Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient graph-based image segmentation. Internat. J. Comput. Vis. 59(2), 167–181 (2004)CrossRef
9.
Grana, C., Borghesani, D., Cucchiara, R.: Optimized Block-based connected-component labeling with decision trees. IEEE T. Image Process. 19(6), 1596–1609 (2010)MathSciNetCrossRef
10.
11.
He, L., Chao, Y., Suzuki, K.: A run-based two-scan labeling algorithm. IEEE T. Image Process. 17(5), 749–756 (2008)MathSciNetCrossRef
12.
He, L., Chao, Y., Yang, Y., Li, S., Zhao, X., Suzuki, K.: A novel two-scan connected-component labeling algorithm. In: Yang, G.-C., Ao, S.-L., Gelman, L. (eds.) IAENG Transactions on Engineering Technologies. Lecture Notes in Electrical Engineering, vol. 229, pp. 445–459. Springer, Dordrecht (2013)CrossRef
13.
Hesselink, H., Meijster, A., Bron, C.: Concurrent determination of connected components. Sci. Comp. Programm. 41, 173–194 (2001)MathSciNetCrossRefMATH
14.
Hu, Q., Qian, G., Nowinski, W.L.: Fast connected-component labeling in three-dimensional binary images based on iterative recursion. Comput. Vis. Image Und. 99(3), 414–434 (2005)CrossRef
15.
Johnston, C.T., Bailey, D.G.: FPGA implementation of a single pass connected components algorithm. In: 4th IEEE International Symposium on Electronic Design, Test and Applications, pp. 228–231. IEEE(2008)
16.
Kalentev, O., Rai, A., Kemnitz, S., Schneider, R.: Connected component labeling on a 2D grid using CUDA. J. Parallel Distrib. Comput. 71(4), 615–620 (2011)CrossRef
17.
Kropatsch, W.G.: Building irregular pyramids by dual-graph contraction. IEEE Proc. Vis. Image Signal Process. 142(6), 366–374 (1995)CrossRef
18.
Kovalevsky, V.: Geometry of Locally Finite Spaces. Publishing House Dr. Baerbel Kovalevski, Berlin (2008)
19.
Meyer, F.: From connected operators to leveling. In: Mathematical Morphology and its Applications to Image and Signal Processing. Computational Imaging and Vision, vol. 12, pp. 191–198. Kluwer Academic Publishers (1998)
20.
Molina-Abril, H., Real, P.: Homological spanning forest framework for 2D image analysis. Annals Math. Artificial Intell. 4(64), 385–409 (2012)MathSciNetCrossRefMATH
21.
Montanvert, A., Meer, P., Rosenfeld, A.: Hierarchical image analysis using irregular tessellations. IEEE Trans. Pattern Anal. Mach. Intell. 13(4), 307–316 (1991)CrossRef
22.
Mandler, E., Oberlander, M.F.: One-pass encoding of connected components in multi-valued images. In: Proceedings of the IEEE International Conference on Pattern Recognition, vol. 2, pp. 65–69 (1990)
23.
Niknam, M., Thulasiraman, P., Camorlinga, S.A.: A parallel algorithm for connected component labeling of gray-scale images on homogeneous multicore architectures. J. Phys: Conf. Ser. 256(012010), 1–7 (2010)
24.
Rosenfeld, A., Pfaltz, J.L.: Sequential operations in digital picture processing. J. ACM 13(4), 471–494 (1966)CrossRefMATH
25.
26.
Schwenk, K., Huber, F.: Connected-component labeling algorithm for very complex and high-resolution images on an FPGA platform. In: SPIE Remote Sensing, ISOP (2015)
27.
Shima, Y., Murakami, T., Koga, M., Yashiro, H., Fujisawa, H.: A high-speed algorithm for propagation-type labeling based on block sorting of runs in binary images. In: Proceedings the 10th International Conference Pattern Recognition, pp. 655–658, June 1990
28.
Suzuki, K., Horiba, I., Sugie, N.: Linear-time connected-component labeling based on sequential local operations. Comput. Vis. Image Und. 89(1), 1–23 (2003)CrossRefMATH
29.
Sang, H., Zhang, J., Zhang, T.: Efficient multi-value connected component labeling algorithm and its ASIC design. In: Proceedings of the SPIE Medical Imaging Conference (2007). 67892I
30.
Wu, K., Otoo, E., Suzuki, K.: Optimizing two-pass connected-component labeling algorithms. Pattern Anal. Appl. 12(2), 117–135 (2009)MathSciNetCrossRef
Metadaten
Titel
Labeling Color 2D Digital Images in Theoretical Near Logarithmic Time
verfasst von
F. Díaz-del-Río
P. Real
D. Onchis
Copyright-Jahr
2017
Buch
Computer Analysis of Images and Patterns

Print ISBN: 978-3-319-64697-8

Electronic ISBN: 978-3-319-64698-5

Copyright-Jahr: 2017

DOI
https://doi.org/10.1007/978-3-319-64698-5_33

Premium Partner

    Bildnachweise