The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Min-cut based segmentation of point clouds
Abstract
We present a min-cut based method of segmenting objects in point clouds. Given an object location, our method builds a k-nearest neighbors graph, assumes a background prior, adds hard foreground (and optionally background) constraints, and finds the min-cut to compute a foreground-background segmentation. Our method can be run fully automatically, or interactively with a user interface. We test our system on an outdoor urban scan, quantitatively evaluate our algorithm on a test set of about 1000 objects, and compare to several alternative approaches.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Kass, M., Witkin, A., & Terzopoulos, D. (1988) · International Journal of Computer Vision · doi:10.1007/bf00133570 · Cited by 17,070
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Graph Cuts and Efficient N-D Image Segmentation
Boykov, Y., & Funka-Lea, G. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-006-7934-5 · Cited by 1,910 · cited 3×
“The most relevant work to ours is [1], in which the authors take advantage of the min-cut algorithm to create a segmentation that satisfies constraints placed by the user or automatic cues.”
BackgroundMethodResultInfluentialCombined Object Categorization and Segmentation With An Implicit Shape Model
Leibe, B., Leonardis, A., & Schiele, B. (2004) · Max Planck Digital Library · Cited by 890
Partitioning 3D surface meshes using watershed segmentation
Mangan, A. P., & Whitaker, R. (1999) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.817348 · Cited by 578
Hierarchical mesh decomposition using fuzzy clustering and cuts
Katz, S., & Tal, A. (2003) · ACM SIGGRAPH 2003 Papers · doi:10.1145/1201775.882369 · Cited by 577
Consistent mesh partitioning and skeletonisation using the shape diameter function
Shapira, L., Shamir, A., & Cohen-Or, D. (2008) · The Visual Computer · doi:10.1007/s00371-007-0197-5 · Cited by 542
Hierarchical mesh decomposition using fuzzy clustering and cuts
Katz, S., & Tal, A. (2003) · ACM Transactions on Graphics · doi:10.1145/882262.882369 · Cited by 477
Segmentation of point clouds using smoothness constraints
Rabbani, T., den Heuvel, F. V., & Vosselman, G. (2006) · University of Twente Research Information · Cited by 464
Shape-based recognition of 3D point clouds in urban environments
Golovinskiy, A., Kim, V. G., & Funkhouser, T. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459471 · Cited by 415
Self-citationHierarchical face clustering on polygonal surfaces
Garland, M., Willmott, A., & Heckbert, P. S. (2001) · Proceedings of the 2001 symposium on Interactive 3D graphics · doi:10.1145/364338.364345 · Cited by 375
Segmentation of 3D meshes through spectral clustering
Liu, R., & Zhang, H. (2004) · 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings. · doi:10.1109/pccga.2004.1348360 · Cited by 213
Shape segmentation using local slippage analysis
Gelfand, N., & Guibas, L. J. (2004) · Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing · doi:10.1145/1057432.1057461 · Cited by 188
Symposium on Geometry Processing: Aachen, Germany, 23–25 June 2003
Kobbelt, L., Schöder, P., & Hoppe, H. (2004) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2004.00011.x · Cited by 163
Strategies for polyhedral surface decomposition: An experimental study
Chazelle, B., Dobkin, D., Shouraboura, N., & Tal, A. (1997) · Computational Geometry · doi:10.1016/s0925-7721(96)00024-7 · Cited by 118
Ji, Z., Liu, L., Chen, Z., & Wang, G. (2006) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2006.00947.x · Cited by 101
Segmentation and Shape Extraction of 3D Boundary Meshes
Shamir, A. (2006) · Eurographics · doi:10.2312/egst.20061056 · Cited by 65
Robust extraction of multiple structures from non-uniformly sampled data
Unnikrishnan, R., & Hebert, M. (2004) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2003.1248828 · Cited by 31
Cited by
Graph-based approach for airborne light detection and ranging segmentation
Vilariño, D. L., Cabaleiro, J. C., Martínez, J., Rivera, F. F., & Pena, T. F. (2017) · Journal of Applied Remote Sensing · doi:10.1117/1.jrs.11.015020 · Cited by 1,721
Perception, Planning, Control, and Coordination for Autonomous Vehicles
Pendleton, S., Andersen, H., Du, X., Shen, X., Meghjani, M., Eng, Y., Rus, D., & Ang, M. (2017) · Machines · doi:10.3390/machines5010006 · Cited by 657
Octree-based region growing for point cloud segmentation
Vo, A.-V., Truong-Hong, L., Laefer, D. F., & Bertolotto, M. (2015) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2015.01.011 · Cited by 657
Linking Points With Labels in 3D: A Review of Point Cloud Semantic Segmentation
Xie, Y., Tian, J., & Zhu, X. X. (2020) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2019.2937630 · Cited by 482
On the segmentation of 3D LIDAR point clouds
Douillard, B., Underwood, J., Kuntz, N., Vlaskine, V., Quadros, A., Morton, P., & Frenkel, A. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5979818 · Cited by 477
Metadata
- Authors
- Golovinskiy, A., & Funk, T.
- Venue
- 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops
- Publisher
- IEEE
- Published
- 2009-09
- Pages
- 39-46
- OpenAlex
- W1996688648
- Cited by
- 293
- References
- 18
- FWCI
- 21.15
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.