書目名稱Graphics Recognition: Achievements, Challenges, and Evolution影響因子(影響力)學(xué)科排名
書目名稱Graphics Recognition: Achievements, Challenges, and Evolution網(wǎng)絡(luò)公開(kāi)度
書目名稱Graphics Recognition: Achievements, Challenges, and Evolution網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書目名稱Graphics Recognition: Achievements, Challenges, and Evolution被引頻次
書目名稱Graphics Recognition: Achievements, Challenges, and Evolution被引頻次學(xué)科排名
書目名稱Graphics Recognition: Achievements, Challenges, and Evolution年度引用
書目名稱Graphics Recognition: Achievements, Challenges, and Evolution年度引用學(xué)科排名
書目名稱Graphics Recognition: Achievements, Challenges, and Evolution讀者反饋
書目名稱Graphics Recognition: Achievements, Challenges, and Evolution讀者反饋學(xué)科排名
作者: compose 時(shí)間: 2025-3-21 23:10 作者: vibrant 時(shí)間: 2025-3-22 02:58 作者: Mechanics 時(shí)間: 2025-3-22 04:36
Fuzzy Intervals for Designing Structural Signature: An Application to Graphic Symbol Recognition,ervised learning scenario for recognizing query symbols. The method has been evaluated for robustness against degradations & deformations on pre-segmented 2D linear architectural & electronic symbols from GREC databases, and for its recognition abilities on symbols with context noise ..作者: 衰老 時(shí)間: 2025-3-22 11:03
Interactive Conversion of Web Tables,pects of interactive table processing can be automated in the near term, and how much time such automation would save. The correlation coefficient between predicted and actual processing time was 0.66.作者: insipid 時(shí)間: 2025-3-22 14:09 作者: insipid 時(shí)間: 2025-3-22 17:20 作者: Pituitary-Gland 時(shí)間: 2025-3-22 23:00 作者: GIST 時(shí)間: 2025-3-23 05:13 作者: 誘拐 時(shí)間: 2025-3-23 08:41 作者: 遭受 時(shí)間: 2025-3-23 11:50
Multidisciplinary Systems Engineeringe areas where the road vector data are otherwise not easily accessible, such as the countries of the Middle East. We show that our approach requires minimal user input and achieves an average of 93.2% completeness and 95.6% correctness in an experiment using raster maps from various sources.作者: 泄露 時(shí)間: 2025-3-23 17:25
Javier Casillas,Joe U. Levi,Danny Sleemaneses, for example that not all kinds of segmentation points are equally difficult to perceive. The resulting methodology can be repeated with other drawings to obtain a set of sketches and segmentation data which could be used as a benchmark for segmentation algorithms, to evaluate their capability to emulate human perception of sketches.作者: 做作 時(shí)間: 2025-3-23 20:43
Automatic Palette Identification of Colored Graphics,re space. As pixels located on edges are made of mixed colors not expected to be part of the palette, they are removed from the initial data set by an automatic pre-processing. Results are shown on scanned maps and on the Macbeth color chart and compared to well established methods.作者: 聯(lián)合 時(shí)間: 2025-3-24 00:24
Extracting Road Vector Data from Raster Maps,e areas where the road vector data are otherwise not easily accessible, such as the countries of the Middle East. We show that our approach requires minimal user input and achieves an average of 93.2% completeness and 95.6% correctness in an experiment using raster maps from various sources.作者: gregarious 時(shí)間: 2025-3-24 02:50 作者: 無(wú)能力 時(shí)間: 2025-3-24 08:32 作者: Kinetic 時(shí)間: 2025-3-24 11:50 作者: 疼死我了 時(shí)間: 2025-3-24 16:17
Multifaceted Protocol in Biotechnologyby boundary moment invariants. The obtained concept lattice relates which symbolic patterns compose a given graphical symbol. A Hasse diagram is derived from the context and is used to recognize symbols affected by noise. We present some preliminary results over a variation of the dataset of symbols from the . symbol recognition contest.作者: PARA 時(shí)間: 2025-3-24 20:16
https://doi.org/10.1007/978-94-6300-615-6algorithms. Our method consists of gradually deforming these circular arc candidates as to precisely fit onto the image strokes, or to reject them if the fitting is not possible, this virtually eliminates spurious detections on the one hand, and avoiding non-detections on the other hand.作者: 意外的成功 時(shí)間: 2025-3-25 00:32
https://doi.org/10.1007/978-3-030-58846-5 circuits, and 2) generation of PSpice codes from the recognized diagrams. Experiments on a few sketched circuit diagrams show that the results are robust and accurate for both recognition and understanding.作者: 咯咯笑 時(shí)間: 2025-3-25 04:35 作者: coalition 時(shí)間: 2025-3-25 08:49
,: A System for Online Sketching and Understanding of Diagrams, circuits, and 2) generation of PSpice codes from the recognized diagrams. Experiments on a few sketched circuit diagrams show that the results are robust and accurate for both recognition and understanding.作者: Custodian 時(shí)間: 2025-3-25 11:58 作者: beta-carotene 時(shí)間: 2025-3-25 19:26
Kutlay Yagmur,Fons J. R. van de Vijvering visual associations in symbols and a statistical classifier for recognition. We vectorize a graphic symbol, encode its topological and geometrical information by an attributed relational graph and compute a signature from this structural graph. We have addressed the sensitivity of structural rep作者: instructive 時(shí)間: 2025-3-25 20:04 作者: FLINT 時(shí)間: 2025-3-26 00:56 作者: helper-T-cells 時(shí)間: 2025-3-26 05:38 作者: 得意牛 時(shí)間: 2025-3-26 08:57
https://doi.org/10.1057/9781137467744orization. The median-shift is an iterative process which shifts each data point to the “median” point of its neighborhood defined thanks to a distance measure and a maximum radius, the only parameter of the method. The process is viewed as a graph transformation which converges to a set of clusters作者: 豪華 時(shí)間: 2025-3-26 14:31
https://doi.org/10.1007/0-387-27744-7an circle can be used to detect a digital circle or a circular arc. Based on this property, digital circular arcs are first extracted and then using the ., their centers and radii are computed. Several arcs are merged together to form a complete digital circle or a larger arc. Finally, a technique b作者: 笨拙處理 時(shí)間: 2025-3-26 18:08
https://doi.org/10.1007/978-3-031-04990-3ic information in a document image may be present in several forms, such as engineering drawings, architectural plans, musical scores, tables, charts, extended objects, hand-drawn sketches, etc. There exist quite a few approaches for segmentation of graphics from text, and also a separate set of tec作者: 極小量 時(shí)間: 2025-3-26 21:09 作者: 拍下盜公款 時(shí)間: 2025-3-27 05:09
Javier Casillas,Joe U. Levi,Danny Sleemanoduce a benchmarking method for segmentation algorithms. The criterion is to minimise the differences between what the algorithm detects and what human beings perceive. We have created a set of sketched drawings and have asked people to segment them. By analysis of the produced segmentations, we hav作者: 生氣的邊緣 時(shí)間: 2025-3-27 05:37
https://doi.org/10.1007/978-3-319-06142-9 have to be able to represent this knowledge in an understandable way. There exists a lot of commercial software that allows to create our own slide presentations but the creativity of the user is rather limited. In this article we present an application that allows the user to create and visualize 作者: 宴會(huì) 時(shí)間: 2025-3-27 09:35 作者: 懶洋洋 時(shí)間: 2025-3-27 15:18 作者: Nuance 時(shí)間: 2025-3-27 19:49
https://doi.org/10.1007/978-3-658-32999-0ure, it seems to have many desirable properties. Recognition invariance in front shift, rotated and noisy shape was checked through median scale tests related to GREC symbol reference database. Even if extracting the topology of a shape by mapping the shortest path connecting all the pixels seems to作者: 先行 時(shí)間: 2025-3-28 01:08 作者: 白楊魚 時(shí)間: 2025-3-28 05:19 作者: 搖晃 時(shí)間: 2025-3-28 06:41 作者: Jejune 時(shí)間: 2025-3-28 12:42 作者: 間接 時(shí)間: 2025-3-28 17:39
https://doi.org/10.1007/978-3-662-04015-7styles defined by the historian is of considerable interest. The developed method is a statistical approach, where all possible patterns included in a pixel mask are processed in order to extract indexes that characterize the image. Then these indexes are used to classify a query drop cap by searchi作者: aphasia 時(shí)間: 2025-3-28 21:03 作者: 釋放 時(shí)間: 2025-3-28 23:18 作者: 混合,攙雜 時(shí)間: 2025-3-29 04:15 作者: Parallel 時(shí)間: 2025-3-29 07:20
Comparing Graph Similarity Measures for Graphical Recognition,nts are used including line drawings (symbols), ancient documents (ornamental letters), shapes and trademark-logos. The experimental results show that the performance of each graph distance measure depends on the kind of data and the graph representation technique.作者: licence 時(shí)間: 2025-3-29 11:39
Robust and Precise Circular Arc Detection,le of assessing the quality of its detection. It is based on Random Sample Consensus minimization, and uses techniques that are inspired from object tracking in image sequences. It is based on simple initial guesses, either based on connected line segments, or on elementary mainstream arc detection 作者: Fantasy 時(shí)間: 2025-3-29 15:39
Automatic Palette Identification of Colored Graphics,orization. The median-shift is an iterative process which shifts each data point to the “median” point of its neighborhood defined thanks to a distance measure and a maximum radius, the only parameter of the method. The process is viewed as a graph transformation which converges to a set of clusters作者: Compass 時(shí)間: 2025-3-29 23:35
Detection of Circular Arcs in a Digital Image Using Chord and Sagitta Properties,an circle can be used to detect a digital circle or a circular arc. Based on this property, digital circular arcs are first extracted and then using the ., their centers and radii are computed. Several arcs are merged together to form a complete digital circle or a larger arc. Finally, a technique b作者: Confound 時(shí)間: 2025-3-30 01:04
GOAL: Towards Understanding of Graphic Objects from Architectural to Line Drawings,ic information in a document image may be present in several forms, such as engineering drawings, architectural plans, musical scores, tables, charts, extended objects, hand-drawn sketches, etc. There exist quite a few approaches for segmentation of graphics from text, and also a separate set of tec作者: 鋼筆記下懲罰 時(shí)間: 2025-3-30 07:32 作者: Handedness 時(shí)間: 2025-3-30 08:48
Human Perception in Segmentation of Sketches,oduce a benchmarking method for segmentation algorithms. The criterion is to minimise the differences between what the algorithm detects and what human beings perceive. We have created a set of sketched drawings and have asked people to segment them. By analysis of the produced segmentations, we hav作者: 飛行員 時(shí)間: 2025-3-30 14:44
SSP: Sketching Slide Presentations, a Syntactic Approach, have to be able to represent this knowledge in an understandable way. There exists a lot of commercial software that allows to create our own slide presentations but the creativity of the user is rather limited. In this article we present an application that allows the user to create and visualize 作者: inchoate 時(shí)間: 2025-3-30 19:31 作者: drusen 時(shí)間: 2025-3-30 23:53 作者: SAGE 時(shí)間: 2025-3-31 03:48
A New Minimum Trees-Based Approach for Shape Matching with Improved Time Computing: Application to ure, it seems to have many desirable properties. Recognition invariance in front shift, rotated and noisy shape was checked through median scale tests related to GREC symbol reference database. Even if extracting the topology of a shape by mapping the shortest path connecting all the pixels seems to作者: Dealing 時(shí)間: 2025-3-31 08:25
Unified Pairwise Spatial Relations: An Application to Graphical Symbol Retrieval,int set, based on topology of the studied objects and thus avoids problems related to erroneous choices of reference objects while preserving symmetry. The method is robust to any type of image configuration since the directional relations are topologically guided. An automatic prototype graphical s作者: 可卡 時(shí)間: 2025-3-31 10:15
Real Scene Sign Recognition,ss Ratio Spectrum for recognizing real scene signs. Particularly, this method will be applied in two different ways: recognizing a multi-component sign as an whole entity or recognizing individual components separately. For the second strategy, a graph matching is used to finally decide the identify作者: 耕種 時(shí)間: 2025-3-31 14:53
Symbol Recognition Using a Concept Lattice of Graphical Patterns,cal patterns. Each model symbol is decomposed in a set of composing graphical patterns taken as primitives. Each one of these primitives is described by boundary moment invariants. The obtained concept lattice relates which symbolic patterns compose a given graphical symbol. A Hasse diagram is deriv作者: 懶惰人民 時(shí)間: 2025-3-31 19:25
Touching Text Character Localization in Graphical Documents Using SIFT,ts. Difficulties arise in graphical document recognition when text and symbol overlapped/touched. Intersection of text and symbols with graphical lines and curves occur frequently in graphical documents and hence separation of such symbols is very difficult..Several pattern recognition and classific作者: Insul島 時(shí)間: 2025-3-31 22:26 作者: 絕緣 時(shí)間: 2025-4-1 05:18
Multidisciplinary Perspectives on Gritnts are used including line drawings (symbols), ancient documents (ornamental letters), shapes and trademark-logos. The experimental results show that the performance of each graph distance measure depends on the kind of data and the graph representation technique.作者: 最高點(diǎn) 時(shí)間: 2025-4-1 06:26
https://doi.org/10.1007/978-3-658-24972-4s on a combination of a Aujol and Chambolle algorithm and a Segmentation using a Zipf Law and can be enhanced as a three-step process: 1)Decomposition in layers 2)Segmentation using a Zipf Law 3)Selection of the connected components.作者: dialect 時(shí)間: 2025-4-1 11:10
