標題: Titlebook: Discrete Geometry for Computer Imagery; 7th International Wo Ehoud Ahronovitz,Christophe Fiorio Conference proceedings 1997 Springer-Verlag [打印本頁] 作者: papyrus 時間: 2025-3-21 19:30
書目名稱Discrete Geometry for Computer Imagery影響因子(影響力)
書目名稱Discrete Geometry for Computer Imagery影響因子(影響力)學科排名
書目名稱Discrete Geometry for Computer Imagery網(wǎng)絡(luò)公開度
書目名稱Discrete Geometry for Computer Imagery網(wǎng)絡(luò)公開度學科排名
書目名稱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讀者反饋學科排名
作者: ALTER 時間: 2025-3-21 22:28
On the reconstruction of finite lattice sets from their X-rays,or the reconstruction of crystalline structures from images produced by quantitative high resolution transmission electron microscopy..In particular, we discuss questions related to the ill-posedness of the problem, determine the computational complexity of the basic underlying tasks and indicate al作者: 故意釣到白楊 時間: 2025-3-22 02:45
Applications of digital straight segments to economical image encoding,gital straight line segments in boundary curves is presented. The algorithm is applied to encode the boundaries of homogeneous regions in digitized images. The code is economical and enables an exact reconstruction of the original image.作者: hauteur 時間: 2025-3-22 05:21
Multiresolution representation of shapes in binary images II: Volume images,lume images contain at high resolution can be considerably compressed at lower resolution, and while the obtained representation still can be suited for simple shape analysis tasks, provided that shape is adequately preserved when resolution decreases. In this paper, we present new methods for build作者: LAPSE 時間: 2025-3-22 08:56
Coplanar tricubes, the total number of the tricubes that may appear in a naive plane is fourty..This study concerns the . of tricubes in a plane. We call . any set of tricubes, such as a naive plane exists, which contains all the tricubes of this set without any other. We present an algorithm which calculates the set作者: 新星 時間: 2025-3-22 16:24 作者: 新星 時間: 2025-3-22 17:42
A linear algorithm for constructing the polygon adjacency relation in iso-surfaces of 3D images,iscrete nature of data allows us to build this adjacency relation in a time proportional to the number of triangles .. We have payed a special attention on the memory requirements, since our method takes as input the surface extracted by the Marching-Cubes algorithm and does not make reference to th作者: declamation 時間: 2025-3-23 00:43 作者: liposuction 時間: 2025-3-23 04:40
Digital topologies revisited: An approach based on the topological point-neighbourhood,nify the proof technique of the results on 4-connectedness and on 8-connectedness in ?.. We also show that there is no topology compatible with 6-connectedness. We shortly comment on potential further use of this approach.作者: Daily-Value 時間: 2025-3-23 07:07 作者: Vertebra 時間: 2025-3-23 11:26 作者: 蚊子 時間: 2025-3-23 14:06
Ellipses estimation from their digitization, ellipse . is presented on digital picture of a given resolution, then the corresponding digital ellipse is: . where . denotes the number of pixels per unit and . = ., . = ., ..Since the digitization of real shapes causes an inherent loss of information about the original objects, the precision of t作者: aspersion 時間: 2025-3-23 20:03
Topological errors and optimal chamfer distance coefficients, is presented. The continuous distance considered is the widely used Euclidean distance whereas we consider as discrete distance the chamfer distance based on 3 x 3 masks. The objective is to obtain formal results from which algorithms for the exact solution of the Euclidean Distance Transformation 作者: happiness 時間: 2025-3-23 22:35 作者: 后天習得 時間: 2025-3-24 04:15 作者: 按時間順序 時間: 2025-3-24 07:26
R. L. Tobler,L. M. Ma,R. P. ReedTopology-based Geometric Modeling is concerned with modeling subdivisions of geometric spaces. Methods are close to that of combinatorial topology, but for different purposes. We discuss some of these methods, their interests and drawbacks for Geometric Modeling, mainly aspects we think that could be of possible interest for Discrete Geometry.作者: Hyperplasia 時間: 2025-3-24 13:55 作者: Iatrogenic 時間: 2025-3-24 17:34 作者: 喊叫 時間: 2025-3-24 22:45 作者: 故意釣到白楊 時間: 2025-3-24 23:20
Discrete Geometry for Computer Imagery978-3-540-69660-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 使成核 時間: 2025-3-25 06:02
https://doi.org/10.1007/978-1-4615-2439-7gital straight line segments in boundary curves is presented. The algorithm is applied to encode the boundaries of homogeneous regions in digitized images. The code is economical and enables an exact reconstruction of the original image.作者: labile 時間: 2025-3-25 08:57 作者: Ascribe 時間: 2025-3-25 14:58 作者: META 時間: 2025-3-25 17:02
Supercomputing Facilities for the 1990sand FCC (Face Centered Cubic) grids, which are well known in crystallography. The use of this kind of grids is motivated by their interesting characteristics: they reduce the density of samples needed to represent a signal without information loss and they have better topological properties than the cubic grid.作者: Dealing 時間: 2025-3-25 22:01
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281115.jpg作者: 侵蝕 時間: 2025-3-26 01:32
https://doi.org/10.1007/BFb00248253D; 3D graphics; Fractal; algorithms; computer; discrete geometry; geometric modeling; modeling; sets; topolo作者: FECT 時間: 2025-3-26 07:46
978-3-540-63884-1Springer-Verlag GmbH Germany, part of Springer Nature 1997作者: 虛構(gòu)的東西 時間: 2025-3-26 11:14
S. Pidcoe,J. Dalessandro,A. Zinszery and sufficient conditions for a 1 in a 2-, 3- or 4-dimensional binary image to be simple are established. The 4-dimensional cases of these results may be regarded as the principal contribution of this paper. A different discrete characterization of simple 1‘s in 2-, 3-and 4-dimensional binary imag作者: 揮舞 時間: 2025-3-26 13:56
Collider Dipole Magnet Producibilityor the reconstruction of crystalline structures from images produced by quantitative high resolution transmission electron microscopy..In particular, we discuss questions related to the ill-posedness of the problem, determine the computational complexity of the basic underlying tasks and indicate al作者: 沉思的魚 時間: 2025-3-26 20:35
https://doi.org/10.1007/978-1-4615-2439-7gital straight line segments in boundary curves is presented. The algorithm is applied to encode the boundaries of homogeneous regions in digitized images. The code is economical and enables an exact reconstruction of the original image.作者: 嘲弄 時間: 2025-3-26 23:22
https://doi.org/10.1007/978-1-4615-2439-7lume images contain at high resolution can be considerably compressed at lower resolution, and while the obtained representation still can be suited for simple shape analysis tasks, provided that shape is adequately preserved when resolution decreases. In this paper, we present new methods for build作者: Cirrhosis 時間: 2025-3-27 01:43 作者: filial 時間: 2025-3-27 07:11
Vector Processing Techniques on CYBER 205ctural description of surfaces where we have some desirable properties: for example, any point is surrounded by a set of faces which constitute a “cycle”. The notion of combinatorial surface extracts these “structural” properties of surfaces..In this paper, we introduce a relation for points in .. w作者: 外科醫(yī)生 時間: 2025-3-27 12:43 作者: gentle 時間: 2025-3-27 16:03 作者: chemical-peel 時間: 2025-3-27 21:43
An Overview of Computing at Los Alamosnify the proof technique of the results on 4-connectedness and on 8-connectedness in ?.. We also show that there is no topology compatible with 6-connectedness. We shortly comment on potential further use of this approach.作者: nugatory 時間: 2025-3-28 01:05 作者: Coronation 時間: 2025-3-28 03:12
Evgeny Kuznetsov,Vladimir Stegailovossess the Jordan property. These surfaces, although discrete by nature, represent most of the time real world continuous surfaces for which local geometrical characteristics are useful for registration, segmentation, recognition and measure. We propose a technique designed to estimate the mean curv作者: Blood-Vessels 時間: 2025-3-28 08:29 作者: 粗糙 時間: 2025-3-28 10:32
Swarn P. Kumar,Janusz S. Kowalik is presented. The continuous distance considered is the widely used Euclidean distance whereas we consider as discrete distance the chamfer distance based on 3 x 3 masks. The objective is to obtain formal results from which algorithms for the exact solution of the Euclidean Distance Transformation 作者: chemoprevention 時間: 2025-3-28 14:39
SUPRENUM: Architecture and Applicationsbining or manipulating simple entities. This problem is even more important when we deal with fractal geometry. In this paper, we propose some methods for increasing the modeling capabilities of fractal shape constructions. We propose an extension of the IFS model based on the definition of matrices作者: SPER 時間: 2025-3-28 20:45
Supercomputing Facilities for the 1990sand FCC (Face Centered Cubic) grids, which are well known in crystallography. The use of this kind of grids is motivated by their interesting characteristics: they reduce the density of samples needed to represent a signal without information loss and they have better topological properties than the作者: Antarctic 時間: 2025-3-29 01:14 作者: 領(lǐng)導權(quán) 時間: 2025-3-29 03:37 作者: KIN 時間: 2025-3-29 08:31 作者: 背書 時間: 2025-3-29 14:40 作者: 決定性 時間: 2025-3-29 16:44
Conference proceedings 1997ier, France, in December 1997. The volume presents 17 revised full papers together with three invited full papers. The contributions are organized in sections on 2D recognition, discrete shapes and planes, surfaces, topology, features, and from principles to applications.作者: 注射器 時間: 2025-3-29 23:13
Supercomputing: Key Issues and Challengese error bounded by . and absolute error bounded by ., (where e is an arbitrary positive number), that is, with the error tending to zero when the picture resolution increases. The obtained results imply that the half-axes of the original ellipse can be estimated with the same bounds of relative and absolute errors.作者: Confound 時間: 2025-3-30 01:09
Ellipses estimation from their digitization,e error bounded by . and absolute error bounded by ., (where e is an arbitrary positive number), that is, with the error tending to zero when the picture resolution increases. The obtained results imply that the half-axes of the original ellipse can be estimated with the same bounds of relative and absolute errors.作者: 移動 時間: 2025-3-30 04:19
Conference proceedings 1997ier, France, in December 1997. The volume presents 17 revised full papers together with three invited full papers. The contributions are organized in sections on 2D recognition, discrete shapes and planes, surfaces, topology, features, and from principles to applications.作者: 獸皮 時間: 2025-3-30 11:56 作者: 不可侵犯 時間: 2025-3-30 14:32 作者: cortisol 時間: 2025-3-30 20:34 作者: abracadabra 時間: 2025-3-30 23:54 作者: Ligament 時間: 2025-3-31 04:37
Digital lighting functions, (., .)-connectedness (., . ε {6,18, 26}) defined on ?. within the graph-based approach to digital topology. Furthermore, the Kong-Roscoe (., .)-surfaces, with (., .) ≠ (6, 6), (18, 6), are also found as particular cases of a more general notion of digital surface.作者: Myocyte 時間: 2025-3-31 05:52 作者: MAL 時間: 2025-3-31 09:16
0302-9743 anized in sections on 2D recognition, discrete shapes and planes, surfaces, topology, features, and from principles to applications.978-3-540-63884-1978-3-540-69660-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: lactic 時間: 2025-3-31 17:19
https://doi.org/10.1007/978-1-4615-2439-7 of these combinations..It appears that the number of these combinations is quite small : only 99, although a “combinatory explosion” could have been expected during their calculation. Their list is given in the appendix.作者: TEM 時間: 2025-3-31 19:49 作者: 剝削 時間: 2025-4-1 01:22 作者: abduction 時間: 2025-4-1 01:54
Swarn P. Kumar,Janusz S. Kowalikusing integer arithmetic can be derived. We conclude this study by presenting a global upper bound for a topologically-correct distance mapping, irrespective of the chamfer distance coefficients, and identify the smallest coefficients associated with this bound.作者: acheon 時間: 2025-4-1 09:53
Coplanar tricubes, of these combinations..It appears that the number of these combinations is quite small : only 99, although a “combinatory explosion” could have been expected during their calculation. Their list is given in the appendix.作者: 看法等 時間: 2025-4-1 12:34
