標題: Titlebook: Discrete Geometry for Computer Imagery; 6th International Wo Serge Miguet,Annick Montanvert,Stéphane Ubéda Conference proceedings 1996 Spri [打印本頁] 作者: misperceive 時間: 2025-3-21 16:09
書目名稱Discrete Geometry for Computer Imagery影響因子(影響力)
書目名稱Discrete Geometry for Computer Imagery影響因子(影響力)學科排名
書目名稱Discrete Geometry for Computer Imagery網(wǎng)絡公開度
書目名稱Discrete Geometry for Computer Imagery網(wǎng)絡公開度學科排名
書目名稱Discrete Geometry for Computer Imagery被引頻次
書目名稱Discrete Geometry for Computer Imagery被引頻次學科排名
書目名稱Discrete Geometry for Computer Imagery年度引用
書目名稱Discrete Geometry for Computer Imagery年度引用學科排名
書目名稱Discrete Geometry for Computer Imagery讀者反饋
書目名稱Discrete Geometry for Computer Imagery讀者反饋學科排名
作者: 合群 時間: 2025-3-22 00:08
Fast computation of the normal vector field of the surface of a 3-D discrete object,rete object at a given scale. Its time cost is proportional to the number of surfels at and little dependent on the scale. We prove that our algorithm converges toward the right value in the case of a plane surface. We also give some experimental results on families of curved surfaces.作者: 要控制 時間: 2025-3-22 04:01
Hypergraph model of digital topology for grey level images,images..The model is based on the fundamental Helly property of Hypergraphs. This paper introduces the Helly filter which gives to the neighborhood hypergraph associated with an image, the Helly property. As an application example, the model is successfully used to build a segmentation process.作者: 通便 時間: 2025-3-22 07:01
0302-9743 between theory and practice. The issues addressed are topology, geometry, shape representation, 3D surfaces and volumes, models for discrete space, image transformation and generation.978-3-540-62005-1978-3-540-49595-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Commentary 時間: 2025-3-22 09:05
0302-9743 Lyon, France, in November 1996..Computer imaging essentially depends on discrete models for coding, processing, recognition, representation, etc. The volume presents 24 revised full papers selected from 41 submissions together with 3 invited contributions and a tutorial paper, which bridges the gap作者: 通情達理 時間: 2025-3-22 13:42 作者: 通情達理 時間: 2025-3-22 17:51 作者: asthma 時間: 2025-3-22 21:22 作者: 永久 時間: 2025-3-23 03:40 作者: 芳香一點 時間: 2025-3-23 06:08
Least squares fitting of digital polynomial segments,als is assumed. One of such representations is (.., m, a., a.?1,..., ..), where .. and . are the .-coordinate of the left endpoint and the number of digital points, respectively, while .., ..?1,..., .. are the coefficients of the least squares polynomial fit ..X.+a.X.+ ...+a., for a given digital polynomial segment.作者: Harness 時間: 2025-3-23 10:31 作者: 初次登臺 時間: 2025-3-23 15:26
Inter-pixel Euclidean paths for image analysis,s context. In this paper we show the advantages of using Euclidean paths in order to smooth inter-pixel boundaries and we demonstrate the interest of inter-pixel Euclidean paths for the purpose of image segmentation and analysis.作者: COMA 時間: 2025-3-23 21:24 作者: NEEDY 時間: 2025-3-23 22:42 作者: paltry 時間: 2025-3-24 06:25
Regina M. Hansen,Susan A. Georgerete object at a given scale. Its time cost is proportional to the number of surfels at and little dependent on the scale. We prove that our algorithm converges toward the right value in the case of a plane surface. We also give some experimental results on families of curved surfaces.作者: crucial 時間: 2025-3-24 09:15
Supernovae as Visual Variable Starsimages..The model is based on the fundamental Helly property of Hypergraphs. This paper introduces the Helly filter which gives to the neighborhood hypergraph associated with an image, the Helly property. As an application example, the model is successfully used to build a segmentation process.作者: Infantry 時間: 2025-3-24 12:48 作者: dura-mater 時間: 2025-3-24 18:12
Astronomy and Astrophysics Libraryns is given by the algorithm as a conjunction of linear inequalities. This method of recognition is well suited to computer imagery, because any traversal algorithm of the given set is possible, and also because any incomplete segment of line or plane can be recognized.作者: 懲罰 時間: 2025-3-24 20:15
Multiresolution representation of shape in binary images,ation in binary pyramids, are presented. The first approach combines the OR and AND rules, whereas the second approach uses grey-level images as an intermediate step. The algorithms are easy to implement and produce significantly better results than the ones obtained by OR/AND pyramids.作者: 宏偉 時間: 2025-3-24 23:28
Recognizing arithmetic straight lines and planes,ns is given by the algorithm as a conjunction of linear inequalities. This method of recognition is well suited to computer imagery, because any traversal algorithm of the given set is possible, and also because any incomplete segment of line or plane can be recognized.作者: 逢迎春日 時間: 2025-3-25 03:54 作者: Eulogy 時間: 2025-3-25 07:37 作者: Valves 時間: 2025-3-25 15:17 作者: 典型 時間: 2025-3-25 19:42 作者: 背信 時間: 2025-3-26 00:03 作者: 文字 時間: 2025-3-26 02:16
Fast computation of the normal vector field of the surface of a 3-D discrete object,eters. Elementary components of discrete surfaces, called surfels, contain some geometric information, but at a scale that is too small with respect to the scale at which we actually want to describe objects. We present here a fast computational technique to compute the normal vector field of a disc作者: grotto 時間: 2025-3-26 06:03 作者: 軟膏 時間: 2025-3-26 10:26
Polyhedra generation from lattice points,mages. The method is based on combinatorial topology [1] and algebraic properties of the 3D lattice space [2]. It is shown that the method can uniquely generate polyhedra from a subset of the lattice space independently of the choice of neighborhood. Furthermore, a practical algorithm is developed a作者: Assault 時間: 2025-3-26 16:16
Recognizing arithmetic straight lines and planes,s in ?. (resp. ?.) belongs to a line (resp. a plane). In this paper the lines and planes are arithmetic, as defined by Reveilles [Rev91], and the problem is translated, for any width that is a linear function of the coefficients of the normal to the searched line or plane, into the problem of solvin作者: 無法破譯 時間: 2025-3-26 17:23 作者: 有抱負者 時間: 2025-3-26 22:26 作者: 入伍儀式 時間: 2025-3-27 01:59
Hypergraph model of digital topology for grey level images,g research. An application of hypergraph based digital topology to grey level images segmentation is presented..The originality of this work comes from the introduction of a new topology concept based on hypergraphs but above all from the possibility to modelize grey level images as well as colored 作者: 泛濫 時間: 2025-3-27 05:47
Application of skeletonization algorithms for myocardial spect quantification,opose a new approach lying on the application of discrete geometry and of two aspects of mathematical morphology, namely, skeletonization and segmentation. The properties of the skeleton are essential for carrying out segmentation, which uses many sights of uncertain‘s theory (fuzzy logic). We prese作者: 附錄 時間: 2025-3-27 12:34
Theoretical Issues in Superionic Conductorsn a second part, the actual and the potential importance of combinatorial topology, arithmetic geometry, discrete linearity and piecewise linearity is studied and discussed. Conclusions, directions. and problems for future work are stated.作者: 饒舌的人 時間: 2025-3-27 14:09 作者: 加強防衛(wèi) 時間: 2025-3-27 20:25
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281119.jpg作者: 迅速成長 時間: 2025-3-28 01:08 作者: ellagic-acid 時間: 2025-3-28 02:53
Pair-Instability Supernova ModelsIn this paper a “topologically consistent” representation for images is presented. It is called the . and is derived from the combinatorial maps model. Thus it establishes a link between image analysis and image synthesis. An efficient algorithm which constructs the Frontiers Topological Graph is developed.作者: Malleable 時間: 2025-3-28 06:45 作者: 內(nèi)部 時間: 2025-3-28 11:40 作者: 不如屎殼郎 時間: 2025-3-28 17:41 作者: 提名 時間: 2025-3-28 22:31 作者: 颶風 時間: 2025-3-29 01:33 作者: BRAVE 時間: 2025-3-29 07:06 作者: 吝嗇性 時間: 2025-3-29 07:57 作者: Gorilla 時間: 2025-3-29 13:19 作者: 匯總 時間: 2025-3-29 18:49 作者: 倔強一點 時間: 2025-3-29 19:47
Astronomy and Astrophysics Libraryimations of implicit models are presented. The first method produces finite element meshes. The second algorithm is based on a P1 (linear) surface approximation from volumetric datasets. Applications examples of discrete constructive solid geometry objects are given.作者: 迫擊炮 時間: 2025-3-30 02:59
Spectroscopy of SN 1987A at 1–4 Microns for arbitrary dimensions. Our main result generalizes the Morgenthaler-Rosenfeld‘s one for (26, 6)-surfaces in ?. [9]. The proof of this generalization is based on a new approach to digital topology sketched in [5] and developed in [2].作者: Confidential 時間: 2025-3-30 06:54 作者: oxidant 時間: 2025-3-30 08:29
Fractal representation of planar shapes,of initial contours, it reconstructs original objects with a high precision. This construction enables fast scalings and rotations of planar individual objects by simple algebraic operations on the fractal representation. Significant compression of data volume was obtained for shape representation.作者: 喊叫 時間: 2025-3-30 14:54 作者: liposuction 時間: 2025-3-30 17:23 作者: Inelasticity 時間: 2025-3-30 22:52 作者: 喃喃而言 時間: 2025-3-31 04:11 作者: spinal-stenosis 時間: 2025-3-31 07:04 作者: 諂媚于性 時間: 2025-3-31 12:30
https://doi.org/10.1007/978-3-662-49170-6ous drawbacks, as they distort the shape significantly. In OR-pyramids black pixels spread all over the array due to expansion and merging of close regions. The shape of the original pattern is rapidly blurred. In AND-pyramids narrow regions of the initial pattern may either completely vanish or bec作者: 進入 時間: 2025-3-31 13:41 作者: climax 時間: 2025-3-31 19:12
Regina M. Hansen,Susan A. Georgeeters. Elementary components of discrete surfaces, called surfels, contain some geometric information, but at a scale that is too small with respect to the scale at which we actually want to describe objects. We present here a fast computational technique to compute the normal vector field of a disc作者: Interdict 時間: 2025-4-1 00:47 作者: obscurity 時間: 2025-4-1 02:48
https://doi.org/10.1007/978-3-662-55054-0mages. The method is based on combinatorial topology [1] and algebraic properties of the 3D lattice space [2]. It is shown that the method can uniquely generate polyhedra from a subset of the lattice space independently of the choice of neighborhood. Furthermore, a practical algorithm is developed a作者: grieve 時間: 2025-4-1 09:24 作者: Ancillary 時間: 2025-4-1 11:12
Spectroscopy of SN 1987A at 1–4 Microns for arbitrary dimensions. Our main result generalizes the Morgenthaler-Rosenfeld‘s one for (26, 6)-surfaces in ?. [9]. The proof of this generalization is based on a new approach to digital topology sketched in [5] and developed in [2].作者: 尾巴 時間: 2025-4-1 16:59
