書目名稱Discrete Geometry for Computer Imagery影響因子(影響力)學(xué)科排名
書目名稱Discrete Geometry for Computer Imagery網(wǎng)絡(luò)公開度
書目名稱Discrete Geometry for Computer Imagery網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Discrete Geometry for Computer Imagery被引頻次
書目名稱Discrete Geometry for Computer Imagery被引頻次學(xué)科排名
書目名稱Discrete Geometry for Computer Imagery年度引用
書目名稱Discrete Geometry for Computer Imagery年度引用學(xué)科排名
書目名稱Discrete Geometry for Computer Imagery讀者反饋
書目名稱Discrete Geometry for Computer Imagery讀者反饋學(xué)科排名
作者: Detoxification 時(shí)間: 2025-3-21 22:14
Ball-Based Shape Processingith a ball of fixed radius. We review their extensions to variable distance offsetting. Specifically, we compare three different formulations of variable distance offsetting for planar shapes: orthogonal, radial, and ball. We discuss compatibility conditions that specify when a shape is the offset o作者: separate 時(shí)間: 2025-3-22 04:00
An Arithmetic and Combinatorial Approach to Three-Dimensional Discrete Lineshe three-dimensional space. We consider discrete segments that connect the origin to a given point (..,..,..) with coprime nonnegative integer coordinates. This generation method is based on generalized three-dimensional Euclid’s algorithms acting on the triple (..,..,..). We associate with the step作者: Repetitions 時(shí)間: 2025-3-22 07:50
Smooth 2D Coordinate Systems on Discrete Surfaces the Riemann mapping theorem. Our algorithm can parameterize triangular, quadrangular and digital meshes. It can be adapted to preserve metric properties. To demonstrate the efficiency of our method, many examples are shown in the experiment section.作者: Microgram 時(shí)間: 2025-3-22 12:09 作者: FLING 時(shí)間: 2025-3-22 15:49
Introduction to Digital Level Layersnvestigate some theoretical properties of this class of digital primitives according to topological and morphological criteria. The second task is to show that even if we consider functions . of high degree, the computations on Digital Level Layers, for instance the computation of a DLL containing a作者: FLING 時(shí)間: 2025-3-22 17:17
Associating Cell Complexes to Four Dimensional Digital Objectspresentation consists on associating a cell complex homologically equivalent to the digital object. To determine the pieces of this cell complex, algorithms based on weighted complete graphs and integral operators are shown. We work with integer coefficients, in order to compute the integer homology作者: alleviate 時(shí)間: 2025-3-22 21:18 作者: Vital-Signs 時(shí)間: 2025-3-23 03:57 作者: AFFIX 時(shí)間: 2025-3-23 07:14
Hierarchic Euclidean Skeletons in Cubical Complexes parameter. We provide in this article a discrete framework which formalizes and generalizes this notion, in particular to higher dimensions. This framework allows us to propose a new skeletonization scheme and to prove several important properties, such as topology preservation and stability w.r.t.作者: DEFT 時(shí)間: 2025-3-23 13:39 作者: ARENA 時(shí)間: 2025-3-23 15:40 作者: Collision 時(shí)間: 2025-3-23 19:00 作者: 背帶 時(shí)間: 2025-3-24 00:26 作者: Implicit 時(shí)間: 2025-3-24 05:06
Path-Based Distance with Varying Weights and Neighborhood Sequencese. The corresponding distance transform algorithm is similar in its form to classical propagation-based algorithms, but the more variable distance increments are either stored in look-up-tables or computed on-the-fly. These distances and distance transform extend neighborhood-sequence distances, cha作者: MOCK 時(shí)間: 2025-3-24 07:46 作者: 廢除 時(shí)間: 2025-3-24 13:59
Efficient Robust Digital Hyperplane Fitting with Bounded Errors the largest possible number of points. We first observe that the problem is 3SUM-hard in the plane, so that it probably cannot be solved exactly with computational complexity better than .(..), and it is conjectured that optimal computational complexity in dimension . is in fact .(..). We therefor作者: 上坡 時(shí)間: 2025-3-24 17:19
Isabelle Debled-Rennesson,Eric Domenjoud,Philippe Fast track conference proceedings.Unique visibility.State of the art research作者: quiet-sleep 時(shí)間: 2025-3-24 23:04 作者: Deduct 時(shí)間: 2025-3-25 02:58
https://doi.org/10.1007/978-3-642-19867-0approximation; computer graphics; computer images; digital imaging; discrete geometry; discrete tomograph作者: 解開 時(shí)間: 2025-3-25 04:59
978-3-642-19866-3Springer-Verlag GmbH Germany, part of Springer Nature 2011作者: 防御 時(shí)間: 2025-3-25 07:51
Open Innovation in the Aviation SectorThis paper is devoted to hierarchies of partitions, on which all criteria are proved to be connective. Optimisations are addressed by minimizing energies that satisfy the condition of hierarchical increasingness. The optimal cuts through the hierarchies are found. It is shown that many of the classical techniques are variants of what is proposed.作者: epicondylitis 時(shí)間: 2025-3-25 15:30 作者: 膠狀 時(shí)間: 2025-3-25 19:46
Hierarchies and OptimaThis paper is devoted to hierarchies of partitions, on which all criteria are proved to be connective. Optimisations are addressed by minimizing energies that satisfy the condition of hierarchical increasingness. The optimal cuts through the hierarchies are found. It is shown that many of the classical techniques are variants of what is proposed.作者: cinder 時(shí)間: 2025-3-26 00:01 作者: Affectation 時(shí)間: 2025-3-26 01:53 作者: 廢除 時(shí)間: 2025-3-26 06:30
Associating Cell Complexes to Four Dimensional Digital Objectspresentation consists on associating a cell complex homologically equivalent to the digital object. To determine the pieces of this cell complex, algorithms based on weighted complete graphs and integral operators are shown. We work with integer coefficients, in order to compute the integer homology of the digital object.作者: Ligneous 時(shí)間: 2025-3-26 08:59 作者: 柳樹；枯黃 時(shí)間: 2025-3-26 15:58
Discrete Geometry for Computer Imagery978-3-642-19867-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Colonnade 時(shí)間: 2025-3-26 20:12
Dheeraj Kumar,Ravi Kant Singh,Apurba Layek the Riemann mapping theorem. Our algorithm can parameterize triangular, quadrangular and digital meshes. It can be adapted to preserve metric properties. To demonstrate the efficiency of our method, many examples are shown in the experiment section.作者: 出來 時(shí)間: 2025-3-27 00:13
Responsiveness-Oriented Strategypresentation consists on associating a cell complex homologically equivalent to the digital object. To determine the pieces of this cell complex, algorithms based on weighted complete graphs and integral operators are shown. We work with integer coefficients, in order to compute the integer homology of the digital object.作者: 替代品 時(shí)間: 2025-3-27 03:30
https://doi.org/10.1007/978-3-031-52247-5 parameter. We provide in this article a discrete framework which formalizes and generalizes this notion, in particular to higher dimensions. This framework allows us to propose a new skeletonization scheme and to prove several important properties, such as topology preservation and stability w.r.t. parameter changes.作者: surmount 時(shí)間: 2025-3-27 06:42
https://doi.org/10.1007/978-3-319-46155-7used for many problems of discrete image analysis. The Helmholtz principle can be formulated as “we immediately perceive whatever has a low likelihood of resulting from accidental arrangement”. To translate this principle into a computational tool, we will introduce a variable called NFA (Number of 作者: 討好美人 時(shí)間: 2025-3-27 09:29
https://doi.org/10.1007/978-3-319-46155-7ith a ball of fixed radius. We review their extensions to variable distance offsetting. Specifically, we compare three different formulations of variable distance offsetting for planar shapes: orthogonal, radial, and ball. We discuss compatibility conditions that specify when a shape is the offset o作者: muster 時(shí)間: 2025-3-27 14:24 作者: 死亡率 時(shí)間: 2025-3-27 17:55 作者: 燒瓶 時(shí)間: 2025-3-27 22:55 作者: inconceivable 時(shí)間: 2025-3-28 05:11 作者: bacteria 時(shí)間: 2025-3-28 08:49 作者: 無脊椎 時(shí)間: 2025-3-28 13:07 作者: 漸變 時(shí)間: 2025-3-28 17:28 作者: 形容詞 時(shí)間: 2025-3-28 20:52
https://doi.org/10.1007/978-3-031-52247-5 parameter. We provide in this article a discrete framework which formalizes and generalizes this notion, in particular to higher dimensions. This framework allows us to propose a new skeletonization scheme and to prove several important properties, such as topology preservation and stability w.r.t.作者: CT-angiography 時(shí)間: 2025-3-29 01:24 作者: BROW 時(shí)間: 2025-3-29 05:18 作者: 動(dòng)脈 時(shí)間: 2025-3-29 08:27
Mónica López-Campos,Arón Barahona Ríosoving points from the object without changing the topology. In order to preserve geometric information, it is usual to preserve curve end points (for curve skeletons) or surface end points (for surface skeletons). In this paper we propose a new fast directional parallel thinning scheme, preserving i作者: nephritis 時(shí)間: 2025-3-29 13:27 作者: mastoid-bone 時(shí)間: 2025-3-29 16:47
https://doi.org/10.1007/978-3-031-32032-3e. The corresponding distance transform algorithm is similar in its form to classical propagation-based algorithms, but the more variable distance increments are either stored in look-up-tables or computed on-the-fly. These distances and distance transform extend neighborhood-sequence distances, cha作者: Favorable 時(shí)間: 2025-3-29 20:48
Alexandr Bozhenyuk,Evgeniya Gerasimenkoextracting medial representations of the objects. The distance transform (DT) is obtained by labeling each object element with the distance to the background. By local operations on the DT, different sets of anchor points can be obtained. We present two different methods based on local operations an作者: 合乎習(xí)俗 時(shí)間: 2025-3-30 03:35
Supply Chain Management Under Fuzzinesss the largest possible number of points. We first observe that the problem is 3SUM-hard in the plane, so that it probably cannot be solved exactly with computational complexity better than .(..), and it is conjectured that optimal computational complexity in dimension . is in fact .(..). We therefor作者: Hypopnea 時(shí)間: 2025-3-30 04:07 作者: 歌劇等 時(shí)間: 2025-3-30 08:21
https://doi.org/10.1007/978-3-319-46155-7 in many detection problems (alignments, smooth curves, edges, etc.). The common framework of these detection problems is that they can all be translated into the question of knowing whether a given group of pixels is meaningful or not. This is a joint work with Lionel Moisan and Jean-Michel Morel.作者: CORD 時(shí)間: 2025-3-30 13:33 作者: ornithology 時(shí)間: 2025-3-30 17:21 作者: intention 時(shí)間: 2025-3-30 20:48 作者: 負(fù)擔(dān) 時(shí)間: 2025-3-31 03:36 作者: 致詞 時(shí)間: 2025-3-31 06:13 作者: rods366 時(shí)間: 2025-3-31 13:12 作者: Organization 時(shí)間: 2025-3-31 17:14
A Unified Topological Framework for Digital Imagingof its corresponding image in ., thus proving the topological correctness of the proposed approach. From these results, it becomes possible to establish links between topology-oriented methods developed either in classical digital spaces (.) or cubical complexes (.).作者: 值得 時(shí)間: 2025-3-31 17:55
Sparse Object Representations by Digital Distance Functionsd prove that the representations are reversible, when this is the case. The methods are defined for weighted distances based on neighborhood sequences, which includes for example the well known cityblock and chessboard distances.作者: peak-flow 時(shí)間: 2025-3-31 23:28 作者: metropolitan 時(shí)間: 2025-4-1 02:20
Introduction to Digital Level Layersshow that even if we consider functions . of high degree, the computations on Digital Level Layers, for instance the computation of a DLL containing an input set of points, remain linear. It makes this notion suitable for applications, for instance to provide analytical characterizations of digital shapes.作者: 法律 時(shí)間: 2025-4-1 08:02
Metric Bases for Polyhedral Gaugesstance, as well as in the digital plane with the city-block and chessboard distances. We investigate these concepts for polyhedral gauges, which generalize in the Euclidean space the chamfer norms in the digital space.作者: Between 時(shí)間: 2025-4-1 13:39
Isthmus-Based 6-Directional Parallel Thinning Algorithmscurve skeletons) or surface end points (for surface skeletons). In this paper we propose a new fast directional parallel thinning scheme, preserving isthmuses (a generalization of curve/surface interior points), and providing skeletons with low amount of noise. We also prove the topology preservation of our approach.作者: 沉默 時(shí)間: 2025-4-1 18:11
Quasi-Linear Transformations, Numeration Systems and Fractalsl results about QLTs. We will then point out relations between QLTs, numeration systems and fractals. These relations allow us to define new numeration systems, fractals associated with them and n-dimensional fractals. With help of some properties of the QLTs we can give the fractal dimension of these fractals.作者: Crepitus 時(shí)間: 2025-4-1 19:49 作者: IRATE 時(shí)間: 2025-4-2 00:55 作者: 打折 時(shí)間: 2025-4-2 05:19
Future of Supply Chain Managementes. We give few basic properties of this collection. Then, we present a theorem which shows the equivalence between this collection and the collection made of all simply contractible simplicial complexes.
