書(shū)目名稱(chēng)Graph-Based Representations in Pattern Recognition影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Graph-Based Representations in Pattern Recognition網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Graph-Based Representations in Pattern Recognition網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Graph-Based Representations in Pattern Recognition被引頻次
書(shū)目名稱(chēng)Graph-Based Representations in Pattern Recognition被引頻次學(xué)科排名
書(shū)目名稱(chēng)Graph-Based Representations in Pattern Recognition年度引用
書(shū)目名稱(chēng)Graph-Based Representations in Pattern Recognition年度引用學(xué)科排名
書(shū)目名稱(chēng)Graph-Based Representations in Pattern Recognition讀者反饋
書(shū)目名稱(chēng)Graph-Based Representations in Pattern Recognition讀者反饋學(xué)科排名
作者: 薄膜 時(shí)間: 2025-3-21 23:42 作者: Delirium 時(shí)間: 2025-3-22 01:28 作者: 倔強(qiáng)一點(diǎn) 時(shí)間: 2025-3-22 06:48
Modelling Small Deformations of PolycrystalsWe present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connected induced subgraphs of the input graphs. Experimental results are provided.作者: CUR 時(shí)間: 2025-3-22 09:54 作者: 招人嫉妒 時(shí)間: 2025-3-22 14:31 作者: 招人嫉妒 時(shí)間: 2025-3-22 19:46 作者: 善變 時(shí)間: 2025-3-22 21:27 作者: 約會(huì) 時(shí)間: 2025-3-23 03:37 作者: Synapse 時(shí)間: 2025-3-23 06:08
A Vascular Network Growth Estimation Algorithm Using Random Graphs (intussusception). Graph theory is a branch of discrete mathematics that is excellently suited to model vascular networks and to analyze their properties (invariants). A random graph process model can simulate the development of a vascular network that has been modeled using graph theory. The renal作者: Exposure 時(shí)間: 2025-3-23 11:18
A Linear Generative Model for Graph Structurejacency matrix. We commence by using correspondence information to place the nodes of each of a set of graphs in a standard reference order. Using the correspondences order, we convert the adjacency matrices to long-vectors and compute the long-vector covariance matrix. By projecting the vectorised 作者: Graves’-disease 時(shí)間: 2025-3-23 15:43
Graph Seriation Using Semi-definite Programmingn important task in network analysis problem in routine and bioinformatics. In this paper we show how the problem of graph seriation can be solved using semi-definite programming (SDP). This is a convex optimisation procedure that has recently found widespread use in computer vision. The main contri作者: 吹牛需要藝術(shù) 時(shí)間: 2025-3-23 18:50
Comparing String Representations and Distances in a Natural Images Classification Taskterest detected thanks to an interest point detector. These salient zones are characterized by local signatures describing singularities and they are linked by using graph seriation algorithms and perceptual methods. Once each image is represented by a string of signatures, we propose to use string-作者: 類(lèi)型 時(shí)間: 2025-3-23 23:54
Reduction Strings: A Representation of Symbolic Hierarchical Graphs Suitable for Learningrgeted for learning the rules, since it contains information about which rules were applied, but also because it can be used to easily define the space of all possible pyramids as a .. We also consider restraining the possible rules to some basic ones in order to make the reduction trees easy to bui作者: 姑姑在炫耀 時(shí)間: 2025-3-24 03:20 作者: 禁令 時(shí)間: 2025-3-24 06:50 作者: BARGE 時(shí)間: 2025-3-24 11:50
The ,: A Unified Representation for Topology and Geometrybased information, and its interface is carefully designed to support a variety of automatic and interactive segmentation methods. We have successfully used the abstract concept of a . as a foundation for the implementation of well-known segmentation methods.作者: craven 時(shí)間: 2025-3-24 16:55 作者: 笨重 時(shí)間: 2025-3-24 21:22
Towards Unitary Representations for Graph Matchingeas from the field of quantum computing we recall the definition of the unitary matrices inducing quantum walks. We show how the spectra of these matrices are related to the spectra of the transition matrices of classical walks. Despite this relationship the behaviour of quantum walks is vastly diff作者: defendant 時(shí)間: 2025-3-25 01:58
Reactive Tabu Search for Measuring Graph Similarityrant graph matching, giving rise to different graph similarity measures. A first goal of this paper is to show that these different measures can be viewed as special cases of a generic similarity measure introduced in [8]. This generic similarity measure is based on a non-bijective graph matching (l作者: scrutiny 時(shí)間: 2025-3-25 06:58 作者: 失眠癥 時(shí)間: 2025-3-25 09:02 作者: 忘恩負(fù)義的人 時(shí)間: 2025-3-25 12:46
Coarse-to-Fine Object Recognition Using Shock Graphsctly segmented. In this paper, we present a framework for shock graph-based object recognition in less contrived scenes. The approach consists of two steps, beginning with the construction of a region adjacency graph pyramid. For a given region, we traverse this scale-space, using a model shock grap作者: 發(fā)展 時(shí)間: 2025-3-25 19:44
https://doi.org/10.1007/978-3-030-93383-8 a lot of problems of operational research and combinatorial optimization. Hypergraphs are now used in many domains such as chemistry, engineering and image processing. We present an overview of a hypergraph-based picture representation giving much application in picture manipulation, analysis and r作者: 排名真古怪 時(shí)間: 2025-3-25 23:14
https://doi.org/10.1007/978-3-031-63091-0sequently used in image processing and understanding. A digital image is processed to extract edge pixel chains and a constrained Delaunay triangulation of the edge contour set is performed to yield triangles that cover the pixelated image without crossing edge contours. Each triangle is attributed 作者: 去才蔑視 時(shí)間: 2025-3-26 01:28
https://doi.org/10.1007/978-3-662-08797-8ved: a graph representing the contents of a document image at some level of interpretation, a set of graph transformation rules (graph productions), and a mechanism for controlling the application of the graph productions. We review existing document analysis systems that use graph transformation, a作者: Explosive 時(shí)間: 2025-3-26 06:34
Modelling Future Telecommunications Systemsgnition systems. We present here a “generic” formalism for graphical knowledge, allowing various modellings for a given graphical shape. We use a modelling library based on this formalism for the management of our graphical knowledge. The use of this library allows to request graphical knowledge dat作者: Nucleate 時(shí)間: 2025-3-26 11:23
Modelling Hot Deformation of Steels (intussusception). Graph theory is a branch of discrete mathematics that is excellently suited to model vascular networks and to analyze their properties (invariants). A random graph process model can simulate the development of a vascular network that has been modeled using graph theory. The renal作者: foreign 時(shí)間: 2025-3-26 13:15 作者: 比喻好 時(shí)間: 2025-3-26 18:45
https://doi.org/10.1007/978-94-007-7648-7n important task in network analysis problem in routine and bioinformatics. In this paper we show how the problem of graph seriation can be solved using semi-definite programming (SDP). This is a convex optimisation procedure that has recently found widespread use in computer vision. The main contri作者: Assignment 時(shí)間: 2025-3-26 21:11
Corinna Elsenbroich,Nigel Gilbertterest detected thanks to an interest point detector. These salient zones are characterized by local signatures describing singularities and they are linked by using graph seriation algorithms and perceptual methods. Once each image is represented by a string of signatures, we propose to use string-作者: 使苦惱 時(shí)間: 2025-3-27 04:19 作者: 一再煩擾 時(shí)間: 2025-3-27 07:15
https://doi.org/10.1007/978-3-642-15923-7he regions of a segmented image but most of them are dedicated to a specific method. Among the non hierarchical models, the model of planar maps with discrete embedding is certainly the most versatile one. Maps have the great advantage to provide a continuity of representation from the abstract math作者: ineffectual 時(shí)間: 2025-3-27 12:42 作者: Brochure 時(shí)間: 2025-3-27 16:24
https://doi.org/10.1007/978-3-030-62547-4based information, and its interface is carefully designed to support a variety of automatic and interactive segmentation methods. We have successfully used the abstract concept of a . as a foundation for the implementation of well-known segmentation methods.作者: 不吉祥的女人 時(shí)間: 2025-3-27 20:41 作者: 合同 時(shí)間: 2025-3-27 23:40
Modelling Rock Fracturing Processeseas from the field of quantum computing we recall the definition of the unitary matrices inducing quantum walks. We show how the spectra of these matrices are related to the spectra of the transition matrices of classical walks. Despite this relationship the behaviour of quantum walks is vastly diff作者: Transfusion 時(shí)間: 2025-3-28 02:44
Modelling Supply Chain Dynamicsrant graph matching, giving rise to different graph similarity measures. A first goal of this paper is to show that these different measures can be viewed as special cases of a generic similarity measure introduced in [8]. This generic similarity measure is based on a non-bijective graph matching (l作者: infringe 時(shí)間: 2025-3-28 08:22
https://doi.org/10.1007/978-981-10-2410-8ed from CT-Scan images acquired at different time, and then modeled as trees. The goal of this algorithm is to find common bifurcations (nodes) and vessels (edges) in both trees..Starting from the tree root, edges and nodes are iteratively matched. The algorithm works on a set of matching hypotheses作者: 碳水化合物 時(shí)間: 2025-3-28 12:43
https://doi.org/10.1007/978-981-19-1964-0When captured in a video sequence, some interactions manifest themselves as occlusions. A visual tracking system must be able to track objects which are partially or even fully occluded. In this paper we present a novel method of tracking objects through occlusions using a multi-resolution represent作者: Custodian 時(shí)間: 2025-3-28 18:29
https://doi.org/10.1007/978-1-4613-2267-2ctly segmented. In this paper, we present a framework for shock graph-based object recognition in less contrived scenes. The approach consists of two steps, beginning with the construction of a region adjacency graph pyramid. For a given region, we traverse this scale-space, using a model shock grap作者: integrated 時(shí)間: 2025-3-28 18:57
Graph-Based Representations in Pattern Recognition作者: Mendicant 時(shí)間: 2025-3-29 01:48
Inside and Outside Within Combinatorial Pyramidsow to distinguish inside and outside of the loop by local computations. We provide a method based on the combinatorial pyramid framework which uses the orientation explicitly encoded by combinatorial maps to determine inside and outside with local calculus.作者: 獨(dú)白 時(shí)間: 2025-3-29 03:11 作者: Arthropathy 時(shí)間: 2025-3-29 09:25 作者: SYN 時(shí)間: 2025-3-29 13:35
Modelling Hot Deformation of Steelsiven renal glomerulus can be estimated by the invariants (root distance, radius, and diameter) of the graph representing the renal glomerulus network. Experimental evidence is given to support this conjecture.作者: 膽大 時(shí)間: 2025-3-29 17:53
https://doi.org/10.1007/978-3-642-15923-7tion and we show how to design, implement and use a general environment for 2D image segmentation, from the mathematical model up to a real application. The model, data structure, algorithms and API described in this paper are currently implemented in a software which will be available under LGPL in the course of year 2005.作者: 完全 時(shí)間: 2025-3-29 21:42 作者: blackout 時(shí)間: 2025-3-30 00:37 作者: 束以馬具 時(shí)間: 2025-3-30 05:02 作者: ANTI 時(shí)間: 2025-3-30 08:42 作者: Obscure 時(shí)間: 2025-3-30 15:24 作者: fodlder 時(shí)間: 2025-3-30 19:06
https://doi.org/10.1007/978-3-662-08797-8nd a mechanism for controlling the application of the graph productions. We review existing document analysis systems that use graph transformation, and discuss challenges and research opportunities in this area.作者: Observe 時(shí)間: 2025-3-30 20:46
https://doi.org/10.1007/978-3-030-46732-6 correspondences order, we convert the adjacency matrices to long-vectors and compute the long-vector covariance matrix. By projecting the vectorised adjacency matrices onto the leading eigenvectors of the covariance matrix, we embed the graphs in a pattern-space. We illustrate the utility of the resulting method for shape-analysis.作者: inventory 時(shí)間: 2025-3-31 04:45
Modelling Ocean Climate Variabilitye of all possible pyramids as a .. We also consider restraining the possible rules to some basic ones in order to make the reduction trees easy to build, and a way to use them for learning will be presented.作者: 創(chuàng)造性 時(shí)間: 2025-3-31 05:19 作者: 諷刺滑稽戲劇 時(shí)間: 2025-3-31 13:10 作者: 多產(chǎn)魚(yú) 時(shí)間: 2025-3-31 14:59 作者: 內(nèi)向者 時(shí)間: 2025-3-31 20:18
Reactive Tabu Search for Measuring Graph Similarityto a set of vertices. In a second part, we address the problem of computing this measure and we describe two algorithms: a greedy algorithm, that quickly computes sub-optimal solutions, and a reactive Tabu search algorithm, that may improve these solutions. Some experimental results are given.作者: Salivary-Gland 時(shí)間: 2025-4-1 01:36
Tree Matching Applied to Vascular Systeminally, this algorithm is validated on the Visible Human with synthetic deformations thanks to the simulator prototype developed at the INRIA which provides realistic deformations for liver and its vascular network.作者: Absenteeism 時(shí)間: 2025-4-1 04:01 作者: 功多汁水 時(shí)間: 2025-4-1 06:22
A Linear Generative Model for Graph Structure correspondences order, we convert the adjacency matrices to long-vectors and compute the long-vector covariance matrix. By projecting the vectorised adjacency matrices onto the leading eigenvectors of the covariance matrix, we embed the graphs in a pattern-space. We illustrate the utility of the resulting method for shape-analysis.作者: 形容詞 時(shí)間: 2025-4-1 13:42
Reduction Strings: A Representation of Symbolic Hierarchical Graphs Suitable for Learninge of all possible pyramids as a .. We also consider restraining the possible rules to some basic ones in order to make the reduction trees easy to build, and a way to use them for learning will be presented.
