{"title":"Preface ASSP 2021","authors":"","doi":"10.1109/assp54407.2021.00005","DOIUrl":"https://doi.org/10.1109/assp54407.2021.00005","url":null,"abstract":"","PeriodicalId":153782,"journal":{"name":"2021 2nd Asia Symposium on Signal Processing (ASSP)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130130939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Research on a Graph Reachability Algorithm Based on Block Optimization","authors":"Jiasi Hu, Bei Gong, Yuchu He","doi":"10.1109/ASSP54407.2021.00009","DOIUrl":"https://doi.org/10.1109/ASSP54407.2021.00009","url":null,"abstract":"The traditional Floyd Warshall algorithm can be used to compute the transitive closure of a graph with $O boldsymbol{(mathrm{n}^{wedge}3)}$ time complexity. In this paper, a new directed graph reachability calculation algorithm based on topological sorting and block optimization is proposed. The performance of the new algorithm is verified by simulation experiments under different conditions. The experimental results show that the new algorithm is more effective than the traditional algorithm when calculating the reachability of directed graphs with different sparsity.","PeriodicalId":153782,"journal":{"name":"2021 2nd Asia Symposium on Signal Processing (ASSP)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132346135","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Keynotes ASSP 2021","authors":"","doi":"10.1109/assp54407.2021.00007","DOIUrl":"https://doi.org/10.1109/assp54407.2021.00007","url":null,"abstract":"","PeriodicalId":153782,"journal":{"name":"2021 2nd Asia Symposium on Signal Processing (ASSP)","volume":"320 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124533355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Simulation of a Cylindrical Roller Bearing with an Embedded Piezoelectric Sensor for Local Fault Detection","authors":"Ali Safian, N. Wu, Xihui Liang","doi":"10.1109/ASSP54407.2021.00043","DOIUrl":"https://doi.org/10.1109/ASSP54407.2021.00043","url":null,"abstract":"Local fault detection in bearings through accelerometer has been one of the most fundamental condition monitoring techniques for three decades. Nevertheless, the sensitivity of accelerometers to surrounding noises from other components/machines and a long transmission path between the sensor and bearing has attracted more attention toward using embedded sensors and measurement of local strain rather than acceleration. These days, utilizing embedded smart materials, such as low-cost piezoelectric sensors, can benefit different industries to detect abnormal conditions in machines or structures. In some cases, these abnormalities show up in the form of sudden strain changes that is detectable by piezoelectric materials. Therefore, in this research, using embedded piezoelectric sensors in a bearing housing with a short transmission path is proposed to detect abnormalities due to a local fault. Through numerical simulation in ANSYS APDL, the dynamic of a cylindrical roller bearing in the healthy and defective conditions is investigated. According to the results, the existence of a local fault affects the radial strain changes and proportionally changes the generated voltage signal. These changes (fault symptoms) are investigated in the time and frequency domains for fault detection.","PeriodicalId":153782,"journal":{"name":"2021 2nd Asia Symposium on Signal Processing (ASSP)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128786743","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hao Wang, Yunkun Bai, Jie Liu, Guangmin Sun, Yanjun Zhang, Jie Li
{"title":"Application of Color Block Code in Image Scaling","authors":"Hao Wang, Yunkun Bai, Jie Liu, Guangmin Sun, Yanjun Zhang, Jie Li","doi":"10.1109/ASSP54407.2021.00012","DOIUrl":"https://doi.org/10.1109/ASSP54407.2021.00012","url":null,"abstract":"Aiming at the high cost of embedding annotation watermark in a narrow small area and the information distortion caused by the change of annotation watermark image resolution, this paper proposes a color block code technology, which uses location information and color code to form recognizable graphics, which can not only simplify the annotation graphics, but also ensure the recognition efficiency. First, the constituent elements of color block code are designed, and then the coding and decoding method of color block code is proposed. Experiments show that color block code has high anti-scaling and anti-interference, and can be widely used in the labeling of small object surface and low resolution image.","PeriodicalId":153782,"journal":{"name":"2021 2nd Asia Symposium on Signal Processing (ASSP)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117231353","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the Performance of Generalized SCL- Flip decoding for Polar Codes","authors":"Yansong Lv, Hang Yin, Zhanxin Yang, Yuhuan Wang, Jingxin Dai, Jing Huan","doi":"10.1109/ASSP54407.2021.00030","DOIUrl":"https://doi.org/10.1109/ASSP54407.2021.00030","url":null,"abstract":"Generalized successive cancellation list flip (SCL-Flip) decoder can reduce the number of re-decoding attempts of the conventional SCL- Flip decoder without error-correction per-formance degradation, by introducing a new threshold considering the pruned path in list decoding. However, the compensation coefficient in the new threshold is not discussed, while a suitable compensation coefficient is important for the error-correction performance improvement. Therefore, a comprehensive study considering the effect of the compensation coefficient on the performance is currently lacking in literature. In this work, we evaluate the impact of the compensation coefficient in terms of error-correction performance and computational complexity of the generalized SCL-Flip decoder. Our work shows that a slight increase in the compensation coefficient could improve the per-formance of generalized SCL-Flip decoder, but the performance gain is limited.","PeriodicalId":153782,"journal":{"name":"2021 2nd Asia Symposium on Signal Processing (ASSP)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128176517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sami Ullah, G. Abbas, M. Waqas, Ziul Haq Abbas, Shanshan Tu
{"title":"Position-based Vehicular Clustering for Emergency Messages Dissemination in Zone of Interest","authors":"Sami Ullah, G. Abbas, M. Waqas, Ziul Haq Abbas, Shanshan Tu","doi":"10.1109/ASSP54407.2021.00018","DOIUrl":"https://doi.org/10.1109/ASSP54407.2021.00018","url":null,"abstract":"Disseminating Emergency Messages (EMs) to a maximum number of vehicles with low latency in Vehicular Ad Hoc Networks (VANETs) can help reduce road accidents. Nevertheless, timely delivery of EMs to a maximum number of vehicles while suppressing redundant transmissions to avoid broadcast storms is challenging. Traditional cluster-based EM dissemination schemes treat all EMs equally and disseminate them across the entire road, increasing rebroadcast ratio and message collisions. Since not all EMs need to cover the entire road, it is essential to broadcast EMs based on their Zone of Interest (ZoI). Therefore, we propose a cluster-based scheme for EM Dissemination in ZoI (EMD-ZoI). The scheme uses information contained in EMs to determine ZoI. We also introduce a relay vehicle based on link lifetime to reduce retransmissions and latency. Simulation results show that EMD-ZoI provides a good performance gain in terms of coverage information, latency and rebroadcast ratio.","PeriodicalId":153782,"journal":{"name":"2021 2nd Asia Symposium on Signal Processing (ASSP)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126440695","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Construction of Trusted Group in Distributed Internet of Things","authors":"Rui Xin, Liang Chen, Ning Lu, Xin Liu, Wei Liu, Guiping Zheng","doi":"10.1109/ASSP54407.2021.00035","DOIUrl":"https://doi.org/10.1109/ASSP54407.2021.00035","url":null,"abstract":"How to build trusted group is a key problem to be solved in the IOT environment. In this paper, a trusted measurement scheme suitable for distributed networking is proposed. Its measurement methods mainly include environmental trusted measurement, direct trusted measurement, indirect trusted measurement, and the final comprehensive trusted measurement. In the node trusted measurement, the indirect trusted measurement of multiple nodes in the group is added, and the trust evaluation value of each node in the group is comprehensively considered. During the trusted individual joining, build a trusted group with similar group characteristics. In the security environment maintenance, a relatively optimal relay node selection mechanism is given to avoid the load imbalance. At the same time, the nodes in the trusted group exclude malicious nodes according to the voting method to maintain the safe and reliable operation of the network. Simulation results show the credibility measurement results in this mechanism can well reflect the real state of the perceived nodes of the IOT, and can timely identify and eliminate malicious nodes, it also has a good performance in group energy consumption.","PeriodicalId":153782,"journal":{"name":"2021 2nd Asia Symposium on Signal Processing (ASSP)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125524747","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Integrating Residual Network and Channel Attention Mechanism for Tire Pattern Image Retrieval","authors":"Qiqi Liu, Y. Liu, Fuping Wang, Da-xiang Li","doi":"10.1109/ASSP54407.2021.00015","DOIUrl":"https://doi.org/10.1109/ASSP54407.2021.00015","url":null,"abstract":"Tire pattern image retrieval is important in obtaining useful clues for criminal case solving and traffic accident control. For complex deep learning models, the increase of the number of hidden layers can improve the model performance to a certain extent, but complex network architecture may cause the difficulty in network training, resulting in low retrieval efficiency. The use of residual blocks in residual networks can relieve this problem. To further improve the accuracy of tire pattern image retrieval, this paper combines a modified residual network with attention mechanism and proposes a novel tire pattern image retrieval model. A modified residual network is used for feature extraction, and a channel attention mechanism is added in the four convolution blocks (conv2-conv5) for feature selection. This method not only reduces the training parameters and make the model simpler, but also facilitates the extraction of more accurate tire pattern image features. Simulation results demonstrate the effectiveness of the proposed algorithm.","PeriodicalId":153782,"journal":{"name":"2021 2nd Asia Symposium on Signal Processing (ASSP)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116589591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Chen Liandong, Liu Wei, Lu Ning, Wei Yong, Chen Kai, Zheng Guiping
{"title":"The Construction and Dynamic Maintenance Mechanism of Trusted Groups in Edge Computing","authors":"Chen Liandong, Liu Wei, Lu Ning, Wei Yong, Chen Kai, Zheng Guiping","doi":"10.1109/ASSP54407.2021.00031","DOIUrl":"https://doi.org/10.1109/ASSP54407.2021.00031","url":null,"abstract":"Aiming at the problem of lack of an edge computing-oriented Internet of Things (IoT) node group management mechanism. Based on the trusted model of multi-dimensional attributes, this paper designs a trusted group construction mechanism considering the commonalities and differences of node trusted characteristics. Further resist the attack behavior of malicious nodes and ensure the trusted operation of edge computing. In addition, the malicious feedback behavior of nodes and the impact of system dynamic changes. A dynamic maintenance mechanism (DMM) is proposed for the trusted group, and the reward mechanism is used to encourage collaboration between nodes to further maintain the validity and reliability of the trusted group.","PeriodicalId":153782,"journal":{"name":"2021 2nd Asia Symposium on Signal Processing (ASSP)","volume":"12 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132953273","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}