Welcome to Journal of Graphics share: 

Journal of Graphics ›› 2025, Vol. 46 ›› Issue (3): 542-550.DOI: 10.11996/JG.j.2095-302X.2025030542

• Image Processing and Computer Vision • Previous Articles     Next Articles

Line extraction and representation algorithm for RGB-D data

LIU Xin(), LI Yang, FENG Shengjie, WU Xiaoqun()   

  1. School of Computing and Artificial Intelligence, Beijing Technology and Business University, Beijing 100048, China
  • Received:2024-07-03 Accepted:2025-01-06 Online:2025-06-30 Published:2025-06-13
  • Contact: WU Xiaoqun
  • About author:First author contact:

    LIU Xin (2000-), master student. His main research interests cover computer graphics, digital geometry processing and image processing. E-mail:2230702022@st.btbu.edu.cn

  • Supported by:
    National Natural Science Foundation of China General Program(62272014)

Abstract:

To improve the accuracy and quality of feature line extraction, a novel algorithm for RGB-D data was proposed to address the challenges of distinguishing between color and geometric boundaries and resolving the discontinuity and roughness of feature lines represented by straight line segments. The proposed algorithm fully utilized the close coupling and complementary properties between RGB and depth images, integrating color and geometric information to enhance the quality of line extraction results. First, the algorithm extracted a dense set of geometric boundary feature points based on color, depth, normal vectors, curvature, and other geometric information, as well as the corresponding planar geometric features of the RGB-D input. Subsequently, the feature point set was optimized using sparse processing, and corner point information was incorporated to enhance the feature line representation. Lastly, the lines were fitted and represented by cubic B-splines, which offered compactness, continuity, and smoothness. During the curve fitting process, a heavy node setting was applied to ensure that the curve passed through the key corner points, thereby accurately representing the trend of the recovered feature line. In order to verify the effectiveness of the proposed algorithm, experiments were performed on both self-collected and publicly accessible RGB-D datasets. Comparative evaluations against existing algorithms demonstrated that the proposed algorithm achieved an extraction precision of 0.82, a recall rate of 0.59, and an intersection-to-union ratio of 0.54 on the NYU v2 dataset. The results indicated that the algorithm can effectively extract continuous and smooth geometric lines from low-quality RGB-D inputs afflicted with deep noise.

Key words: RGB-D, feature line extraction, feature line representation, dense and sparse processing, B-splines

CLC Number: