標題: Titlebook: ; [打印本頁] 作者: 二足動物 時間: 2025-3-21 17:41
書目名稱Graph Based Representations in Pattern Recognition影響因子(影響力)
書目名稱Graph Based Representations in Pattern Recognition影響因子(影響力)學科排名
書目名稱Graph Based Representations in Pattern Recognition網(wǎng)絡公開度
書目名稱Graph Based Representations in Pattern Recognition網(wǎng)絡公開度學科排名
書目名稱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讀者反饋學科排名
作者: Corroborate 時間: 2025-3-21 23:40 作者: Noctambulant 時間: 2025-3-22 03:53 作者: MAPLE 時間: 2025-3-22 08:04 作者: MAG 時間: 2025-3-22 11:16 作者: N斯巴達人 時間: 2025-3-22 13:36 作者: N斯巴達人 時間: 2025-3-22 19:47 作者: 傾聽 時間: 2025-3-23 00:25 作者: eustachian-tube 時間: 2025-3-23 04:46
Metzler Lexikon literarischer Symboleion of a new pair of matched nodes. A set of feasibility rules are introduced for pruning states associated to partial matching solutions which do not satisfy the required graphs morphism. Results outlining the computational cost reduction achieved by the method are given with reference to a set of randomly generated graphs.作者: APEX 時間: 2025-3-23 09:18 作者: Lignans 時間: 2025-3-23 13:31 作者: Factual 時間: 2025-3-23 16:08 作者: 放逐 時間: 2025-3-23 18:22 作者: 手榴彈 時間: 2025-3-24 00:22 作者: antipsychotic 時間: 2025-3-24 04:37 作者: 滲入 時間: 2025-3-24 10:27
https://doi.org/10.1007/978-3-476-03285-0pyramids. In the first section we present the theory behind DGC, in the second an algorithmic specification is derived, and in the third an implementation under LEDA is given followed by a short conclusion.作者: chondromalacia 時間: 2025-3-24 11:30
Recognition of Polymorphic Patterns in Parameterized Graphs for 3D Building Reconstruction,er to alleviate the occurring ambiguities, namely occlusions, inverse mapping, and noise. Using an extensive suburban scene it will be shown how polymorphic patterns can be recognized. Finally, we will estimate and discuss an upper bound complexity of the algorithm according to the application.作者: 直言不諱 時間: 2025-3-24 15:02
Dual Graph Contraction with LEDA,pyramids. In the first section we present the theory behind DGC, in the second an algorithmic specification is derived, and in the third an implementation under LEDA is given followed by a short conclusion.作者: 寄生蟲 時間: 2025-3-24 20:28
Generalization of Two Hypergraphs. Algorithm of Calculation of the Greatest Sub-Hypergraph Common t time for the calculation of these solutions. These methods constitute a general framework of the study of these problems and can be used in many areas such natural language, pattern recognition or organic chemistry.作者: 易改變 時間: 2025-3-24 23:44 作者: 免除責任 時間: 2025-3-25 04:10
Optimization Techniques on Pixel Neighborhood Graphs for Image Processing,ed on an appropriate pixel neighborhood graph. For attaining a higher computation speed, the full pixel lattice is replaced by a succession of partial identical neighborhood trees. Two versions of a high-speed minimization procedure are proposed for, respectively, discretely defined and quadratic objective functions.作者: 奇思怪想 時間: 2025-3-25 07:39 作者: 蒙太奇 時間: 2025-3-25 12:03 作者: 迫擊炮 時間: 2025-3-25 19:44 作者: Munificent 時間: 2025-3-25 23:19
Edge Detection as Finding the Minimum Cost Path in a Graph,tire graph of the search without defining the goal node: simple graph tools can be used to find closed boundaries or to determine junctions. On the other hand, we show that a cost function with exponential curvature can favor adaptive search strategies, preserving the minimum cost path condition.作者: Cardioversion 時間: 2025-3-26 02:35 作者: 星星 時間: 2025-3-26 04:49 作者: HEW 時間: 2025-3-26 10:14
Isomorphism between Strong Fuzzy Relational Graphs Based on ,-Formulae,uple of nodes is linked by a relational histogram which can be assumed to the attraction of two regions following a set of directions. The attraction is computed by a continuous function, depending on the distance of the confronted objects. Each case of the histogram corresponds to a particular dire作者: 刺激 時間: 2025-3-26 14:24
A Graph Structure for Grey Value and Texture Segmentation,arity Graph—FSG) which is based on a feature similarity criterion and a feature smoothing procedure applied in each layer of the network. Starting with grey value segmentation (the features are the pixel grey values) one obtains segments which, for textured images, represent texture elements (texels作者: ODIUM 時間: 2025-3-26 16:49
Image Sequence Segmentation by a Single Evolutionary Graph Pyramid,f the sequence, and then it is updated from image to image, using a split-and-merge process that takes into account the changes occurred between two successive frames. Thus, the same pyramid structure is used along the sequence, speeding up the process. Stability criteria allow to have the required 作者: 行業(yè) 時間: 2025-3-26 22:49 作者: probate 時間: 2025-3-27 02:57
Implementing Image Analysis with a Graph-Based Parallel Computing Model,, as a primitive operation to manipulate objects in an image. While the model is adapted to an efficient hardware implementation, it is also quite expressive in terms of image analysis. The paper illustrates that by presenting the implementation of Vorono? diagrams based image segmentation.作者: interference 時間: 2025-3-27 05:41
Optimization Techniques on Pixel Neighborhood Graphs for Image Processing,n and a priori smoothness constraints. Such a generalized problem is set as the formal problem of minimization of a separable objective function defined on an appropriate pixel neighborhood graph. For attaining a higher computation speed, the full pixel lattice is replaced by a succession of partial作者: modifier 時間: 2025-3-27 09:34 作者: 出處 時間: 2025-3-27 16:54 作者: GIBE 時間: 2025-3-27 20:33
https://doi.org/10.1007/978-3-476-05302-2ing the graph configuration or labeling minimizing some cost function. In the case of local relationships between the graph nodes, the Markovian framework and simulated annealing algorithms provide some answers to this question..We are interested in this paper in the automatic or semi-automatic dete作者: Ballerina 時間: 2025-3-27 22:49
Metzler Lexikon literarischer Symboletire graph of the search without defining the goal node: simple graph tools can be used to find closed boundaries or to determine junctions. On the other hand, we show that a cost function with exponential curvature can favor adaptive search strategies, preserving the minimum cost path condition.作者: 鐵砧 時間: 2025-3-28 03:52
Metzler Lexikon literarischer Symbole set of syntactic and semantic transformations, they can be made isomorphic to each other. The matching process is carried out by using a State Space Representation: a state represents a partial solution of the matching between the graphs, and a transition between two states corresponds to the addit作者: 較早 時間: 2025-3-28 08:31
Metzler Lexikon moderner Mythen of graph algorithms for subgraph isomorphism detection has been proposed, one of these algorithms having quadratic time complexity. These new algorithms use a preprocessing step to allow rapid matching of an input graph against a database of model graphs. We present a new algorithm for largest comm作者: Myosin 時間: 2025-3-28 12:46 作者: 不吉祥的女人 時間: 2025-3-28 16:35
https://doi.org/10.1007/978-3-476-05380-0arity Graph—FSG) which is based on a feature similarity criterion and a feature smoothing procedure applied in each layer of the network. Starting with grey value segmentation (the features are the pixel grey values) one obtains segments which, for textured images, represent texture elements (texels作者: 騎師 時間: 2025-3-28 22:13
https://doi.org/10.1007/978-3-476-03743-5f the sequence, and then it is updated from image to image, using a split-and-merge process that takes into account the changes occurred between two successive frames. Thus, the same pyramid structure is used along the sequence, speeding up the process. Stability criteria allow to have the required 作者: 高歌 時間: 2025-3-29 01:27 作者: Arresting 時間: 2025-3-29 06:36 作者: 震驚 時間: 2025-3-29 09:38 作者: LATHE 時間: 2025-3-29 14:01 作者: epidermis 時間: 2025-3-29 15:49 作者: 做作 時間: 2025-3-29 20:41 作者: incisive 時間: 2025-3-30 03:58
Implementing Image Analysis with a Graph-Based Parallel Computing Model,, as a primitive operation to manipulate objects in an image. While the model is adapted to an efficient hardware implementation, it is also quite expressive in terms of image analysis. The paper illustrates that by presenting the implementation of Vorono? diagrams based image segmentation.作者: ULCER 時間: 2025-3-30 06:53
Graph Based Representations in Pattern Recognition978-3-7091-6487-7Series ISSN 0344-8029 作者: Intervention 時間: 2025-3-30 09:44
https://doi.org/10.1007/978-3-476-03491-5In this paper, we present different recent segmentation works based on discrete maps. Discrete maps provide an efficient framework for region based segmentation methods. A discrete map is a mixed model combining an encoding of the discrete boundaries of the image regions with topological graphs which represent the topology of the image.
