检索结果-内蒙古大学图书馆

Feature enhanced non-line-of-sight imaging using graph model in latent space

OPTICS AND LASER TECHNOLOGY 2025年 181卷

作者： Xu, Weihao Chen, Songmao Wang, Dingjie Tian, Yuyuan Zhang, Ning Hao, Wei Su, Xiuqin Chinese Acad Sci Xian Inst Opt & Precis Mech Key Lab Space Precis Measurement Technol Xian 710119 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China Pilot Natl Lab Marine Sci & Technol Qingdao 266237 Peoples R China Chinese Acad Sci Key Lab Spectral Imaging Technol Xian Inst Opt & Precis Mech Xian 710119 Peoples R China

Non-line-of-sight (NLoS) imaging reveals hidden scene from indirect diffusion signals. However, it is still challenging to balance noise suppression, detail preservation, and reconstruction efficiency. In this work, a robust framework which is centered on feature extractor and enhancement is proposed. In the framework, the feature extractor exploits the graph model in latent space for efficient noise suppression and detail preservation, the enhancement collaboratively learns the feature and data statistics by considering the extractor to define regularization. The reconstruction results on the publicly accessible datasets show that the proposed framework outperforms the state-of-art methods considering both quality and efficiency.

关键词： Non line of sight imaging Regularization by denoising graph model

来源：评论

学校读者我要写书评

暂无评论

Neighbor self-embedding graph model for clustering ensemble

引用

APPLIED SOFT COMPUTING 2025年 171卷

作者： Li, Siyang Zhao, Peng Wang, Hongjun Wang, Huan Li, Tianrui Guangxi Univ Sci & Technol Coll Comp Sci Liuzhou Peoples R China Southwest Jiaotong Univ Sch Comp & Artificial Intelligence Chengdu Peoples R China

Clustering ensemble is an important method in machine learning and data mining for achieving robust and consistent results by integrating multiple base clustering results. However, existing clustering ensemble methods often overlook self-supervised information in the data, treating data points assigned to the same cluster as equivalent, regardless of their relative distances from the cluster center, which may hinder clustering ensemble methods improvement performance. To address this issue, we propose the Neighbor Self-embedding graph model for Clustering Ensemble (NSGMCE), which leverages self-supervised embeddings derived from diverse base clustering methods to extract structural information intrinsic to the data while preserving the characteristics of the base clustering results. Specifically, unlike traditional methods that directly rely on pseudo-labels from base clustering, NSGMCE treats self-supervised embeddings as new feature representations, retaining the advantages of ensemble learning while mitigating the impact of erroneous pseudo-labels. Subsequently, this self-supervised embeddings is used to construct an neighbor self-embedding graph, which is optimized and pruned during the alternating minimization inference process to obtain the final consensus result. The objective function of NSGMCE is formulated as a convex optimization problem, this smooth and continuous objective ensures its convergence and allows for efficient solving to obtain the global optimal solution, which we have theoretically proven. Extensive experiments were conducted comparing NSGMCE with eight state-of-the-art clustering ensemble methods across 12 datasets, demonstrating its superior performance. Specifically, NSGMCE achieved an 11.8% improvement in average accuracy over the second-best method and ranked first in terms of average Purity, Rand Index, and Mirkin metric. Further analysis confirmed that NSGMCE effectively leverages self-supervised embeddings to enhance robustness and

关键词： Clustering Clustering ensemble Machine learning Self-supervised graph model

来源：评论

学校读者我要写书评

暂无评论

A Novel Health Index for MV Cable Joint Aging Prediction Based on Dynamic graph Attention model

引用

IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT 2025年 74卷

作者： Negri, Virginia Mingotti, Alessandro Tinarelli, Roberto Peretto, Lorenzo Ray, Lala Shakti Swarup Zhou, Bo Lukowicz, Paul Univ Bologna Dept Elect Elect & Informat Engn G Marconi I-40136 Bologna Italy German Res Ctr Artificial Intelligence DFKI Kaiser D-67663 Kaiserslautern Germany RPTU Kaiserslautern Landau Dept Comp Sci D-67663 Kaiserslautern Germany

The distribution network relies on a critical electric component, the cable joint (CJ), for expansion and post-fault repairs. In some parts of the network, a CJ can be found every few 100 m, making it a crucial element that requires thorough study. Additionally, the CJ is highly vulnerable, and its failure often results in explosions following a fault in a problematic network branch. Unfortunately, the exact relationship between CJ parameters and their health index (HI) is unknown. This work aims to enhance existing knowledge by proposing a new and flexible HI and using a machine learning-based approach to estimate CJ aging. The proposed HI considers numerous factors, detailed in the text, and is adaptable to the information available to system operators (SOs). By means of a public dataset with condition monitoring data, the machine learning algorithm is validated to demonstrate its efficacy in estimating the HI and forecasting future CJ parameters.

关键词： Power cables Cables Aging Weight measurement Indexes Temperature measurement Adaptation models Predictive models Maintenance artificial intelligence (AI) cable joints (CJs) condition monitoring graph model health index (HI) medium voltage (MV) medium voltage (MV)

来源：评论

学校读者我要写书评

暂无评论

graph model for Conflict Resolution With Internal Consensus Reaching and External Game

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2024年第10期54卷 6265-6279页

作者： Zhang, Hengjie Wang, Fang Dong, Yucheng Chiclana, Francisco Herrera-Viedma, Enrique Hohai Univ Business Sch Nanjing 211100 Peoples R China Sichuan Univ Ctr Network Big Data & Decis Making Business Sch Chengdu 610017 Peoples R China De Montfort Univ Inst Artificial Intelligence Sch Comp Sci & Informat Leicester LE1 9BH England Univ Granada Andalusian Res Inst Data Sci & Computat Intelligen Dept Comp Sci & Artificial Intelligence Granada 18070 Spain

The graph model is devoted to game conflicts arising from incongruent pursued objectives among conflicting parties. Considering that each conflicting party is composed of multiple individuals, preference conflicts stemming from differing cognitive levels and knowledge backgrounds exist among internal individuals. This scenario simultaneously involving game conflicts and preference conflicts is termed dual conflict decision-making problem. Tailored to effectively address this problem, this study proposes an enhanced graph model that incorporates internal consensus and external stability. The best-worst method, incorporating comparative linguistic expressions, is devised to effectively elicit individual preferences over game states. To mitigate preference conflicts inherent to internal individuals within conflicting party concerning game states, a consensus reaching model minimizing preference information loss is introduced. By this way, collective preferences are obtained. Based on these, the concept of "game consensus" is proposed to manage the game conflicts and the diverse behaviors exhibited by conflicting party. Finally, a case study regarding price conflict within a dual-channel supply chain, accompanied by a comparative analysis, is presented to validate the effectiveness of the proposal. Compared to existing graph model, the proposal effectively grapples with consensus issues and heterogeneous behaviors within conflicting parties, making it more valuable in practice.

关键词： Stability analysis Games Analytical models Decision making Adaptation models Conflict analysis consensus graph model group decisions and negotiations optimization model

来源：评论

学校读者我要写书评

暂无评论

graph model-based salient object detection using objectness and multiple saliency cues

引用

NEUROCOMPUTING 2019年 323卷 188-202页

作者： Ji, Yuzhu Zhang, Haijun Tseng, Kuo-Kun Chow, Tommy W. S. Wu, Q. M. Jonathan Harbin Inst Technol Shenzhen Grad Sch Dept Comp Sci Shenzhen Peoples R China City Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China Univ Windsor Dept Elect & Comp Engn Windsor ON Canada

Recent years have witnessed increasing interest in salient object detection, which aims at stimulating the human visual attention mechanism to detect and segment the most attractive object in natural scenes, and can be widely applied in numerous computer vision tasks. In this paper, by considering both objectness cue and saliency detection, we propose a graph model-based bottom-up salient object detection framework by fusing multiple saliency maps using low-level features and objectness features under a manifold ranking framework. Specifically, for each feature, we utilize geodesic distance between any two superpixels to construct the affinity matrix and un-normalized Laplacian matrix of the graph. Then, we apply saliency optimization to refine each saliency map generated by manifold ranking with the first-stage query, and integrate saliency maps corresponding to different features by multilayer cellular automata in the final stage. Extensive experimental results demonstrate that our method can deliver promising performance in comparison to several state-of-the-art bottom-up methods on many benchmark datasets. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Salient object Objectness graph model Manifold ranking Multiple cues

来源：评论

学校读者我要写书评

暂无评论

THE graph model FOR CONFLICTS

引用

AUTOMATICA 1987年第1期23卷 41-55页

作者： KILGOUR, DM HIPEL, KW FANG, LP Department of Systems Design Engineering University of Waterloo Waterloo Ontario Canada N2L 3G1

The graph model for conflicts is developed as a comprehensive methodology for realistically analyzing real world conflicts. The graph form takes outcomes, rather than individual decisions, as the basic units for describing a conflict. In the graph form, many solution concepts can be formulated for both two-player and multiplayer games. In particular, specific mathematical criteria are presented for categorizing solution concepts which can be used for predicting equilibria in n -player games. One of the criteria on which this taxonomy of solution concepts is based is the number of steps ahead a player may think, in terms of the reactions of other players to his actions. Other criteria include which players take part in the sanctioning process, and whether sanctioning moves are restricted to those which lead to immediate improvements for the mover. In order to demonstrate the insight which decision makers can gain from studying a dispute using the graph model, various solution concepts are applied to an important environmental engineering problem.

关键词： conflict analysis game theory graph model large-scale systems operations research System analysis water resources

来源：评论

学校读者我要写书评

暂无评论

ROBUSTNESS OF EQUILIBRIA IN THE graph model FOR CONFLICT RESOLUTION

引用

Journal of Systems Science and Systems Engineering 2015年第4期24卷 450-465页

作者： Yasser T.Matbouli D.Marc Kilgour Keith W.Hipel Department of Industrial Engineering King Abdulaziz University Department of Systems Design Engineering University of Waterloo Department of Mathematics Wilfrid Laurier University Centre for International Governance Innovation(CIGI)

A novel approach for assessing the robustness of an equilibrium in conflict resolution is presented. Roughly, an equilibrium is robust if it is resilient, or resistant to deviation. Robustness assessment is based on a new concept called Level of Freedom, which evaluates the relative freedom of a decision maker to escape an equilibrium. Resolutions of a conflict can be affected by changes in decision makers＇ preferences, which may destabilize an equilibrium, causing the conflict to evolve. Hence, a conflict may become long-term and thereby continue to evolve, even after reaching an equilibrium. The new robustness measure is used to rank equilibria based on robustness, to facilitate distinguishing equiiibria that are relatively sustainable. An absolutely robust equilibrium is a special case in which the level of freedom is at an absolute minimum for each individual stability definition.

关键词： Robustness equilibria level of freedom conflict evolution graph model

来源：评论

学校读者我要写书评

暂无评论

Maximinh Stability in the graph model for Conflict Resolution for Bilateral Conflicts

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2020年第10期50卷 3760-3769页

作者： Rego, Leandro Chaves Vieira, Giannini Italino Alves Univ Fed Ceara Stat & Appl Math Dept BR-60455760 Fortaleza Ceara Brazil Univ Fed Pernambuco Grad Program Stat BR-50670901 Recife PE Brazil Univ Fed Pernambuco Grad Program Management Engn BR-50670901 Recife PE Brazil Univ Fed Ceara Crateus Campus BR-63700000 Crateus Brazil Univ Fed Ceara Grad Program Modeling & Quantitat Methods BR-60455760 Fortaleza Ceara Brazil

In this paper, our objective is to propose a stability concept within the graph model for conflict resolution (GMCR) that does not require knowledge about preferences of other decision makers (DMs) in the conflict and is flexible to analyze the conflict with variable horizon. For that we propose the use of the maximin decision rule within the GMCR. More specifically, we consider a GMCR with two DMs and introduce the concept of Maximin(h) stability with horizon h for a given DM. The Maximin(h) stability concept was inspired by the notion of limited-move stability with horizon h present in the GMCR literature and it is adequate for modeling cautious DMs in conflicts where they have no knowledge about the other DM's preferences. We establish what is the relationship among the Maximin(h) stabilities for different horizons and the relationship among Maximin(h) stability and other GMCR stability concepts. Finally, we present an application to illustrate the proposed stability concept, namely, a neuroscience technological selection conflict in China.

关键词： Stability criteria Thermal stability Mathematical model Analytical models Probabilistic logic Neuroscience Conflict resolutions graph model maximin stability concepts technological selection

来源：评论

学校读者我要写书评

暂无评论

Fuzzy option prioritization for the graph model for conflict resolution

引用

FUZZY SETS AND SYSTEMS 2014年 246卷 34-48页

作者： Bashar, M. Abul Kilgour, D. Marc Hipel, Keith W. Univ Waterloo Dept Syst Design Engn Waterloo ON N2L 3G1 Canada Wilfrid Laurier Univ Dept Math Waterloo ON N2L 3C5 Canada

A fuzzy option prioritization technique is developed to efficiently model uncertain preferences of DMs in strategic conflicts as fuzzy preferences by using the decision makers' (DMs') fuzzy truth values of preference statements at feasible states within the framework of the graph model for Conflict Resolution. The preference statements of a DM express desirable combinations of options or courses of action, and are listed in order of importance. A fuzzy truth value is a truth degree, expressed as a number between 0 and 1, capturing uncertainty in the truth of a preference statement at a feasible state. A fuzzy preference formula is introduced based on the fuzzy truth values of preference statements, and it is established that the output of this formula is a fuzzy preference relation. It is shown that fuzzy option prioritization can also be used when the truth values of preference statements at feasible states are completely based on Boolean logic, thereby generating a crisp preference over feasible states that is the same as would be found by employing the existing crisp option prioritization, making the crisp option prioritization technique a special case of the fuzzy option prioritization methodology. To demonstrate how this methodology can be employed to represent fuzzy preferences in real-world decision problems, fuzzy option prioritization is applied to an actual dispute over groundwater contamination that took place in Elmira, Ontario, Canada. (c) 2014 Elsevier B.V. All rights reserved.

关键词： graph model Preference statement Fuzzy truth value Fuzzy score interval Fuzzy option prioritization Fuzzy preference

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Preferences in the graph model for Conflict Resolution

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2015年第4期45卷 595-608页

作者： Rego, Leandro C. dos Santos, Andrea Maria Univ Fed Pernambuco Dept Stat BR-50740540 Recife PE Brazil Inst Fed Educ Ciencia & Tecnol Pernambuco BR-55590000 Recife PE Brazil Univ Fed Pernambuco Grad Program Stat BR-50740540 Recife PE Brazil

We present a generalization of the graph model for conflict resolution, introducing the possibility of decision makers (DMs) expressing their preferences among the possible scenarios through probabilistic preferences. In this new scenario, four stability definitions (solution concepts) are proposed: 1) alpha-Nash stability;2) (alpha, beta)-metarationality;3) (alpha, beta)-symmetric metarationality;and 4) (alpha, beta, gamma)-sequential stability. We deal with conflicts that involve two or more DMs. Relationships between these definitions are demonstrated, as well as an analysis of how the values of the parameters alpha, beta, and. influence the set of stable states is made. Applications of the proposed model to conflicts involving two and three DMs are presented. The analysis of these applications highlights the advantages gained by allowing individuals to express their preferences probabilistically.

关键词： Conflict graph model preference uncertainty probabilistic preferences stability notions

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：