The quality of underwater polarization imaging is mainly affected by the polarization properties of the target and impurity particles. Traditional methods often assume uniform polarization characteristics of the target, which make it difficult to address the restoration issues of complex targets. In response, a partition-based method for recovering underwater polarization images is proposed. The method involves pre-processing the image using the Gaussian curvature filtering algorithm, partitioning the image based on polarization information. In addition, a joint image evaluation method is used to achieve restoration of complex polarized characteristic targets. The method estimates the value of the reflected light polarization of one partition to estimate the value of the next partition and links the polarization values of each partition. Our approach achieves clear restoration results for multiple targets or complex structural objects underwater. Achieving significant improvement in image quality in multi-target underwater scenes, our method is highly effective for complex underwater environments. Experimental results show that our method, when compared with three other newer methods on multiple images of different targets and under varying scattering conditions, achieves an average increase of 617% in the standard deviation image evaluation index and a 61% optimization in the natural image quality evaluator index. Furthermore, our method is robust for different degrees of water turbidity.
KEYWORDS: Clouds, Detection and tracking algorithms, Radar, Principal component analysis, 3D acquisition, Image registration, 3D modeling, LIDAR, Space operations, Data modeling
It has become an important and difficult point to solve the problem of non-cooperative target pose measurement in space. The three-dimensional point cloud data of the target acquired by the laser radar can restore its three-dimensional morphology through point cloud registration, so as to solve the relative pose of non-cooperative target in space. In view of the fact that the traditional point cloud Iterative Closest Point (ICP) registration algorithm is prone to fall into local extremum when the initial value is not good, which leads to registration failure, a rough registration algorithm of 3D point cloud based on the combination of bounding box and FPFH descriptor using principal component analysis is proposed. In this method, PCA is used to construct a three-dimensional point cloud bounding box. The parameter threshold of FPFH describing sub-point cloud on-time matching is selected through the density of point cloud and the outer dimension of outer bounding box. The normal alignment is added to adjust the normal direction of point cloud. The experimental results show that the proposed method simplifies the complexity feature parameters selection, reduces the search range of the feature point matching, and provides the error of precise registration of about 3°, to solve the spatial non-cooperative target relative position measurement technology provides technical reference.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.