Dynamic LiDAR point cloud compression with range images aims to reduce storage and transmission costs while preserving both spatial accuracy and temporal consistency across frames. Vision Transformers (ViTs) are commonly used for cross-frame dependency modeling. However, they suffer from feature misalignment under cross-frame displacement due to fixed patch partitioning, and their global attention across all patches is costly yet ineffective for local motions. High-precision sequences also face precision loss when 16-bit range data are quantized in a single channel. To address these limitations, we propose a Slide Deformable Transformer framework for high-precision dynamic LiDAR point cloud compression, termed SDT-PCC. At its core, the proposed SDT layer restricts attention to local sliding windows, capturing fine-grained correspondences across consecutive frames. It integrates deformable convolution into cross-frame attention to adaptively sample motion-offset locations, thereby enhancing temporal alignment and motion modeling. We also propose a Radix-Decomposition Multi-Channel Quantizer (RDMCQ), which decomposes range values into multiple channels and progressively refines precision across radix levels. Consequently, these designs can produce more temporally-coherent, accurate and stable reconstructions. Experiments on the SemanticKITTI dataset show that SDT-PCC achieves high efficiency in dynamic point cloud compression. The code is available on https://github.com/SYSU-SAIL/SDT-PCC.

Multi-view clustering (MVC) can fuse the information of multiple views for robust clustering result, among it two fusion strategies,early-fusionandlate-fusionare widely adopted. Although they have derived many MVC methods, there are still two crucial questions: (1)early-fusionforces multiple views to share a consensus latent representation, which compounds the challenge of excavating view-specific diverse local information; (2)late-fusiongenerates view-partitions independently and then integrates them in the following clustering procedure, where the two procedures cannot guide each other and lack necessary negotiation. In view of this, we propose a novel Graph Proxy Fusion (GPF) method to preserve and fuse view-specific local information concertedly in one unified framework. Specifically, we first propose anchor-based local information learning to capture view-specific local structural information in bipartite graphs; meanwhile, a view-consensus graph learned through self-expressiveness-based proxy graph learning module is deemed as a higher-order proxy; following, the novel graph proxy fusion module integrally embeds all lower-order bipartite graphs in the higher-order proxy via higher-order correlation theory. As a novel fusion strategy, the proposed GPF efficiently investigates the valuable consensus and diverse information of multiple views. Experiments on various multi-view datasets demonstrate the superiority of our method.

The growth of 3D point cloud applications requires efficient compression techniques for high-quality and low-latency services. Recently, learning-based point cloud compression models have made significant progress. However, geometric distortion resulting from downsampling limits the feature depth within large-scale point clouds, thereby constraining the receptive field and suppressing the redundant removal. Moreover, the issues of computational efficiency and reconstruction quality still persist in the compression of large-scale point clouds. To address these challenges, we propose a hierarchical distortion learning framework for end-to-end lossy compression of point clouds. First, we design a feature residual compression module to efficiently transmit shallow semantics between the encoder and the decoder, which enables a lightweight design of our framework. Second, we introduce a geometry residual compression module to progressively complement the reconstruction distortion, avoiding the accumulation of geometric distortion. By integrating these two modules and employing sufficient downsampling processes, we develop a high-performance framework with a significantly enlarged receptive field and low computational cost. Extensive experiments demonstrate that our method achieves state-ofthe- art performance in geometry lossy compression, while delivering competitive performance in joint geometry and color lossy compression with fast running speed. Code is available athttps://github.com/pengpeng-yu/FastPCC.

Multiview clustering (MVC) can achieve more accurate results by utilizing complementary information from multiple perspectives, compared to traditional single-view methods. However, current multiview techniques require all views to be available upfront, making them inadequate for dealing with prevalent data sources that arrive as streams, such as stem cell analysis and multicamera surveillance. To address this problem, in this article, we propose a method called lifelong stream-view clustering (LSVC), which comprises an embedding anchor knowledge library and three key components, enabling the capability to perform asynchronous clustering on stream views. These three components are specifically: 1) the knowledge extraction module that extracts the abstract knowledge of the newcome view over time and updates the shared knowledge library; 2) the knowledge transfer module that aligns the newcome view with the historical knowledge library, enabling the transfer of structure information to the knowledge library; and 3) the knowledge rule module that constraints the knowledge library to enjoy a fair amount of anchors for each cluster, improving the discrimination of knowledge. The experimental results show that LSVC outperforms traditional single-view clustering (SVC) and MVC methods as it gradually improves with the accumulation of stream views and tends to be stable over time.

Although multi-view clustering (MVC) has achieved remarkable performance by integrating the complementary information of views, it is inefficient when facing scalable data. Proverbially, anchor strategy can mitigate such a challenge a certain extent. However, the unsupervised dynamic strategy usually cannot obtain the optimal anchors for MVC. The main reasons are that it does not consider the fairness of different views and lacks the priori supervised guidance. To completely solve these problems, we first propose the priori anchor graph regularization (PAGG) for scalable multi-view bipartite graph clustering, dubbed as SMGC method. Specifically, SMGC learns a few representative consensus anchors to simulate the numerous view data well, and constructs a bipartite graph to bridge the affinities between the anchors and original data points. In order to largely improve the quality of anchors, PAGG predefines prior anchor labels to constrain the anchors with discriminative cluster structure and fair view allocation, such that a better bipartite graph can be obtained for fast clustering. Experimentally, abundant of experiments are accomplished on six scalable benchmark datasets, and the experimental results fully demonstrate the effectiveness and efficiency of our SMGC.

Graph-based clustering has become an active topic due to the efficiency in characterizing the relationships between the samples via graph. To improve the quality of graph, recent works propose to utilize global and local information. However, existing methods may lead to a degenerated graph when facing noisy and uneven distributed data. Since 1) they preserve the local information by referring the similarity between each sample-pair, whose confidence is easily disturbed by the poor quality samples; and 2) although the global information is relatively robust to the noisy, existing methods have island effect that lies between local and global structures learning, such that the information of both can not be utilized mutually. To alleviate these issues, this paper presents explicit local coupling global structure clustering (ELGSC) to explicitly learn the local structure and global structure information via a coupling scheme. To be specific, we learn$l(\ll n)$pseudo samples as the anchors to reflect local hot spots distribution, where$n$is the number of samples. By referring the relationship between each anchor-sample pair, ELGSC is capable of obtaining an effective local bipartite graph to capture the local structure. Meanwhile, the self-expressiveness learning is adopted to pursue a lower-rank global affinity graph. Finally, a higher-order coupling learning framework is proposed to couple the learning of global affinity graph and local bipartite graph. Thus, local and global structure information could be propagated each other on both graphs. The experimental results on real datasets demonstrate the efficacy of the proposed method over state-of-the-arts.