As a kind of information-intensive 3D representation, point cloud rapidly develops in immersive applications, which has also sparked new attention in point cloud compression. The most popular dynamic methods ignore the characteristics of point clouds and use an exhaustive neighborhood search, which seriously impacts the encoder’s runtime. Therefore, we propose an improved compression means for dynamic point cloud based on curvature estimation and hierarchical strategy to meet the demands in real-world scenarios. This method includes initial segmentation derived from the similarity between normals, curvature-based hierarchical refining process for iterating, and image generation and video compression technology based on de-redundancy without performance loss. The curvature-based hierarchical refining module divides the voxel point cloud into high-curvature points and low-curvature points and optimizes the initial clusters hierarchically. The experimental results show that our method achieved improved compression performance and faster runtime than traditional video-based dynamic point cloud compression.

This paper introduces a robust normal estimation method for point cloud data that can handle both smooth and sharp features. Our method is based on the inclusion of neighborhood recognition into the normal mollification process in the neighborhood of the current point: First, the point cloud surfaces are assigned normals via a normal estimator of robust location (NERL), which guarantees the reliability of the smooth region normals, and then a robust feature point recognition method is proposed to identify points around sharp features accurately. Furthermore, Gaussian maps and clustering are adopted for feature points to seek a rough isotropic neighborhood for the first-stage normal mollification. In order to further deal with non-uniform sampling or various complex scenes efficiently, the second-stage normal mollification based on residual is proposed. The proposed method was experimentally validated on synthetic and real-world datasets and compared to state-of-the-art methods.

To effectively balance the trade-off between a large field of view (FOV) and high resolution of an optical system, as well as to solve the problem of image stitching misalignment after focusing, firstly, this paper conducts a theoretical analysis of the design principle of the concentric multi-scale optical system and the causes of image stitching misalignment after focusing. Secondly, the design idea of using a combination structure of a two-layer front concentric imaging group and an image-space telecentric relay imaging array and then a joint full-motion zoom relay imaging system is proposed. Finally, an image-space telecentric two-step zoom concentric multi-scale optical system with a 7 × 7 relay imaging array is designed. The FOV of this optical system is 60° × 45°; the focal lengths are 50 mm and 100 mm for the center channel and 50 mm for the other channels. This concentric multi-scale zoom system has the advantages of both high-precision imaging stitching with a wide object distance and high-resolution imaging, which makes up for the defects of the conventional concentric multi-scale optical system, making it a promising application in the fields of aviation and security.

The predecessor of China Optics was China Optics and Applied Optics Digest, which was founded in 1985. At that time, it was the only retrieval journal in the field of optics in China. At the end of 2008, China Optics and Applied Optics Digest was renamed 《中国光学》的前身是1985年创办的《中国光学与应用光学文摘》，当时是国内光学领域唯一的检索刊物。2008年底《中国光学与应用光学文摘》转型更名为《中国光学与应用光学》期刊，刊载内容突破了文摘的限制，正式成为学术刊物。

Evaluation of the deviation zone based on discrete measured points is crucial for quality control in manufacturing and metrology. However, deviation-zone evaluation is a highly nonlinear problem that is difficult to solve using traditional numerical optimization methods. Swarm intelligence has many advantages in solving this problem: it produces gradient-free, high-quality solutions and is characterized by its ease of implementation. Therefore, this study applies an improved Harris hawks algorithm (HHO) to tackle the problem. The average fitness is applied to replace the random operator in the exploration phase to solve the problem of conflicting exploration strategies due to randomness. In addition, the salp swarm algorithm (SSA) with a nonlinear inertia weight is embedded into the HHO, such that the superior explorative ability of SSA can fill the gap in the exploration of HHO. Finally, the optimal solution is greedily selected between SSA-based individuals and HHO-based individuals. The effectiveness of the proposed improved HHO optimizer is checked through a comparison with other swarm intelligence methods in typical benchmark problems. Moreover, the experimental results of form deviation-zone evaluation on primitive geometries show that the improved method can accurately solve various form deviations, providing an effective general solution for primitive geometries in the manufacturing and metrology fields.

Three-dimensional digital modeling at actual scales is essential for digitally preserving cultural relics. While 3D reconstruction using a monocular camera offers a cost-effective solution, the lack of scale information in the resulting models limits their suitability for geometric measurements. Objects with monotonous textures, such as batteries, pose additional challenges due to insufficient feature points, increasing positional uncertainty. This article proposes a method incorporating point and line features to address the scale ambiguity in multi-view 3D reconstruction using monocular cameras. By pre-measuring the lengths of multiple sets of real line segments, building a lookup table, and associating the line features in different images, the table was input into the improved reconstruction algorithm to further optimize the scale information. Experimental results on real datasets showed that the proposed method outperformed the COLMAP method by 70.82% in reconstruction accuracy, with a scale recovery reaching millimeter-level accuracy. This method is highly generalizable, cost-effective, and supports lightweight computation, making it suitable for real-time operation on a CPU.