Secure Ranked Keyword Search Method with Conditional Random Fields over Encrypted Cloud Data

Author(s):  
Priyanka V. Deshpande ◽  
U. L. Talware
2012 ◽  
Vol 23 (8) ◽  
pp. 1467-1479 ◽  
Author(s):  
Cong Wang ◽  
Ning Cao ◽  
Kui Ren ◽  
Wenjing Lou

2016 ◽  
Vol 27 (4) ◽  
pp. 951-963 ◽  
Author(s):  
Chi Chen ◽  
Xiaojie Zhu ◽  
Peisong Shen ◽  
Jiankun Hu ◽  
Song Guo ◽  
...  

Author(s):  
M. Bassier ◽  
M. Bonduel ◽  
B. Van Genechten ◽  
M. Vergauwen

Point cloud segmentation is a crucial step in scene understanding and interpretation. The goal is to decompose the initial data into sets of workable clusters with similar properties. Additionally, it is a key aspect in the automated procedure from point cloud data to BIM. Current approaches typically only segment a single type of primitive such as planes or cylinders. Also, current algorithms suffer from oversegmenting the data and are often sensor or scene dependent.<br><br> In this work, a method is presented to automatically segment large unstructured point clouds of buildings. More specifically, the segmentation is formulated as a graph optimisation problem. First, the data is oversegmented with a greedy octree-based region growing method. The growing is conditioned on the segmentation of planes as well as smooth surfaces. Next, the candidate clusters are represented by a Conditional Random Field after which the most likely configuration of candidate clusters is computed given a set of local and contextual features. The experiments prove that the used method is a fast and reliable framework for unstructured point cloud segmentation. Processing speeds up to 40,000 points per second are recorded for the region growing. Additionally, the recall and precision of the graph clustering is approximately 80%. Overall, nearly 22% of oversegmentation is reduced by clustering the data. These clusters will be classified and used as a basis for the reconstruction of BIM models.


Sign in / Sign up

Export Citation Format

Share Document