書目名稱Graph-Based Representations in Pattern Recognition影響因子(影響力)學(xué)科排名
書目名稱Graph-Based Representations in Pattern Recognition網(wǎng)絡(luò)公開度
書目名稱Graph-Based Representations in Pattern Recognition網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph-Based Representations in Pattern Recognition被引頻次
書目名稱Graph-Based Representations in Pattern Recognition被引頻次學(xué)科排名
書目名稱Graph-Based Representations in Pattern Recognition年度引用
書目名稱Graph-Based Representations in Pattern Recognition年度引用學(xué)科排名
書目名稱Graph-Based Representations in Pattern Recognition讀者反饋
書目名稱Graph-Based Representations in Pattern Recognition讀者反饋學(xué)科排名
作者: Extort 時間: 2025-3-21 22:47 作者: 漂亮 時間: 2025-3-22 03:36
Pairwise Similarity Propagation Based Graph Clustering for Scalable Object Indexing and Retrievalormation is utilized for speeding up. Using SOM based clustering tree and SPGC, we develop a framework for scalable object indexing and retrieval. We illustrate these ideas on a database of over 50K images spanning more than 500 objects. We show that the precision is substantially boosted, achieving作者: OASIS 時間: 2025-3-22 06:16
https://doi.org/10.1007/978-3-030-35750-4e learning algorithm. We show how the DAG provides an improved comprehension of NPC etiology. Our findings are compared with the risk factors that were suggested in the recent literature in cancerology.作者: 治愈 時間: 2025-3-22 09:19 作者: 假 時間: 2025-3-22 15:53 作者: 假 時間: 2025-3-22 19:18
Graph-Based Representations in Pattern Recognition作者: BRAWL 時間: 2025-3-22 21:34
https://doi.org/10.1007/978-1-4842-2217-1arts are matched if their immediate properties are similar, the same holds recursively for their subparts, and the same holds for their neighbor parts. The shapes are represented by hierarchical attributed graphs whose node attributes encode the photometric and geometric properties of corresponding 作者: inferno 時間: 2025-3-23 02:35 作者: prostate-gland 時間: 2025-3-23 06:44 作者: HEW 時間: 2025-3-23 12:33
https://doi.org/10.1007/978-981-32-9005-1rk, the authors reformulate the mesh smoothing problem as an optimisation one. This approach gives the means of controlling the steps to assure monotonic convergence. Furthermore, a new optimisation function is proposed that reduces the shrinking effect of the method. Examples are given to illustrat作者: phlegm 時間: 2025-3-23 14:53
https://doi.org/10.1007/978-1-4020-5941-4ng. A novel approach is introduced that represents melodic progressions as graph structures providing a dissimilarity measure which complies with the invariances in the human perception of melodies. That way, music collections can be processed by non-Euclidean variants of Neural Gas or Self-Organizi作者: 2否定 時間: 2025-3-23 19:27
https://doi.org/10.1007/978-3-030-35750-4h an increased risk of Nasopharyngeal Carcinoma (NPC) based on a case-control epidemiologic study. This framework builds on the use of Bayesian network for representing statistical dependencies between the random variables. BN is directed acyclic graphs that models the joint multivariate probability作者: 解決 時間: 2025-3-23 23:44
https://doi.org/10.1007/978-3-658-16905-3pe can be analyzed through its decomposition into a collection of components with a simpler topology. Here, we consider a decomposition of a non-manifold shape into components which are almost manifolds, and we present a novel graph representation which highlights the non-manifold singularities shar作者: 四目在模仿 時間: 2025-3-24 04:08
https://doi.org/10.1007/978-3-658-34479-5 graph algorithms as well as higher level processing. To improve algorithmic efficiency, spatial indexing can be applied. Implementation aspects are discussed as well. An earlier version of the DG model has been applied for interpretation of Hungarian cadastral maps. Although this paper gives exampl作者: triptans 時間: 2025-3-24 07:21 作者: Curmudgeon 時間: 2025-3-24 11:46
https://doi.org/10.1007/978-3-322-87154-1age, which shows a small part of a city map, and stored map data. Such registration is important in fields like mobile computing for augmentation purposes. Until now, RFID tags, markers, or regular dot grids on specially prepared maps are typically required. In this paper we propose a graph-based me作者: flavonoids 時間: 2025-3-24 16:07
https://doi.org/10.1007/978-1-4842-3519-5del plane graphs with 2-dimensional combinatorial maps, which provide nice data structures for modelling the topology of a subdivision of a plane into nodes, edges and faces. We define submap isomorphism, we give a polynomial algorithm for this problem, and we show how this problem may be used to se作者: sperse 時間: 2025-3-24 20:23 作者: interlude 時間: 2025-3-25 01:38 作者: Nebulous 時間: 2025-3-25 06:42
Rob Kaas,Marc Goovaerts,Michel Denuithe skeleton of the 3D shape to a pre-specified tree model. Unfortunately, the tree representation can contain vertices that split limbs in multiple parts, which do not allow a good match by usual methods. To solve this problem, we propose a new alignment, taking in account the homeomorphism between 作者: 賞錢 時間: 2025-3-25 08:38 作者: MEAN 時間: 2025-3-25 12:48
https://doi.org/10.1007/978-3-319-64501-8pological node signatures. Using these signatures, we compute an optimum solution for node-to-node assignment with the Hungarian method and propose a distance formula to compute the distance between weighted graphs. The experiments demonstrate that the newly presented algorithm is well suited to pat作者: aptitude 時間: 2025-3-25 17:44 作者: habile 時間: 2025-3-25 23:22
Modern Agriculture and the Environmentevel constraints. In this paper we propose an optimization of this algorithm. This new way to solve arc-consistency checking with bilevel constraints gives the possibility to parallelize the algorithm. Some experiments shows the efficiency of this approach.作者: ATRIA 時間: 2025-3-26 00:32 作者: 談判 時間: 2025-3-26 04:48
Matching Hierarchies of Deformable Shapesarts are matched if their immediate properties are similar, the same holds recursively for their subparts, and the same holds for their neighbor parts. The shapes are represented by hierarchical attributed graphs whose node attributes encode the photometric and geometric properties of corresponding 作者: Estimable 時間: 2025-3-26 10:28 作者: 主講人 時間: 2025-3-26 15:31 作者: capsaicin 時間: 2025-3-26 19:47 作者: 好色 時間: 2025-3-26 21:34
Graph-Based Representation of Symbolic Musical Datang. A novel approach is introduced that represents melodic progressions as graph structures providing a dissimilarity measure which complies with the invariances in the human perception of melodies. That way, music collections can be processed by non-Euclidean variants of Neural Gas or Self-Organizi作者: 誓言 時間: 2025-3-27 04:27
Graph-Based Analysis of Nasopharyngeal Carcinoma with Bayesian Network Learning Methodsh an increased risk of Nasopharyngeal Carcinoma (NPC) based on a case-control epidemiologic study. This framework builds on the use of Bayesian network for representing statistical dependencies between the random variables. BN is directed acyclic graphs that models the joint multivariate probability作者: GONG 時間: 2025-3-27 06:14
Computing and Visualizing a Graph-Based Decomposition for Non-manifold Shapespe can be analyzed through its decomposition into a collection of components with a simpler topology. Here, we consider a decomposition of a non-manifold shape into components which are almost manifolds, and we present a novel graph representation which highlights the non-manifold singularities shar作者: 上漲 時間: 2025-3-27 10:24
A Graph Based Data Model for Graphics Interpretation graph algorithms as well as higher level processing. To improve algorithmic efficiency, spatial indexing can be applied. Implementation aspects are discussed as well. An earlier version of the DG model has been applied for interpretation of Hungarian cadastral maps. Although this paper gives exampl作者: 隱士 時間: 2025-3-27 14:50
Tracking Objects beyond Rigid Motionor example color histograms) is similar to other nearby regions or to the background. Instead of tracking multiple features independently, we propose an approach that integrates the underlying structure into the tracking process using an attributed graph. The independent tracking processes are drive作者: connoisseur 時間: 2025-3-27 21:47 作者: 北極人 時間: 2025-3-28 00:48 作者: 碎石 時間: 2025-3-28 06:08 作者: 光滑 時間: 2025-3-28 09:17 作者: 本土 時間: 2025-3-28 10:38
Homeomorphic Alignment of Edge-Weighted Treeshe skeleton of the 3D shape to a pre-specified tree model. Unfortunately, the tree representation can contain vertices that split limbs in multiple parts, which do not allow a good match by usual methods. To solve this problem, we propose a new alignment, taking in account the homeomorphism between 作者: covert 時間: 2025-3-28 16:50
Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectorsnvectors of the graph Laplacian. Given two sets of eigenvectors that correspond to the smallest non-null eigenvalues of the Laplacian matrices of two graphs, we project each graph onto its eigenenvectors. We estimate the histograms of these one-dimensional graph projections (eigenvector histograms) 作者: 極小 時間: 2025-3-28 19:54
Graph Matching Based on Node Signaturespological node signatures. Using these signatures, we compute an optimum solution for node-to-node assignment with the Hungarian method and propose a distance formula to compute the distance between weighted graphs. The experiments demonstrate that the newly presented algorithm is well suited to pat作者: 一條卷發(fā) 時間: 2025-3-29 01:39 作者: 受傷 時間: 2025-3-29 04:06 作者: jeopardize 時間: 2025-3-29 11:17
Pairwise Similarity Propagation Based Graph Clustering for Scalable Object Indexing and Retrievale size. As distinct from the bag-of-feature based methods, we do not regard descriptor quantizations as ”visual words”. Instead a group of selected SIFT features of an object together with their spatial arrangement are represented by an attributed graph. Each graph is then regarded as a ”visual word作者: 強行引入 時間: 2025-3-29 15:27 作者: 膝蓋 時間: 2025-3-29 19:16
https://doi.org/10.1007/978-3-322-84070-7n to a solution that satisfies the visual as well as the structural constraints. An approach for rigid objects is presented and extended to handle articulated objects consisting of rigid parts. Experimental results on real and synthetic videos show promising results in scenes with considerable amount of occlusion.作者: conscience 時間: 2025-3-29 22:15 作者: Melodrama 時間: 2025-3-30 02:53 作者: 評論性 時間: 2025-3-30 06:49 作者: Consensus 時間: 2025-3-30 09:35 作者: BOAST 時間: 2025-3-30 15:08
Graph-Based Registration of Partial Images of City Maps Using Geometric Hashingthod to avoid the need of special maps. It creates a graph representation of a given input image and robustly finds an optimal registration using a geometric hashing technique. Our approach is translation, scale and rotation invariant, map type independent and robust against noise and missing data.作者: 開始沒有 時間: 2025-3-30 20:17
Graph Matching Based on Node Signaturestern recognition applications. Compared with four well-known methods, our algorithm gives good results for clustering and retrieving images. A sensitivity analysis reveals that the proposed method is also insensitive to weak structural changes.作者: Peculate 時間: 2025-3-30 22:34 作者: 展覽 時間: 2025-3-31 03:12 作者: Stable-Angina 時間: 2025-3-31 06:15
A Graph Based Data Model for Graphics Interpretationiscussed as well. An earlier version of the DG model has been applied for interpretation of Hungarian cadastral maps. Although this paper gives examples of map interpretation, our concept can be extended to other fields of graphics recognition.作者: 固執(zhí)點好 時間: 2025-3-31 10:06 作者: GLOSS 時間: 2025-3-31 15:28
A Recursive Embedding Approach to Median Graph Computationategies. In this paper we present a new approximate recursive algorithm for median graph computation based on graph embedding into vector spaces. Preliminary experiments on three databases show that this new approach is able to obtain better medians than the previous existing approaches.作者: gruelling 時間: 2025-3-31 20:09 作者: 民間傳說 時間: 2025-3-31 22:04 作者: biopsy 時間: 2025-4-1 02:52
Coarse-to-Fine Matching of Shapes Using Disconnected Skeletons by Learning Class-Specific Boundary Dhat, the computed matching cost is re-evaluated by taking into account the similarity of boundary details in the light of class-specific boundary deformations which are learned from a given set of examples.作者: inflame 時間: 2025-4-1 08:36
https://doi.org/10.1007/978-1-4842-2217-1bgraph isomorphism that minimizes a quadratic cost. The dimensionality of the matching space is dramatically reduced by convexifying the cost. Experimental evaluation on the benchmark MPEG-7 and Brown datasets demonstrates that the proposed approach is robust.作者: Nausea 時間: 2025-4-1 11:38
https://doi.org/10.1007/978-1-349-15943-7y of eigenvector computation, and for aligning two embeddings. This results in an inexact graph matching solution that can be improved using a rigid point registration algorithm. We apply the proposed methodology to match surfaces represented by meshes.作者: liposuction 時間: 2025-4-1 16:09
Modern Age Waste Water Problemsendent parameters such as edition costs. The experimental validation on a TC-15 database shows that our model obtains higher recognition results, when there is moderate variability of the class elements, than several structural matching algorithms. Indeed in our model fewer comparisons are needed.作者: HERTZ 時間: 2025-4-1 21:46
