書目名稱Graphics Recognition: Algorithms and Systems影響因子(影響力)學科排名
書目名稱Graphics Recognition: Algorithms and Systems網(wǎng)絡公開度
書目名稱Graphics Recognition: Algorithms and Systems網(wǎng)絡公開度學科排名
書目名稱Graphics Recognition: Algorithms and Systems被引頻次
書目名稱Graphics Recognition: Algorithms and Systems被引頻次學科排名
書目名稱Graphics Recognition: Algorithms and Systems年度引用
書目名稱Graphics Recognition: Algorithms and Systems年度引用學科排名
書目名稱Graphics Recognition: Algorithms and Systems讀者反饋
書目名稱Graphics Recognition: Algorithms and Systems讀者反饋學科排名
作者: 忍耐 時間: 2025-3-21 23:06 作者: MELD 時間: 2025-3-22 02:58
Genericity in graphics recognition algorithms,rithm is adapted to meet the requirements of the contest: straight and circular, solid and dashed lines, horizontal and vertical text, and filled and hollow arrowheads. We present detailed algorithms for recognizing these graphic objects, which are all based on the same generic recognition algorithm.作者: 反對 時間: 2025-3-22 05:36
Information extraction from a skewed form document in the presence of crossing characters,oval and broken character restoration using morphological analysis model of crossing shape. Using the proposed method, more than 95% of the horizontal and vertical crossing lines are correctly restored.作者: BLINK 時間: 2025-3-22 12:21 作者: 拋棄的貨物 時間: 2025-3-22 16:42
Vincent T’kindt,Jean-Charles Billauton. Thus, the similarity between two regions is defined in terms of the string edit distance between their boundary strings. The use of string matching allows the recognition method to work also under presence of distortion.作者: 拋棄的貨物 時間: 2025-3-22 19:55 作者: 自愛 時間: 2025-3-23 00:05
A string based method to recognize symbols and structural textures in architectural plans,on. Thus, the similarity between two regions is defined in terms of the string edit distance between their boundary strings. The use of string matching allows the recognition method to work also under presence of distortion.作者: 占線 時間: 2025-3-23 03:31
Logo recognition by recursive neural networks,ertaining to each contour node. Hence symbolic and sub-symbolic information coexist in the contour-tree representation of logo image. Experimental results are reported on 40 real logos distorted with artificial noise and performance of recursive neural network is compared with another two types of neural approaches.作者: thrombus 時間: 2025-3-23 09:18
Multicriteria Design Optimizationthe memory space and the processing time. The improved separation algorithm has all the advantages of the original one. It is independent of font style, font size, and language and map style. It performs well even in cases where lines and characters are connected.作者: 鋸齒狀 時間: 2025-3-23 12:54 作者: 起皺紋 時間: 2025-3-23 13:55 作者: Endearing 時間: 2025-3-23 22:01
https://doi.org/10.1007/978-1-4899-3734-6ments and arcs of the symbol; a description language has been written in order to describe these constraints. Symbol detection is performed by propagating the segments and the arcs in the network and retrieving the recognized symbols. The construction of this network is an iterative incremental process.作者: Carbon-Monoxide 時間: 2025-3-23 23:41 作者: Integrate 時間: 2025-3-24 02:45
https://doi.org/10.1007/978-94-007-7651-7map the already recognized layers to facilitate the interpretation of remaining more complex layers. We present numerous results of the layers already extracted. The most important point to address in the near future, will be the computation of reliability indicator allowing to throw an alert-process.作者: 雇傭兵 時間: 2025-3-24 07:46
https://doi.org/10.1007/978-1-137-40360-5nized end vectorized. Then, by a local analysis, we weight and add some hypothetical edges. By a relaxation process, we try to orientate the elevation curves, and so we could re-adjust the weight. Finally, we found a topologycally correct solution by resolving the dual problem (i.e. a bi-colouring problem).作者: 積習難改 時間: 2025-3-24 13:48 作者: cartilage 時間: 2025-3-24 18:51
Improved directional morphological operations for separation of characters from maps/graphics,the memory space and the processing time. The improved separation algorithm has all the advantages of the original one. It is independent of font style, font size, and language and map style. It performs well even in cases where lines and characters are connected.作者: Maximize 時間: 2025-3-24 22:53
A coarse vectorisation as an initial representation for the understanding of line drawing images, of the drawings. Then, its capacity to evolve and to carry high semantical local entities is highlighted. Finally we show how an architecture of perceptive cycles allows a better quality interpretation of the document.作者: 充足 時間: 2025-3-25 02:49 作者: AXIS 時間: 2025-3-25 03:49 作者: 故意 時間: 2025-3-25 07:34 作者: 橢圓 時間: 2025-3-25 14:48 作者: moratorium 時間: 2025-3-25 19:16
Automatic interpretation of scanned maps: Reconstruction of Contour Lines,nized end vectorized. Then, by a local analysis, we weight and add some hypothetical edges. By a relaxation process, we try to orientate the elevation curves, and so we could re-adjust the weight. Finally, we found a topologycally correct solution by resolving the dual problem (i.e. a bi-colouring problem).作者: 小樣他閑聊 時間: 2025-3-25 21:54
Segmentation of thematic maps using colour and spatial attributes,d on the Delaunay triangulation. It enables to spatially define textured regions by analyzing the spatial relationship between neighbouring pixels, not necessary adjacent. Examples illustrate the different steps of the segmentation procedure.作者: Free-Radical 時間: 2025-3-26 01:35
https://doi.org/10.1007/978-1-4615-8768-2rithm is adapted to meet the requirements of the contest: straight and circular, solid and dashed lines, horizontal and vertical text, and filled and hollow arrowheads. We present detailed algorithms for recognizing these graphic objects, which are all based on the same generic recognition algorithm.作者: 含水層 時間: 2025-3-26 06:13
https://doi.org/10.1007/978-981-10-2222-7oval and broken character restoration using morphological analysis model of crossing shape. Using the proposed method, more than 95% of the horizontal and vertical crossing lines are correctly restored.作者: 規(guī)章 時間: 2025-3-26 11:45
https://doi.org/10.1007/978-3-030-50079-5retation part, i.e. its current status and recent improvements. As part of this discussion we elaborate on the knowledge representation and the interpretation mechanism, propose a new concept to handle multiple detectors, introduce a new judgment procedure of instances of map objects and show the necessity of explicitly specified conflict rules.作者: HEED 時間: 2025-3-26 15:50 作者: Euthyroid 時間: 2025-3-26 19:25
Improved directional morphological operations for separation of characters from maps/graphics,ch to improve the efficiency of this algorithm using run-length-encoded (RLE) image representation. Directional edge images are all represented as directional run-length linked lists. Moreover, we migrate all of the processes used to the RLE data structure. As a result, we reduce significantly both 作者: membrane 時間: 2025-3-26 21:34
A coarse vectorisation as an initial representation for the understanding of line drawing images,ritten). We propose a method in which the problems induced by a first step skeletisation have been avoided. We first achieve a hierarchical representation that enables a fine description of the drawing using only pixels, vectors and quadrilateral primitives. This representation gives a global vision作者: AMOR 時間: 2025-3-27 01:12
Euclidean paths for representing and transforming scanned characters,ur which is intrinsically jagged while preserving all the initial information it contains. We recall here the general model of Euclidean Paths and the construction of tangent driven Euclidean paths associated with 8-connected boundaries [7]. Tangent driven Euclidean paths provide a good approximatio作者: AVOID 時間: 2025-3-27 08:30 作者: 只有 時間: 2025-3-27 13:17
A constraint network for symbol detection in architectural drawings,ed on Messmer‘s network for exact and inexact graph matching, presents a compact representation of all the symbols, which allows a one-pass search. Some modifications to this method for our specific document analysis problem are outlined: the symbols are represented as sets of constraints on the seg作者: 偶像 時間: 2025-3-27 16:24
A string based method to recognize symbols and structural textures in architectural plans,d by an attributed graph whose nodes represent characteristic points and whose edges represent segments. Symbols and textures can be seen as a set of regions, i.e. closed loops in the graph, with a particular arrangement. The search for a symbol involves a graph matching between the regions of a mod作者: Compass 時間: 2025-3-27 20:25
Logo recognition by recursive neural networks,are converted into a structured representation based on contour trees. Recursive neural networks are then learnt using the contourtrees as inputs to the neural nets. On the other hand, the contour-tree is constructed by associating a node with each exterior or interior contour extracted from the log作者: Rustproof 時間: 2025-3-27 23:22 作者: 種子 時間: 2025-3-28 05:59 作者: 機密 時間: 2025-3-28 09:41
Robust reconstruction of damaged character images on the form documents,t easy to extract characters correctly because the shapes of characters are transformed by line images. In this paper, we propose a new method to reconstruct the character images damaged by the preprinted lines of documents. The method consists of two stages — the character decomposition stage and t作者: 柔軟 時間: 2025-3-28 11:33 作者: Distribution 時間: 2025-3-28 14:35 作者: OATH 時間: 2025-3-28 22:34 作者: Somber 時間: 2025-3-29 00:55 作者: Notify 時間: 2025-3-29 04:33 作者: 乳汁 時間: 2025-3-29 08:15
Information fusion for conflict resolution in map interpretation,”. Besides a short description of the overall system architecture, which is presented in more detail in [8], we will focus in this paper on the interpretation part, i.e. its current status and recent improvements. As part of this discussion we elaborate on the knowledge representation and the interp作者: 相反放置 時間: 2025-3-29 12:31 作者: LINES 時間: 2025-3-29 15:46 作者: 服從 時間: 2025-3-29 23:47 作者: 極大痛苦 時間: 2025-3-30 00:22
https://doi.org/10.1007/3-540-27659-9ur which is intrinsically jagged while preserving all the initial information it contains. We recall here the general model of Euclidean Paths and the construction of tangent driven Euclidean paths associated with 8-connected boundaries [7]. Tangent driven Euclidean paths provide a good approximatio作者: Host142 時間: 2025-3-30 07:18
Multicriteria Optimization and Engineeringrecognition and raises some open issues that need further investigation. Work on symbol recognition tends to be highly application specific. Therefore, this review presents the symbol recognition methods in the context of specific applications.作者: Munificent 時間: 2025-3-30 10:09
https://doi.org/10.1007/978-1-4899-3734-6ed on Messmer‘s network for exact and inexact graph matching, presents a compact representation of all the symbols, which allows a one-pass search. Some modifications to this method for our specific document analysis problem are outlined: the symbols are represented as sets of constraints on the seg作者: 啞巴 時間: 2025-3-30 14:35 作者: 改革運動 時間: 2025-3-30 18:55 作者: ARC 時間: 2025-3-30 21:42
https://doi.org/10.1057/9781137403452urance application forms will be introduced. This paper is divided into two parts. The first part in section 2 focuses on the forms processing by discussing the issues of form identification, recognition field extraction, and form line removal with character restoration capability. The second part i作者: 官僚統(tǒng)治 時間: 2025-3-31 02:44 作者: Angiogenesis 時間: 2025-3-31 07:33
https://doi.org/10.1057/9780230599321t easy to extract characters correctly because the shapes of characters are transformed by line images. In this paper, we propose a new method to reconstruct the character images damaged by the preprinted lines of documents. The method consists of two stages — the character decomposition stage and t作者: CRUC 時間: 2025-3-31 11:34 作者: Collar 時間: 2025-3-31 15:39 作者: Comedienne 時間: 2025-3-31 18:24
https://doi.org/10.1007/978-1-137-40360-5pology of the contour lines (i.e. a set of nonintersecting closed lines), but we use also some local and geometrical informations to guide the reasoning..Our proposed method starts from a map scanned in RGB. The image is first segmented by a colour classification process, and the objects are skeleto作者: hermitage 時間: 2025-4-1 00:14
Multiculturalism and Social Cohesionrmation and structured objects from digital topographic maps in raster format using an automated process. An approach of knowledge-based Template Matching with high recognition rates (about 95%) and a procedure to segment and isolate coherent areas of a colour layer are presented. All segmented area作者: 泥沼 時間: 2025-4-1 04:15 作者: 玷污 時間: 2025-4-1 08:04
https://doi.org/10.1007/978-3-030-50079-5”. Besides a short description of the overall system architecture, which is presented in more detail in [8], we will focus in this paper on the interpretation part, i.e. its current status and recent improvements. As part of this discussion we elaborate on the knowledge representation and the interp作者: 薄荷醇 時間: 2025-4-1 11:40
