Special issue

  • Display Type:
  • Text List
  • Abstract List
  • 1  Burmese OCR Method Based on Knowledge Distillation
    MAO Cunli XIE Xuyang YU Zhengtao GAO Shengxiang WANG Zhenhan LIU Fuhao
    2022, 37(1):173-182. DOI: 10.16337/j.1004-9037.2022.01.015
    [Abstract](790) [HTML](2002) [PDF 1.40 M](1996)
    Abstract:
    Different from traditional image text recognition tasks, the Burmese optical character recognition (OCR) requires computers to recognize complex characters nested and combined by multiple characters in a receptive field, which brings great challenges to Burmese OCR tasks. To solve this problem, a Burmese OCR method based on knowledge distillation is proposed. This paper constructs a model of teacher network and student network using the framework of convolutional neural networks (CNN)+ recurrent neural networks (RNN) to train in an integrated learning way. In the training process, the teacher integrated sub-network is coupled with the student network to realize the alignment of the local character image features corresponding to a single receptive field in the student network and the overall character image features in the teacher network, so as to enhance the acquisition of local features in long sequence character images. The experimental results show that the performance of our model is better than the baseline by 2.9% and 2.7% respectively without and with background noise images as training data sets.
    2  Layer Chains Decision of Trauma Treatment Based on Multi-label Learning
    ZHAO Pengfei LIU Hua
    2022, 37(2):446-455. DOI: 10.16337/j.1004-9037.2022.02.017
    [Abstract](887) [HTML](497) [PDF 725.83 K](1652)
    Abstract:
    In modern trauma treatment, reasonable and accurate pre-hospital assessment based on the injury and making corresponding treatment decisions are of great significance for reducing the disability and mortality of patients. To improve the shortcomings of manual decision-making and achieve accurate and reasonable standardized trauma treatment decision-making, after in-depth analysis and research on the treatment decision, this study uses the multi-label learning method to divide the overall treatment decision into sub-decisions, and extracts judgment factors corresponding to the sub-decisions as a label sets. Next, to better consider the relationship between labels, this paper combines the chain idea of the Classifier Chains algorithm with the ML-KNN algorithm, and proposes a multi-label learning algorithm by improving the ML-KNN algorithm, named layer chains multi-label K-nearest neighbor (LCML-KNN). The LCML-KNN algorithm divides labels into two layer chains according to the characteristics. After the prediction label information of the first layer chain is output, it is uniquely encoded. And the transformed lables are put into the second layer chain as new features for prediction and judgement. The LCML-KNN algorithm not only better takes into account the relationship between the labels but also expands the feature dimension through the label conversion. The experimental results with various existing multi-label learning algorithms on two trauma datasets verify the robustness and superiority of the LCML-KNN algorithm.
    3  Local-Feature-Based Two-Dimensional Whitening Reconstruction
    Tian Jialue Zhu Yulian Chen Feiyue Liu Jiahui
    2022, 37(2):308-320. DOI: 10.16337/j.1004-9037.2022.02.005
    [Abstract](936) [HTML](1471) [PDF 3.45 M](2104)
    Abstract:
    Whitening is a preprocessing method that can remove the correlation between variables of data. Two-dimensional whitening reconstruction (TWR) is a new whitening method for a single image. In this paper, we will elaborate the equivalence between TWR and column-based ZCA whitening, that is, TWR can remove the correlation in image column. However, the correlation within the local block of the image is often much greater than that within the column. From the perspective of removing the correlation within the local block of the image, this paper proposes two improved TWR methods: reshaped-based TWR (RTWR) and patch-based TWR(PTWR). RTWR firstly reshapes an image to form a new matrix of which each column vector corresponds to the sub-block of the original image, and then performs the TWR on the reshaped matrix. In PTWR method, TWR is directly applied to each sub-block of the image. The experimental results on ORL, CMU PIE and AR face datasets show that RTWR and PTWR are more beneficial to improving the subsequent classification performance than TWR.
    4  Microblog Popularity Prediction Algorithm Based on XGBoost
    Ren Minjie Jin Guoqing Wang Xiaowen Chen Ruidong Yuan Yunxin Nie Weizhi Liu An’an
    2022, 37(2):383-395. DOI: 10.16337/j.1004-9037.2022.02.011
    [Abstract](1017) [HTML](1329) [PDF 1.60 M](2120)
    Abstract:
    With the advent of the all-media era and the development of social networks, the popularity prediction begins to play an important role in the monitoring of public opinion and the competition of data discourse power. The existing popularity prediction researches mostly focuse on foreign media, and it is an emerging and challenging direction to predict the popularity of domestic mainstream media such as microblog. In this paper, we conduct the research on microblog, a domestic social media platform, through the analysis of microblog’s content and users, and design a variety of popularity prediction schemes. Meanwhile, we propose a microblog popularity prediction algorithm based on XGBoost, which converts the popluarity prediction problem into an interactive value file classification problem, and use the extracted and fused features for model training under the categorical framework, which can predict the popularity of microblog with user information more accurately. The proposed algorithm is verified in the microblog popularity prediction dataset, whose accuracy rate can achieve as high as 85.69%.
    5  Survey on New Progresses of Deep Learning Based Computer Vision
    LU Hongtao LUO Mukun
    2022, 37(2):247-278. DOI: 10.16337/j.1004-9037.2022.02.001
    [Abstract](3777) [HTML](4404) [PDF 12.48 M](5273)
    Abstract:
    Deep learning has recently achieved great breakthroughs in some fields of computer vision. Various new deep learning methods and deep neural network models were proposed, and their performance was constantly updated. This paper makes a survey on the new progresses of applications of deep learning on computer vision since 2016 with emphases on some typical networks and models. We first investigate the mainstream deep neural network models for image classification including standard models and light-weight models. Then, we introduce some main methods and models for different computer vision fields including object detection, image segmentation and image super-resolution. Finally, we summarize deep neural network architecture searching methods.
    6  Language Identification Method for Multi-task Learning Based on Contrastive Predictive Coding Model
    ZHAO Jianchuan YANG Haoquan XU Yong WU Lian CUI Zhongwei
    2022, 37(2):288-297. DOI: 10.16337/j.1004-9037.2022.02.003
    [Abstract](845) [HTML](1692) [PDF 754.63 K](1830)
    Abstract:
    The key of language identification is to extract useful features from speech fragments. The time-delayed neural network (TDNN) can extract feature vectors, which contain rich context and improve system performance effectively. This paper proposes a multi-task learning method of ECAPA(Emphasized channel attention)-TDNN+contrastive predictive coding(CPC) network for language identification. ECAPA-TDNN is the main network to extract the global features of language. The improved CPC model is the auxiliary network, and the frame level features extracted by ECAPA-TDNN are compared and predicted. Finally, the joint loss function is used to optimize the network. The proposed method is tested on the 10 language data sets provided by the AP17-OLR data set.The result shows that the identification accuracy of the proposed network is higher than baseline on the 1 s, 3 s and All test data sets of AP17-OLR.
    7  Topic Opinion Leader Mining Based on Multi-relational Networks
    Duan Zhen Ni Yunpeng Chen Jie Zhang Yanping Zhao Shu
    2022, 37(3):576-585. DOI: 10.16337/j.1004-9037.2022.03.008
    [Abstract](758) [HTML](755) [PDF 1.41 M](4699)
    Abstract:
    Opinion leaders in social networks play an important role in the process of information dissemination. The traditional mining of opinion leaders is based on network structures and doesnot consider the role of a specific topic or event, and the current mining of opinion leaders based on topic is only based on a single network structure, without taking into account the multiple interactive relationships between nodes. This paper proposes a topic opinion leader mining method based on multi-relational networks (MRTRank), which joins topic factors and a variety of interactive relationship between nodes. Through an attribute network representation learning algorithm, the similarity of different nodes in the multi-relationship network is obtained, and the transition probability matrix of nodes is formed. Finally, the top-k opinion leaders are obtained through the PageRank algorithm. Experimental results on real Twitter datasets verify that the proposed method is superior to traditional opinion leader mining algorithms.
    8  Hot Topic Detection Method of Microblog Short Text Stream Based on Feature Extension
    LI Yanhong XIE Mengna WANG Suge LI Deyu
    2022, 37(3):621-632. DOI: 10.16337/j.1004-9037.2022.03.012
    [Abstract](918) [HTML](648) [PDF 1.00 M](5412)
    Abstract:
    With the rapid development of social networks and Internet, a large number of microblog short text stream data have been produced. Discovering hot topics from microblog text streams in time plays an important role in topic recommendation and public opinion monitoring. To solve the problem of sparse features of microblog, a feature extension-based hot topic detection (FE-HTD) method in microblog short text stream is proposed by using microblog comments to extend the features of microblog. To complete the feature extension of the microblog text, firstly, the comment text is selected by the influence of the comment users and the number of likes for comment text, and the feature words are extracted from the comment text by word co-occurrence and term frequency-inverse document frequency (TF-IDF) method. Then count the word pair speed, word pair acceleration and microblog text strength of the microblog short text stream. The burst feature is calculated by word pair acceleration and microblog text strength. Finally, the variable length window range of hot topic is determined according to the speed of the burst word pair, and the topic structure of hot topic in the window is obtained by clustering. In the experiment, the proposed algorithm is compared with the text-based topic detection (T-TD) method and the burst words-based topic detection (BW-TD) method. The results show that the accuracy of the proposed algorithm is 76.4%, and the recall rate is 78.7%,which are 10% higher than those of T-TD and BW-TD methods.
    9  Feature Selection Based on Rough Hypercuboid and Binary PSO
    WANG Sizhao LUO Chuan LI Tianrui CHEN Hongmei
    2022, 37(3):668-679. DOI: 10.16337/j.1004-9037.2022.03.016
    [Abstract](859) [HTML](528) [PDF 1.99 M](4980)
    Abstract:
    Feature selection is to choose a subset without containing redundant features, while keeping the classification performance of the data unchanged. Rough hypercuboid approaches can comprehensively evaluate the feature subsets from the three aspects of the relevance, dependency and significance of features, which have been used for feature selection successfully. However, calculating the combination of all feature subsets is NP-hard, and the results obtained by traditional forward search methods is locally optimal. Therefore, a new algorithm based on the rough hypercuboid approach is designed by integrating binary particle swarm optimization. The algorithm first introduces the feature relevance to generate a set of particles, then sets the improved objective function of the rough hypercuboid method as the optimization function, and finally finds the optimal feature subset by iterative optimization of binary particle swarm. By comparing with traditional rough hypercuboid methods and the rough set method based on particle swarm optimization, etc, experimental results demonstrate the proposed algorithm is able to acquire a feature subset with fewer features and higher classification performance.
    10  Review on Domain Adaptation Methods Based on Deep Learning
    Tian Qing Zhu Yanan Ma Chuang
    2022, 37(3):512-541. DOI: 10.16337/j.1004-9037.2022.03.004
    [Abstract](1846) [HTML](3582) [PDF 2.90 M](11288)
    Abstract:
    Domain adaptation mainly deals with similar task decision across different data distributions. As an emerging branch of machine learning, domain adaptation has received much attention. With the rise of deep learning in recent years, the deep domain adaptation paradigm, as a combination of deep learning and traditional domain adaptation, has attracted more and more research. Although a variety of deep domain adaptation methods have been proposed, few systematic reviews have been published. To this end, this paper definitely reviews and analyzes the existing deep domain adaptation work and summarizes them to provide reference for relevant researchers. In conclusion, the main contributions of this work include the following aspects. Firstly, the background, concepts and application fields of domain adaptation are summarized. Secondly, according to whether the model training involves adversarial mechanism, we group the existing deep domain adaptation methods into two categories, such as deep adversarial domain adaptation and deep non-adversarial domain adaptation, and review and analyze them, respectively. Then, the benchmark datasets commonly used in the domain adaptation research are tabulated with profiles. Finally, the issues suffered in the existing deep domain adaptation work are summarized and analyzed, and future research directions are given.
    11  Dynamic Visual SLAM Based on Unified Geometric-Semantic Constraints
    Shen Yehu Chen Jiahao Li Xing Jiang Quansheng Xie Ou Niu Xuemei Zhu Qixin
    2022, 37(3):597-608. DOI: 10.16337/j.1004-9037.2022.03.010
    [Abstract](1580) [HTML](1191) [PDF 1.53 M](8851)
    Abstract:
    Traditional visual simultaneous localization and mapping (SLAM) algorithms rely on the scene rigidity assumption. However, when dynamic objects exist in the scene, the stability of the SLAM system will be affected and the accuracy of pose estimation will be reduced. Currently, most of the existing methods apply probability strategies and geometric constraints to reduce the impact caused by a small number of dynamic objects. But when the number of dynamic objects in the scene is high, these methods will fail. In order to deal with this problem, a novel algorithm is proposed in this paper. It combines the dynamic visual SLAM algorithm with the multi-target tracking algorithm. Firstly, a semantic instance segmentation network together with geometric constraints is introduced to assist the visual SLAM module to effectively separate the static feature points from the dynamic ones, and at the same time, it can also achieve the better multi-target tracking performance. Furthermore, the trajectory and velocity information of the moving objects can also be estimated, which can provide decision information for autonomous robots navigation. The experimental results on KITTI dataset show that the localization accuracy of the proposed algorithm is improved by about 28% compared with ORB-SLAM2 algorithm in dynamic environments.
    12  Frequency Division Duplex Massive Multiple-input Multiple-output Downlink Channel State Information Acquisition Techniques Based on Deep Learning
    GUI Guan WANG Jie YANG Jie LIU Miao SUN Jinlong
    2022, 37(3):502-511. DOI: 10.16337/j.1004-9037.2022.03.003
    [Abstract](1547) [HTML](860) [PDF 1.82 M](9088)
    Abstract:
    The evolution of massive multiple-input multiple-output (MIMO) techniques is an important support for further improving the performance of six-generation (6G) wireless communication systems. However, with the continuous expansion of large-scale antenna arrays, frequency division duplex (FDD) massive MIMO systems are facing severe challenges in acquiring downlink channel state information (CSI). Deep learning has a powerful ability to learn and process high-dimensional data, which provides a potential solution to this challenge. In this paper, we survey FDD massive MIMO downlink CSI acquisition techniques based on deep learning, including CSI feedback and prediction techniques. Firstly, the theoretical frameworks of CSI feedback and prediction based on deep learning are presented. Then, the superior performance of relevant research results at home and abroad is analyzed, providing a reference scheme for solving the problem of acquiring downlink CSI in FDD massive MIMO systems towards 6G. Finally, unsolved open problems of FDD massive MIMO downlink CSI acquisition are discussed, followed by potential solutions correspondingly.
    13  Granular Computing-Driven Support Vector Data Description Approach to Classification
    Fang Yu Cao Xuemei Yang Mei Wang Xuan Min Fan
    2022, 37(3):633-642. DOI: 10.16337/j.1004-9037.2022.03.013
    [Abstract](1244) [HTML](538) [PDF 1.21 M](7741)
    Abstract:
    The effect of classification learning is closely related to the distribution of limited training samples. Support vector data description (SVDD), as a single boundary solution model, cannot well describe the actual distribution characteristics of the data, resulting in some target objects falling outside the hypersphere. To improve its classification ability, this paper proposes a granular computing-driven SVDD (GrC-SVDD) classification method to construct a multi-granularity levels attribute sets and the corresponding multi-granular hyperspheres. Firstly,the importance of the attribute within the current granularity level is calculated through the neighborhood self-information. Secondly, the best attribute set is then chosen to retrain the hyperspheres that did not achieve the purity criterion at the previous granularity level, and so on until all hyperspheres meet the conditions or the attributes are exhausted. The experimental section discusses the effect of parameters on classification performance and learns hyperparameters. The experimental results show that GrC-SVDD has better classification performance compared with SVDD and popular classification methods.
    14  Urban Facility Locating Method Based on Ranking Learning
    Han Wenjun Zhang Yaping Chen Hong Chen Dan Sun Wanting Zhao Bin
    2022, 37(3):609-620. DOI: 10.16337/j.1004-9037.2022.03.011
    [Abstract](671) [HTML](656) [PDF 4.02 M](6047)
    Abstract:
    A locating method based on learning to rank is proposed to solve the location of urban facilities and introduce the features of human mobility to improve the effectiveness. First, representation vector is extracted with two stream autoencoders, fusing the features of human mobility with others. Then the plots are sorted based on representation vector of the candidate sets and the ranking network. Extensive experiments based on real multi-source dataset verify the effectiveness of the proposed locating method.
    15  Few-Shot Learning Method Based on Topic Model and Dynamic Routing Algorithm
    ZHANG Shufang TANG Huanling ZHENG Han LIU Xiaoyan DOU Quansheng LU Mingyu
    2022, 37(3):586-596. DOI: 10.16337/j.1004-9037.2022.03.009
    [Abstract](1303) [HTML](799) [PDF 1.89 M](8443)
    Abstract:
    Aiming at the problem that the training samples for few-shot learning are too few, which leads to the weak expression of features, a novel dynamic routing prototypical network based on SLDA(DRP-SLDA) is proposed based on the supervised topic model(Supervised LDA, SLDA) and dynamic routing algorithm. The SLDA topic model is used to establish the semantic mapping between words and categories, enhance the category distribution characteristics of words, and obtain the semantic representation of samples from the perspective of word granularity. The dynamic routing prototypical network(DR-Proto) is presented. The network makes full use of the semantic relationship between samples by extracting cross features, and uses the dynamic routing algorithm to iteratively generate dynamic prototype with category representation, so as to solve the problem of feature expression. The experimental results show that the DRP-SLDA model can effectively extract the category distribution characteristics of words and dynamically obtain the dynamic prototype to increase the category identification, which can obviously improve the generalization ability of few-shot text classification.
    16  Multi-scale Domain Adversarial Network for Transfer Learning
    LIN Jiawei WANG Shitong
    2022, 37(3):555-565. DOI: 10.16337/j.1004-9037.2022.03.006
    [Abstract](889) [HTML](1323) [PDF 757.29 K](5535)
    Abstract:
    The effectiveness of deep learning algorithms depends on a large amount of labeled data. The purpose of transfer learning is to use a dataset with known labels (source domain) to classify a dataset with unknown labels (target domain), so the research of deep transfer learning has become a hotspot. For the problem of insufficient training data labels, a model of multi-scale domain adversarial network(MSDAN) based on multi-scale feature fusion is proposed. This method uses the idea of generating adversarial networks and multi-scale feature fusion to obtain the feature representation of the domain data and the target domain data in a high-dimensional feature space. The feature representation extracts common geometric features and common semantic features of the source domain data and the target domain data. The feature representation of the source domain data and the source domain label are input into the classifier for classification, and finally more advanced effect is obtained in the test of the target domain dataset.
    17  Data Science : From Digital World to Digital Intelligent World
    ZHANG Qinghua GAO Yu SHEN Qiuping
    2022, 37(3):471-487. DOI: 10.16337/j.1004-9037.2022.03.001
    [Abstract](1700) [HTML](1150) [PDF 1.63 M](10211)
    Abstract:
    With the development of big data, data has become a major strategic resource for countries and its social impact is increasingly obvious. Thus, data science is proposed to explore and study basic scientific problems contained in big data. In this paper, the development of big data, the rise and connotation of data science are first introduced. Second, the research status of big data and data science is analyzed, and the application of data in various industries is discussed. Third, the big data proving ground that is constructed to explore laws and problems of data science is briefly described. Finally, in order to promote the development of data science, accelerate the transformation of the real world to the digital world, and realize the intelligent life, the key issues of data science and the new thinking in digital world are discussed.
    18  Improved Grey Correlation Model for Performance Evaluation of Radar Emitter Signal Sorting and Recognition Features
    PU Yunwei WU Haixiao JIANG Ying YU Yongpeng
    2022, 37(3):657-667. DOI: 10.16337/j.1004-9037.2022.03.015
    [Abstract](756) [HTML](549) [PDF 1.45 M](2153)
    Abstract:
    In order to solve the problems of insufficient objective evaluation and lack of evaluation basis for the classification and identification of radar emitter signal, an improved gray correlation feature evaluation model combined with interval-valued intuitionistic fuzzy thought is constructed. The model introduces the dimension of signal-to-noise ratio (SNR) to examine the dynamic differences of data at different levels, describes feature information with interval data, and establishes an interval-valued intuitionistic fuzzy comprehensive decision matrix. Secondly, an optimization model that maximizes the total deviation between features is used to determine the weight of each indicator. Finally, based on the improved gray correlation framework, the ranking of feature schemes is achieved by combining with the approach to ideal points. The simulation results show that the proposed method can give the sorting identification feature evaluation and sorting results that are consistent with the actual situation, and is basically consistent with the analysis results by the unimproved gray correlation method, which verifies the feasibility and effectiveness of the proposed method.
    19  A Model for Extracting Evaluation Objects of Cased-Involved Microblog Based on Keyword Structured Encoding
    Wang Jingyun Yu Zhengtao Xiang Yan Chen Long
    2022, 37(5):1026-1035. DOI: 10.16337/j.1004-9037.2022.05.008
    [Abstract](659) [HTML](486) [PDF 960.79 K](1581)
    Abstract:
    The purpose of extracting evaluation object of the microblog involved in a case is to identify the case object terms of the user evaluation from the microblog comments, which helps to grasp public thought on different aspects of a certain case. In general, the existing methods regard evaluation object extraction as a sequence labeling task, but do not take into account the domain characteristics of the microblog involved in the case, that is, comments are usually discussed around the case keywords that appear in the microblog text. For this reason, this paper proposes a sequence labeling model based on case keyword structured encoding to extract the evaluation objects of the microblog involved in the case. First of all, a number of case keywords are obtained from the text of microblogs, and the structured encoding mechanism is used to convert them into keyword structural representations. After that, the representations are integrated into the comment sentence representation through the cross attention mechanism. In the end, the evaluation target terms are extracted by the conditional random field (CRF). Experiments are conducted on the data sets of two cases. Compared with the multiple baselines, the encouraging progress validates the effectiveness of the proposed approach.
    20  Survey of Interpretable Deep TSK Fuzzy Systems
    Wang Shitong Xie Runshan Zhou Erhao
    2022, 37(5):935-951. DOI: 10.16337/j.1004-9037.2022.05.001
    [Abstract](1901) [HTML](1245) [PDF 840.68 K](3810)
    Abstract:
    While the existing deep neural networks have earned great successes in various application scenarios,they are still facing black-box challenges that they are not very suitable for some application fields such as healthcare, finance and transportation. Therefore, explainable artificial intelligence (XAI) has been becoming a hot research topic in recent years. Among the existing XAI means, since fuzzy AI systems have the impressive ability to achieve an excellent trade-off between performance and interpretability,interpretable deep Takagi-Sugeno-Kang (TSK) fuzzy systems have been drawing more and more attentions. We first state the concept of the classical TSK fuzzy systems,then give a comprehensive overview of interpretable deep TSK fuzzy systems which are based on stacked generalization principle, including their structures,representative models and application scenarios, and finally discuss their future development direction according to their existing problems.
    21  Approximate Aggregate Query Method Based on Two-Stage Stratified Sampling
    Fang Jun Zhao Bo Zuo Changqi
    2022, 37(5):1049-1058. DOI: 10.16337/j.1004-9037.2022.05.010
    [Abstract](879) [HTML](1086) [PDF 1.41 M](1711)
    Abstract:
    The interactive query analysis technology represented by data warehouse application provides support for intelligent decision-making. With the continuous increase of data scale, accurate calculation of query results often requires global data scanning, which makes the group-by query face the problem of insufficient real-time response ability. Based on the pre-extracted sample data, it can provide fast approximate answers for aggregate queries, which is a feasible solution to this problem in many scenarios. This paper analyzes the specific conditions that stratified sampling is better than random sampling, and proposes a two-stage stratified sampling method. In the first stage, the sampling is grouped according to the business characteristics. In each grouping, the random sampling method is first used for random sampling, and the sampling effect is evaluated. To improve the effect of approximate query, the second stage sampling is carried out, and the self-organizing feature mapping (SOM) clustering method is used to group the values. Experimental results on the public data set and the actual power grid data show that, compared with random sampling, stratified random sampling and congressional sampling algorithm, performance of the proposed method can be improved by 15% at most under the same sampling rate. And SOM has better approximate query results than K-means and density-based spatial clustering of applications with noise (DBSCAN) clustering methods.
    22  Difference Analysis Research of Threshold Selection in Principal Component Analysis
    ZHANG Jing LIU Qian
    2022, 37(5):1012-1017. DOI: 10.16337/j.1004-9037.2022.05.006
    [Abstract](979) [HTML](1083) [PDF 1.77 M](2026)
    Abstract:
    Principal component analysis (PCA) is a commonly used method for feature extraction and data dimension reduction. In many applications, the components whose eigenvalues are greater than the average value are retained. However, there is no specific analysis result for the relationship between the number of principal components and the application results. Therefore, an experimental analysis of the difference in selection of PCA threshold is carried out to provide basis for the PCA threshold selection in different applications. The experiment analysis is used to reduce the dimension of handwritten digital sample set MNIST, and different neural networks are constructed according to different thresholds for classification. Furthermore, the change of classification accuracy under different thresholds is analyzed. The experimental results show that when the threshold of PCA is between 79%—81% (dimension is 41—50), the classification accuracy is the highest, and the accuracy decreases accordingly when the threshold is lower or higher than that region. It is proved that there is no positive correlation between application results and threshold selection of PCA, and the average of the eigenvalues is not a mandatory criterion.
    23  Improved Self-paced Deep Incomplete Multi-view Clustering
    Cui Jinrong Huang Cheng
    2022, 37(5):1036-1048. DOI: 10.16337/j.1004-9037.2022.05.009
    [Abstract](848) [HTML](705) [PDF 1.96 M](2124)
    Abstract:
    With the increase of the volume of data, multi-view clustering with missing view data is becoming progressively common, which is regarded as the incomplete multi-view clustering. Powered by the development of deep learning models, clustering models introduced deep learning can normally get more outstanding performance than shallow models. A novel deep incomplete multi-view clustering model is proposed, which is called improved self-paced deep incomplete multi-view clustering. In this model, the complementarity of multi-view data is fully considered, and the missing views are completed by the nearest neighbor imputation scheme based on multi-view data characteristics. Multiple encoders are exerted to obtain the low-dimensional potential features of multiple views. Meanwhile, the graph embedding strategy is introduced to maintain the geometric structure among the potential features. The consistency principle is exerted to fuse the potential features from different views to obtain consistent potential features. Experimental results indicate that, compared with the existing incomplete multi-view clustering models, our model can deal with various incomplete multi-view clustering more flexibly and efficiently, thus improving the robustness and performance of incomplete multi-view clustering.
    24  A Survey on Application of Deep Learning in Photoacoustic Image Reconstruction from Limited-View Sparse Data
    SUN Zheng HOU Yingsa
    2022, 37(5):971-983. DOI: 10.16337/j.1004-9037.2022.05.001
    [Abstract](1507) [HTML](1052) [PDF 4.04 M](3982)
    Abstract:
    Photoacoustic imaging (PAI) is a newly emerging hybrid functional imaging modality. High-quality image reconstruction is the key to improve the imaging accuracy. Incomplete photoacoustic(PA) measurements usually lead to the reduction in the imaging depth and the quality of images which are rendered by using conventional reconstruction techniques such as back projection (BP), time reversal (TR), and delay and sum (DAS). The iterative algorithms are capable of solving this issue to a certain extent at the cost of high computational burden and a properly selected regularization tool. In recent years, deep learning (DL) has exhibited promising performances in the field of medical imaging. It has also shown great potential in reconstructing images with high quality and high efficiency. This paper provides a survey on PA image reconstruction from sparely sampled data in a limited view based on DL. The current methods are summarized and classified, and their advantages and limits are also discussed.
    25  Sparse Principal Component Analysis Algorithm Based on Same Sparse Pattern
    SHAO Jianfei PU Rong Huang Wei JI Jianjie GUO Peng
    2022, 37(5):1084-1091. DOI: 10.16337/j.1004-9037.2022.05.013
    [Abstract](932) [HTML](527) [PDF 966.74 K](1570)
    Abstract:
    Sparse principal component analysis is an unsupervised method for dimensionality reduction and feature selection. An adaptive sparse principal component analysis (ASPCA) algorithm is proposed, because the principal load vectors do not have the same sparse pattern when calculating multiple principal components, and it is difficult to determine a small number of the variables that contribute the most to the principal components from the original feature space. Firstly, the group lasso model is used, and the ASPCA formula is obtained by applying block sparse constraints on the load vector. Subsequently, different adjustment parameters are used for different columns of the sparse matrix to obtain adaptive penalty. Finally, the block-coordinate descent method is used to optimize the adaptive sparse principal component analysis formula in two stages, so as to find the sparse load matrix and the orthogonal matrix and achieve the optimization of dimensionality reduction. The comparison results of the sparse principal component analysis (SPCA) algorithm, the structured and sparse principal component analysis (SSPCA) algorithm and the ASPCA algorithm show that the ASPCA algorithm has better dimensionality reduction performance and can extract more valuable features, thereby effectively improving the average classification accuracy of the classification model.