Point cloud registration serves as a critical tool for constructing 3D environmental maps. Both geometric and color information are instrumental in differentiating diverse point features. Specifically, when points appear similar based solely on geometric features, rendering them challenging to distinguish, the color information embedded in the point cloud carries significantly important features. In this study, the colored point cloud is utilized in the FCGCF algorithm, a refined version of the FCGF algorithm, incorporating color information. Moreover, we introduce the PointDSCC method, which amalgamates color consistency from the PointDSC method for outlier removal, thus enhancing registration performance when synergized with other pipeline stages. Comprehensive experiments across diverse datasets reveal that the integration of color information into the registration pipeline markedly surpasses the majority of existing methodologies and demonstrates robust generalizability.

As the cornerstone of Industrial Internet, heterogeneous data interoperability is aiming to develop intelligence through the data-driven industry. Hence, standardized data model and information service system become more and more important for different countries, different industries, and different enterprises. In this paper, we provide a comprehensive study of the latest industrial data models, and propose the exploration of Identifiable Digital Object (IDO) data model. We hope that this paper will inspire more researches into practice.

In the context of real-world Internet of Things (IoT) implementations, the delivery of images within blockchain environments is becoming increasingly crucial. However, the multitable hashing technologies currently used for retrieval suffer from considerable redundancy in tables, leading to diminished performance of the distributed system. To address these challenges, we propose a hash code selection-based secure image retrieval (HCSSIR) scheme for data sharing and secure retrieval on the blockchain. First, we introduce a learning-based method to shorten hash codes. Initial long hash codes are generated using locality-sensitive hashing families for high efficiency and accuracy. The most informative hash tables are then selected based on a learning model that has been pretrained on a dataset specifically prepared for this purpose. This approach aims to reduce space and computational requirements, potentially further decreasing time consumption. Next, a cryptographic hierarchical index structure based on the compressed hash codes is designed, along with its construction and searching methods. We also create a secure Hamming distance computation algorithm to preserve the index features and access patterns. Finally, proxy re-encryption is adapted to ensure data availability in multiuser settings. We offer a security analysis to confirm that the HCSSIR scheme effectively protects the privacy of images, indexes, and queries. Furthermore, the proposed selection method achieves an approximate 12.3% enhancement in F1-score for code compression when compared with the cutting-edge method. Additionally, the HCSSIR scheme registers improvements of approximately 27.58% and 56.7% in searching and storage efficiencies, respectively. These results underscore its suitability for real-world IoT applications.