Xin Zeng, Shizhe Hu, Qiang Guo, Yunpeng Wu, Yangdong Ye
{"title":"Crowd Counting Using Scale Enhanced Network with Dual Attention Booster","authors":"Xin Zeng, Shizhe Hu, Qiang Guo, Yunpeng Wu, Yangdong Ye","doi":"10.1145/3579654.3579655","DOIUrl":"https://doi.org/10.1145/3579654.3579655","url":null,"abstract":"Crowd counting has been a fundamental yet challenging problem in pattern recognition. Most recent deep models for crowd counting rely on Convolutional Neural Networks (CNNs). Although CNN visual features comprise the spatial and channel features, existing deep models on crowd counting have limited descriptive ability as they only focus on the spatial or channel information. In this paper, we propose Scale Enhanced Network with Dual Attention Booster named as SEN-DAB, a novel method to jointly learn the representations of spatial and channel information for crowd counting. Moreover, to further leverage the multi-scale information, a pyramid residual scale enhanced block is presented to process the multi-scale features. As a result, the learned spatial, channel and multi-scale features can be robust to appearance changes of the crowd. Our model is tested on three benchmarks and the experimental results confirm that the promising performance of SEN-DAB when compared with various networks.","PeriodicalId":146783,"journal":{"name":"Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121325027","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 Ship target recognition based on attention mechanism","authors":"Teng Dong","doi":"10.1145/3579654.3579683","DOIUrl":"https://doi.org/10.1145/3579654.3579683","url":null,"abstract":"Abstract: Marine ship target recognition can effectively identify the categories of sailing ships and realize effective management of ships. It is strategically important for both civil and military domains, but it is highly demanding in terms of accuracy. In this paper, a novel neural network ByCTE(Bayesian Classification Transformer-Encoder) is proposed to realize ship target recognition by using track information. First, the raw data is preprocessed to make the processed data more favorable for model learning. Secondly, four BayesianLinear Encoder(BLE) modules are used to learn the complex relationship between different spatial positions of the sequence, so as to capture the long-term dependence relationship between the input sequences, and further extract the deep features of the sequence. Finally, complete the recognition by attention layer and softmax function. We select the best performing model in the training and use open dataset Automatic Identification System (AIS) data from Europe for training and validating the validity of the proposed model. ByCTE can achieve better accuracy by comparison with other methods.","PeriodicalId":146783,"journal":{"name":"Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence","volume":"1074 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116022595","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":"Cherry Size and Shape Classification Detection Based On Deep Convolutional Neural Network","authors":"Zhi Chai, Yue-Kun Pei, J. Liu, Pei-Pei Cao","doi":"10.1145/3579654.3579756","DOIUrl":"https://doi.org/10.1145/3579654.3579756","url":null,"abstract":"In order to enhance the post-production value of cherries, to improve the efficiency of cherry sorting, and to standardize and commercialize the industry, cherry grading detection becomes extreamly important. In this paper, we proposed a deep learning-based key point detection algorithm to identify the size and shape of cherries, key point features were extracted based on the fruit body through a feature extraction network, and a heat map regression method was used to construct a model to obtain the key point coordinates of the cherry fruit body, and the purpose of grading detection was achieved. The test results show that the accuracy of cherry size detection is 95.18%, and the accuracy of deformity detection is 94.50%. The network detection method proposed in this paper can effectively detect the size and deformity of cherries with high accuracy, and the average speed of detection is about 59 pieces/s, which meets the demand of real-time.","PeriodicalId":146783,"journal":{"name":"Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122888967","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":"A Multi-Armed Bandit Recommender Algorithm Based on Conversation and KNN","authors":"Hao-dong Xia, Zhifeng Lu, Wenxing Hong","doi":"10.1145/3579654.3579714","DOIUrl":"https://doi.org/10.1145/3579654.3579714","url":null,"abstract":"With the wide application of recommendation systems in various fields, in order to effectively solve the cold-start problem in recommendation systems, contextual bandit algorithm uses user feedback to update user preferences online, converting the cold-start problem of recommendation systems into an exploration and exploitation problem. However, traditional contextual bandit algorithm is slow to learn due to the extensive exploration required. With the development of conversational recommendation, conversational contextual bandit algorithm learns the user's preference for key-term through conversation thus accelerating the learning speed. However, it only considers user feedback on key-term and ignores the relevance of key-term to each other. To solve the problem, a multi-armed bandit based on conversation and KNN (K-Nearest Neighbors) algorithm is proposed by introducing a more refined collaboration (KNNConUCB). Experiments on Synthetic data, as well as real datasets from Movielens and Last.FM, demonstrate the efficacy of the KNNConUCB algorithm.","PeriodicalId":146783,"journal":{"name":"Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126113799","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}
Hengxu Zhang, Pengpeng Liang, Zhiyong Sun, Bo Song, Erkang Cheng
{"title":"An Efficient Transformer-based Approach for Joint Nuclei Detection and Segmentation in Whole Slide Tissue Images","authors":"Hengxu Zhang, Pengpeng Liang, Zhiyong Sun, Bo Song, Erkang Cheng","doi":"10.1145/3579654.3579727","DOIUrl":"https://doi.org/10.1145/3579654.3579727","url":null,"abstract":"The detection and segmentation of cell nuclei in whole slide tissue images plays an important role in disease diagnosis and treatment. Automatic detection and segmentation of nuclei is very challenging due to high nuclei density, low contrast, overlapping and adhesion between cells. Recently, Transformer-based object detection and instance segmentation methods have made great progress on traditional computer vision datasets. These Transformer-based approaches are effective by removing the need for many hand-crafted components in the network, and post-processing steps like non-maximum suppression (NMS). However, such approaches consume tremendous amount of memory in detection and segmentation of cell nuclei in whole slide tissue images due to large number of cells in the images. Also, those methods may suffer from inferior performance on small cell instances. Inspired by Deformable DETR which makes use of small set of key sampling points in the attention module to reduce the computation and the usage of multi-scale feature maps, we propose an efficient Transformer-based approach for joint nuclei detection and segmentation in whole slide tissue images. Specifically, In Transformer decoder, it directly outputs the object detection results and instance segmentation masks. We evaluate our proposed method on the public MoNuSeg dataset, and the experimental results show that our method achieves promising performance on nuclei detection and segmentation.","PeriodicalId":146783,"journal":{"name":"Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127424152","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":"A Novel Prediction Method for Metal-Ion Binding Sites in Protein Sequence Based on Ensemble Learning","authors":"Chuyi Song, Jing-qing Jiang","doi":"10.1145/3579654.3579694","DOIUrl":"https://doi.org/10.1145/3579654.3579694","url":null,"abstract":"The identification of metal ion-binding sites is important for detecting the protein structures and understanding its biological functions. However, in Protein Data Bank (PDB) which collects the known crystal structures of proteins, only less than one percent are membrane proteins even though they play a significant role in material exchange for cells and have a close relationship in drug target design. In this work, we develop an efficient prediction method for six different types of metal ion-binding sites in membrane proteins. In order to solve the imbalance problem in the dataset, multiple random down-sampling technique is used to obtain multiple training subsets with equal number of binding residues and non-binding residues. The support vector machines (SVM) and random forest (RF) classification models are built based on these subsets and their results are combined by ensemble learning algorithm which efficiently reduce the number of false positive samples in the final prediction. On an independent testing set, our proposed method achieves the average accuracy of 0.991 and average MCC of 0.681 which outperform a recently proposed prediction method, . The superiority in performance has demonstrated that our proposed method is expected to be an accurate tool for prediction of metal ion-binding sites in membrane proteins and it should provide assistant in design of new drug targets.","PeriodicalId":146783,"journal":{"name":"Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121689969","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":"Prediction of Protein-ATP Binding Sites Based on Word Vector Convolution Model","authors":"Zerui Song, Chuyi Song, Jiazhi Song, Jing-qing Jiang","doi":"10.1145/3579654.3579660","DOIUrl":"https://doi.org/10.1145/3579654.3579660","url":null,"abstract":"Recent studies have shown that the interaction between protein and ATP is closely related to human diseases, and the ATP-binding sites in protein sequences have become the focus of drug design. In order to improve the prediction accuracy of Protein-ATP binding sites, in this paper, we propose a prediction method based on word vector convolution neural network. Firstly, we extract five types of features from protein sequences including the position specific scoring matrix, protein secondary structure, solvent accessible surface area, sequence characteristics and residue physicochemical property. Then, the RepeatedEditedNearestNeighbours method is used to clean the data, and the sample imbalance problem is solved by random under-sampling. The under-sampled data is encoded by word vectors. Finally, the improved deep convolution neural network model is trained and compared with the related prediction methods. The experimental results show that our proposed prediction method can predict the Protein-ATP binding sites more precisely.","PeriodicalId":146783,"journal":{"name":"Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130700033","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":"θ is all you need: Revisiting SVD in caputuring changes in matrices","authors":"Yanwen Zhang, Jichang Zhao","doi":"10.1145/3579654.3579773","DOIUrl":"https://doi.org/10.1145/3579654.3579773","url":null,"abstract":"Given a series of matrices (e.g., frames in video) vary over time, figuring out the spatially changing regions (e.g., moving objects) is a critical issue both in theory and applications. In this article, we propose a change detection scheme based on E-SVD, a theory uses Givens transformation, that only determined by the rotation angle θ, to reduce the number of parameters representing a matrix after singular value decomposition (SVD) compression. Inspired by the close relationship between SVD and principal component analysis (PCA), we firstly provide the analytical dependence between θ and matrix elements when changes happen, which guarantees the theoretical rationality of our selection of target θ to efficiently capture these changes. Secondly, we present our detection scheme which is implemented to accurately locate the changing regions of a matrix spatially. The proposed methodology is verified using both simulation and empirical data, results of which show its efficiency and effectiveness. In order to clarify the realistic application of this scheme in object detection without supervision, an additional experiment is also conducted using surveillance video to further demonstrate its potential. Our findings in both theory and application give a new perspective of figuring out spatial variation in a matrix, leading to a wider usage of matrix factorization methods in the domain of unsupervised object detection.","PeriodicalId":146783,"journal":{"name":"Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127060876","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":"High-Quality-High-Quantity Semantic Distillation for Incremental Object Detection","authors":"Mengxue Kang, Jinpeng Zhang, Xiashuang Wang, Xuhui Huang","doi":"10.1145/3579654.3579682","DOIUrl":"https://doi.org/10.1145/3579654.3579682","url":null,"abstract":"Model is required to learn from dynamic data stream under incremental object detection task. However, traditional object detection model fails to deal with this scenario. Fine-tuning on new task suffers from a fast performance decay of early learned tasks, which is known as catastrophic forgetting. A promising way to alleviate catastrophic forgetting is knowledge distillation, which includes feature distillation and response distillation. Previous feature distillation methods have not discuss knowledge selection and knowledge transfer at the same time. In this paper, we propose high-level semantic feature distillation and task re-balancing strategy that consider both high-quality knowledge selection and high-quantity knowledge transfer simultaneously. Extensive experiments are conducted on MS COCO benchmarks. The performance of our method exceeds previous SOTA methods under all experimental scenarios. Remarkably, our method reduces the mAP gap toward full-training to 2.58, which is much better than that of the previous SOTA method with a gap of 3.30.","PeriodicalId":146783,"journal":{"name":"Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence","volume":"267 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122146821","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":"Infrared Small Target Detection Based on the Difference Variance Weighted Enhanced Local Contrast Measure","authors":"Xiaofeng Lu, Jiaming Liu, Xiaofei Bai, Sixun Li","doi":"10.1145/3579731.3579813","DOIUrl":"https://doi.org/10.1145/3579731.3579813","url":null,"abstract":"Infrared Search and Tracking System (IRST) has been widely applied in many fields, but it is still challenging to detect small infrared targets in complex backgrounds. To address this problem, this paper proposes a detection framework known as Difference Variance Weighted Enhanced Local Contrast Measure (DVWELCM). First, an enhanced local contrast measure (ELCM) is used to enhance small targets and suppress complex background while improving signal clutter ratio (SCR). Second, a weighting function of the difference variance is adopted to further reduce the influence of the background and improve the robustness. Finally, by integrating enhanced local contrast measure (ELCM) and difference variance weighting (DVW), an adaptive threshold segmentation method is used to extract the real target. Extensive experiments have been performed on data sets in different scenarios. The results show that compared with the existing methods, the proposed method has better detection performance in complex backgrounds.","PeriodicalId":146783,"journal":{"name":"Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114210829","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}