- Research
- Open Access
- Published:

# Depth image-based plane detection

*Big Data Analytics*
**volume 3**, Article number: 10 (2018)

## Abstract

### Background

The emerging of depth-camera technology is paving the way for variety of new applications and it is believed that plane detection is one of them. In fact, planes are common in man-made living structures, thus their accurate detection can benefit many visual-based applications. The use of depth data allows detecting planes characterized by complicated pattern and texture, where texture-based plane detection algorithms usually fail. In this paper, we propose a robust Depth Image-based Plane Detection (DIPD) algorithm. The proposed approach starts from the highest planarity seed patch, and uses the estimated equation of the growing plane and a dynamic threshold function to steer the growing process. Aided with this mechanism, each seed patch can grow to its maximum extent, and then next seed patch starts to grow. This process is iteratively repeated so as to detect all the planes.

### Results

Validated by extensive experiments on three datasets, the proposed DIPD algorithm can achieve 81% correct detection ratio which doubles the value compared with the state-of-the-art algorithms. Meanwhile, the runtime of the proposed algorithm is around 4 times of the fastest RANdom SAmple Consensus (RANSAC).

### Conclusions

The proposed depth image-based plane detection algorithm can achieve state-of-the-art performance. In terms of applications, it could be used as the pre-processing step for planar object recognition, super-resolution of the intrinsically low resolution Time-of-Flight (ToF) depth images, and variety of other applications.

## Background

Man-made indoor and outdoor structures are generally dominated by different shapes of planes. These planes carry orientation and size information of the 3D objects in the scene. Therefore, 3D reconstruction can be simplified by detecting these planes and setting up the piecewise planar model of the indoor and outdoor scenes [1–3]. Moreover, plane detection technique has been widely used in robot navigation systems [4] and the computer vision for object recognition [5].

At the early stage of the plane detection technique, texture information is mainly adopted. However, this approach may fail when a plane has inconsistent color or texture. As a remedy to this limitation, depth maps offer one clue and turns out to be effective in texture challenging situations. With the increasing availability of consumer depth cameras, e.g., SwissRanger SR4000 [6] and Microsoft Kinect [7], the depth-based plane segmentation and plane detection become popular. Since depth map represents the spatial information of each point in the scene, the points from the same plane will have similar spatial features, such as gradients and normal vectors. Based on this, Holz et al. [8] implemented the real-time plane detection by extracting three components of the normal vector of each point and clustering the points with similar orientations. As parallel planes have similar normals, all the extracted planes, later on, are refined by their distance to the origin. Although, the depth-based plane detection approaches can be implemented in real-time by checking the points’ normal vectors, they suffer from low accuracy and precision. Moreover, due to the fact that the local normal vector is obtained based on a fixed number of neighboring points, if the number is small (e.g., 2), the normal vector is easily affected by noise points. However, if the number is large, the normal vector for boundary points is inaccurate. For robotic navigation system, the detection speed is more strictly required than its accuracy. Hence, using normal vectors is sufficient, whereas for other applications, for example, the human navigation system for guiding the visually impaired person, the detection accuracy is more important. Therefore, in this work, we will target on the accuracy and robustness of the proposed plane detection algorithm.

To satisfy this requirement, we present an unsupervised plane detection algorithm on consumer Time-of-Flight (ToF) depth camera captured depth maps, named Depth Image-based Plane Detection (DIPD). The proposed DIPD algorithm detects planes by adopting a dynamic seed growing approach. The growing starts from the highest planarity seed patch and is steered by the estimated equation of the current growing plane. Moreover, the estimated equation is refined at each growing stage by taking the newly incorporated pixels into account. The growing process is iteratively carried out until all the planes get detected. More advanced than the previous work [9], in this work, a dynamic threshold function which takes both the plane attributes and noise model of depth cameras into account, is proposed to enhance the detection accuracy and robustness. These, later on, have been validated by comprehensive and extensive experiments on three datasets. The proposed plane detection process can be taken as a necessary step for further planar object recognition (floor, walls, table-tops, etc.) [10], indoor scene reconstruction [11] and place recognition [12].

In short summary, the major contributions of this proposed work are as follows: (1) In our algorithm, no RGB information is used and no per-pixel normal vector estimation is required. (2) We proposed a patch-based seed selection approach rather than separated or randomly selected seed points and the plane growing always starts from the seed patch with the largest planarity. This can ensure the growing process starts from a small plane. (3) We novelly proposed a dynamic threshold function in the growing process, which takes both the process and ToF depth camera noise model into account. Therefore, in contrast to existing algorithms, the proposed one can efficiently alleviate over-growing and under-growing problem. (4) Extensive experiments are performed to validate the proposed approach. Our results show a significant performance improvement for the challenging indoor scene on different depth datasets.

### Iterative plane fitting methods

Iterative plane fitting or iterative initial estimates refining is a common approach used for plane detection and its typical representative is RANdom SAmple Consensus (RANSAC) algorithm [13]. RANSAC is an iteratively randomized model fitting process and the initial fitting model is obtained based on several randomly selected points. This method is efficient in detecting large planes and robust to noisy data, however, it tends to over-simplify complex planar structures. For example, the horizontal and vertical planes in a stair-step structure are often detected as one plane aligned with the stair slope. Hence, in order to tackle this problem, RANSAC is usually combined with other detection or refinement methods, such as Minimum Description Length (MDL) [14], and Normal Coherence Checking (NCC-RANSAC) [15].

### Hough transform-based methods

The Hough Transform is well-known for parameterized objects detection, typically for detecting lines and circles in 2D datasets [16]. Aiming to extend its usage to 3D space and meanwhile, to reduce its computational cost, numerous variations have been proposed. 3D Hough Transform proposed by Hulik et al. [17] describes each plane by its slope along *x* and *y* axes and the distance to the origin of the coordinate system. Although in contrast to RANSAC, the formulation of Hough Transform-based methods is sound, the voting process makes them suffer from high computational cost in finding the parameters of one fitting model, especially when the input data is large or the accumulator is sensitive. Randomized Hough Transform (RHT) [18] as an alternative approach avoids high computational cost of the voting process. Instead, for every pixel, it calculates the model parameters in a probabilistic way. Dube et al. [19] proposed a plane detection method by applying RHT on Kinect generated depth map which allows detecting the planes in real time. For a more comprehensive review of Hough-based methods on plane detection, please refer to [18].

### Region-growing-based methods

Compared with RANSAC and Hough Transform methods, region-growing methods with more straight-forward working principle exploit the points’ neighboring relationship. Pathak et al. [20] proposed a plane detection algorithm relying on a two-point-seed growing approach. The growing process starts from a region *G*, which consists of a random point *p* and its one nearest neighbor from the point cloud data, and then extends outwards by adding its neighboring point *p*_{n} according to some criteria until no more points can be added to *G*. The plane parameters are incrementally updated by taking the centroid and covariance matrix of previous growing region into account. Instead of incrementally computing the covariance matrix to derive a plane normal vector, Holz et al. [21, 22] used the average normal vector from the plane points as the approximate value of the plane normal vector. Therefore, after every growth only the centroid of growing region is updated and stored in normal vector space, which considerably reduces the number of computations. Xiao et al. [23] proposed a Cached-Octree Region-Growing (CORG) algorithm to segment the point cloud into planar segments. Since the method stops growing merely based on distance information, over-growing may occur due to interesting planes. Nurunnabi et al. [24] classified all the 3D points into border-line points, edge/corner points and surfels (i.e., small surfaces) by Robust Principle Component Analysis (RPCA) algorithm. Then the region starts to grow from one surfel point by adding its neighboring surfel point if the angle between the normal vector of the region’s seed point and that of the surfel point is below a threshold. This method works well for two planes having distinct edges between them, but may fail in the opposite situation.

### Scan line grouping methods

For segmenting 3D laser range scans, scan line grouping methods are widely adopted. The basic idea behind this method is that 3D planes in a 3D scan are observed as 2D straight lines and if two straight lines cut one another, they lie in one plane [25]. As a derivative of region growing methods, the growing primitives are scan lines instead of individual pixels. In this regard, scan line grouping increases computational efficiency by first detecting lines in planar cuts and then merging neighboring line segments to regions. Hemmat et al. [26] realized the plane detection in three steps. Firstly, all 3D edges in a depth image were searched and the lines between these edges were found. Then, all the points on each pair of intersecting lines were merged into a plane and finally, filtering enhancements were applied to improve the segmentation accuracy.

## Methods

More advanced than the previous work [9], the working principles of seed generation and region growing are reformulated using clear mathematic expressions in this section, respectively. Moreover, a novel dynamic growing threshold function is proposed to increase the detection accuracy and robustness by considering the noise model of consumer depth cameras and the characteristics of the region growing process.

### Valid seed patches generation

Seed selection is a crucial step in region-growing methods. Indeed, the results of the detection are highly dependent on the initial seeds from which regions are expanded. Since some holes or anomalous points may exist in the hardware generated depth maps, without checking the points’ validation, randomly picking up the seed points can easily lead to the failure of the model fitting, which also increases the computational cost for determining the optimal fitting plane. Moreover, by neglecting the neighbor relationships, randomly selected seed points have high probability from different planes, which easily cause the failure of finding the best fitting plane. Hence, in order to ensure that the growing process is established on reliable seed points, a sliding *L*×*L* square window moves in raster-scan fashion by one pixel each time on the whole depth map, and at each position, all the involved points will be checked. The patch, which is free from holes, is regarded as one *valid seed patch* and denoted as *ψ*_{i} with *i* being the seed generation index. The performance differences caused by different seed patch sizes are discussed in the experimental section.

In the 3D space, a plane can be represented by its normal vector \(\hat {\mathbf {n}}\) and the distance from the 3D space origin *d*. For an arbitrary point **p**=(*x,y*,*z*) on this plane, the Hessian form of the plane can be written as \(\hat {\mathbf {n}} \cdot \mathbf {p} + d=0\) and the operation “ ·” stands for the dot-product of two vectors. By applying the Linear Least Squares (LLS) plane fitting approach to each valid seed patch, the best fitting plane *s*_{i} can be found to represent the seed patch. The distance (or fitting error) between the best fitting plane and its point **p** can be evaluated as:

Therefore, the root mean square fitting error of the seed patch points **P** with respect to the corresponding seed patch plane *s*_{i} can be calculated by

The root mean square fitting error indicates the planarity of the seed patch. Thus less fitting error means higher planarity. These values later on are used to sort all the valid seed patches.

### Region growing process

This subsection explains the iterative growing process of a plane starting from a seed patch. First of all, some notations that will be used throughout the article need to be introduced. The index *j* is used as a superscript to indicate the iteration index of the growing process. For example, a plane *S*_{i} at *j*-th stage of the growing process will be represented by \(S_{i}^{j}\) or \(S_{i}^{j}\left (f_{i}^{j}, \delta _{i}^{j}\right)\) where \(f_{i}^{j}\) and \(\delta _{i}^{j}\) are the estimated equation and root mean square fitting error of the plane, respectively. Once the plane grows to its final stage, it will be represented hereinafter by *S*_{i} or \(S_{i}\left (f_{i}^{k_{i}}, \delta _{i}^{k_{i}}\right)\), where *k*_{i} represents the index of the last growing stage of this plane and \(f_{i}^{k_{i}}\) is the final estimated plane equation.

Different from RANSAC-based methods [13, 15] whose seeds are selected randomly, in the proposed growing stage, all the previously valid seed patches will be initially arranged in ascending order of their fitting error in a *growing seed list* *Ψ*_{1}, thus *Ψ*_{1}={∀*ψ*_{n},*ψ*_{m}∈*Ψ*_{1}:*δ*_{n}≤*δ*_{m};*n*<*m*}. For the seed patches having the same fitting error, the earlier generated one appears earlier in the seed list. The first seed patch appearing in the list will be used to initiate the first plane. Once the first plane reaches its maximum extent, it stops to grow and the seed list is updated to *Ψ*_{2} by eliminating all the seed patches that get englobed in the detected plane. This updating process will be carried out at the end of the growing process of each plane to generate a new growing seed list *Ψ*_{i+1}={∀*ψ*_{m}∈*Ψ*_{i}:*ψ*_{m}∉*S*_{i}} where *i* is the detected plane index. This can ensure that only the valid seed patch, which is non-incorporated in previously detected planes and ranked as the first one in the new growing seed list, will be used in the subsequent detection of other planes.

At the beginning of the growing process of plane *S*_{i}, its initial representation equation is merely defined by its seed patch. Thus, \(S_{i}^{0}\left (f_{i}^{0}, \delta _{i}^{0}\right)=s_{m}\), with *s*_{m} being the best fitting plane of the first seed patch in *Ψ*_{i}. Referring to Fig. 1 which shows an example of the first two growing stages (i.e., *j*=1 and *j*=2) of the plane *S*_{i}. At the first growing stage, all the 8-connected neighboring points \({N}_{i}^{0}\) [27] of seed patch are checked. When no holes are found, meanwhile, no points belong to any previously detected plane, \({N}_{i}^{0} = \left \{ \mathbf {p} : \mathbf {p} \notin S_{m}, m < i \right \}\), the neighboring points are substituted into plane equation \(f_{i}^{0}\) separately to get the corresponding fitting error by (1). If the fitting error is above a threshold, *T*, the corresponding neighboring point is regarded as an outlier to this current growing plane. Otherwise, this point is incorporated into this plane. After the first growing stage, the plane equation \(f_{i}^{0}\) will be refined to \(f_{i}^{1}\) using the LLS plane fitting approach over the whole involved points and \(\delta _{i}^{0}\) is updated to \(\delta _{i}^{1}\) by (2). The similar process will be repeated for the rest growing stages and it could be summarized by:

where *T*(*d,j*) is the threshold which is a function of depth value *d* and the number of growth *j*.

Since the key to region growing-based plane detection is to accurately distinguish the inliers and outliers of the current growing plane, the judgement which is conducted by the distance threshold *T* plays an important role. For most of the region growing-based methods, fixed threshold is used in growing process. However, this easily causes over-growing (the threshold is set large) or under-growing (the threshold is set small). Therefore, several works begin to take the depth camera noise model into the design of threshold function.

As suggested in [28] that for consumer depth camera the noise in range sensors usually increases quadratically with the measured distance, Holz et al. [21], Nguyen et al. [29] and Smisek et al. [30] adopted a simple quadratic polynomial as a function of distance to determine the threshold.

where *α*,*β* and *γ* are three constants but with different values in the three works due to different assumptions. Holzer et al. [31] and Deng et al.[10] in their works provided a noise model solely based on the quantization effect induced by the measurement principle of depth sensors. Therefore, the corresponding threshold is only proportional to the square of depth.

where *κ* is a constant. By conducting a set of experiments to evaluate the influence of the threshold function for plane detection, it is found that although the final detection performance does not considerably deviate for the different threshold functions, the best results can be achieved with a combination of the quadratic polynomial models and the depth square models [22]:

where *d*_{0} is the depth value that makes *α**d*^{2}+*β**d*+*γ*=*κ**d*^{2}.

Although these three kinds of threshold functions are elaborately designed based on the camera noise model, they all lead to a monotonously increasing threshold with depth values. This, however, does not fully align with the reality. Firstly, referring to the measurement of ToF depth camera, the measured depth depends on both object distance and object reflectivity. Hence, for some planes, although they are close to the camera due to their surface materials, they may also contain large noise. Therefore, a small threshold easily causes under-growing in this case. Secondly, the planes far from the camera but with small size are easily over-growing due to the large threshold. Thirdly, if the growing plane is perpendicular to the camera plane, the threshold becomes a fixed number. However, with more and more points get involved in the growing plane, noise is also accumulated. In this case, the perpendicular plane trends to be under-growing.

In order to overcome above mentioned weaknesses, we propose a threshold function that takes both the noise model and the plane size into consideration. Moreover, inspired by (6), the proposed threshold function is in a combination format.

where *τ* is the maximum allowed “roughness” of the plane, *λ* decides the changing speed of the threshold, *H* and *W* represent the size of the depth map and *α* and *κ* are two constants. Hence, for each plane, *T*(*d,j*) is initialized by *j*=1 and the maximum threshold value is either determined by *j* if \(j \leq \frac {H\times W}{\kappa ^{2}}\) or by the distance of points being checked. The parameter *τ* can be tuned to suit different object reflectivities and to make the detection of planes more robust to depth map noise. Meanwhile, the parameter *λ* allows to set the increasing speed of the threshold at initial growing stages for different situations.

This kind of elaborate design can well tackle the mentioned problems met by noise-model-based thresholds in literature. Since the number of growth can indirectly indicate the plane size, within a certain range the threshold *T*(*d,j*) is dynamically updated only based on the plane size. Specifically, when the growing plane is in its small or medium size, the threshold negative exponentially increases with the growing number. It can lead to two benefits. Firstly, by considering the plane size, even if for the small and far planes, it could avoid the over-growing problem caused by a large threshold. Secondly, by considering the noise accumulation in growing process, even if the growing plane is parallel to the camera plane, the threshold is not a fixed number. With continuously growing, both plane size and the point distance have joint effects on the threshold. However, the impact of plane size decreases while the growth number increases. Finally, the point distance will be predominant to determine the threshold. Hence, for large planes, the threshold follows the camera noise model that further planes suffer from more noise than the closer ones and consequently, the corresponding threshold should be larger. In addition, the problems caused by planes with rough surfaces can be well handled by setting the maximum allowed roughness *τ* to a relatively large value.

By adopting the proposed threshold function, the growing process for the plane *S*_{i} will be iteratively repeated until one of the following termination conditions is met: (a) the neighboring set \({N}_{i}^{j}\) is empty, (b) no point in \({N}_{i}^{j}\) fits well into the current growing plane. These two conditions indicate that the *i*-th plane grows to its maximum extent. As previously described at the end of the growing process of the *i*-th plane, a new growing seed list, *Ψ*_{i+1}, will be generated and a new round of growing process will be initiated by the first-ranked seed patch in the seed list. This plane detection process is repeated until the updated seed list is empty.

### Computational complexity analysis

In order to clearly analyze the computational complexity of the proposed DIPD algorithm, we decompose the whole algorithm into three main processes which are seed patches generation, region growing and refinement. For a ToF depth camera generated depth map, its size is *W*×*H* and contains *n*=*W*×*H* points. If the size of the sliding window that used to generate seed patch is *L*×*L* and each time the sliding window only moves one pixel, the number of generated seed patch is *m*=(*W*−*L*+1)(*H*−*L*+1). Since the optimal plane fitting for each seed patch needs constant time, the computational complexity for seed patches generation in total is *O*(*m*). However, this complexity could be reduced by enlarging the sliding window step size, so that the seed patches are generated right next to each other. In this case, the number of seed patches can drop to \(m=\frac {W \times H}{L^{2}}\). Due to the adoption of point-based growing approach, the complexity of region growing processes is *O*(*n* log*n*). The complexity *O*(*m*) compared with *O*(*n* log*n*) can be neglected, and consequently, the overall computational complexity of the proposed DIPD algorithm is *O*(*n* log*n*). Therefore, the proposed approach can increase the accuracy and robustness of plane detection without increasing the computational complexity.

## Results

The proposed plane detection approach is validated through extensive experiments on a number of depth maps. To this end, we perform experiments on three types of depth which are generated by ToF depth camera SwissRanger SR4000, a structured light depth camera and computer graphics, respectively. All the types of depth have the ground truth for objective assessment. Although in this work the proposed plane detection algorithm is targeted at ToF camera generated depths which have higher accuracy than the structured light camera generated ones, by testing on other types of depths, the robustness of the proposed algorithm can be validated. In this section, we first briefly introduce each of the adopted depth datasets. Then we evaluate the proposed approach on these depths and present both subjective and objective experimental results along with a comparison with the state-of-the-art approaches. Finally, the runtime analysis with respect to well acknowledged RANSCA approach is discussed.

### Testing images

The ToF depth camera generated depth images present typical indoor scenes, such as a room with table and chairs, cabinet and stairs. They are in a resolution 176×144 and without post-processing. Thus, for some captured scenes, geometric distortion is present. The provided ground truth is obtained by manually labeling in pixel level. The structured light camera generated depth maps are from SegComp ABW dataset [32] and all of the 30 images are in a resolution of 512×512 pixels. The dataset provides ground truth plane segmentation in conjunction with an evaluation tool. The computer generated depth is shown in Fig. 2 which is a 3D saw-tooth structure with each “tooth” having the same width but different heights, so that their corresponding angle of each tooth is different (shown on its top in Fig. 3). The resolution is 176×144, and without any noise, the generated depth is ground truth. The parameters adopted in all datasets are the same that *L*=3,*τ*=3,*λ*=1,*α*=0.009 and *κ*=20.

### Evaluation of the proposed DIPD approach

In this subsection, the proposed approach, two state-of-the-art growing-based approaches ([23, 24]) and two RANSAC-based approaches ([10, 33]) are tested on five indoor scenes shown in Fig. 4. The depth map and associated ground truth are shown in the first and second column in this figure, respectively. The rest five images are the testing results of CORG method [23], RPCA-based hybrid method [24], CC-RANSAC method [10, 33] method and the proposed DIPD method, respectively. In ground truth images, all edges are in white and “uncertain” regions are in black. Whereas, in result images, the black areas or points represent undetected parts. From Fig. 4 we can observe that these five indoor scenes have various levels of depth complexity. For example, *Scene 1* (the first row) has a table and wall with uniform textures. Being more complex than *Scene 1*, *Scene 2* has some books on the table and a different kind of chair. The aim of this kind of arrangement is to assess the ability of the proposed DIPD method to distinguish different planes forming complicated objects. Then, *Scene 3* is a more challenging scenario, due to the presence of many small objects, transparent glass and complex combinations of vertical and horizontal planes. Finally, *Scene 4* and *Scene 5* are the front and side view of a stair-step structure. The stairs scene is known to be challenging for the RANSAC and growing-based plane detection methods.

In the obtained results, detected planes are randomly represented in different colors. It can be noticed that the proposed method can detect the majority of planes. Almost all the detected planes have smooth edges. Some small objects on the cabinet table in Fig. 4 Scene 3 can be distinguished. RPCA-based method also can extract the majority of planes, but due to its sensitivity to the angle of planes, it misses to detect the planes around edges and noisy areas (the black areas in the results). CC-RANSAC and CORG methods can well extract large planes, e.g. the wall, but fail in detecting some small or complex planes (e.g. Scene 3). CORG method has the trend to over-segment planes, while, the CC-RANSAC method has the trend to over-grow planes (e.g. Scene 4). The over-growing problem affecting the results of CC-RANSAC is caused by the intrinsical feature of RANSAC technique. However, in the same situation, the proposed method can distinguish most of the stair planes and has better performance than these two benchmark methods, except some distorted planes (the wall surface and lower two stairs) are over-growing. Compared with the proposed method, RPCA-based method is more robust to intrinsically geometric distortion in this case. It is obvious that the method [10] is also good at detecting large scale planes, e.g., the ground and wall, however, it suffers from the missing detection of small planes. Referring to Scene 4, [10] has detected the parallel horizontal stairs as one plane which is similar to CC-RANSAC. Similar results are also obtained in Scene 5 that the parallel vertical stairs is detected as one plane. The threshold updating mechanism in the proposed method allows refining the estimated equations of the detected planes, this can correctly detect curved surfaces with limited curvature, for example, the top-board side surface of the table in *Scene 1* and *Scene 2*. However, for the chairs’ bases in *Scene 1* with large curvature, they will be still detected as the combination of multiple planes rather than one curved surface.

**Failure cases analysis:** Although the proposed method can correctly detect most of the planes in the scenes, there are still some cases, e.g., intersected planes may make it fail. Refer to Fig. 4 Scene 5, due to the intersection between the horizontal stair planes and the wall surface, the horizontal stair planes over-grow into the wall surface and cause the later become under-growing. Since during the growing process one plane firstly reaches the intersection line (the red line in Figs. 5 and 6), if the fitting errors of the neighboring points of this intersection line are smaller than the current threshold, the current growing plane will wrongly intrude into its intersecting plane. There are two kinds of over-growing: over-growing along the lateral side of the intersection line (shown in Fig. 5) and over-growing along the intersection line (shown in Fig. 6). In the case of Scene 5, the over-growing is lateral over-growing. Another failure case is the under-growing of the wall surface in Scene 4. This is caused by the geometric distortion of the depth map. Although, the proposed plane detection algorithm can correctly detect the planes with limited curvature, due to the geometric distortion the wall surface close to the lens part suffers from a large curvature, which causes the failure of the proposed algorithm. Hence, these failure cases limit the accuracy and robustness of the proposed algorithm. Further post-processing is required to overcome the over-growing and under-growing problem.

The objective assessment of the proposed method is shown in Table 1 using the Receiver Operating Characteristic (ROC) of labeled planes in ground truth. In this table, detection sensitivity can be expressed as *sensitivity*=*TP*/(*TP*+*FN*); specificity can be expressed as *specificity*=*TN*/(*TN*+*FP*); Correct Detection Ratio (CDR) counts for in each scene how many labeled planes are correctly detected, and one plane that has over 80% overlap with the ground truth is regarded as a correctly detected plane. “TP” (True Positive) counts the points that have been successfully detected as inliers of the plane and “TN” (True Negative) counts the non-belonging points that have been successfully detected as outliers of the plane. Whereas, “FN” (False Negative) and “FP” (False Positive) counts the points which were wrongly classified as not belonging and belonging to the plane, respectively. The average values of detection sensitivity, specificity and CDR are also reported in Table 1. From Table 1, the proposed method always has the highest sensitivity and CDR than the benchmark methods. However, in terms of specificity, the proposed method is slightly weaker than PRCA and CORG methods. This means our method has a slight trend of over-growing, nevertheless, the benchmark methods have a clear trend of either under-growing or over-growing. Since the missing detection of areas has huge negative impacts on both the sensitivity and specificity values, the undetected areas and points bring down these values of RPCA and [11] methods. While, the under-growing problem and over-growing problem bring down the sensitivity value of CORG method and the specificity value of CC-RANSAC method, respectively. For the details of objective assessment of each plane, please refer to the project website.

Table 2 shows the results of our approach on the SegComp ABW test images. Since our approach employed the noise model in ToF depth camera, it is not specifically designed for range images in ABW dataset. Furthermore, these range images contain systematic noise in the form of depth discretization effects, which are difficult to handle for small segments composed of only a few points [34]. However, compared with the state-of-the-art range image segmentation performance, our approach only using the depth information still can make the plane detection quality, as well as plane fit accuracy, lay in the upper range of results on this dataset. Note that, in [32] the USF algorithm is regarded as a common approach to region segmentation by iteratively growing from seed regions, the WSU algorithm uses a powerful clustering algorithm to drive its segmentation, and the UB algorithm uses a novel approach that exploits the scan line structure of the image. The parameters in these three methods are obtained by training other range images in ABW databset, hence, they can obtain good segmentation results. In UFPR [35], there are 7 parameters needs to determine for each dataset. One problem faced by this approach is that the locally estimated normal vectors are very imprecise when calculated near object vertices or over small, narrow regions. Hence, it easily leads to miss detection and under-segmentation in these regions. The approach of Georgiev et al. [36] considerably has the trend to over-grow planes meeting at obtuse angles, while, the approach of Trevor et al. [37] is weak at detecting smaller planar patches. The approach of Holz et al. [38] suffers from inconsistent normal orientations in this dataset and tends to over-segment the range images. Since only point normal vector at different resolution was used in clustering plane elements in [34], it suffers in the noisy data.

To validate the detection accuracy and robustness of the proposed DIPD method, we test the method on a computer generated depth map (Fig. 2). By ordering the 18 planes in Figs. 2 and 3 from left to right, the corresponding outcomes of measured angle, sensitivity and specificity for Plane 1, 5, 7, 13 and 17 are listed in Table 3. In the table, “ *Δ*” indicates the angle difference between measure tooth angle and ground truth value, “CG” represents the original computer generated depth map. The value following “SNR” represents the noise level and larger number represents less noise contained. The ground truth angles for Plane 1, 5, 7, 13, 17 are 10°,30°,50°,70° and 90°, respectively. The equation \(\arccos \left (\hat {\mathbf {n}}_{i}^{k_{i}} \cdot \hat {\mathbf {n}}_{u}^{k_{u}}\right)\) is used to measure the angle of a tooth where \(\hat {\mathbf {n}}_{i}^{k_{i}}\) and \(\hat {\mathbf {n}}_{u}^{k_{u}}\) are the estimated norms of the two planes defining that tooth. From this table, we could notice that, in terms of angle measurement, the proposed method has better outcomes and is more robust to noise on the tooth planes with a large slope (Plane 1 and Plane 5) than the ones with a small slope (Plane 13 and Plane 17). Besides some missing detections of planes, the detection sensitivity decreases with the increasing noise which has the opposite trend of specificity. For specificity, lower the value is, severer the over-growing problem is. Hence, the added noise stops the plane to over-grow to some extent and increase the detection accuracy. Compared with sensitivity, the specificity maintains good performance regardless of the noise, which means the proposed method is better at distinguishing the outliers than the inliers.

### Runtime analysis

In order to allow other plane detection or segmentation methods to directly compare with our method, the runtime comparison is carried out between the proposed method and the well acknowledged RANSAC method. Specifically, the default settings of RANSAC are adopted, i.e., the minimum iteration times for detecting each plane is 0, the maximum iteration times is set to infinite, the threshold is 11.35, and the maximum plane number is 40. In this case, RANSAC will stop when the first comparative optimal plane for most of the non-involved points is found, and then the next plane searching process starts. Therefore, the default RANSAC is in its fastest mode. In the proposed DIPD approach, there is a trade-off between the detection accuracy and efficiency. To balance them, a large seed size is adopted (i.e., 11×11) with no seed patch overlap, while a minimal performance degradation of the proposed algorithm is guaranteed. All the rest parameters for the proposed method are kept unchanged, and both algorithms are implemented with Matlab on a PC with Intel i7 CPU, 3.30GHz. Corresponding results are shown in Table 4 (time unit: second). The corresponding results are reported in Table 4. From Table 4, we notice that the proposed algorithm is more time consuming compared to the fastest RANSAC, however, our algorithm achieves obvious higher performance in terms of sensitivity, specificity and CDR, which are around 1.9, 1.5 and 3 times higher than that of RANSAC. Furthermore, with respect to sensitivity and CDR, the performance of our algorithm is still better than that of CORG, RPCA and CC-RANSAC even a large seed size is adopted. It is important to note that when design the whole DIPD algorithm, detection accuracy and the code flexibility and re-usability are predominant with respect to the speed, hence, with the gain in performance of the proposed algorithm, it does not sacrifice much more time.

## Discussion

In this section, we discuss the effects of different components in the proposed DIPD on the final performance. Table 5 summarizes the results achieved on the consumer depth camera generated depth dataset when different components are replaced or removed from the final framework.

In Table 5, the effects of different seed sizes are tested first. By comparing the detection results obtained from different seed patch sizes, it can be noticed that employing smaller seed patch initially can achieve more accurate detection result and this will be more superior for complex scenes (e.g. Scene3). In the same scene, it easily causes over-growing by adopting large seed size. Due to the superior performance of using small seed patch size, in our experiment, all the datasets adopt 3×3 seed patch. In terms of different growing seed orders, the plane grows from the seed with the highest planarity gives the best performance than the other two growing orders which is as expected. Since the growth starts from the seed with highest planarity, through each time the plane fitness checking, it has the trend to maintain this planarity during the following growing. On the contrary, if the growth starts from the seed with the lowest planarity, which means it grows from an unperfect fitting plane. Therefore, the fitness error accumulates after each iteration. It is easy to result in under-growing and the growing process becomes sensitive to the depth noise. For each growing starts from randomly selected seed, its performance, as expected, is between the two situations mentioned before. Moreover, since the growing seed patch is randomly selected, it can not guarantee the stableness of plane detection performance. Compared with different threshold functions, we find that the threshold in [31] increases the fastest along with depth values which makes it easily face over-growing problem, so that its detection performance is the worst. Although the threshold function in [30] has highest values in sensitivity and specificity, the proposed threshold function can lead to the highest CDR which means the proposed method can have more planes correctly detected.

## Conclusions

In this paper, we proposed a dynamic seed growing mechanism to detect indoor planes using depth maps. The growing starts from the most planar seed patch and grows to its largest extent. Then, next unincorporated most planar seed patch is used, until all the planes are detected. A dynamic threshold function which takes both the plane attributes and noise model of depth cameras into account is adopted in the growing process. The performance of the proposed method has been assessed by comparing with other state-of-the-art methods on the typical indoor scenes and public dataset. The reported results indicate the proposed Depth Image-based Plane Detection (DIPD) method can detect planes with high sensitivity and are robust with respect to various indoor scenes, the chosen parameters and depth noise. As for future work, we aim to exploit the proposed approach for more applications, e.g., depth map up-sampling and depth map coding.

## References

- 1
Cohen A, Schnberger JL, Speciale P, Sattler T. Indoor-outdoor 3d reconstruction alignment. In: European Conference on Computer Vision (ECCV), vol. 9907. Cham: Springer: 2016.

- 2
Zhang Y, Xu W, Tong Y, Zhou K. Online structure analysis for real-time indoor scene reconstruction. ACM Trans Graph. 2015; 34(5):159–115913.

- 3
Francis E, Jörg S, Bastian L. Joint Object Pose Estimation and Shape Reconstruction in Urban Street Scenes Using 3D Shape Priors. Cham: Springer; 2016, pp. 219–30.

- 4
Lu Y, Song D. Visual navigation using heterogeneous landmarks and unsupervised geometric constraints. IEEE Trans Robot. 2015; 31(3):736–49.

- 5
Gupta S, Arbelaez P, Girshick R, Malik J. Indoor scene understanding with rgb-d images: Bottom-up segmentation, object detection and semantic segmentation. Int J Comput Vision. 2015; 112(2):133–49.

- 6
http://hptg.com/industrial/ (accessed: 15 June 2018).internest. 2014.

- 7
https://developer.microsoft.com/en-us/windows/kinect (accessed: 15 June 2018).internest. 2014.

- 8
Holz D, Holzer S, Rusu RB, Behnke S. Real-time plane segmentation using rgb-d cameras. In: In Robot Soccer World Cup. Berlin Heidelberg: Springer: 2011. p. 306–17.

- 9
Jin Z, Tillo T, Cheng F. Depth-map driven planar surfaces detection. In: Visual Communications and Image Processing Conference, IEEE. Valletta: IEEE: 2014. p. 514–7.

- 10
Deng Z, Todorovic S, Latecki LJ. Unsupervised object region proposals for rgb-d indoor scenes. Comput Vision Image Underst. 2017; 154:127–36.

- 11
H.Kim HX, Max N. Piecewise planar scene reconstruction and optimization for multi-view stereo. In: Computer Vision(ACCV), 11th Asian Conference on Computer Vision, Daejeon, Korea, November 5-9, 2012, Revised Selected Papers, Part IV. Berlin Heidelberg: Springer: 2013. p. 191–204.

- 12
Fernández-Moral E, Mayol-Cuevas W, Arévalo V, González-Jiménez J. Fast place recognition with plane-based maps. In: Robotics and Automation (ICRA), IEEE International Conference On. Karlsruhe: IEEE: 2013. p. 2719–24.

- 13
Fischler MA, Bolles RC. Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography. Commun ACM. 1981; 24(6):381–95. https://doi.org/10.1145/358669.358692.

- 14
Yang MY, Förstner W. Plane detection in point cloud data. In: Proceedings of the 2nd Int Conf on Machine Control Guidance, Bonn. Bonn: a technical report published by the University of Bonn: 2010. p. 95–104.

- 15
Qian X, Ye C. Ncc-ransac: A fast plane extraction method for 3-d range data segmentation. IEEE Trans Cybern. 2014; 44(12):2771–2783.

- 16
Hough PVC. Method and means for recognizing complex patterns. U.S. Atomic Energy Commission DTIE; NSA-17-008572, US 3069654, United States. 1962.

- 17
Hulik R, Spanel M, Smrz P, Materna Z. Continuous plane detection in point-cloud data based on 3d hough transform. J Vis Commun Image Represent. 2014; 25(1):86–97. https://doi.org/10.1016/j.jvcir.2013.04.001. Visual Understanding and Applications with RGB-D Cameras.

- 18
Borrmann D, Elseberg J, Lingemann K, Nüchter A. The 3d hough transform for plane detection in point clouds: A review and a new accumulator design. 3D Res. 2011; 2(2):1–13.

- 19
Dube D, Zell A. Real-time plane extraction from depth images with the randomized hough transform. In: Computer Vision Workshops (ICCV Workshops), IEEE International Conference On. Barcelona Spain: IEEE: 2011. p. 1084–91.

- 20
Pathak K, Birk A, Vaskevicius N, Poppinga J. Fast registration based on noisy planes with unknown correspondences for 3-d mapping. Robot IEEE Trans. 2010; 26(3):424–41. https://doi.org/10.1109/TRO.2010.2042989.

- 21
Holz D, Behnke S. Fast range image segmentation and smoothing using approximate surface reconstruction and region growing. In: Proceedings of the Internatinal Conforence on Intelligent Autonomous Systems, IAS, Jeju Island, Korea. Jeju Island: IEEE: 2012.

- 22
Holz D, Behnke S. Approximate triangulation and region growing for efficient segmentation and smoothing of range images. In: Robotics Autonomous Systems 62. Elsevier: 2014. 62(9):1282–93.

- 23
Xiao J, Adler B, Zhang J, Zhang H. Planar segment based three-dimensional point cloud registration in outdoor environments. J Field Robot. 2013; 30(4):552–82.

- 24
Nurunnabi A, Belton D, West G. Robust segmentation for multiple planar surface extraction in laser scanning 3d point cloud data. In: Pattern Recognition (ICPR), 21st International Conference On.Tsukuba: IEEE: 2012. p. 1367–70.

- 25
Jiang X, Bunke H. Fast segmentation of range images into planar regions by scan line grouping. Mach Vis Appl. 1994; 7(2):115–22.

- 26
Hemmat HJ, A P, Bondarev E, de With PHN. Fast planar segmentation of depth images. Proc. SPIE. 2015; 9399:93990–939908.

- 27
Gonzalez RC, Woods RE. Digital Image Processing.Upper Saddle River: Prentice Hall; 2008.

- 28
Anderson D, Herman H, Kelly A. Experimental characterization of commercial flash ladar devices. In: Proceedings of the International Conference of Sensing and Technology, Palmerston North, New Zealand. Palmerston North: IEEE: 2005.

- 29
Nguyen CV, Izadi S, Lovell D. Modeling kinect sensor noise for improved 3d reconstruction and tracking. In: Second International Conference on 3D Imaging, Modeling, Processing, Visualization Transmission.Zurich: IEEE: 2012. p. 524–30.

- 30
Smisek J, Jancosek M, Tomas P. 3D with Kinect. London: Springer; 2013, pp. 3–25.

- 31
Holzer S, Rusu RB, Dixon M, Gedikli S, Navab N. Real-time surface normal estimation from organized point cloud data using integral images. In: in:Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS, Vilamoura, Portugal. Vilamoura: IEEE: 2012. p. 2684–9.

- 32
Hoover A, Jean-Baptiste G, Jiang X, Flynn PJ, Bunke H, Goldgof DB, Bowyer K, Eggert DW, Fitzgibbon A, Fisher RB. An experimental comparison of range image segmentation algorithms. Pattern Anal Mach Intell IEEE Trans. 1996; 18(7):673–89. https://doi.org/10.1109/34.506791.

- 33
Gallo O, Manduchi R, Rafii A. Cc-ransac: Fitting planes in the presence of multiple surfaces in range data. Pattern Recog Lett. 2011; 32(3):403–10. https://doi.org/10.1016/j.patrec.2010.10.009.

- 34
Oehler B, Stueckler J, Welle DJ, Schulz Behnke S. Efficient Multi-resolution Plane Segmentation of 3D Point Clouds. Berlin: Springer; 2011, pp. 145–56.

- 35
Gotardo PFU, Bellon ORP, Silva L. Range image segmentation by surface extraction using an improved robust estimator. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. Madison: IEEE: 2003. p. 33–8.

- 36
Georgiev K, Creed RT, Lakaemper R. Fast plane extraction in 3d range data based on line segments. In: IEEE/RSJ International Conference on Intelligent Robots and Systems.San Francisco: IEEE: 2011. p. 3808–15.

- 37
Trevor AJB, Gedikli S, Rusu RB, Christensen HI. Efficient organized point cloud segmentation with connected components. Karlsruhe: IEEE; 2013.

- 38
D H, J SR, Stückler DD, S B. Towards Semantic Scene Analysis with Time-of-Flight Cameras. Berlin Heidelberg: Springer; 2011, pp. 121–32.

## Acknowledgements

The author would like to thank Xiangfei Qian and Prof. Cang Ye from the Department of Systems Engineering, University of Arkansas for their helpful technical support.

### Funding

This work is supported by the NSFC Project under Grant 61771321, Grant 61701313, and Grant 61472257, in part by the Natural Science Foundation of Shenzhen under Grant KQJSCX20170327151357330, Grant JCYJ20170818091621856, Grant JCYJ20160307154003475, Grant JCYJ20160506172651253 and Grant JCYJ20170302145906843, in part by the Interdisciplinary Innovation Team of Shenzhen University, and in part by the Natural Science Foundation of SZU under Grant 827-000152.

### Availability of data and materials

All the testing data and source code for DIPD algorithm are available in the GitHub repository https://github.com/jzrita/DIPD_Project/tree/master/DIPD_test_imagesfor research purpose only.

## Author information

### Affiliations

### Contributions

In this work, a dynamic seed growing-based indoor planes detection algorithm is proposed. The proposed algorithm has three contributions. Firstly, no RGB information is used and no per-pixel normal vector estimation is required. Secondly, the seed selection approach starts from the patch with the largest planarity rather than separated or randomly selected seed points. Thirdly, a dynamic threshold function is proposed in the growing process, which takes both the process and ToF depth camera noise model into account. ZJ and TT proposed this algorithm, carried out numerical experiments, and drafted the manuscript. WZ, XL and EGL checked and clarified the manuscript carefully. All authors read and approved the final manuscript.

### Corresponding author

Correspondence to Wenbin Zou.

## Ethics declarations

### Ethics approval and consent to participate

Not applicable.

### Consent for publication

Not applicable.

### Competing interests

The authors declare that they have no competing interests.

### Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## Rights and permissions

**Open Access** This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.

## About this article

### Cite this article

Jin, Z., Tillo, T., Zou, W. *et al.* Depth image-based plane detection.
*Big Data Anal* **3, **10 (2018). https://doi.org/10.1186/s41044-018-0035-y

Received:

Accepted:

Published:

### Keywords

- Plane detection
- Depth image
- Region growing
- Dynamic threshold function
- ToF depth camera