In this paper, we present a robust face recognition method with combined locality-sensitive sparsity and group sparsity constraint. The group sparsity constraint is designed to utilize the grouped structure informatio...
详细信息
A kind of hybrid surface plasmonic waveguide based on the nonlinear media of Si-NC/SiO2 was designed. The dependence of the distribution of longitudinal energy flux density, the effective refractive index, the propaga...
详细信息
Community structure is one of the most important features in real networks and reveals the internal organization of the vertices. Uncovering accurate community structure is effective for understanding and exploiting n...
详细信息
Community structure is one of the most important features in real networks and reveals the internal organization of the vertices. Uncovering accurate community structure is effective for understanding and exploiting networks. Tolerance Granulation based Community Detection Algorithm(TGCDA) is proposed in this paper, which uses tolerance relation(namely tolerance granulation) to granulate a network hierarchically. Firstly, TGCDA relies on the tolerance relation among vertices to form an initial granule set. Then granules in this set which satisfied granulation coefficient are hierarchically merged by tolerance granulation operation. The process is finished till the granule set includes one granule. Finally, select a granule set with maximum granulation criterion to handle overlapping vertices among some granules. The overlapping vertices are merged into corresponding granules based on their degrees of affiliation to realize the community partition of complex networks. The final granules are regarded as communities so that the granulation for a network is actually the community partition of the *** on several datasets show our algorithm is effective and it can identify the community structure more accurately. On real world networks, TGCDA achieves Normalized Mutual Information(NMI) accuracy 17.55% higher than NFA averagely and on synthetic random networks, the NMI accuracy is also improved. For some networks which have a clear community structure, TGCDA is more effective and can detect more accurate community structure than other algorithms.
The subwavelength metal grating is designed and simulated by using the finite difference time domain (FDTD) algorithm. The transmission characteristics of subwavelength metal grating structure are studied based on the...
详细信息
How to fast, accurately and robustly recognize wheat diseases, particularly for those diseases with mild-to-moderate severity, is a challenge for prevention and control of crop disease timely. In this study, image pro...
详细信息
How to fast, accurately and robustly recognize wheat diseases, particularly for those diseases with mild-to-moderate severity, is a challenge for prevention and control of crop disease timely. In this study, image processing technique was applied to segment the infected regions of disease leaves. Twenty disease features were extracted, and eighteen larger weight features were selected by Relief-F algorithm to generate the models of Support Vector Machine (SVM), Relevance Vector Machine (RVM) and Back Propagation Neural Network (BPNN). Subsequently, these models were used to identify two kinds of wheat diseases, namely, wheat stripe rust and powdery mildew. Total 136 samples, including 68 training samples and 68 test samples with different infection severities were used to study the recognition capabilities of the three models. Results showed that high predictive accuracies in identification of two wheat diseases with varying severity for all three models. Overall accuracy of RVM was 89.71%, which was superior to 83.82% of SVM and inferior to 92.64% of BPNN. Meanwhile, the recognition accuracies of SVM, RVM and BPNN models for mild-to-moderate disease were 83.33%, 88.33% and 91.67%, respectively. The prediction time of RVM was less than those of SVM and BPNN, with differences as large as 7.96 and 31.68 times, respectively. Therefore, RVM appeared to be the most suitable for real-time identifying wheat leaf diseases among the three models, which can provide important technical support for wheat diseases management.
Quantum-well infrared photodetectors have been studied extensively due to their night vision, astronomy and environmental monitoring research in recent years. However, responsivity and detectivity are relatively low i...
详细信息
Embedded systems and computational intelligence have been greatly developed in recent years. It is necessary to consider the design of a handheld terminal for industrial control purposes because there is still some wo...
详细信息
In this paper, a novel design of theWideband Bandstop Filter, based on Split Ring Resonators, (SRR) is proposed. The Defect Ground Structure (DGS) is achieved by opening the SRR-shaped slot in the ground plane, and th...
详细信息
In this paper, a novel design of the dual passband lowpass filter based on the Defect Ground Structure (DGS) is proposed. The defect ground structure (DGS) is achieved by opening a set of asymmetric U-shaped slot in t...
详细信息
Low-rank tensor factorization(LRTF) provides a useful mathematical tool to reveal and analyze multi-factor structures underlying data in a wide range of practical applications. One challenging issue in LRTF is how to ...
详细信息
Low-rank tensor factorization(LRTF) provides a useful mathematical tool to reveal and analyze multi-factor structures underlying data in a wide range of practical applications. One challenging issue in LRTF is how to recover a low-rank higher-order representation of the given high dimensional data in the presence of outliers and missing entries, i.e., the so-called robust LRTF problem. The L1-norm LRTF is a popular strategy for robust LRTF due to its intrinsic robustness to heavy-tailed noises and outliers. However, few L1-norm LRTF algorithms have been developed due to its non-convexity and non-smoothness, as well as the high order structure of data. In this paper we propose a novel cyclic weighted median(CWM) method to solve the L1-norm LRTF problem. The main idea is to recursively optimize each coordinate involved in the L1-norm LRTF problem with all the others fixed. Each of these single-scalar-parameter sub-problems is convex and can be easily solved by weighted median filter, and thus an effective algorithm can be readily constructed to tackle the original complex problem. Our extensive experiments on synthetic data and real face data demonstrate that the proposed method performs more robust than previous methods in the presence of outliers and/or missing entries.
暂无评论