scholarly journals Fast plane segmentation with line primitives for RGB-D sensor

2016 ◽  
Vol 13 (6) ◽  
pp. 172988141666584 ◽  
Author(s):  
Lizhi Zhang ◽  
Diansheng Chen ◽  
Weihui Liu

This article presents a fast and robust plane segmentation approach for RGB-D type sensor, which detects plane candidates by line segments extracted from 2-D scanline projected from row or column points. It neither requires high computation to calculate local normals for the entire point cloud as most of approaches do nor randomly chooses plane candidates such as RANSAC-like approaches. First, a line extraction algorithm is utilized to extract line segments. Second, the plane candidates are detected by estimating local normal of points lying on line segments. Finally, the plane having most inlier is recursively extracted from the plane candidates as the result plane. Experiments were conducted with different data sets and the segmentation performances were evaluated quantitatively and qualitatively. We demonstrated the efficiency and robustness of our proposed approach, especially in the none plane scenario, the approach needs little computational cost.

2019 ◽  
Vol 27 (5) ◽  
pp. 1218-1228
Author(s):  
陈华伟 CHEN Hua-wei ◽  
袁小翠 YUAN Xiao-cui ◽  
吴禄慎 WU Lu-chen ◽  
王晓辉 WANG Xiao-hui

Author(s):  
Chi-Fang Lin ◽  
Cheng-Yi Hsiao

A novel method is proposed in this study to recognize the line structure of table-form documents, e.g. telephone bills and office documents. The line structures of table-form documents are mainly composed of horizontal and vertical line segments. By treating the segment structure as line patterns, the problem of structure recognition is turned out to be the searching of line pattern matching, which can be solved by adopting the technique of relaxation. The proposed method consists of a learning phase and a recognition phase. In the former phase, line structures of various kinds of table-form documents are taken as templates and are extracted through a line extraction algorithm, in which an unique number functioning as a form ID is assigned to each line pattern. In the latter, by adopting the method of relaxation, the line pattern of the testing document is matched to those patterns created in the previous phase and the form ID of the best matching is chosen as the ID of the testing document. To increase the performance of the proposed method, an algorithm was presented to reduce the number of line segments in the matching process. The experimental results reveal the practicability of the proposed methods.


2014 ◽  
Vol 926-930 ◽  
pp. 3612-3615
Author(s):  
Chun Fang Wang

Automatic recognition of the line in the image is an important work in the field of machine vision and image processing. Focusing on the problem of the computational cost and large invalid sampling in the line extraction algorithm using standard Hough transform (HT). An improved HT algorithm is proposed to solve these problems. The parameters of the improved algorithm can be reduced to one and the accumulator is operated by setting the tolerance. Then the existence of linear is determined by seting the threshold. The experimental results show that the algorithm not only can effectively solve the problem of local maxima and improves the algorithm speed and reduces the storage space,but also the accuracy of line extraction is improved.


1976 ◽  
Vol 15 (01) ◽  
pp. 36-42 ◽  
Author(s):  
J. Schlörer

From a statistical data bank containing only anonymous records, the records sometimes may be identified and then retrieved, as personal records, by on line dialogue. The risk mainly applies to statistical data sets representing populations, or samples with a high ratio n/N. On the other hand, access controls are unsatisfactory as a general means of protection for statistical data banks, which should be open to large user communities. A threat monitoring scheme is proposed, which will largely block the techniques for retrieval of complete records. If combined with additional measures (e.g., slight modifications of output), it may be expected to render, from a cost-benefit point of view, intrusion attempts by dialogue valueless, if not absolutely impossible. The bona fide user has to pay by some loss of information, but considerable flexibility in evaluation is retained. The proposal of controlled classification included in the scheme may also be useful for off line dialogue systems.


1995 ◽  
Vol 31 (2) ◽  
pp. 193-204 ◽  
Author(s):  
Koen Grijspeerdt ◽  
Peter Vanrolleghem ◽  
Willy Verstraete

A comparative study of several recently proposed one-dimensional sedimentation models has been made. This has been achieved by fitting these models to steady-state and dynamic concentration profiles obtained in a down-scaled secondary decanter. The models were evaluated with several a posteriori model selection criteria. Since the purpose of the modelling task is to do on-line simulations, the calculation time was used as one of the selection criteria. Finally, the practical identifiability of the models for the available data sets was also investigated. It could be concluded that the model of Takács et al. (1991) gave the most reliable results.


Sign in / Sign up

Export Citation Format

Share Document