標題: Titlebook: Discrete Geometry for Computer Imagery; 8th International Co Gilles Bertrand,Michel Couprie,Laurent Perroton Conference proceedings 1999 Sp [打印本頁] 作者: clot-buster 時間: 2025-3-21 16:48
書目名稱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讀者反饋學科排名
作者: HAVOC 時間: 2025-3-21 22:27
0302-9743 to these, four invited speakers have contributed to the conference. The site of Marne-la-Vall ee, just 20 min away from Paris, is particularly we- suited to ho978-3-540-65685-2978-3-540-49126-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: LAVE 時間: 2025-3-22 01:33
Multiresolution Representation of Shapes Based on Cell Complexeslls. An MC describes a shape as an initial cell complex approximating it, plus a collection of generic modification patterns to such complex arranged according to a partial order. The partial order is essential to extract variable-resolution shape descriptions in real time. We show how existing mult作者: legislate 時間: 2025-3-22 08:06 作者: 言外之意 時間: 2025-3-22 12:40
Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvaturethe study of discrete lines. By the use of the linear time segment recognition algorithm of Debled and Réveillès [.], Vialard [.] has proposed a .(.) algorithm for computing the tangent in one point of a discrete curve where . is the average length of the tangent. By applying her algorithm to . poin作者: VOC 時間: 2025-3-22 13:27
The Discrete Moments of the Circlests ..(.), defined as . can be a good approximation for ..(.). This paper gives an answer what is the order of magnitude for the difference between a real moment ..(.) and its approximation ..(.), calculated from the corresponding digital picture. Namely, we estimate . in function of the size of the 作者: VOC 時間: 2025-3-22 19:14 作者: 跳動 時間: 2025-3-22 23:39
Local Configurations of Digital Hyperplanes., we investigate the arrangement of the different combinatorial structures contained in a digital hyperplane. The regularity of this deployment is controlled by two arithmetical functions that we call .. and ... By using these two simple tools, we prove that the local configurations in a functional作者: IRS 時間: 2025-3-23 02:13 作者: wall-stress 時間: 2025-3-23 06:03
Intersection Number of Paths Lying on a Digital Surface and a New Jordan Theoremider two kinds of paths for different adjacencies, and define the algebraic number of oriented intersections between these two paths. We show that this intersection number is invariant under any homotopic transformation we apply on the two paths. Already, this intersection number allows us to prove 作者: canvass 時間: 2025-3-23 12:28 作者: Guaff豪情痛飲 時間: 2025-3-23 13:50 作者: entail 時間: 2025-3-23 21:16
Reconstruction in Different Classes of 2D Discrete Setsithms and complexity results are summarized in the case of .-convex sets, .-convex polyominoes, .-convex 8-connected sets, and directed .-convex sets. We show that the reconstruction algorithms used in the class of .-convex 4-connected sets (polyominoes) can be used, with small modifications, for re作者: Armory 時間: 2025-3-24 01:24 作者: dermatomyositis 時間: 2025-3-24 04:30
Shape-from-Silhouette/Stereo and Its Application to 3-D Digitizerm-Silhouette with stereo based on simple voting-localizing operations in a voxel space. In this algorithm, Shape-from-Silhouette roughly estimates the shape of the target object first, and then multi-eye stereo is applied within the estimated area to refine the shape. This algorithm overcomes the sh作者: 發(fā)生 時間: 2025-3-24 08:53 作者: ARBOR 時間: 2025-3-24 13:03
Topological Operators on the Topological Graph of Frontierstopological operators which achieve directly on the graph current operations performed on segmented images..Well known graph structures such as the Region Adjacency Graph [.] [.] do not (and cannot) keep track of the topology and so cannot maintain it. We claim that the structures and operators desc作者: preservative 時間: 2025-3-24 17:54 作者: AUGER 時間: 2025-3-24 20:32
Border Map: A Topological Representation for ,D Image Analysisepresents simple and multiple adjacencies, inclusion of regions, as well as the frontier type between two adjacent regions. An algorithm computing a border map, linear to the number of elements of an image, is defined in 2D, then generalized in 3D and in .D.作者: Pituitary-Gland 時間: 2025-3-25 00:15
Dimensions, Processes and OutcomesThe goal of this paper is to generalize the notion of lighting function given in [.] in order to integrate strong 26-surfaces [.] into our framework for digital topology. In particular, the continuous analogue for strong 26-surfaces introduced in [.] is extended for arbitrary objects.作者: Arrhythmia 時間: 2025-3-25 04:24 作者: 口音在加重 時間: 2025-3-25 08:53
A Digital Lighting Function for Strong 26-SurfacesThe goal of this paper is to generalize the notion of lighting function given in [.] in order to integrate strong 26-surfaces [.] into our framework for digital topology. In particular, the continuous analogue for strong 26-surfaces introduced in [.] is extended for arbitrary objects.作者: Debility 時間: 2025-3-25 13:01
New Notions for Discrete TopologySome new notions based on orders and discrete topology are introduced. We investigate the notions of unipolar and free points, we propose some discrete definitions for homotopy and a generalization of the notion of simple point.作者: Extort 時間: 2025-3-25 17:04 作者: multiply 時間: 2025-3-25 22:30 作者: Flawless 時間: 2025-3-26 00:51 作者: reperfusion 時間: 2025-3-26 05:19
Die Methode Supervision — eine Skizzethe study of discrete lines. By the use of the linear time segment recognition algorithm of Debled and Réveillès [.], Vialard [.] has proposed a .(.) algorithm for computing the tangent in one point of a discrete curve where . is the average length of the tangent. By applying her algorithm to . poin作者: installment 時間: 2025-3-26 11:57 作者: 脫毛 時間: 2025-3-26 14:24
,Schulenorientierte Ans?tze von Supervision,]. We introduce a new class of discrete planes (respectively lines) which we call graceful planes (respectively graceful lines).We use naive planes and graceful lines to obtain as thin as possible triangular mesh discretization admitting an analytical description. The interiors of the triangles are 作者: manifestation 時間: 2025-3-26 18:23 作者: 教義 時間: 2025-3-26 21:45 作者: 阻撓 時間: 2025-3-27 04:23 作者: 陰郁 時間: 2025-3-27 05:30 作者: inventory 時間: 2025-3-27 13:31 作者: 輕而薄 時間: 2025-3-27 13:50 作者: 細胞膜 時間: 2025-3-27 18:44 作者: Clinch 時間: 2025-3-28 00:51
Christoph Bieber,Christian Schw?belm-Silhouette with stereo based on simple voting-localizing operations in a voxel space. In this algorithm, Shape-from-Silhouette roughly estimates the shape of the target object first, and then multi-eye stereo is applied within the estimated area to refine the shape. This algorithm overcomes the sh作者: JEER 時間: 2025-3-28 04:06
Hausbesuche in der Wohnungslosenhilfese appoach. An alternative, and non topological, axiomatics has been proposed by Serra. It lies on the idea that the union of connected components that intersect is still connected. Such an axiomatics enlarges the range of possible connections, and includes clusters of particles..The main output of 作者: Rinne-Test 時間: 2025-3-28 06:38
Junge Menschen in (Wohnungs-)Nottopological operators which achieve directly on the graph current operations performed on segmented images..Well known graph structures such as the Region Adjacency Graph [.] [.] do not (and cannot) keep track of the topology and so cannot maintain it. We claim that the structures and operators desc作者: 經(jīng)典 時間: 2025-3-28 12:10 作者: 偽書 時間: 2025-3-28 15:19
https://doi.org/10.1057/978-1-137-50057-1epresents simple and multiple adjacencies, inclusion of regions, as well as the frontier type between two adjacent regions. An algorithm computing a border map, linear to the number of elements of an image, is defined in 2D, then generalized in 3D and in .D.作者: Nuance 時間: 2025-3-28 21:46 作者: 遺留之物 時間: 2025-3-28 23:05 作者: Pituitary-Gland 時間: 2025-3-29 05:40 作者: fender 時間: 2025-3-29 11:04
Border Map: A Topological Representation for ,D Image Analysisepresents simple and multiple adjacencies, inclusion of regions, as well as the frontier type between two adjacent regions. An algorithm computing a border map, linear to the number of elements of an image, is defined in 2D, then generalized in 3D and in .D.作者: Carcinogenesis 時間: 2025-3-29 13:20 作者: integrated 時間: 2025-3-29 18:22
https://doi.org/10.1007/978-3-663-01498-0is based on a multiresolution structure. The shape is hierarchically decomposed according to local thickness. A merging process is introduced for merging of small components to more significant parts. As a side effect of the algorithm, we also obtain a way of smoothing noisy shapes.作者: 傲慢物 時間: 2025-3-29 23:13 作者: amphibian 時間: 2025-3-30 00:00 作者: 修剪過的樹籬 時間: 2025-3-30 04:02 作者: 羅盤 時間: 2025-3-30 09:50
https://doi.org/10.1007/3-540-49126-0Artistic Imaging; Computer Graphics; Computer Imagery; Image Processing; computer; discrete geometry; topo作者: Incumbent 時間: 2025-3-30 12:44
978-3-540-65685-2Springer-Verlag GmbH Germany, part of Springer Nature 1999作者: cardiac-arrest 時間: 2025-3-30 20:36
Die Methode Supervision — eine Skizze the tangent evolution along a discrete curve. The resulting algorithm has a .(.) complexity and is thus optimal. Some applications in curvature computation and a tombstones contours study are also presented.作者: 支柱 時間: 2025-3-30 21:59
Hausbesuche in der Wohnungslosenhilfe(openings, strong alternated filters).The paper presents an overview of set connection and illustrates it by filterings on gray tone images. It is emphazised that all notions introduced here apply equally to both discrete and continuous spaces.作者: 群居動物 時間: 2025-3-31 04:32 作者: 發(fā)牢騷 時間: 2025-3-31 06:50 作者: arbiter 時間: 2025-3-31 12:27
Set Connections and Discrete Filtering(openings, strong alternated filters).The paper presents an overview of set connection and illustrates it by filterings on gray tone images. It is emphazised that all notions introduced here apply equally to both discrete and continuous spaces.作者: 格子架 時間: 2025-3-31 13:48 作者: 昏迷狀態(tài) 時間: 2025-3-31 20:24
Multiresolution Representation of Shapes Based on Cell Complexesiresolution models reduce to special cases of MCs characterized by specific modification patterns. The MC acts as a unifying framework that is also useful for comparing and evaluating the expressive power of different approaches.作者: Keshan-disease 時間: 2025-3-31 23:40
A Topological Method of Surface Representationmemory space then the raster representation of the object. The object may be exactly reconstructed from the code. Surfaces of a genus greater that zero (e.g. that of a torus) may also be encoded by a single continuous sequence. The traversal algorithm recognizes the genus of the surface.作者: 擁擠前 時間: 2025-4-1 04:43 作者: 自負的人 時間: 2025-4-1 07:00
Supervision als Sinn- und Grenzreflexionimage processing and pattern recognition, because it shows what the picture resolution should be used in order to obtain a required precision in the parameter estimation from the digital data taken from the corresponded binary picture.作者: 不利 時間: 2025-4-1 13:03 作者: stress-test 時間: 2025-4-1 16:19
Graceful Planes and Thin Tunnel-Free Meshesd graceful lines to obtain as thin as possible triangular mesh discretization admitting an analytical description. The interiors of the triangles are portions of naive planes, while the sides are graceful lines作者: 終點 時間: 2025-4-1 22:08
Local Configurations of Digital Hyperplanesntrolled by two arithmetical functions that we call .. and ... By using these two simple tools, we prove that the local configurations in a functional digital hyperplane only depends on its normal vector and that their number is less than the size of the chosen neighborhood.作者: Rejuvenate 時間: 2025-4-2 01:50 作者: 陰謀小團體 時間: 2025-4-2 04:21
Presentation of the Fundamental Group in Digital Surfacesencode a discrete group is to find a . of this group. In this paper, we define a presentation for the fundamental group of any subset of a digital surface. This presentation can be computed by an efficient algorithm.作者: Physiatrist 時間: 2025-4-2 09:22 作者: 產(chǎn)生 時間: 2025-4-2 12:18
