Skip to main content

2014 | OriginalPaper | Buchkapitel

Impact of Keypoint Detection on Graph-Based Characterization of Blood Vessels in Colonoscopy Videos

verfasst von : Joan M. Núñez, Jorge Bernal, Miquel Ferrer, Fernando Vilariño

Erschienen in: Computer-Assisted and Robotic Endoscopy

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

We explore the potential of the use of blood vessels as anatomical landmarks for developing image registration methods in colonoscopy images. An unequivocal representation of blood vessels could be used to guide follow-up methods to track lesions over different interventions. We propose a graph-based representation to characterize network structures, such as blood vessels, based on the use of intersections and endpoints. We present a study consisting of the assessment of the minimal performance a keypoint detector should achieve so that the structure can still be recognized. Experimental results prove that, even by achieving a loss of \(25\,\%\) of the keypoints, the descriptive power of the associated graphs to the vessel pattern is still high enough to recognize blood vessels.

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!

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!

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!

Literatur
1.
Zurück zum Zitat Bressler, B., Paszat, L., Chen, Z., Rothwell, D., Vinden, C., Rabeneck, L.: Rates of new or missed colorectal cancers after colonoscopy and their risk factors: a population-based analysis. Gastroenterology 132(1), 96–102 (2007)CrossRef Bressler, B., Paszat, L., Chen, Z., Rothwell, D., Vinden, C., Rabeneck, L.: Rates of new or missed colorectal cancers after colonoscopy and their risk factors: a population-based analysis. Gastroenterology 132(1), 96–102 (2007)CrossRef
2.
Zurück zum Zitat Pudzs, M., Fuksis, R., Greitans, M.: Palmprint image processing with non-halo complex matched filters for forensic data analysis. In: International Workshop on Biometrics and Forensics (IWBF), pp. 1–4. IEEE (2013) Pudzs, M., Fuksis, R., Greitans, M.: Palmprint image processing with non-halo complex matched filters for forensic data analysis. In: International Workshop on Biometrics and Forensics (IWBF), pp. 1–4. IEEE (2013)
3.
Zurück zum Zitat Azzopardi, G., Petkov, N.: Automatic detection of vascular bifurcations in segmented retinal images using trainable cosfire filters. Pattern Recogn. Lett. 34(8), 922–933 (2013)CrossRef Azzopardi, G., Petkov, N.: Automatic detection of vascular bifurcations in segmented retinal images using trainable cosfire filters. Pattern Recogn. Lett. 34(8), 922–933 (2013)CrossRef
4.
Zurück zum Zitat Bhuiyan, A., Nath, B., Chua, J., Ramamohanarao, K.: Automatic detection of vascular bifurcations and crossovers from color retinal fundus images. In: Third International IEEE Conference on Signal-Image Technologies and Internet-Based System, SITIS’07, pp. 711–718. IEEE (2007) Bhuiyan, A., Nath, B., Chua, J., Ramamohanarao, K.: Automatic detection of vascular bifurcations and crossovers from color retinal fundus images. In: Third International IEEE Conference on Signal-Image Technologies and Internet-Based System, SITIS’07, pp. 711–718. IEEE (2007)
5.
Zurück zum Zitat Saha, S., Dutta Roy, N.: Automatic detection of bifurcation points in retinal fundus images. Int. J. Latest Res. Sci. Technol. 2(2), 105–108 (2013) Saha, S., Dutta Roy, N.: Automatic detection of bifurcation points in retinal fundus images. Int. J. Latest Res. Sci. Technol. 2(2), 105–108 (2013)
6.
Zurück zum Zitat Can, A., Stewart, C.V., Roysam, B., Tanenbaum, H.L.: A feature-based, robust, hierarchical algorithm for registering pairs of images of the curved human retina. IEEE Trans. Pattern Anal. Mach. Intell. 24(3), 347–364 (2002)CrossRef Can, A., Stewart, C.V., Roysam, B., Tanenbaum, H.L.: A feature-based, robust, hierarchical algorithm for registering pairs of images of the curved human retina. IEEE Trans. Pattern Anal. Mach. Intell. 24(3), 347–364 (2002)CrossRef
7.
Zurück zum Zitat Tsai, C.-L., Stewart, C.V., Tanenbaum, H.L., Roysam, B.: Model-based method for improving the accuracy and repeatability of estimating vascular bifurcations and crossovers from retinal fundus images. IEEE Trans. Inf. Technol. Biomed. 8(2), 122–130 (2004)CrossRef Tsai, C.-L., Stewart, C.V., Tanenbaum, H.L., Roysam, B.: Model-based method for improving the accuracy and repeatability of estimating vascular bifurcations and crossovers from retinal fundus images. IEEE Trans. Inf. Technol. Biomed. 8(2), 122–130 (2004)CrossRef
8.
Zurück zum Zitat Mahé, P., Ueda, N., Akutsu, T., Perret, J.-L., Vert, J.-P.: Graph kernels for molecular structure-activity relationship analysis with support vector machines. J. Chem. Inf. Model. 45(4), 939–951 (2005)CrossRef Mahé, P., Ueda, N., Akutsu, T., Perret, J.-L., Vert, J.-P.: Graph kernels for molecular structure-activity relationship analysis with support vector machines. J. Chem. Inf. Model. 45(4), 939–951 (2005)CrossRef
9.
Zurück zum Zitat Schenker, A., Bunke, H., Last, M., Kandel, A.: Graph-Theoretic Techniques for Web Content Mining. World Scientific, London (2005) Schenker, A., Bunke, H., Last, M., Kandel, A.: Graph-Theoretic Techniques for Web Content Mining. World Scientific, London (2005)
10.
Zurück zum Zitat Harchaoui, Z., Bach, F.: Image classification with segmentation graph kernels. In: IEEE Conference on Computer Vision and Pattern Recognition, CVPR’07, pp. 1–8. IEEE (2007) Harchaoui, Z., Bach, F.: Image classification with segmentation graph kernels. In: IEEE Conference on Computer Vision and Pattern Recognition, CVPR’07, pp. 1–8. IEEE (2007)
11.
Zurück zum Zitat Llados, J., Sanchez, G.: Graph matching versus graph parsing in graphics recognitiona combined approach. Int. J. Pattern Recogn. Artif. Intell. 18(03), 455–473 (2004)CrossRef Llados, J., Sanchez, G.: Graph matching versus graph parsing in graphics recognitiona combined approach. Int. J. Pattern Recogn. Artif. Intell. 18(03), 455–473 (2004)CrossRef
12.
Zurück zum Zitat Sanfeliu, A., Fu, K.-S.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. 3, 353–362 (1983)CrossRef Sanfeliu, A., Fu, K.-S.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. 3, 353–362 (1983)CrossRef
13.
Zurück zum Zitat Bunke, H., Allermann, G.: Inexact graph matching for structural pattern recognition. Pattern Recogn. Lett. 1(4), 245–253 (1983)CrossRefMATH Bunke, H., Allermann, G.: Inexact graph matching for structural pattern recognition. Pattern Recogn. Lett. 1(4), 245–253 (1983)CrossRefMATH
14.
Zurück zum Zitat Neuhaus, M., Bunke, H.: A graph matching based approach to fingerprint classification using directional variance. In: Kanade, T., Jain, A., Ratha, N.K. (eds.) AVBPA 2005. LNCS, vol. 3546, pp. 191–200. Springer, Heidelberg (2005)CrossRef Neuhaus, M., Bunke, H.: A graph matching based approach to fingerprint classification using directional variance. In: Kanade, T., Jain, A., Ratha, N.K. (eds.) AVBPA 2005. LNCS, vol. 3546, pp. 191–200. Springer, Heidelberg (2005)CrossRef
15.
Zurück zum Zitat Ambauen, R., Fischer, S., Bunke, H.: Graph edit distance with node splitting and merging, and its application to diatom identification. In: Hancock, E.R., Vento, M. (eds.) GbRPR 2003. LNCS, vol. 2726, pp. 95–106. Springer, Heidelberg (2003)CrossRef Ambauen, R., Fischer, S., Bunke, H.: Graph edit distance with node splitting and merging, and its application to diatom identification. In: Hancock, E.R., Vento, M. (eds.) GbRPR 2003. LNCS, vol. 2726, pp. 95–106. Springer, Heidelberg (2003)CrossRef
16.
Zurück zum Zitat Robles-Kelly, A., Hancock, E.R.: Graph edit distance from spectral seriation. IEEE Trans. Pattern Anal. Mach. Intell. 27(3), 365–378 (2005)CrossRef Robles-Kelly, A., Hancock, E.R.: Graph edit distance from spectral seriation. IEEE Trans. Pattern Anal. Mach. Intell. 27(3), 365–378 (2005)CrossRef
17.
Zurück zum Zitat Boeres, M.C., Ribeiro, C.C., Bloch, I.: A randomized heuristic for scene recognition by graph matching. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 100–113. Springer, Heidelberg (2004)CrossRef Boeres, M.C., Ribeiro, C.C., Bloch, I.: A randomized heuristic for scene recognition by graph matching. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 100–113. Springer, Heidelberg (2004)CrossRef
18.
Zurück zum Zitat Sorlin, S., Solnon, C.: Reactive tabu search for measuring graph similarity. In: Brun, L., Vento, M. (eds.) GbRPR 2005. LNCS, vol. 3434, pp. 172–182. Springer, Heidelberg (2005)CrossRef Sorlin, S., Solnon, C.: Reactive tabu search for measuring graph similarity. In: Brun, L., Vento, M. (eds.) GbRPR 2005. LNCS, vol. 3434, pp. 172–182. Springer, Heidelberg (2005)CrossRef
19.
Zurück zum Zitat Justice, D., Hero, A.: A binary linear programming formulation of the graph edit distance. IEEE Trans. Pattern Anal. Mach. Intell. 28(8), 1200–1214 (2006)CrossRef Justice, D., Hero, A.: A binary linear programming formulation of the graph edit distance. IEEE Trans. Pattern Anal. Mach. Intell. 28(8), 1200–1214 (2006)CrossRef
20.
Zurück zum Zitat Neuhaus, M., Riesen, K., Bunke, H.: Fast suboptimal algorithms for the computation of graph edit distance. In: Yeung, D.-Y., Kwok, J.T., Fred, A., Roli, F., de Ridder, D. (eds.) SSPR 2006 and SPR 2006. LNCS, vol. 4109, pp. 163–172. Springer, Heidelberg (2006)CrossRef Neuhaus, M., Riesen, K., Bunke, H.: Fast suboptimal algorithms for the computation of graph edit distance. In: Yeung, D.-Y., Kwok, J.T., Fred, A., Roli, F., de Ridder, D. (eds.) SSPR 2006 and SPR 2006. LNCS, vol. 4109, pp. 163–172. Springer, Heidelberg (2006)CrossRef
21.
Zurück zum Zitat Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. 27(7), 950–959 (2009)CrossRef Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. 27(7), 950–959 (2009)CrossRef
22.
Zurück zum Zitat Burkard, R., Dell’Amico, M., Martello, S.: Assignment Problems. SIAM, Philadelphia (2012). (Revised Reprint)CrossRef Burkard, R., Dell’Amico, M., Martello, S.: Assignment Problems. SIAM, Philadelphia (2012). (Revised Reprint)CrossRef
23.
Zurück zum Zitat Neuhaus, M.: Self-organizing graph edit distance. In: Hancock, E.R., Vento, M. (eds.) GbRPR 2003. LNCS, vol. 2726, pp. 83–94. Springer, Heidelberg (2003)CrossRef Neuhaus, M.: Self-organizing graph edit distance. In: Hancock, E.R., Vento, M. (eds.) GbRPR 2003. LNCS, vol. 2726, pp. 83–94. Springer, Heidelberg (2003)CrossRef
24.
Zurück zum Zitat Neuhaus, M., Bunke, H.: A probabilistic approach to learning costs for graph edit distance. In: Proceedings of the 17th International Conference on Pattern Recognition, ICPR 2004, vol. 3, pp. 389–393. IEEE (2004) Neuhaus, M., Bunke, H.: A probabilistic approach to learning costs for graph edit distance. In: Proceedings of the 17th International Conference on Pattern Recognition, ICPR 2004, vol. 3, pp. 389–393. IEEE (2004)
25.
Zurück zum Zitat Neuhaus, M., Bunke, H.: Self-organizing maps for learning the edit costs in graph matching. IEEE Trans. Syst. Man Cybern. Part B Cybern. 35(3), 503–514 (2005)CrossRef Neuhaus, M., Bunke, H.: Self-organizing maps for learning the edit costs in graph matching. IEEE Trans. Syst. Man Cybern. Part B Cybern. 35(3), 503–514 (2005)CrossRef
26.
27.
Zurück zum Zitat Bernal, J., Sánchez, J., Vilariño, F.: Towards automatic polyp detection with a polyp appearance model. Pattern Recogn. 45(9), 3166–3182 (2012)CrossRef Bernal, J., Sánchez, J., Vilariño, F.: Towards automatic polyp detection with a polyp appearance model. Pattern Recogn. 45(9), 3166–3182 (2012)CrossRef
28.
Zurück zum Zitat Riesen, K., Bunke, H.: Iam graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) SSPR&SPR 2008. LNCS, vol. 5342, pp. 287–297. Springer, Heidelberg (2008)CrossRef Riesen, K., Bunke, H.: Iam graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) SSPR&SPR 2008. LNCS, vol. 5342, pp. 287–297. Springer, Heidelberg (2008)CrossRef
29.
Zurück zum Zitat Riesen, K., Bunke, H.: Classification and Clustering of Vector Space Embedded Graphs. World Scientific, London (2010) Riesen, K., Bunke, H.: Classification and Clustering of Vector Space Embedded Graphs. World Scientific, London (2010)
Metadaten
Titel
Impact of Keypoint Detection on Graph-Based Characterization of Blood Vessels in Colonoscopy Videos
verfasst von
Joan M. Núñez
Jorge Bernal
Miquel Ferrer
Fernando Vilariño
Copyright-Jahr
2014
DOI
https://doi.org/10.1007/978-3-319-13410-9_3