October 2024
·
3 Reads
Expert Systems with Applications
This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.
October 2024
·
3 Reads
Expert Systems with Applications
August 2024
·
5 Reads
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
The globalization of the Integrated Circuit (IC) supply chain has introduced the risk of Hardware Trojan (HT) insertion. We propose an unsupervised Hardware Trojan detection method based on the Enhanced Local Outlier Factor (ELOF) algorithm to detect HT efficiently. This method extracts structural and testability features and employs the scoring mechanism of the ELOF algorithm to emphasize the deviation of suspicious HT nets from clusters. Experimental results on Hardware Trojan libraries show that the method achieves an average prediction accuracy (A) of 97.36%, a True Negative Rate (TNR) of 97.81%, a precision (P) of 40.94%, and an F-measure of 49.28%, all of which outperform the Local Outlier Factor (LOF) algorithm and Cluster-Based Local Outlier Factor (CBLOF) algorithm. Notably, the method exhibits superior performance in terms of True Positive Rate (TPR), reaching 70.86%, indicating its efficiency in identifying HT and reducing false negatives. The results demonstrate that the proposed algorithm and feature combination in the approach can significantly enhance the efficiency of Trojan detection.
January 2024
·
1 Read
January 2024
·
6 Reads
IEEE Geoscience and Remote Sensing Letters
In the task of multi-label aerial image classification, various objects and land cover in an image are usually represented by multiple labels which are treated equally. However, from a semantic point of view, the importance of multiple labels are different in a specific scene. There is often a prime label in the image that plays a "leading" role. Obtaining the most important label from candidate multiple labels is crucial, because it best represents the semantics of the entire image. In this letter, we attempt to automatically obtain the prime label of each image from several existing multi-label aerial image datasets without additional supervision cost. In other words, the prime labels are only used to evaluate the performance of models during testing and do not participate in the training process. Therefore, it is essentially a weakly supervised learning task. For this novel aerial image classification task, corresponding datasets are provided in this letter firstly, including over head images with multi-labels for training and prime labels for testing. Then the baselines on the above datasets are provided. Finally, a new prime label learning method is proposed, which improves the baseline accuracy by about 14% and reaches the state-of-the-art on current datasets.
September 2023
·
66 Reads
Identifying the feature of the circuit network is a crucial step to understanding the behavior of the Very Large Scale Integration (VLSI). Unfortunately, the growing complexity of the VLSI design makes enormous computations for estimating the property of the network. We propose a machine learning framework to overcome the intractable estimation of feature importance in the circuit network. We extract complex network features at the placement stage and compute circuit wire length at the routing stage, then study their correlation using machine learning and estimate the importance of complex network features by the learned correlation. The experimental result on TAU 2017 Benchmark shows the high efficiency of the framework that the prediction accuracy achieves an average of 96.722%. The estimated importance of complex network features is in order of the number of nodes, the average degree, the average edge weight, the average betweenness, the average strength, and the average weighted clustering coefficient. The result is convincing and consistent with the previous work, demonstrating the reliability of our method.
February 2023
·
7 Reads
Engineering Applications of Artificial Intelligence
Efficient three-dimensional (3D) object recognition plays an important role in the 3D reconstruction of light-field displays. However, presently, the error rate of 3D implicit shape object recognition remains high, because the local features are sparse in the geometric expression of 3D reconstruction. To address this issue, a hypothesis verification method based on semi-supervised active learning-based K-means++ combined with 3D feature extraction is proposed. The proposed approach consists of the offline and online phases. The algorithm time complexity is O(n) and O(n2), respectively. The offline phase includes keypoint detection, normal estimation, fast point feature histograms (FPFH) descriptor extraction, geometric word weight saving, and indexing structure construction. In addition to the FPFH extraction, the online phase includes nearest geometric word searching, corresponding direction and center voting, and non-maximum suppression. Comparative experiments were conducted in which the models and scenes were tested on the 3D datasets Mian and Tosca that is high-resolution. The experimental results demonstrate that the proposed method resolves the low recognition rate problem of 3D implicit objects, with the highest 3D intersection over union (IoU) reaching 88.89%.
January 2023
·
11 Reads
SSRN Electronic Journal
September 2022
·
21 Reads
·
1 Citation
Remote Sensing Letters
Street view image (SVI) is becoming one of the most essential proximity sensing data for urban land-use study. Because of the highly abstract nature of their labels (e.g., commercial area), straight usage of end-to-end visual models often perform poorly. Recently proposed ‘bottom-up and top-down’ framework has achieved remarkable performance, which transforms visual classification task into text sequence classification task. However, in the ‘top-down’ phase, the long-distance dependence of text information still exists. On the other hand, in the ‘bottom-up’ phase, better detectors are also needed to further extract visual features. In this letter, the idea of ‘feature adaptive weighting’ (FAW), which was derived from the attention mechanism, is used in both phases to improve the overall performance. ‘Self-correlation guided feature adaptive weighting’ (S-FAW) is introduced in the first phase to improve building detection. In the second phase, ‘cross-correlation guided feature adaptive weighting’ (C-FAW) is used to enhance the connections between detected individual buildings. Experimental results show that the proposed FAWNet can effectively improve the performance of the two-phase framework in both phases and surpass the mainstream end-to-end models.
May 2022
·
9 Reads
April 2022
·
11 Reads
·
5 Citations
Physica A Statistical Mechanics and its Applications
The research on artificial networks is of great significance for understanding and improving the functionality of the artificial system. In this paper, we study the complexity and robustness of the weighted circuit network of the placement. The result on circuit benchmarks shows that the network behaves as a small-world property of the broad-scale class, and the large-scale circuit tends to be with a strong small-world property. The correlation between network efficiency and circuit scale presents a power-law distribution. The networks represent diverse robustness to different attack strategies due to their inherent characteristics. Especially IS (Initial Strength) attack strategy outperforms ID (Initial Degree) attack strategy for large-scale networks.
... In general, during each phase of attack simulations, several metrics are exploited to assess the current network performance and structure; the size of the largest connected component (LCC) and network efficiency are among the most common ones [40][41][42][43][44]. The former is an indicator of network connectedness, while the latter indicates network connectivity and specifically accounts for the ease of movement among its nodes [45][46][47]. ...
April 2022
Physica A Statistical Mechanics and its Applications
... Nie et al. found that the performance of VLSI physical design correlated with the properties of the complex network. The intensity of the correlations differs from each other and changes in the physical design optimization [24]. However, the growing complexity of the VLSI design requires enormous computations for estimating the property of the network. ...
April 2020
IEEE Access
... Gao et al. fused multiple texture features to achieve recognition analysis of an image. Zhou et al. [13] used the properties of nodes and connected edges to perform dynamic evolution, combined with mathematical methods such as multiscale wavelets to extract features. This paper proposes a multi-network-based image recognition method that combines complex networks and neural networks to recognize images. ...
January 2017
Journal of Information Hiding and Multimedia Signal Processing
... Points of interest are the pixels in the image and contain important features of the image. Interest points are some key pixels in an image which contain a lot of important features and information content of the image [1]. The ultimate goal of interest points detection is to describe the key points of information to achieve the image matching between each other to achieve image stitching, face recognition, video tracking and other applications. ...
March 2016
... Other node attack strategies are based on different topological properties of the networks, like eigenvector centrality [5,8], closeness centrality [9,10], and clustering coefficient [5]. In addition, scientists investigated these attack strategies' variations [4,11,12]. By analyzing the impact of these attack strategies, we can identify the node importance in the network. ...
April 2016
Physica A Statistical Mechanics and its Applications
... That being said, many intelligent computer vision and image processing techniques are being developed [4,5], yet, thanks to digitization of data, documents exploitation has become simpler and more convenient, However, this advantage has caused unauthorized use and illegal modifications of these documents. Indeed, many infringements occur just by modifying the content and this become a real threat for copyright protection and intellectual property or it can become more problematic in the case of intentional attacks on identity and data authentication [6]. In order to resolve these issues and others, several techniques have been invented for securing data transfer and preserving intellectual property, among which is watermarking. ...
March 2016
... Considering that nodes at the crossroads of different communities tend to be more powerful in disseminating information from one community to another. Inspired by the information entropy [49], we then introduce the other concept of Hierarchical-Community Entropy (HCE) to measure the amount of the community structural information of nodes. For the communities, the Community Importance (CI) of each community can be calculated as follows: ...
February 2016
Physica A Statistical Mechanics and its Applications
... Iris feature extraction is the key to iris recognition. Gabor Wavelet [3,18,19], curvelet [16] and Discrete Linear Discriminant Analysis (DLDA) [10] are commonly used to extract iris feature, but these methods are high requirements for iris image quality. Convolutional neural network (CNN), as a mature deep learning framework, has made a breakthrough in image classification and recognition [6,8,9,15,20,23,24] since it can extract high-level abstract image features [22]. ...
August 2015
IEICE Transactions on Information and Systems
... For example, Guo and Wang [24] proposed a passion network model and released the degree distribution formula of this model with the power-law exponent between 1 and 2. Additionally, Zhang et al. [63] developed the growing and optimizing processes of scale-free networks. Lv et al. [37] explored the second-order centrality correlation for several types of the scale-free networks while Laird and Jensen [65] introduced a non-growth network model. However, there has been no study that has investigated the scale-free networks with an S-shaped characteristic, which has been proven to be a function form that is close to reality. ...
January 2015
International Journal of Modern Physics C
... The explanation of all of them are given as: NCDB-LBPac [23] 90.00 OD-LBP [24] 76.66 CT level-1 + LBP [60] 70.67 CT + LBP [60] 73.33 CCPS [61] 51.20 CLPS [61] 64.33 FMMC [62] 84.67 KNN [62] 82.67 AWULBP_MHOG [63] 87.33 L1-CSRT [64] 60.00 G-FST [65] 65.00 QRCP [65] 38.00 MNTCDP [66] 91.53 AECLBP-M [66] 84.07 FK2DPCA [67] 52.30 K2DPCA [67] 52.00 DBP (The proposed) 94.00 ...
April 2014
IEICE Transactions on Information and Systems