Search Results (460)

Concept-cognitive learning reveals the principle of human cognition by simulating the brain’s process of learning and processing concepts. Nevertheless, for neighborhood similarity granules, the average information of objects regarding all attributes is not considered, which may lead to unbalanced acquisition of knowledge. On the other hand, there are some unnecessary concepts in the extension of fuzzy concepts, which results in poor classification learning. To tackle these challenges, we present a forgetting-based concept-cognitive learning model for classification in a fuzzy formal decision context. Firstly, the fuzzy concept space is established based on the the correlation coefficient matrix. Then, to delete unnecessary objects that are in the zone of proximal development, we construct the forgetting fuzzy concept space by selecting the concept corresponding to the maximum similarity. Subsequently, a forgetting-based fuzzy concept model (FCCLM) mechanism is proposed. In the end, experimental results on eight datasets validate the feasibility and efficiency of the proposed learning mechanism through classification performance assessment. Full article

Among the existing challenges in the field of hyperspectral imaging, the need to optimize memory usage and computational capacity in material detection methods stands out, given the vast amount of data associated with the hundreds of reflectance bands. In line with this, this article proposes a comparative study on the effectiveness and efficiency of five computational methods for detecting composite material asbestos cement (AC) in hyperspectral images: correlation, spectral differential similarity (SDS), Fourier phase similarity (FPS), area under the curve (AUC), and decision trees (DT). The novelty lies in the comparison between the first four methods, which represent the spectral proximity method and a machine learning method, such as DT. Furthermore, SDS and FPS are novel methods proposed in the present document. Given the accuracy that detection methods based on supervised learning have demonstrated in material identification, the results obtained from the DT model were compared with the percentage of AC detected in a hyperspectral image of the Manga neighborhood in the city of Cartagena by the other four methods. Similarly, in terms of computational efficiency, a 20 × 20 pixel region with 380 bands was selected for the execution of multiple repetitions of each of the five computational methods considered, in order to obtain the average processing time of each method and the relative efficiency of the methods with respect to the method with the best effectiveness. The decision tree (DT) model achieved the highest classification accuracy at 99.4%, identifying 11.44% of asbestos cement (AC) pixels in the reference image. However, the correlation method, while detecting a lower percentage of AC pixels (9.72%), showed the most accurate visual performance and had no spectral overlap, with a 1.4% separation between AC and non-AC pixels. The SDS method was the most computationally efficient, running 23.85 times faster than the DT model. The proposed methods and results can be applied to other hyperspectral imaging tasks involving material identification in urban environments, especially when balancing accuracy and computational efficiency is essential. Full article

Image registration constitutes the fundamental basis for the joint interpretation of synthetic aperture radar (SAR) and optical images. However, robust image registration remains challenging due to significant regional heterogeneity in remote sensing scenes (e.g., co-existing urban and marine areas within a single image). To overcome this challenge, this article proposes a novel optical–SAR image registration method named Gradient and Standard Deviation Feature Weighted Fusion (GDWF). First, a Block-local standard deviation (Block-LSD) operator is proposed to extract block-based feature points with regional adaptability. Subsequently, a dual-modal feature description is developed, constructing both gradient-based descriptors and local standard deviation (LSD) descriptors for the neighborhoods surrounding the detected feature points. To further enhance matching robustness, a confidence-weighted feature fusion strategy is proposed. By establishing a reliability evaluation model for similarity measurement maps, the contribution weights of gradient features and LSD features are dynamically optimized, ensuring adaptive performance under varying conditions. To verify the effectiveness of the method, different optical and SAR datasets are used to compare it with the currently advanced algorithms MOGF, CFOG, and FED-HOPC. The experimental results demonstrate that the proposed GDWF algorithm achieves the best performance in terms of registration accuracy and robustness among all compared methods, effectively handling optical–SAR image pairs with significant regional heterogeneity. Full article

Heterogeneous information network (HIN) embedding transforms multi-type nodes into low-dimensional vectors to preserve structural and semantic information for downstream tasks. However, it struggles with multiplex networks where nodes connect via diverse semantic paths (metapaths). Information fusion mainly improves the quality of node embedding by fully exploiting the structure and hidden information within the network. Current metapath-based methods ignore information from intermediate nodes along paths, depend on manually defined metapaths, and overlook implicit relationships between nodes sharing similar attributes. Our objective is to develop an adaptive framework that overcomes limitations in existing metapath-based embedding (incomplete information aggregation, manual path dependency, and ignorance of latent semantics) to learn more discriminative embeddings. We propose an adaptive multi-hop neighbor information fusion model for heterogeneous network embedding (ANHNE), which: (1) autonomously extracts composite metapaths (weighted combinations of relations) via a multipath aggregation matrix to mine hierarchical semantics of varying lengths for task-specific scenarios; (2) projects heterogeneous nodes into a unified space and employs hierarchical attention to selectively fuse neighborhood features across metapath hierarchies; and (3) enhances semantics by identifying potential node correlations via cosine similarity to construct implicit connections, enriching network structure with latent information. Extensive experimental results on multiple datasets show that ANHNE achieves more precise embeddings than comparable baseline models. Full article

Amman’s rapid population growth and sprawling urbanization have resulted in car-centric, fragmented neighborhoods that lack social cohesion and are vulnerable to the impacts of climate change. This study reframes walkability as a climate adaptation strategy, demonstrating how pedestrian-oriented spatial planning can reduce vehicle emissions, mitigate urban heat island effects, and enhance the resilience of green infrastructure in peri-urban contexts. Using Deir Ghbar, a rapidly developing marginal area on Amman’s western edge, as a case study, we combine objective walkability metrics (street connectivity and residential and retail density) with GIS-based spatial regression analysis to examine relationships with residents’ sense of community. Employing a quantitative, correlational research design, we assess walkability using a composite objective walkability index, calculated from the land-use mix, street connectivity, retail density, and residential density. Our results reveal that higher residential density and improved street connectivity significantly strengthen social cohesion, whereas low-density zones reinforce spatial and socioeconomic disparities. Furthermore, the findings highlight the potential of targeted green infrastructure interventions, such as continuous street tree canopies and permeable pavements, to enhance pedestrian comfort and urban ecological functions. By visualizing spatial patterns and correlating built-environment attributes with community outcomes, this research provides actionable insights for policymakers and urban planners. These strategies contribute directly to several Sustainable Development Goals (SDGs), particularly SDG 11 (Sustainable Cities and Communities) and SDG 13 (Climate Action), by fostering more inclusive, connected, and climate-resilient neighborhoods. Deir Ghbar emerges as a model for scalable, GIS-driven spatial planning in rural and marginal peri-urban areas throughout Jordan and similar regions facing accelerated urban transitions. By correlating walkability metrics with community outcomes, this study operationalizes SDGs 11 and 13, offering a replicable framework for climate-resilient urban planning in arid regions. Full article

Detecting leakage using a point cloud acquired by mobile laser scanning (MLS) presents significant challenges, particularly from within three-dimensional space. These challenges primarily arise from the prevalence of noise in tunnel point clouds and the difficulty in accurately capturing the three-dimensional morphological characteristics of leakage patterns. To address these limitations, this study proposes a classification method based on XGBoost classifier, integrating both intensity and geometric features. The proposed methodology comprises the following steps: First, a RANSAC algorithm is employed to filter out noise from tunnel objects, such as facilities, tracks, and bolt holes, which exhibit intensity values similar to leakage. Next, intensity features are extracted to facilitate the initial separation of leakage regions from the tunnel lining. Subsequently, geometric features derived from the k neighborhood are incorporated to complement the intensity features, enabling more effective segmentation of leakage from the lining structures. The optimal neighborhood scale is determined by selecting the scale that yields the highest F_1-score for leakage across various multiple evaluated scales. Finally, the XGBoost classifier is applied to the binary classification to distinguish leakage from tunnel lining. Experimental results demonstrate that the integration of geometric features significantly enhances leakage detection accuracy, achieving an F_1-score of 91.18% and 97.84% on two evaluated datasets, respectively. The consistent performance across four heterogeneous datasets indicates the robust generalization capability of the proposed methodology. Comparative analysis further shows that XGBoost outperforms other classifiers, such as Random Forest, AdaBoost, LightGBM, and CatBoost, in terms of balance of accuracy and computational efficiency. Moreover, compared to deep learning models, including PointNet, PointNet++, and DGCNN, the proposed method demonstrates superior performance in both detection accuracy and computational efficiency. Full article

As power grids continue to expand in scale, the occurrence of cascading failures within them can lead to significant economic losses. Therefore, assessing the criticality of grid nodes is crucial for ensuring the secure and stable operation of power systems and for mitigating losses when cascading failures occur. The classical Local Link Similarity (LLS) algorithm in complex networks evaluates the importance of network nodes from a neighborhood topology perspective, but it suffers from issues such as the excessive weighting of node degrees and the neglect of electrical parameters. Based on the classical algorithm, this paper first develops the Improved Local Link Similarity (ILLS) algorithm by substituting alternative similarity metrics and comparatively evaluating their performance. Building upon the ILLS, we then propose the Electrical LLS (ELLS) algorithm by integrating node power flow and electrical coupling connectivity as multiplicative factors, with optimal combinations determined via simulation experiments. Compared to classical approaches, ELLS demonstrates superior adaptability to power grid contexts and delivers enhanced accuracy in power system node importance assessments. These algorithms are applied to rank the node importance in the IEEE 300-bus system. Their performance is evaluated using the loss-of-load-size metric, comparing ELLS, ILLS, and the classical algorithm. The results demonstrate that under the loss-of-load-size metric, the ELLS algorithm achieves approximately 25% higher accuracy compared to both the ILLS and the classical algorithm, validating its effectiveness. Full article

Identifying correspondences of road segments in different road networks, namely road-network matching, is an essential task for road network-centric data processing such as data integration of road networks and data quality assessment of crowd-sourced road networks. Traditional road-network matching usually relies on feature engineering and parameter selection of the geometry and topology of road networks for similarity measurement, resulting in poor performance when dealing with dense and irregular road network structures. Recent development of graph neural networks (GNNs) has demonstrated unsupervised modeling power on road network data, which learn the embedded vector representation of road networks through spatial feature induction and topology-based neighbor aggregation. However, weighting spatial information on the node feature alone fails to give full play to the expressive power of GNNs. To this end, this paper proposes a Spatial Pattern-aware Graph EMbedding learning method for road-network matching, named SP-GEM, which explores the idea of spatially-explicit modeling by identifying spatial patterns in neighbor aggregation. Firstly, a road graph is constructed from the road network data, and geometric, topological features are extracted as node features of the road graph. Then, four spatial patterns, including grid, high branching degree, irregular grid, and circuitous, are modelled in a sector-based road neighborhood for road embedding. Finally, the similarity of road embedding is used to find data correspondences between road networks. We conduct an algorithmic accuracy test to verify the effectiveness of SP-GEM on OSM and Tele Atlas data. The algorithmic accuracy experiments show that SP-GEM improves the matching accuracy and recall by at least 6.7% and 10.2% among the baselines, with high matching success rate (>70%), and improves the matching accuracy and recall by at least 17.7% and 17.0%, compared to the baseline GNNs, without spatially-explicit modeling. Further embedding analysis also verifies the effectiveness of the induction of spatial patterns. This study not only provides an effective and practical algorithm for road-network matching, but also serves as a test bed in exploring the role of spatially-explicit modeling in GNN-based road network modeling. The experimental performances of SP-GEM illuminate the path to develop GeoEmbedding services for geospatial applications. Full article

Firmware vulnerabilities in embedded devices have caused serious security incidents, necessitating similarity analysis of binary program instruction embeddings to identify vulnerabilities. However, existing instruction embedding methods neglect program execution semantics, resulting in accuracy limitations. Furthermore, current embedding approaches utilize independent computation across models, where the lack of standardized interaction information between models makes it difficult for embedding models to efficiently detect firmware vulnerabilities. To address these challenges, this paper proposes a firmware vulnerability detection scheme based on statistical inference and code similarity fuzzy matching analysis for resource-constrained vehicular network environments, helping to balance both accuracy and efficiency. First, through dynamic programming and neighborhood search techniques, binary code is systematically partitioned into normalized segment collections according to specific rules. The binary code is then analyzed in segments to construct semantic equivalence mappings, thereby extracting similarity metrics for function execution semantics. Subsequently, Google Protocol Buffers (ProtoBuf) is introduced as a serialization format for inter-model data transmission, serving as a “translation layer” and “bridging technology” within the firmware vulnerability detection framework. Additionally, a ProtoBuf-based certificate authentication scheme is proposed to enhance vehicular network communication reliability, improve data serialization efficiency, and increase the efficiency and accuracy of the detection model. Finally, a vehicular network simulation environment is established through secondary development on the NS-3 network simulator, and the functionality and performance of this architecture were thoroughly tested. Results demonstrate that the algorithm possesses resistance capabilities against common security threats while minimizing performance impact. Experimental results show that FirmPB delivers superior accuracy with 0.044 s inference time and 0.932 AUC, outperforming current SOTA in detection performance. Full article

Youth violence—the deliberate use of physical force or harm by young people between the ages of 10 and 24 to intimidate or cause harm to others, both online and offline—is a critical public health issue in the United States. Yet, successfully predicting future violent offenders is a complex and challenging task, as the question of why some youths resort to extreme violence while others refrain from it—despite facing similar risk factors—remains widely debated. This article highlights both risk and protective factors of youth violence through a socio-ecological lens to offer a comprehensive understanding of the multifaceted factors driving youth violence in the United States. To understand the interconnectedness between individual factors and the broader environments in which individuals are embedded, we outline the risk and protective factors related to youth violence across five socio-ecological levels: (1) individual, (2) interpersonal, (3) neighborhood, (4) cultural, and (5) life course. Approaching youth violence from a holistic lens offers a greater opportunity to mitigate contributing factors and to address the deleterious impacts of this complex issue. Practice and research implications are discussed. Full article

Lunar orbiter image matching is a critical process for achieving high-precision lunar mapping, positioning, and navigation. However, with the Moon’s weak-texture surface and rugged terrain, lunar orbiter images generally suffer from inconsistent lighting conditions and exhibit varying degrees of non-linear intensity distortion, which pose significant challenges to image traditional matching. This paper presents a robust feature matching method based on crater neighborhood structure, which is particularly robust to changes in illumination. The method integrates deep-learning based crater detection, Crater Neighborhood Structure features (CNSFs) construction, CNSF similarity-based matching, and outlier removal. To evaluate the effectiveness of the proposed method, we created an evaluation dataset, comprising Multi-illumination Lunar Orbiter Images (MiLOIs) from different latitudes (a total of 321 image pairs). And comparative experiments have been conducted using the proposed method and state-of-the-art image matching methods. The experimental results indicate that the proposed approach exhibits greater robustness and accuracy against variations in illumination. Full article

Leaf shape is a crucial visual cue for plant recognition. However, distinguishing among plants with high inter-class shape similarity remains a significant challenge, especially among cultivars within the same species where shape differences can be extremely subtle. To address this issue, we propose a novel shape representation and an advanced heterogeneous fusion framework for accurate leaf image retrieval. Specifically, based on the local polar coordinate system, multiscale analysis, and statistical histograms, we first propose local polar coordinate feature representation (LPCFR), which captures spatial distribution from two orthogonal directions while encoding local curvature characteristics. Next, we present heterogeneous feature fusion with exponential weighting and Ranking (HFER), which enhances the compatibility and robustness of fused features by applying exponential weighted normalization and ranking-based encoding within neighborhood distance measures. Extensive experiments on both species-level and cultivar-level leaf datasets demonstrate that the proposed representation effectively captures shape features, and the fusion framework successfully integrates heterogeneous features, outperforming state-of-the-art (SOTA) methods. Full article

Territorial tourism has brought new development opportunities for historic and cultural neighborhoods. However, an insufficient understanding of the spatial distribution and influencing mechanisms of neighborhood vitality continues to constrain effective revitalization strategies. This study takes the Shuitingmen Historical and Cultural Neighborhood in Quzhou, China, as a case study and develops a multi-dimensional vitality evaluation framework incorporating point-of-interest (POI) data, location-based service (LBS) heatmaps, street network data, historical resources, and environmental perception indicators. The Analytic Hierarchy Process (AHP) is applied to assign indicator weights and calculate composite vitality scores across 19 streets. The results reveal that (1) comprehensive evaluation corrects the bias of single indicators and highlights the value of integrated assessment; (2) vitality is higher on rest days than on weekdays, with clear temporal patterns and two types of daily fluctuation trends—similar and differential; and (3) vitality levels are spatially uneven, with higher vitality in central and western areas and lower performance in the southeast, often related to low accessibility and functional monotony. This study confirms a strong positive correlation between street vitality and objective spatial factors, offering strategic insights for the micro-scale renewal and sustainable revitalization of historic neighborhoods. Full article

Smart surveillance cameras are increasingly employed for automated tasks such as event and anomaly detection within smart city infrastructures. However, the heterogeneity of deployment environments, ranging from densely populated urban intersections to quiet residential neighborhoods, renders the use of a single, universal model suboptimal. To address this, we propose the construction of a model zoo comprising models trained for diverse environmental contexts. We introduce an automated transferability assessment framework that identifies the most suitable model for a new deployment site. This task is particularly challenging in smart surveillance settings, where both source data and labeled target data are typically unavailable. Existing approaches often depend on pretrained embeddings or assumptions about model uncertainty, which may not hold reliably in real-world scenarios. In contrast, our method leverages embeddings generated by randomly initialized neural networks (RINNs) to construct task-agnostic reference embeddings without relying on pretraining. By comparing feature representations of the target data extracted using both pretrained models and RINNs, this method eliminates the need for labeled data. Structural similarity between embeddings is quantified using minibatch-Centered Kernel Alignment (CKA), enabling efficient and scalable model ranking. We evaluate our method on realistic surveillance datasets across multiple downstream tasks, including object tagging, anomaly detection, and event classification. Our embedding-level score achieves high correlations with ground-truth model rankings (relative to fine-tuned baselines), attaining Kendall’s $\tau$ values of 0.95, 0.94, and 0.89 on these tasks, respectively. These results demonstrate that our framework consistently selects the most transferable model, even when the specific downstream task or objective is unknown. This confirms the practicality of our approach as a robust, low-cost precursor to model adaptation or retraining. Full article

Reference-based super-resolution (RefSR) enhances the detail restoration capability of low-resolution images (LR) by utilizing the details and texture information of external reference images (Ref). This study proposes a RefSR method based on hash adaptive matching and progressive multi-scale dynamic aggregation to improve the super-resolution reconstruction capability. Firstly, to address the issue of feature matching, this chapter proposes a hash adaptive matching module. On the basis of similarity calculation between traditional LR images and Ref images, self-similarity information of LR images is added to assist in super-resolution reconstruction. By dividing the feature space into multiple hash buckets through spherical hashing, the matching range is narrowed down from global search to local neighborhoods, enabling efficient matching in more informative regions. This not only retains global modeling capabilities, but also significantly reduces computational costs. In addition, a learnable similarity scoring function has been designed to adaptively optimize the similarity score between LR images and Ref images, improving matching accuracy. Secondly, in the process of feature transfer, this chapter proposes a progressive multi-scale dynamic aggregation module. This module utilizes dynamic decoupling filters to simultaneously perceive texture information in both spatial and channel domains, extracting key information more accurately and effectively suppressing irrelevant texture interference. In addition, this module enhances the robustness of the model to large-scale biases by gradually adjusting features at different scales, ensuring the accuracy of texture transfer. The experimental results show that this method achieves superior super-resolution reconstruction performance on multiple benchmark datasets. Full article