Yi Zhang

Dr. Yi Zhang

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 January 2021 in ACM Transactions on Multimedia Computing, Communications, and Applications
Verified
Journal Article
Open access
YZYi Zhang
Yi Zhang
MLMiaomiao Li
Miaomiao Li
SWSiwei Wang
Siwei Wang
SDSisi Dai
Sisi Dai
LLLei Luo
Lei Luo
HZHaoran Zhou
Haoran Zhou
Gaussian mixture model (GMM) clustering has been extensively studied due to its effectiveness and efficiency. Though demonstrating promising performance in various applications, it cannot effectively address the absent features among data, which is not uncommon in practical applications. In this article, different from existing approaches that first impute the absence and then perform GMM clustering tasks on the imputed data, we propose to integrate the imputation and GMM clustering into a unified learning procedure. Specifically, the missing data is filled by the result of GMM clustering, and the imputed data is then taken for GMM clustering. These two steps alternatively negotiate with each other to achieve optimum. By this way, the imputed data can best serve for GMM clustering. A two-step alternative algorithm with proved convergence is carefully designed to solve the resultant optimization problem. Extensive experiments have been conducted on eight UCI benchmark datasets, and the results have validated the effectiveness of the proposed algorithm.

24 March 2024 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
SLSuyuan Liu
Suyuan Liu
JZJunpu Zhang
Junpu Zhang
YWYi Wen
Yi Wen
XYXihong Yang
Xihong Yang
SWSiwei Wang
Siwei Wang
XLXinwang Liu
Xinwang Liu
Incomplete multi-view clustering has attracted much attention due to its ability to handle partial multi-view data. Recently, similarity-based methods have been developed to explore the complete relationship among incomplete multi-view data. Although widely applied to partial scenarios, most of the existing approaches are still faced with two limitations. Firstly, fusing similarities constructed individually on each view fails to yield a complete unified similarity. Moreover, incomplete similarity generation may lead to anomalous similarity values with column sum constraints, affecting the final clustering results. To solve the above challenging issues, we propose a Sample-level Cross-view Similarity Learning (SCSL) method for Incomplete Multi-view Clustering. Specifically, we project all samples to the same dimension and simultaneously construct a complete similarity matrix across views based on the inter-view sample relationship and the intra-view sample relationship. In addition, a simultaneously learning consensus representation ensures the validity of the projection, which further enhances the quality of the similarity matrix through the graph Laplacian regularization. Experimental results on six benchmark datasets demonstrate the ability of SCSL in processing incomplete multi-view clustering tasks. Our code is publicly available at https://github.com/Tracesource/SCSL.

1 July 2023 in Information Fusion
Verified
Journal Article
Closed access
MLMiaomiao Li
Miaomiao Li
YZYi Zhang
Yi Zhang
SLSuyuan Liu
Suyuan Liu
ZLZhe Liu
Zhe Liu
XZXinzhong Zhu
Xinzhong Zhu

26 May 2025 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
XLXinwang Liu
Xinwang Liu
YZYi Zhang
Yi Zhang
LLLi Liu
Li Liu
CTChang Tang
Chang Tang
LPLimin Peng
Limin Peng
DHDewen Hu
Dewen Hu
Simple multiple kernel k-means (SMKKM) introduces a new minimization-maximization learning paradigm for multi-view clustering and makes remarkable achievements in some applications. As one of its variants, localized SMKKM (LSMKKM) is recently proposed to capture the variation among samples, focusing on reliable pairwise samples, which should keep together and cut off unreliable, farther pairwise ones. Though demonstrating effectiveness, we observe that LSMKKM indiscriminately utilizes the variation of each sample, resulting in unsatisfying clustering performance. To overcome this limitation, we propose a sample adaptive localized SMKKM (SAL-SMKKM) algorithm where the weight of the local alignment for each sample can be adaptively adjusted, resulting in a more challenging tri-level minimization-minimization-maximization. To deal with it, we reformulate it into a minimization problem of an optimal function characterized by minimization-maximization dynamics, prove its differentiability, and develop a reduced gradient descent method to optimize it. We then theoretically analyze the clustering performance of the proposed SAL-SMKKM by deriving its generalization error bound. In addition, we empirically evaluate the clustering performance of the proposed SAL-SMKKM on several benchmark datasets. Experiment results clearly indicate that proposed algorithms consistently outperform state-of-the-art ones. Finally, we apply the proposed SAL-SMKKM to the multi-modal parcellation of the human cerebral cortex, which is essential and helpful to understanding brain organization and function. As seen, SAL-SMKKM achieves accurate parcellation in an automatic and objective manner without any manual intervention, which once again demonstrates its validity and effectiveness in practical applications.

1 November 2021
Verified
Conference Paper
Closed access
ZFZuojun Fu
Zuojun Fu
YHYi Hou
Yi Hou
CLCangjian Liu
Cangjian Liu
YZYi Zhang
Yi Zhang
SZShilin Zhou
Shilin Zhou
In recent years, autonomous driving solutions that rely on the fusion of multiple sensors such as lidar, inertial navigation systems, and GPS positioning systems have attracted the attention of the industry and academia. Such solutions use multiple sets of sensing systems to work together to ensure the greatest probability of the accuracy and completeness of the results. These solutions are able to tackle problems that are difficult to solve with a single sensor in the short term. However, in the long run, the design of deep coupling between data and strategy is not conducive to the real improvement of the perception system. Therefore, this paper proposes a light-weight autonomous vehicle system based on pure vision named VOLWA. To cope with the huge challenge of using the camera as the only sensor, VOLWA contains three new algorithms:(i) view segmentation algorithm is proposed to improve the perception accuracy (ii) visual place recognition algorithm for removing dynamic targets based on channel selection is proposed to solve the interference problem of dynamic targets such as pedestrians and vehicles in the field of view (iii) threshold self-localization based on image features is proposed for high-precision positioning of autonomous vehicles. Experimental results show that visual place recognition algorithm for removing dynamic targets based on channel selection effectively improves the performance of place recognition. The system architecture and algorithm proposed in this paper have been transplanted to self-developed autonomous vehicles for verification, and the autonomous vehicles are running well. See the link for the demo video https://youtu.be/6WfUnor205M.

9 November 2026
Verified
Conference Paper
Open access
JZJianzhong Zhang
Jianzhong Zhang
YZYi Zhang
Yi Zhang
WLWeixuan Liang
Weixuan Liang
EZEn Zhu
En Zhu
XLXinwang Liu
Xinwang Liu
KHKunlun He
Kunlun He