Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
A Data-Driven Method For Online Monitoring Tube Wall Thinning Process In Dynamic Noisy Environment, Chen Zhang, Jun Long Lim, Ouyang Liu, Aayush Madan, Yongwei Zhu, Shili Xiang, Kai Wu, Rebecca Yen-Ni Wong, Jiliang Eugene Phua, Karan M. Sabnani, Keng Boon Siah, Wenyu Jiang, Yixin Wang, Emily Jianzhong Hao, Hoi, Steven C. H.
A Data-Driven Method For Online Monitoring Tube Wall Thinning Process In Dynamic Noisy Environment, Chen Zhang, Jun Long Lim, Ouyang Liu, Aayush Madan, Yongwei Zhu, Shili Xiang, Kai Wu, Rebecca Yen-Ni Wong, Jiliang Eugene Phua, Karan M. Sabnani, Keng Boon Siah, Wenyu Jiang, Yixin Wang, Emily Jianzhong Hao, Hoi, Steven C. H.
Research Collection School Of Computing and Information Systems
Tube internal erosion, which corresponds to its wall thinning process, is one of the major safety concerns for tubes. Many sensing technologies have been developed to detect a tube wall thinning process. Among them, fiber Bragg grating (FBG) sensors are the most popular ones due to their precise measurement properties. Most of the current works focus on how to design different types of FBG sensors according to certain physical laws and only test their sensors in controlled laboratory conditions. However, in practice, an industrial system usually suffers from harsh and dynamic environmental conditions, and FBG signals are affected by many …
Low-Rank Sparse Subspace For Spectral Clustering, Xiaofeng Zhu, Shichao Zhang, Yonggang Li, Jilian Zhang, Lifeng Yang, Yue Fang
Low-Rank Sparse Subspace For Spectral Clustering, Xiaofeng Zhu, Shichao Zhang, Yonggang Li, Jilian Zhang, Lifeng Yang, Yue Fang
Research Collection School Of Computing and Information Systems
The current two-step clustering methods separately learn the similarity matrix and conduct k means clustering. Moreover, the similarity matrix is learnt from the original data, which usually contain noise. As a consequence, these clustering methods cannot achieve good clustering results. To address these issues, this paper proposes a new graph clustering methods (namely Low-rank Sparse Subspace clustering (LSS)) to simultaneously learn the similarity matrix and conduct the clustering from the low-dimensional feature space of the original data. Specifically, the proposed LSS integrates the learning of similarity matrix of the original feature space, the learning of similarity matrix of the low-dimensional …