Skip to main content

2016 | OriginalPaper | Buchkapitel

SurfCut: Free-Boundary Surface Extraction

verfasst von : Marei Algarni, Ganesh Sundaramoorthi

Erschienen in: Computer Vision – ECCV 2016

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

We present SurfCut, an algorithm for extracting a smooth simple surface with unknown boundary from a noisy 3D image and a seed point. In contrast to existing approaches that extract smooth simple surfaces with boundary, our method requires less user input, i.e., a seed point, rather than a 3D boundary curve. Our method is built on the novel observation that certain ridge curves of a front propagated using the Fast Marching algorithm are likely to lie on the surface. Using the framework of cubical complexes, we design a novel algorithm to robustly extract such ridge curves and form the surface of interest. Our algorithm automatically cuts these ridge curves to form the surface boundary, and then extracts the surface. Experiments show the robustness of our method to errors in the data, and that we achieve higher accuracy with lower computational cost than comparable methods.

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!

Anhänge
Nur mit Berechtigung zugänglich
Fußnoten
1
A one-dimensional ridge point of a function is such that all eigenvectors of the Hessian (except one) are negative and the derivative of the function in the direction of eigenvectors corresponding to negative eigenvalues are zero [22]. Intuitively, this means a local maximum in one direction.
 
Literatur
1.
Zurück zum Zitat Schultz, T., Theisel, H., Seidel, H.P.: Crease surfaces: from theory to extraction and application to diffusion tensor MRI. IEEE Trans. Vis. Comput. Graph. 16(1), 109–119 (2010)CrossRef Schultz, T., Theisel, H., Seidel, H.P.: Crease surfaces: from theory to extraction and application to diffusion tensor MRI. IEEE Trans. Vis. Comput. Graph. 16(1), 109–119 (2010)CrossRef
2.
Zurück zum Zitat Cohen, L.D., Kimmel, R.: Global minimum for active contour models: a minimal path approach. Int. J. Comput. Vis. 24(1), 57–78 (1997)CrossRef Cohen, L.D., Kimmel, R.: Global minimum for active contour models: a minimal path approach. Int. J. Comput. Vis. 24(1), 57–78 (1997)CrossRef
3.
Zurück zum Zitat Sethian, J.A.: A fast marching level set method for monotonically advancing fronts. Proc. Nat. Acad. Sci. 93(4), 1591–1595 (1996)MathSciNetCrossRefMATH Sethian, J.A.: A fast marching level set method for monotonically advancing fronts. Proc. Nat. Acad. Sci. 93(4), 1591–1595 (1996)MathSciNetCrossRefMATH
4.
Zurück zum Zitat Kaul, V., Yezzi, A., Tsai, Y.: Detecting curves with unknown endpoints and arbitrary topology using minimal paths. IEEE Trans. Pattern Anal. Mach. Intell. 34(10), 1952–1965 (2012)CrossRef Kaul, V., Yezzi, A., Tsai, Y.: Detecting curves with unknown endpoints and arbitrary topology using minimal paths. IEEE Trans. Pattern Anal. Mach. Intell. 34(10), 1952–1965 (2012)CrossRef
5.
Zurück zum Zitat Mille, J., Bougleux, S., Cohen, L.D.: Combination of piecewise-geodesic paths for interactive segmentation. Int. J. Comput. Vis. 112(1), 1–22 (2015)MathSciNetCrossRefMATH Mille, J., Bougleux, S., Cohen, L.D.: Combination of piecewise-geodesic paths for interactive segmentation. Int. J. Comput. Vis. 112(1), 1–22 (2015)MathSciNetCrossRefMATH
6.
Zurück zum Zitat Benmansour, F., Cohen, L.D.: From a single point to a surface patch by growing minimal paths. In: Tai, X.-C., Mørken, K., Lysaker, M., Lie, K.-A. (eds.) SSVM 2009. LNCS, vol. 5567, pp. 648–659. Springer, Heidelberg (2009). doi:10.1007/978-3-642-02256-2_54 CrossRef Benmansour, F., Cohen, L.D.: From a single point to a surface patch by growing minimal paths. In: Tai, X.-C., Mørken, K., Lysaker, M., Lie, K.-A. (eds.) SSVM 2009. LNCS, vol. 5567, pp. 648–659. Springer, Heidelberg (2009). doi:10.​1007/​978-3-642-02256-2_​54 CrossRef
7.
Zurück zum Zitat Ardon, R., Cohen, L.D., Yezzi, A.: A new implicit method for surface segmentation by minimal paths: applications in 3D medical images. In: Rangarajan, A., Vemuri, B., Yuille, A.L. (eds.) EMMCVPR 2005. LNCS, vol. 3757, pp. 520–535. Springer, Heidelberg (2005). doi:10.1007/11585978_34 CrossRef Ardon, R., Cohen, L.D., Yezzi, A.: A new implicit method for surface segmentation by minimal paths: applications in 3D medical images. In: Rangarajan, A., Vemuri, B., Yuille, A.L. (eds.) EMMCVPR 2005. LNCS, vol. 3757, pp. 520–535. Springer, Heidelberg (2005). doi:10.​1007/​11585978_​34 CrossRef
8.
Zurück zum Zitat Grady, L.: Minimal surfaces extend shortest path segmentation methods to 3D. IEEE Trans. Pattern Anal. Mach. Intell. 32(2), 321–334 (2010)CrossRef Grady, L.: Minimal surfaces extend shortest path segmentation methods to 3D. IEEE Trans. Pattern Anal. Mach. Intell. 32(2), 321–334 (2010)CrossRef
9.
Zurück zum Zitat Hale, D., et al.: Fault surfaces and fault throws from 3D seismic images. In: 2012 SEG Annual Meeting, Society of Exploration Geophysicists (2012) Hale, D., et al.: Fault surfaces and fault throws from 3D seismic images. In: 2012 SEG Annual Meeting, Society of Exploration Geophysicists (2012)
10.
Zurück zum Zitat Caselles, V., Kimmel, R., Sapiro, G.: Geodesic active contours. Int. J. Comput. Vis. 22(1), 61–79 (1997)CrossRefMATH Caselles, V., Kimmel, R., Sapiro, G.: Geodesic active contours. Int. J. Comput. Vis. 22(1), 61–79 (1997)CrossRefMATH
11.
Zurück zum Zitat Yezzi, A., Kichenassamy, S., Kumar, A., Olver, P., Tannenbaum, A.: A geometric snake model for segmentation of medical imagery. IEEE Trans. Med. Imaging 16(2), 199–209 (1997)CrossRef Yezzi, A., Kichenassamy, S., Kumar, A., Olver, P., Tannenbaum, A.: A geometric snake model for segmentation of medical imagery. IEEE Trans. Med. Imaging 16(2), 199–209 (1997)CrossRef
12.
Zurück zum Zitat Chan, T.F., Vese, L.A.: Active contours without edges. IEEE Trans. Image Process. 10(2), 266–277 (2001)CrossRefMATH Chan, T.F., Vese, L.A.: Active contours without edges. IEEE Trans. Image Process. 10(2), 266–277 (2001)CrossRefMATH
13.
Zurück zum Zitat Osher, S., Sethian, J.A.: Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations. J. Comput. Phys. 79(1), 12–49 (1988)MathSciNetCrossRefMATH Osher, S., Sethian, J.A.: Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations. J. Comput. Phys. 79(1), 12–49 (1988)MathSciNetCrossRefMATH
14.
Zurück zum Zitat Pock, T., Schoenemann, T., Graber, G., Bischof, H., Cremers, D.: A convex formulation of continuous multi-label problems. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008. LNCS, vol. 5304, pp. 792–805. Springer, Heidelberg (2008). doi:10.1007/978-3-540-88690-7_59 CrossRef Pock, T., Schoenemann, T., Graber, G., Bischof, H., Cremers, D.: A convex formulation of continuous multi-label problems. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008. LNCS, vol. 5304, pp. 792–805. Springer, Heidelberg (2008). doi:10.​1007/​978-3-540-88690-7_​59 CrossRef
15.
Zurück zum Zitat Boykov, Y.Y., Jolly, M.P.: Interactive graph cuts for optimal boundary & region segmentation of objects in ND images. In: Eighth IEEE International Conference on Computer Vision, ICCV 2001, Proceedings, vol. 1, pp. 105–112. IEEE (2001) Boykov, Y.Y., Jolly, M.P.: Interactive graph cuts for optimal boundary & region segmentation of objects in ND images. In: Eighth IEEE International Conference on Computer Vision, ICCV 2001, Proceedings, vol. 1, pp. 105–112. IEEE (2001)
16.
Zurück zum Zitat Rother, C., Kolmogorov, V., Blake, A.: Grabcut: interactive foreground extraction using iterated graph cuts. ACM Trans. Graph. (TOG) 23, pp. 309–314. ACM (2004) Rother, C., Kolmogorov, V., Blake, A.: Grabcut: interactive foreground extraction using iterated graph cuts. ACM Trans. Graph. (TOG) 23, pp. 309–314. ACM (2004)
17.
Zurück zum Zitat Ulen, J., Strandmark, P., Kahl, F.: Shortest paths with higher-order regularization. IEEE Trans. Pattern Anal. Mach. Intell. 37(12), 2588–2600 (2015)CrossRef Ulen, J., Strandmark, P., Kahl, F.: Shortest paths with higher-order regularization. IEEE Trans. Pattern Anal. Mach. Intell. 37(12), 2588–2600 (2015)CrossRef
18.
Zurück zum Zitat Grady, L.: Computing exact discrete minimal surfaces: extending and solving the shortest path problem in 3D with application to segmentation. In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 1, pp. 69–78. IEEE (2006) Grady, L.: Computing exact discrete minimal surfaces: extending and solving the shortest path problem in 3D with application to segmentation. In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 1, pp. 69–78. IEEE (2006)
19.
Zurück zum Zitat Kovalevsky, V.A.: Finite topology as applied to image analysis. Comput. Vis. Graph. Image Process. 46(2), 141–161 (1989)CrossRef Kovalevsky, V.A.: Finite topology as applied to image analysis. Comput. Vis. Graph. Image Process. 46(2), 141–161 (1989)CrossRef
20.
21.
Zurück zum Zitat Siddiqi, K., Pizer, S.: Medial Representations: Mathematics, Algorithms and Applications, vol. 37. Springer, Netherlands (2008)MATH Siddiqi, K., Pizer, S.: Medial Representations: Mathematics, Algorithms and Applications, vol. 37. Springer, Netherlands (2008)MATH
22.
Zurück zum Zitat Eberly, D., Gardner, R., Morse, B., Pizer, S., Scharlach, C.: Ridges for image analysis. J. Math. Imaging Vis. 4(4), 353–373 (1994)CrossRef Eberly, D., Gardner, R., Morse, B., Pizer, S., Scharlach, C.: Ridges for image analysis. J. Math. Imaging Vis. 4(4), 353–373 (1994)CrossRef
23.
Zurück zum Zitat Lindeberg, T.: Edge detection and ridge detection with automatic scale selection. Int. J. Comput. Vis. 30(2), 117–156 (1998)CrossRef Lindeberg, T.: Edge detection and ridge detection with automatic scale selection. Int. J. Comput. Vis. 30(2), 117–156 (1998)CrossRef
24.
Zurück zum Zitat Kolomenkin, M., Shimshoni, I., Tal, A.: Multi-scale curve detection on surfaces. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 225–232(2013) Kolomenkin, M., Shimshoni, I., Tal, A.: Multi-scale curve detection on surfaces. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 225–232(2013)
25.
Zurück zum Zitat Rusu, R.B., Cousins, S.: 3D is here: Point Cloud Library (PCL). In: 2011 IEEE International Conference on Robotics and Automation (ICRA), pp. 1–4. IEEE (2011) Rusu, R.B., Cousins, S.: 3D is here: Point Cloud Library (PCL). In: 2011 IEEE International Conference on Robotics and Automation (ICRA), pp. 1–4. IEEE (2011)
Metadaten
Titel
SurfCut: Free-Boundary Surface Extraction
verfasst von
Marei Algarni
Ganesh Sundaramoorthi
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-46478-7_11