書目名稱Graph-Based Representations in Pattern Recognition影響因子(影響力)學科排名
書目名稱Graph-Based Representations in Pattern Recognition網(wǎng)絡(luò)公開度
書目名稱Graph-Based Representations in Pattern Recognition網(wǎng)絡(luò)公開度學科排名
書目名稱Graph-Based Representations in Pattern Recognition被引頻次
書目名稱Graph-Based Representations in Pattern Recognition被引頻次學科排名
書目名稱Graph-Based Representations in Pattern Recognition年度引用
書目名稱Graph-Based Representations in Pattern Recognition年度引用學科排名
書目名稱Graph-Based Representations in Pattern Recognition讀者反饋
書目名稱Graph-Based Representations in Pattern Recognition讀者反饋學科排名
作者: Classify 時間: 2025-3-21 21:39 作者: expunge 時間: 2025-3-22 03:43 作者: happiness 時間: 2025-3-22 06:33
Probabilistic Relaxation Labeling by Fokker-Planck Diffusion on a Graphbabilities. The state vector evolves with time according to the Fokker-Planck equation. We show how the solution state vector can be estimated using the spectrum of the Laplacian matrix for the weighted support graph. Experiments on various data clustering tasks show effectiveness of our new algorithm.作者: 倒轉(zhuǎn) 時間: 2025-3-22 12:06
https://doi.org/10.1007/1-84628-178-4e numerical values associated to the nodes and edges of the graphs. The adaptation of a greedy graph matching algorithm with the new scoring function demonstrates significant performance improvements over traditional exhaustive searches of graph matching.作者: 美食家 時間: 2025-3-22 15:38 作者: 美食家 時間: 2025-3-22 17:45
https://doi.org/10.1007/978-1-4020-8327-3An analysis of the quantum walk in the presence of structural errors between graphs is used as the basis of the consistency measure. We test the performance of this measure on graphs derived from images in the COIL-100 database.作者: Inertia 時間: 2025-3-22 23:18
Graph Based Shapes Representation and Recognitione numerical values associated to the nodes and edges of the graphs. The adaptation of a greedy graph matching algorithm with the new scoring function demonstrates significant performance improvements over traditional exhaustive searches of graph matching.作者: 影響帶來 時間: 2025-3-23 02:30
A Bound for Non-subgraph Isomorphismt a subgraph isomorphism don’t exist in the problem instance. But note that conversely, a negative lower bound does not imply that a subgraph isomorphism must be present and only indicates that a subgraph isomorphism is still possible.作者: 假 時間: 2025-3-23 07:21
A Correspondence Measure for Graph Matching Using the Discrete Quantum WalkAn analysis of the quantum walk in the presence of structural errors between graphs is used as the basis of the consistency measure. We test the performance of this measure on graphs derived from images in the COIL-100 database.作者: Dri727 時間: 2025-3-23 13:45 作者: Guileless 時間: 2025-3-23 16:43
A Quadratic Programming Approach to the Graph Edit Distance Problemrmulation for the minimization of fuzzy edit costs. Experiments on real-world graph data demonstrate that our proposed method is able to outperform the standard edit distance method in terms of recognition accuracy on two out of three data sets.作者: 群居動物 時間: 2025-3-23 19:55
Comparing Sets of 3D Digital Shapes Through Topological Structuress of a virtual scene are represented by structural descriptions, this paper deals with the problem of comparing two (or more) sets of 3D objects, where each model is represented by an attributed graph. We will define a new distance to estimate the possible similarities among the sets of graphs and we will validate our work using a shape graph [1].作者: Hippocampus 時間: 2025-3-23 23:13 作者: 分散 時間: 2025-3-24 03:40 作者: 發(fā)酵劑 時間: 2025-3-24 07:26 作者: 無政府主義者 時間: 2025-3-24 14:29 作者: Fulminate 時間: 2025-3-24 15:32 作者: squander 時間: 2025-3-24 22:05
Studies in Behavioural Adaptation define in which order the structures have to be recognized. We propose to address this problem of order definition by developing algorithms that automatically deduce sequential segmentation paths from fuzzy spatial attribute graphs. As an illustration, these algorithms are applied on brain image understanding.作者: NATAL 時間: 2025-3-25 02:14
https://doi.org/10.1007/978-1-84628-909-5perceptual geometric information. Finally, a graph-based segmenter is utilized for extracting the different geometric structures present in the scene through a region-growing procedure that is applied hierarchically. The proposed algorithm is evaluated on real 3D scenes acquired with a trinocular camera.作者: receptors 時間: 2025-3-25 03:42 作者: Sputum 時間: 2025-3-25 09:22 作者: arthroplasty 時間: 2025-3-25 12:41 作者: INTER 時間: 2025-3-25 16:41
Modelling in Public Health Researchers, which represent segments of a video. The resulting structure defines a hierarchically segmented video tree. Comparative performance results of different types of scripted content videos are demonstrated.作者: Budget 時間: 2025-3-25 23:08 作者: exceptional 時間: 2025-3-26 02:37 作者: 可互換 時間: 2025-3-26 07:52
Image Classification Using Marginalized Kernels for Graphsutes. In the second one, we use kernel functions to project the graphs in a mathematical space that allows the use of performant classification algorithms. Experiments are performed on medical images acquired with various modalities and concerning different parts of the body.作者: 導師 時間: 2025-3-26 12:12
Graph-Based Multilevel Temporal Segmentation of Scripted Content Videosers, which represent segments of a video. The resulting structure defines a hierarchically segmented video tree. Comparative performance results of different types of scripted content videos are demonstrated.作者: 含水層 時間: 2025-3-26 14:01 作者: AMBI 時間: 2025-3-26 20:11 作者: Communicate 時間: 2025-3-26 21:38 作者: 必死 時間: 2025-3-27 04:34 作者: sorbitol 時間: 2025-3-27 08:59
https://doi.org/10.1007/1-84628-178-4re generated. Thus, the nodes of the graph represent shape primitives like vectors and quadrilaterals while arcs describing the mutual primitives relations. To be invariant to transformations such as rotation and scaling, relative geometric features extracted from primitives are associated to nodes 作者: Pandemic 時間: 2025-3-27 13:27 作者: 手榴彈 時間: 2025-3-27 15:40
https://doi.org/10.1007/978-3-662-44009-4graphs can be found. The computation is based on the SDP relaxation of a – to the best of our knowledge – new combinatorial optimisation formulation for subgraph isomorphism. We consider problem instances where only the structures of the two graph instances are given and therefore we deal with simpl作者: Phonophobia 時間: 2025-3-27 19:13
https://doi.org/10.1007/978-1-4020-8327-3aph that connects pairs of vertices from the graphs to be matched by way of auxiliary vertices. A coined quantum walk is simulated on this auxiliary graph and the quantum interference on the auxiliary vertices indicates possible matches. When dealing with graphs for which there is no exact match, th作者: majestic 時間: 2025-3-28 02:01 作者: 無法治愈 時間: 2025-3-28 04:37 作者: 平常 時間: 2025-3-28 07:28
Jean Thoma,Belkacem Ould Bouamamatation, recognition and manipulation of both the complete virtual scenes and even of subparts of them are still open problems..Once the main components of a virtual scene are represented by structural descriptions, this paper deals with the problem of comparing two (or more) sets of 3D objects, wher作者: candle 時間: 2025-3-28 11:28
Robert Macredie,Ray Paul,Shamim Warwickrm. Irregular pyramids are defined as a stack of graphs successively reduced. Within this framework, the scale is often defined implicitly as the height in the pyramid. However, each level of an irregular pyramid can not usually be readily associated to the global optimum of an energy or a global cr作者: 薄荷醇 時間: 2025-3-28 14:35
Studies in Behavioural Adaptationce characteristics. Graphs are well adapted to represent such information. Sequential methods for knowledge-based recognition of structures require to define in which order the structures have to be recognized. We propose to address this problem of order definition by developing algorithms that auto作者: 鋼筆記下懲罰 時間: 2025-3-28 19:27 作者: 有組織 時間: 2025-3-29 02:13 作者: Outwit 時間: 2025-3-29 03:54 作者: 預防注射 時間: 2025-3-29 07:50
https://doi.org/10.3920/978-90-8686-712-7the spatially varying nature of most images, which are much better modeled as piecewise smooth. This paper advocates the concept of local influence neighbourhoods (LINs). The influence neighbourhood of a pixel is defined as the set of neighbouring pixels which have a causal influence on it. LINs can作者: GUILT 時間: 2025-3-29 14:16
Modelling of Complex Signals in Nerves pixel lattice using a weighted undirected graph. The edge weights of the graph are determined by the Gaussian weighted distances between local neighbouring windows. We then compute the associated Laplacian matrix (the degree matrix minus the adjacency matrix). Anisotropic diffusion across this weig作者: 惡心 時間: 2025-3-29 18:36 作者: Bone-Scan 時間: 2025-3-29 20:51 作者: Demulcent 時間: 2025-3-30 01:35
Matching of Tree Structures for Registration of Medical Images placing landmarks in the images. In this paper we propose a method which is able to find reasonable landmarks automatically. To achieve this, nodes of the vessel systems, which have been extracted from the images by a segmentation algorithm, will be assigned by the so-called association graph metho作者: 斜坡 時間: 2025-3-30 04:41 作者: conquer 時間: 2025-3-30 11:57
Stereo Vision for Obstacle Detection: A Graph-Based Approach 3D scene is not needed; rather, it is more important to have a fast localization of the obstacles to avoid them. All the methods in the literature, based on a punctual stereo matching, are ineffective in realistic contexts because they are either computationally too expensive, or unable to deal wit作者: 壓艙物 時間: 2025-3-30 15:52 作者: fastness 時間: 2025-3-30 20:14 作者: 間諜活動 時間: 2025-3-31 00:02
A Bound for Non-subgraph Isomorphismgraphs can be found. The computation is based on the SDP relaxation of a – to the best of our knowledge – new combinatorial optimisation formulation for subgraph isomorphism. We consider problem instances where only the structures of the two graph instances are given and therefore we deal with simpl作者: DEI 時間: 2025-3-31 03:58 作者: 思想靈活 時間: 2025-3-31 06:50
A Quadratic Programming Approach to the Graph Edit Distance Problem respect to a minimum-cost edit path between graphs, we introduce the notion of fuzzy edit paths between graphs and provide a quadratic programming formulation for the minimization of fuzzy edit costs. Experiments on real-world graph data demonstrate that our proposed method is able to outperform th作者: 織物 時間: 2025-3-31 10:06
Image Classification Using Marginalized Kernels for Graphslized kernels to image processing. In machine learning, performant algorithms have been developed for data organized as real valued arrays; these algorithms are used for various purposes like classification or regression. However, they are inappropriate for direct use on complex data sets. Our work 作者: 劇毒 時間: 2025-3-31 16:53
Comparing Sets of 3D Digital Shapes Through Topological Structurestation, recognition and manipulation of both the complete virtual scenes and even of subparts of them are still open problems..Once the main components of a virtual scene are represented by structural descriptions, this paper deals with the problem of comparing two (or more) sets of 3D objects, wher作者: Rejuvenate 時間: 2025-3-31 18:26 作者: GLEAN 時間: 2025-3-31 22:17 作者: obsolete 時間: 2025-4-1 03:56
Graph-Based Perceptual Segmentation of Stereo Vision 3D Images at Multiple Abstraction Levelsss geometric filter is first applied to the given cloud of 3D points to remove noise. The tensor voting algorithm is then applied in order to extract perceptual geometric information. Finally, a graph-based segmenter is utilized for extracting the different geometric structures present in the scene 作者: anniversary 時間: 2025-4-1 09:55 作者: Ablation 時間: 2025-4-1 11:20 作者: Strength 時間: 2025-4-1 15:47
Deducing Local Influence Neighbourhoods with Application to Edge-Preserving Image Denoisingthe spatially varying nature of most images, which are much better modeled as piecewise smooth. This paper advocates the concept of local influence neighbourhoods (LINs). The influence neighbourhood of a pixel is defined as the set of neighbouring pixels which have a causal influence on it. LINs can作者: Mendicant 時間: 2025-4-1 18:32
Graph Spectral Image Smoothing pixel lattice using a weighted undirected graph. The edge weights of the graph are determined by the Gaussian weighted distances between local neighbouring windows. We then compute the associated Laplacian matrix (the degree matrix minus the adjacency matrix). Anisotropic diffusion across this weig作者: interference 時間: 2025-4-2 01:54
