Bondarev, Y Egor

Javan Hemmat, H Hani

With, PHN Peter  de

Javan Hemmat, H.

Bondarau, Y.

de With, P.H.N.

Pure OAI Repository

 Real-time planar segmentation of depth imagesCitation for published version (APA):Javan Hemmat, H., Bondarau, Y., & de With, P. H. N. (2015). Real-time planar segmentation of depth images. 1-2. Poster session presented at The Netherlands Conference on Computer Vision (NCCV 2015), Lunteren,Netherlands.Document status and date:Published: 01/01/2015Document Version:Publisher’s PDF, also known as Version of Record (includes final page, issue and volume numbers)Please check the document version of this publication:• A submitted manuscript is the version of the article upon submission and before peer-review. There can beimportant differences between the submitted version and the official published version of record. Peopleinterested in the research are advised to contact the author for the final version of the publication, or visit theDOI to the publisher's website.• The final author version and the galley proof are versions of the publication after peer review.• The final published version features the final layout of the paper including the volume, issue and pagenumbers.Link to publicationGeneral rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright ownersand it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.            • Users may download and print one copy of any publication from the public portal for the purpose of private study or research.            • You may not further distribute the material or use it for any profit-making activity or commercial gain            • You may freely distribute the URL identifying the publication in the public portal.If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the “Taverne” license above, pleasefollow below link for the End User Agreement:www.tue.nl/taverneTake down policyIf you believe that this document breaches copyright please contact us at:openaccess@tue.nlproviding details and we will investigate your claim.Download date: 15. Jul. 2024Real-time Planar Segmentation of Depth ImagesHani Javan Hemmat, Egor Bondarev and Peter H.N. de WithEindhoven University of Technology, The Netherlands{h.javan.hemmat, e.bondarev, p.h.n.de.with}@tue.nlAbstractHandling depth images as a point cloud in a 3Ddata framework and performing planar segmentation inreal-time requires heavy computation and it is a ma-jor challenge. Available planar-segmentation algorithmsare mostly based on surface normals and/or curva-tures, and consequently, do not provide real-time perfor-mance. In this abstract paper, we introduce a real-timeplanar-segmentation method for depth images avoiding anysurface-normal calculation. A possible 3D applicationwould strongly benefit from this real-time algorithm, morespecifically, aiming at the reconstruction of indoor environ-ments, which mainly consist of planar surfaces.1. IntroductionMultiple planar segmentation algorithms have been pro-posed for point cloud datasets. Considering depth images aspoint clouds and performing planar segmentation requiresheavy computation, because available planar segmentationalgorithms are mostly based on surface normals and/or cur-vatures. In such algorithms, a real-time segmentation ofplanes is normally achieved by sacrificing the image quality.As illustrated in Figure 1, a straightforward way toextract planes out of a depth image is to conventionallyconvert it to a point cloud and then apply an appropri-ate algorithm. In this abstract paper, as an alternative tothis approach, we propose a real-time planar segmenta-tion algorithm, which directly deploys the depth images as2D frames containing 3D information. More specifically,Figure 1. Two approaches to extract planes from depth images as:(a) point clouds, (b) 2D images containing 3D information.Figure 2. Three examples of datasets and the corresponding out-comes: (a) color images of each scene, (b) extracted 3D edges, and(c) planar surfaces.the proposed algorithm involves high-level region growingbased on a geometrical proposition stating that each pairof intersecting lines lies on a plane. To this end, first,edge contours should be detected in order to extract sur-faces bounded between the 3D edges. After detecting 3Dedges of a depth image, the algorithm searches for line-segments between the opposite edges and then merges thedetected line-segments into planes, thereby facilitating pla-nar segmentation. This abstract paper summarizes an orig-inal work which has been already published (submitted) bythe authors [1, 2].2. From 3D Edges to Segmented PlanesThe proposed algorithm segments planar surfaces inthree principal steps: (1) edge detection, (2) plane extrac-tion, and (3) enhancement.In the first step, four different types of 3D edges in adepth image are extracted: jump, extremum, corner, andcurved. The jump edges result from occlusions or holes.The extremum edges include the local-minima or -maxima.The corner-edges emerge where two planes meet each other,and the curved-edges are resulting from intersection of ac-tual planar and non-planar surfaces.1Figure 3. Planar segmentation of an depth image: (a) 3D edgesdetected; (b) detecting and labelling each individual line-segment;(c) merging of intersecting line-segments; (h) final outcome of theplanar segmentation process (Note that for the sake of clarity, onlydiagonal lines have been shown. Besides this, the proposed en-hancement methods improving the final outcome have not beenapplied here).In the second step, we first extract all the (1-pixel-wide)string-segments bounded in between the edges. This stepcommences with scanning all the strings in all four direc-tions (vertically, horizontally, left- and right-diagonally).Then, for each of these string-segments, we evaluatewhether it is a line-segment or not. After finding all theline-segments, the algorithm attempts to merge the pointson each pair of intersecting lines into a plane candidate.This step segments a depth image into its plane candidates.In the third and final step, to improve the segmentationoutcome, we perform several validation checks. First of all,we evaluate each plane candidate in terms of its curvaturein a 3D space (for instance as a point cloud). Second, due toocclusions, a planar surface can be detected as various dis-connected planar segments. Therefore, a merging processis needed to coalesce these apart segments into one actualplane. Finally, we evaluate the resulting segments in termsof their size to reject diminutive planes. Figure 3 illustratesthe steps for planer segmentation of a depth image.3. Evaluation ResultsTo evaluate the proposed algorithm, we have prepared arich collection of datasets captured via Kinect as a depth-sensor. Figure 2 depicts three snapshots of the datasets andthe corresponding results. The proposed algorithm has beeninitially designed to maximally benefit from parallel com-puting. The OpenMP library (OMP) and Compute UnifiedDevice Architecture (CUDA) have been utilized in orderto implement the parallel versions running on multi-coreCPUs and GPU platforms, respectively. Table 1 shows theaverage executing time and the corresponding speedup fac-tors for the various implementations of the proposed algo-Table 1. Average execution time (ms)/Speedup of planar segmen-tation pipeline for various implementations.Algorithm CPU CPU/Speedup GPU/Speedupsingle-threaded multi-threaded kerneledges 998 323 / 3.09 9.40 / 106planes 103 68.7 / 1.50 7.84 / 13.2full pipeline 1102 391 / 2.81 17.2 / 64rithm, which is implemented as a dual-layer pipeline, con-sisting of 3D edge detection and plane extraction. On theaverage, it takes 1102 ms to segment a depth image intoits planes for a single-threaded implementation. A multi-threaded implementation decreases this execution time to391 ms per frame (speedup factor of ≈ 3). And finally,this pipeline can produce planar segments in 17 ms perdepth image by employing a GPU-based implementation(speedup factor of ≥ 60). Utilizing an interleaved pipelineenables us to gain an even higher speedup factor of ≥ 100fps (9.4 ms per interleaved cycle).4. ConclusionIn this abstract paper, we have introduced a real-time pla-nar segmentation algorithm, which enables plane detectionin depth images avoiding any normal-estimation calcula-tion. First, the proposed algorithm searches for 3D edgesin a depth image and then finds the line-segments located inbetween of these 3D edges. Second, the algorithm mergesall the points on each pair of the intersecting line-segmentsinto a plane candidate. The developed 3D edge detection al-gorithm considers four different types of edges: jump, cor-ner, curved and extremum edges. The complete system isimplemented as a dual-layer execution architecture: the 3Dedge detection and plane extraction layers. This enables afast execution of both algorithms in parallel. By exploitingthe GPU-based implementation, on the average, 3D edgesare detected in 9.4 ms and planes are extracted in 7.8 ms.Therefore, the planar segmentation pipeline is capable ofsegmenting planes in a depth image with a rate of 58 fps.Utilizing pipeline-interleaving techniques further increasesthe rate up to 100 fps [1].AcknowledgmentsThis research has been performed within the PANORAMA project, co-funded by grants from Belgium, Italy, France, the Netherlands, the UnitedKingdom, and the ENIAC Joint Undertaking.References[1] H. J. Hemmat, E. Bondarev, and P. H. N. de With. Real-time planarsegmentation of depth images: from 3d edges to segmented planes,2015. submitted to SPIE Journal of Electronic Imaging, 2015.[2] H. J. Hemmat, A. Pourtaherian, E. Bondarev, and P. H. N. de With.Fast planar segmentation of depth images. Image Processing: Algo-rithms and Systems XIII, Proceedings of SPIE (SPIE, Bellingham, WA2015), 93990I, 2015.2

English

Real-time planar segmentation of depth images

NARCIS 

Repository TU/e

Real-time planar segmentation of depth images

Abstract

Similar works

Full text

Available Versions

Pure OAI Repository

NARCIS

Repository TU/e