標(biāo)題: Titlebook: ; [打印本頁(yè)] 作者: 延展 時(shí)間: 2025-3-21 18:44
書(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網(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é)科排名
作者: Ophthalmoscope 時(shí)間: 2025-3-21 21:41
Peter Prechtl,Franz-Peter Burkardnumber of matching algorithms for graphs with unique node labels are developed. It is shown that problems such as graph isomorphism, subgraph isomorphism, maximum common subgraph and others have a computational complexity that is only quadratic in the number of nodes. We also discuss some potential 作者: 背帶 時(shí)間: 2025-3-22 01:11
Hare Krishna-Bewegung (ISKCON), factor higher than 2.0. Thus, the new method yields a higher reduction factor than the stochastic decimation algorithm (MIS) and maximal independent edge set (MIES), in all tests. This means the number of vertices in the subgraph induced by any set of contractible edges is reduced to half or less b作者: 仇恨 時(shí)間: 2025-3-22 05:46
https://doi.org/10.1007/978-3-476-03704-6esent, code, and analyze many problems in computer vision. By explicitly modeling functional dependences by a hypergraph, we obtain a structure well-adapted to information retrieval and processing. Thanks to the functional dependences, we show how all the variables involved in a functional graphical作者: insomnia 時(shí)間: 2025-3-22 08:47 作者: 擁擠前 時(shí)間: 2025-3-22 13:40
https://doi.org/10.1007/978-3-476-00091-0 representation and a geometrical representation of the regions of the segmented image. In both models the description of the topology lays on topological maps with a combinatorial representation. A geometrical embedding of maps is used to describe the geometry of regions. Both models differ in the 作者: 擁擠前 時(shí)間: 2025-3-22 18:13 作者: Diaphragm 時(shí)間: 2025-3-22 21:32
https://doi.org/10.1007/978-3-476-03487-8e a system of self-organizing maps representing attribute distance spaces that encode edit operation costs. The self-organizing maps are iteratively adapted to minimize the edit distance of those graphs that are required to be similar. To demonstrate the learning effect, the distance model is applie作者: palpitate 時(shí)間: 2025-3-23 03:58
https://doi.org/10.1007/978-3-476-00496-3This scheme is useful in applications where the nodes of the considered graphs represent regions extracted by some segmentation procedure from an image. To demonstrate the feasibility of the proposed method, its application to the automatic identification of diatoms (unicellular algae) is described.作者: SPURN 時(shí)間: 2025-3-23 06:46
https://doi.org/10.1007/978-3-476-03486-1M) algorithm is based on the recently introduced Kronecker Product Graph Matching (KPGM) formulation. However, unlike previous algorithms based on the KPGM formulation which avoided explicit compatibility calculations, the OKKPGM algorithm obtains an estimate to the Kronecker Match Matrix (KMM) usin作者: Enthralling 時(shí)間: 2025-3-23 12:40 作者: Contort 時(shí)間: 2025-3-23 17:33
https://doi.org/10.1007/978-3-476-05985-7mmon subgraph problem, exact and inexact algorithms are known from the literature. Nevertheless, until now no effort has been done for characterizing their performance, mainly for the lack of a large database of graphs. In this paper, three exact and well-known algorithms for maximum common subgraph作者: Freeze 時(shí)間: 2025-3-23 19:19 作者: 弄皺 時(shí)間: 2025-3-23 23:00 作者: deriver 時(shí)間: 2025-3-24 06:09
https://doi.org/10.1007/978-3-476-00129-0on problem that is frequently encountered in computer vision and pattern recognition. Recently, motivated by a linear complementarity formulation, standard pivoting operations on matrices have proven to be effective in attacking this and related problems. An intriguing connection between the maximum作者: 馬具 時(shí)間: 2025-3-24 07:39
https://doi.org/10.1007/978-3-476-00130-6hed into smaller subgraphs. If this is done, then the process may cast into a hierarchical framework or cast in a way which is amenable to parallel computation. In this paper we demonstrate how the Fiedler-vector can be used to partition graphs for the purposes of decomposition. We show how the resu作者: 強(qiáng)制性 時(shí)間: 2025-3-24 13:07
https://doi.org/10.1007/978-3-476-00127-6cency matrix to define eigenmodes of the adjacency matrix. For each eigenmode, we compute vectors of spectral properties. These include the eigenmode perimeter, eigenmode volume, Cheeger number, inter-mode adjacency matrices and intermode edge-distance. We embed these vectors in a pattern-space usin作者: FER 時(shí)間: 2025-3-24 17:08 作者: micronized 時(shí)間: 2025-3-24 21:57
Metzler Lexikon antiker Architekturiation is defined as the set median of the positive edit sequences between any string and the set median. We show how the set deviation can be efficiently used in well known statistical estimation and particularly with the minimum volume ellipsoid estimator. This concept is illustrated on several ex作者: 關(guān)心 時(shí)間: 2025-3-25 02:18
Construction of Combinatorial Pyramids set of vertices in the level below. One connected set of vertices reduced into a single vertex at the above level is called the reduction window of this vertex. In the same way, a connected set of vertices in the base level graph reduced to a single vertex at a given level is called the receptive f作者: 揮舞 時(shí)間: 2025-3-25 07:07
On Graphs with Unique Node Labelsnumber of matching algorithms for graphs with unique node labels are developed. It is shown that problems such as graph isomorphism, subgraph isomorphism, maximum common subgraph and others have a computational complexity that is only quadratic in the number of nodes. We also discuss some potential 作者: 上坡 時(shí)間: 2025-3-25 08:24 作者: Abominate 時(shí)間: 2025-3-25 13:24
Functional Modeling of Structured Imagesesent, code, and analyze many problems in computer vision. By explicitly modeling functional dependences by a hypergraph, we obtain a structure well-adapted to information retrieval and processing. Thanks to the functional dependences, we show how all the variables involved in a functional graphical作者: Reclaim 時(shí)間: 2025-3-25 19:14 作者: ALIBI 時(shí)間: 2025-3-25 22:02 作者: 門(mén)窗的側(cè)柱 時(shí)間: 2025-3-26 03:11 作者: 郊外 時(shí)間: 2025-3-26 07:36
Self-Organizing Graph Edit Distancee a system of self-organizing maps representing attribute distance spaces that encode edit operation costs. The self-organizing maps are iteratively adapted to minimize the edit distance of those graphs that are required to be similar. To demonstrate the learning effect, the distance model is applie作者: Magnitude 時(shí)間: 2025-3-26 11:36 作者: Anthem 時(shí)間: 2025-3-26 12:48
Orthonormal Kernel Kronecker Product Graph MdatchingM) algorithm is based on the recently introduced Kronecker Product Graph Matching (KPGM) formulation. However, unlike previous algorithms based on the KPGM formulation which avoided explicit compatibility calculations, the OKKPGM algorithm obtains an estimate to the Kronecker Match Matrix (KMM) usin作者: vector 時(shí)間: 2025-3-26 18:41
Theoretical Analysis and Experimental Comparison of Graph Matching Algorithms for Database Filteringimilar prototype in the database. Graph matching is a powerful yet computationally expensive procedure. If the sample graph is matched against a large database of model graphs, the size of the database is introduced as an additional factor into the overall complexity of the matching process. Databas作者: circumvent 時(shí)間: 2025-3-27 00:57 作者: NICE 時(shí)間: 2025-3-27 01:43 作者: jumble 時(shí)間: 2025-3-27 07:01
Graph Matching Using Spectral Seriation and String Edit Distancetance is that it lacks the formality and rigour of the computation of string edit distance. Hence, our aim is to convert graphs to string sequences so that string matching techniques can be used. To do this we use graph spectral seriation method to convert the adjacency matrix into a string or seque作者: 賞心悅目 時(shí)間: 2025-3-27 11:45 作者: 不開(kāi)心 時(shí)間: 2025-3-27 14:58
Graph Partition for Matchinghed into smaller subgraphs. If this is done, then the process may cast into a hierarchical framework or cast in a way which is amenable to parallel computation. In this paper we demonstrate how the Fiedler-vector can be used to partition graphs for the purposes of decomposition. We show how the resu作者: craving 時(shí)間: 2025-3-27 18:55
Spectral Clustering of Graphscency matrix to define eigenmodes of the adjacency matrix. For each eigenmode, we compute vectors of spectral properties. These include the eigenmode perimeter, eigenmode volume, Cheeger number, inter-mode adjacency matrices and intermode edge-distance. We embed these vectors in a pattern-space usin作者: 因無(wú)茶而冷淡 時(shí)間: 2025-3-27 22:14 作者: 樂(lè)意 時(shí)間: 2025-3-28 05:27
Some Experiments on Clustering a Set of Stringsiation is defined as the set median of the positive edit sequences between any string and the set median. We show how the set deviation can be efficiently used in well known statistical estimation and particularly with the minimum volume ellipsoid estimator. This concept is illustrated on several ex作者: 誤傳 時(shí)間: 2025-3-28 10:08
https://doi.org/10.1007/978-3-476-00127-6ctral pattern vectors. The second approach involves performing multidimensional scaling on the L2 norm for pairs of pattern vectors. We illustrate the utility of the embedding methods on neighbourhood graphs representing the arrangement of corner features in 2D images of 3D polyhedral objects.作者: acrobat 時(shí)間: 2025-3-28 13:23
Spectral Clustering of Graphsctral pattern vectors. The second approach involves performing multidimensional scaling on the L2 norm for pairs of pattern vectors. We illustrate the utility of the embedding methods on neighbourhood graphs representing the arrangement of corner features in 2D images of 3D polyhedral objects.作者: 牙齒 時(shí)間: 2025-3-28 17:58
https://doi.org/10.1007/978-3-476-05002-1ffer an explicit encoding of the orientation of edges around vertices. This paper describes the construction scheme of a Combinatorial Pyramid. We also provide a constructive definition of the notions of reduction windows and receptive fields within the Combinatorial Pyramid framework.作者: finale 時(shí)間: 2025-3-28 20:04 作者: 戰(zhàn)勝 時(shí)間: 2025-3-29 01:47
Construction of Combinatorial Pyramidsffer an explicit encoding of the orientation of edges around vertices. This paper describes the construction scheme of a Combinatorial Pyramid. We also provide a constructive definition of the notions of reduction windows and receptive fields within the Combinatorial Pyramid framework.作者: 脫水 時(shí)間: 2025-3-29 07:04
Graph Matching Using Spectral Seriation and String Edit Distanceh for edit cost is the negative logarithm of the a posteriori sequence alignment probability. To compute the string alignment probability we provide models of the edge compatibility error and the probability of individual node correspondences.作者: GULLY 時(shí)間: 2025-3-29 09:41 作者: Institution 時(shí)間: 2025-3-29 11:37
Tree Edit Distance from Information Theory node in the archetype the probability that the node is present in a sample. A minimum descriptor length formulation is then used to estimate the structure and parameters of this tree model as well as the node-correspondences between trees in the sample-set and the tree model.作者: Bravado 時(shí)間: 2025-3-29 18:37 作者: MAUVE 時(shí)間: 2025-3-29 22:07
Orthonormal Kernel Kronecker Product Graph Mdatching KPGM formulation which avoided explicit compatibility calculations, the OKKPGM algorithm obtains an estimate to the Kronecker Match Matrix (KMM) using kernel function evaluations. A permutation sub-matrix (match matrix), is then inferred from the KMM using a summation procedure.作者: Nucleate 時(shí)間: 2025-3-30 01:16
Comparison of Distance Measures for Graph-Based Clustering of Documents is evaluated using five different graph distance measures under three clustering performance indices. The experiments are performed on two separate document collections. The results show the graph-based approach performs as well as vector-based methods or even better when using normalized graph distance measures.作者: 門(mén)窗的側(cè)柱 時(shí)間: 2025-3-30 07:53
Some Experiments on Clustering a Set of Stringsntly used in well known statistical estimation and particularly with the minimum volume ellipsoid estimator. This concept is illustrated on several examples and particularly in clustering a set of shapes coded as strings using the Freeman code.作者: aggressor 時(shí)間: 2025-3-30 08:19
https://doi.org/10.1007/978-3-476-03704-6 model can be stored efficiently. We derive from that result a description length of general FGMs which can be used to achieve model selection for example. We demonstrate their relevance for capturing regularities in data by giving examples of functional models coding 1D signals and 2D images.作者: Ancillary 時(shí)間: 2025-3-30 15:53
https://doi.org/10.1007/978-3-476-00091-0way of defining this embedding. The aim of this paper is to compare these two models from the point of view of their interest for image segmentation, and to explore the possibility and the interest of making both these models converge.作者: heterogeneous 時(shí)間: 2025-3-30 19:33
https://doi.org/10.1007/978-3-476-00088-0e filtering procedures are used to reduce the impact of this additional factor. In this paper we report the results of a basic study on the relation between filtering efficiency and graph matching algorithm performance, using different graph matching algorithms for isomorphism and subgraph-isomorphism.作者: 轉(zhuǎn)換 時(shí)間: 2025-3-30 23:19 作者: BALK 時(shí)間: 2025-3-31 01:07
Jens Roselt,Ulrike Ha?,Gabriele Brandstettercal optima, we propose a modification which allows for vertex swaps during the formation of a clique. Experiments on random graphs show the effectiveness of the proposed heuristics both in terms of quality of solutions and speed.作者: 眉毛 時(shí)間: 2025-3-31 06:30 作者: 傲慢人 時(shí)間: 2025-3-31 09:31 作者: 彎彎曲曲 時(shí)間: 2025-3-31 16:36
Comparison and Convergence of Two Topological Models for 3D Image Segmentationway of defining this embedding. The aim of this paper is to compare these two models from the point of view of their interest for image segmentation, and to explore the possibility and the interest of making both these models converge.作者: 裂隙 時(shí)間: 2025-3-31 19:42
Theoretical Analysis and Experimental Comparison of Graph Matching Algorithms for Database Filteringe filtering procedures are used to reduce the impact of this additional factor. In this paper we report the results of a basic study on the relation between filtering efficiency and graph matching algorithm performance, using different graph matching algorithms for isomorphism and subgraph-isomorphism.作者: ablate 時(shí)間: 2025-4-1 01:41 作者: 認(rèn)識(shí) 時(shí)間: 2025-4-1 03:24
Swap Strategies for Graph Matchingcal optima, we propose a modification which allows for vertex swaps during the formation of a clique. Experiments on random graphs show the effectiveness of the proposed heuristics both in terms of quality of solutions and speed.作者: syring 時(shí)間: 2025-4-1 08:44
Graph Partition for Matchinglting subgraphs can be matched using a variety of algorithms. We demonstrate the utility of the resulting graph-matching method on both real work and synthetic data. Here it proves to provide results which are comparable with a number of state-of-the-art graph matching algorithms.作者: Kidnap 時(shí)間: 2025-4-1 10:15
Hare Krishna-Bewegung (ISKCON),edge set (MIES), in all tests. This means the number of vertices in the subgraph induced by any set of contractible edges is reduced to half or less by a single parallel contraction. The lower bound of the reduction factor becomes crucial with large images.作者: refraction 時(shí)間: 2025-4-1 16:16 作者: RENAL 時(shí)間: 2025-4-1 20:40
