A Novel Grouping-Based Hybrid Color Correction Algorithm for Color Point Clouds

• URL: http://arxiv.org/abs/2511.02397v1
• Date: Tue, 04 Nov 2025 09:23:15 GMT
• Title: A Novel Grouping-Based Hybrid Color Correction Algorithm for Color Point Clouds
• Authors: Kuo-Liang Chung, Ting-Chung Tang,
• Abstract summary: This paper proposes a grouping-based hybrid color correction algorithm for color point clouds.<n>The desired color consistency correction benefit of our algorithm has been justified through 1086 testing color point cloud pairs.
• Score: 2.2917707112773593
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Color consistency correction for color point clouds is a fundamental yet important task in 3D rendering and compression applications. In the past, most previous color correction methods aimed at correcting color for color images. The purpose of this paper is to propose a grouping-based hybrid color correction algorithm for color point clouds. Our algorithm begins by estimating the overlapping rate between the aligned source and target point clouds, and then adaptively partitions the target points into two groups, namely the close proximity group Gcl and the moderate proximity group Gmod, or three groups, namely Gcl, Gmod, and the distant proximity group Gdist, when the estimated overlapping rate is low or high, respectively. To correct color for target points in Gcl, a K-nearest neighbors based bilateral interpolation (KBI) method is proposed. To correct color for target points in Gmod, a joint KBI and the histogram equalization (JKHE) method is proposed. For target points in Gdist, a histogram equalization (HE) method is proposed for color correction. Finally, we discuss the grouping-effect free property and the ablation study in our algorithm. The desired color consistency correction benefit of our algorithm has been justified through 1086 testing color point cloud pairs against the state-of-the-art methods. The C++ source code of our algorithm can be accessed from the website: https://github.com/ivpml84079/Point-cloud-color-correction.

Related papers

• Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges [8.499685241219366]
  We consider a framework for clustering edge-colored hypergraphs, where the goal is to cluster objects based on the primary type of multiway interactions they participate in.<n>One well-studied objective is to color nodes to minimize the number of unsatisfied hyperedges.<n>We provide new algorithms for maximizing satisfied edges, which is the same at optimality but is much more challenging to approximate.
  arXiv  Detail & Related papers  (2025-02-18T16:20:50Z)
• Evaluating the Impact of Point Cloud Colorization on Semantic Segmentation Accuracy [1.4604369887945985]
  Point cloud semantic segmentation is essential for 3D scene understanding. While image-based segmentation is widely adopted due to its maturity, methods relying solely on RGB information often suffer from degraded performance due to color inaccuracies. Recent advancements have incorporated additional features such as intensity and geometric information, yet RGB channels continue to negatively impact segmentation accuracy when errors in colorization occur.
  arXiv  Detail & Related papers  (2024-10-09T09:46:53Z)
• Fuzzy color model and clustering algorithm for color clustering problem [2.002741592555996]
  We have tried to model the inherent uncertainty and vagueness of color data using fuzzy color model. With the fuzzy color model, we developed a new fuzzy clustering algorithm for an efficient partition of color data.
  arXiv  Detail & Related papers  (2024-07-09T11:53:54Z)
• Multiway Point Cloud Mosaicking with Diffusion and Global Optimization [74.3802812773891]
  We introduce a novel framework for multiway point cloud mosaicking (named Wednesday) At the core of our approach is ODIN, a learned pairwise registration algorithm that identifies overlaps and refines attention scores. Tested on four diverse, large-scale datasets, our method state-of-the-art pairwise and rotation registration results by a large margin on all benchmarks.
  arXiv  Detail & Related papers  (2024-03-30T17:29:13Z)
• CheckerPose: Progressive Dense Keypoint Localization for Object Pose Estimation with Graph Neural Network [66.24726878647543]
  Estimating the 6-DoF pose of a rigid object from a single RGB image is a crucial yet challenging task. Recent studies have shown the great potential of dense correspondence-based solutions. We propose a novel pose estimation algorithm named CheckerPose, which improves on three main aspects.
  arXiv  Detail & Related papers  (2023-03-29T17:30:53Z)
• GQE-Net: A Graph-based Quality Enhancement Network for Point Cloud Color Attribute [51.4803148196217]
  We propose a graph-based quality enhancement network (GQE-Net) to reduce color distortion in point clouds. GQE-Net uses geometry information as an auxiliary input and graph convolution blocks to extract local features efficiently. Experimental results show that our method achieves state-of-the-art performance.
  arXiv  Detail & Related papers  (2023-03-24T02:33:45Z)
• PCR-CG: Point Cloud Registration via Deep Explicit Color and Geometry [28.653015760036602]
  We introduce a novel 3D point cloud registration module explicitly embedding the color signals into the geometry representation. Our key contribution is a 2D-3D cross-modality learning algorithm that embeds the deep features learned from color signals to the geometry representation. Our study reveals a significant advantages of correlating explicit deep color features to the point cloud in the registration task.
  arXiv  Detail & Related papers  (2023-02-28T08:50:17Z)
• Keypoint Cascade Voting for Point Cloud Based 6DoF Pose Estimation [1.3439502310822147]
  We propose a novel keypoint voting 6DoF object pose estimation method, which takes pure unordered point cloud geometry as input without RGB information. The proposed cascaded keypoint voting method, called RCVPose3D, is based upon a novel architecture which separates the task of semantic segmentation from that of keypoint regression.
  arXiv  Detail & Related papers  (2022-10-14T21:36:52Z)
• GPCO: An Unsupervised Green Point Cloud Odometry Method [64.86292006892093]
  A lightweight point cloud odometry solution is proposed and named the green point cloud odometry (GPCO) method. GPCO is an unsupervised learning method that predicts object motion by matching features of consecutive point cloud scans. It is observed that GPCO outperforms benchmarking deep learning methods in accuracy while it has a significantly smaller model size and less training time.
  arXiv  Detail & Related papers  (2021-12-08T00:24:03Z)
• Differentiable Hierarchical Graph Grouping for Multi-Person Pose Estimation [95.72606536493548]
  Multi-person pose estimation is challenging because it localizes body keypoints for multiple persons simultaneously. We propose a novel differentiable Hierarchical Graph Grouping (HGG) method to learn the graph grouping in bottom-up multi-person pose estimation task.
  arXiv  Detail & Related papers  (2020-07-23T08:46:22Z)
• Sequential Graph Convolutional Network for Active Learning [53.99104862192055]
  We propose a novel pool-based Active Learning framework constructed on a sequential Graph Convolution Network (GCN) With a small number of randomly sampled images as seed labelled examples, we learn the parameters of the graph to distinguish labelled vs unlabelled nodes. We exploit these characteristics of GCN to select the unlabelled examples which are sufficiently different from labelled ones.
  arXiv  Detail & Related papers  (2020-06-18T00:55:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.