書目名稱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é)科排名
作者: 步履蹣跚 時間: 2025-3-22 00:00
Sre?ko Brlek,Christophe Reutenauer,Xavier Proven?a作者: 愛了嗎 時間: 2025-3-22 02:30
Frances Bauer,Paul Garabedian,Antony Jamesonrediction for which errors in both the model and the observations need to be considered and estimated. Atmospheric predictability is concerned with the . nature of the nonlinear equations that govern the atmosphere. Ensemble prediction is one area that has expanded significantly in the last decade. 作者: BALK 時間: 2025-3-22 07:12 作者: Exposure 時間: 2025-3-22 11:32 作者: 兵團(tuán) 時間: 2025-3-22 16:27
Mathematics in Atmospheric Sciences: An Overviewt waves. Climate studies are needed to make decisions about the long-term development in agriculture, transport and land development. Observing and modeling the evolution of the atmosphere is needed to provide key . information for both weather prediction and climate scenarios. This paper gives an o作者: 兵團(tuán) 時間: 2025-3-22 17:50 作者: 全能 時間: 2025-3-22 22:06 作者: 無思維能力 時間: 2025-3-23 04:36
An Improved Coordinate System for Point Correspondences of 2D Articulated Shapestified by a pair of distinct coordinates. The coordinates are used to address corresponding points. This paper proposes a solution to a discretization problem identified in a previous approach. The polar like coordinate system is computed in a space where the problem cannot occur, followed by mappin作者: N防腐劑 時間: 2025-3-23 05:35 作者: epicondylitis 時間: 2025-3-23 12:45
Multiscale Discrete Geometryof a standard digital straight line by a multi-resolution grid. We then study the multi-resolution of Digital Straight Segments (DSS): we provide a sublinear algorithm computing the exact characteristics of a DSS whenever it is a subset of a known standard line. We finally deduce an algorithm for co作者: 慢慢沖刷 時間: 2025-3-23 13:54
Ellipse Detection with Elemental Subsetse then prove that the global fitting cost can be easily derived from the fitting cost of the samples. Since fitting costs are computed from small samples, the technique can be incorporated in many ellipse detection and recognition algorithms, and in particular, in algorithms that make use of increme作者: 救護(hù)車 時間: 2025-3-23 21:03
Multi-Label Simple Points Definition for 3D?Images Digital Deformable Model deformable partition process. The definition is based on simple intervoxel properties and is easy to implement. A deformation process is carried out with a greedy energy minimization algorithm. A discrete area estimator is used to approach at best standard regularizers classically used in continuou作者: 危險 時間: 2025-3-24 01:55
Marching Triangle Polygonization for Efficient Surface Reconstruction from Its Distance Transformbasic algorithm which produces a complete mesh without any cracks. Our method is useful in the surface reconstruction process of scanned objects. It works over the scalar field distance transform of the object to produce the resulting triangle mesh. First we improve the original algorithm in finding作者: 引水渠 時間: 2025-3-24 05:30 作者: 正式通知 時間: 2025-3-24 07:21 作者: impale 時間: 2025-3-24 12:36 作者: PANEL 時間: 2025-3-24 16:52
Topology-Preserving Thinning in 2-D Pseudomanifoldsal images (. images defined on ?.) such procedures are usually based on the notion of simple point. By opposition to the case of spaces of higher dimensions (. ?., .?≥?3), it was proved in the 80’s that the exclusive use of simple points in ?. was indeed sufficient to develop thinning procedures pro作者: 聲明 時間: 2025-3-24 21:00
Discrete Geometry for Computer Imagery978-3-642-04397-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 整潔 時間: 2025-3-25 02:36 作者: Dri727 時間: 2025-3-25 06:28
Jeffrey P. Miller,Charlene Van Buitentified by a pair of distinct coordinates. The coordinates are used to address corresponding points. This paper proposes a solution to a discretization problem identified in a previous approach. The polar like coordinate system is computed in a space where the problem cannot occur, followed by mapping the computed coordinates to pixels.作者: assent 時間: 2025-3-25 10:34 作者: CLAMP 時間: 2025-3-25 13:52
Matter Couplings in Global Supersymmetry map which is used to derive the watersheds. We propose to combine a Random Forest classifier with the watershed transform and introduce three novel methods to obtain scalar boundary indicator maps from class probability maps. We further introduce the multivariate watershed as a generalization of the classic watershed approach.作者: 讓步 時間: 2025-3-25 18:34 作者: 心胸開闊 時間: 2025-3-25 21:40
An Improved Coordinate System for Point Correspondences of 2D Articulated Shapestified by a pair of distinct coordinates. The coordinates are used to address corresponding points. This paper proposes a solution to a discretization problem identified in a previous approach. The polar like coordinate system is computed in a space where the problem cannot occur, followed by mapping the computed coordinates to pixels.作者: concubine 時間: 2025-3-26 03:13 作者: Cirrhosis 時間: 2025-3-26 08:09
Multivariate Watershed Segmentation of Compositional Data map which is used to derive the watersheds. We propose to combine a Random Forest classifier with the watershed transform and introduce three novel methods to obtain scalar boundary indicator maps from class probability maps. We further introduce the multivariate watershed as a generalization of the classic watershed approach.作者: Climate 時間: 2025-3-26 10:31
https://doi.org/10.1007/978-4-431-67873-1We provide an algorithm for the exact computation of the lattice width of an integral polygon . in linear-time with respect to the size of .. Moreover, we describe how this new algorithm can be extended to an arbitrary dimension thanks to a greedy approach avoiding complex geometric processings.作者: Accessible 時間: 2025-3-26 13:29 作者: 不能逃避 時間: 2025-3-26 18:28 作者: 咽下 時間: 2025-3-26 23:06
Sarah A. Johnson,Emily K. WoolfA new technique to automatically detect the vanishing points in digital images is presented. The proposed method borrows several ideas from various papers on vanishing point detection and segmentation in sparse images and recombines them with a new intersection point neighborhood on ..作者: preservative 時間: 2025-3-27 04:33 作者: concise 時間: 2025-3-27 07:29 作者: 青少年 時間: 2025-3-27 12:13
Optimal Partial Tiling of Manhattan?PolyominoesFinding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we give an algorithm linear in the number of columns. Some techniques are borrowed from traditional graph optimisation problems.作者: Gerontology 時間: 2025-3-27 15:01 作者: 歡笑 時間: 2025-3-27 18:45
https://doi.org/10.1007/978-3-642-04397-0Image segmentation; computer graphics; computer images; descrete topology; discrete geometry; geometric c作者: 偉大 時間: 2025-3-28 01:04
978-3-642-04396-3Springer-Verlag GmbH Germany, part of Springer Nature 2009作者: 重畫只能放棄 時間: 2025-3-28 05:18
The Classical Theory of Critical Pointsction. We first give an overview of methods and properties that can be deduced from this viewpoint. Substitution rules are known to be an efficient construction process for tilings. We then introduce a substitution rule acting on discrete planes, which maps faces of unit cubes to unions of faces, an作者: 擴(kuò)張 時間: 2025-3-28 07:59 作者: Entirety 時間: 2025-3-28 13:48
Frances Bauer,Paul Garabedian,Antony Jamesont waves. Climate studies are needed to make decisions about the long-term development in agriculture, transport and land development. Observing and modeling the evolution of the atmosphere is needed to provide key . information for both weather prediction and climate scenarios. This paper gives an o作者: 集中營 時間: 2025-3-28 15:08 作者: 長處 時間: 2025-3-28 21:31
Superficial Esophageal Neoplasmthese are called double squares). In this paper, we study two families of tiles : one is directly linked to Christoffel words while the other stems from the Fibonacci sequence. We show that these polyominoes are double squares, revealing strong connections between discrete geometry and other areas b作者: Magnitude 時間: 2025-3-29 01:59
Jeffrey P. Miller,Charlene Van Buitentified by a pair of distinct coordinates. The coordinates are used to address corresponding points. This paper proposes a solution to a discretization problem identified in a previous approach. The polar like coordinate system is computed in a space where the problem cannot occur, followed by mappin作者: 你不公正 時間: 2025-3-29 04:30 作者: Herbivorous 時間: 2025-3-29 07:30 作者: fender 時間: 2025-3-29 11:35
Shelby Cox,Kalyn Garcia,Charlotte Carlsone then prove that the global fitting cost can be easily derived from the fitting cost of the samples. Since fitting costs are computed from small samples, the technique can be incorporated in many ellipse detection and recognition algorithms, and in particular, in algorithms that make use of increme作者: 針葉樹 時間: 2025-3-29 18:40 作者: expansive 時間: 2025-3-29 23:32
Connections on Super Riemann Surfacesbasic algorithm which produces a complete mesh without any cracks. Our method is useful in the surface reconstruction process of scanned objects. It works over the scalar field distance transform of the object to produce the resulting triangle mesh. First we improve the original algorithm in finding作者: 環(huán)形 時間: 2025-3-30 01:07 作者: 讓你明白 時間: 2025-3-30 04:57
Matter Couplings in Global Supersymmetry On the other hand, there are very fast pixel watershed algorithms, but they produce errors not only in certain exotic cases, but also in real-world images and even in the most simple scenarios. In this work, we examine closely the source of these errors and propose a new algorithm that is fast, app作者: Isometric 時間: 2025-3-30 09:45
Gianguido Dall’Agata,Marco Zagermanns. This paper defines a novel purely digital deformable model (DDM), whose internal energy is based on the minimum length polygon (MLP). We prove that our combinatorial regularization term has “convex” properties: any local descent on the energy leads to a global optimum. Similarly to the continuous作者: Airtight 時間: 2025-3-30 15:07 作者: LVAD360 時間: 2025-3-30 18:23 作者: GEN 時間: 2025-3-31 00:37
0302-9743 entation and analysis; discrete and combinatorial Topology; models for discrete geometry; geometric transforms; and discrete tomography.978-3-642-04396-3978-3-642-04397-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 套索 時間: 2025-3-31 03:12
Connections on Super Riemann Surfacesse a relevant error metric tool to compare results and show our new method is more accurate than Marching Cube which is the most widely used triangulation algorithm in the surface reconstruction process of scanned objects.作者: obstruct 時間: 2025-3-31 05:41
Marching Triangle Polygonization for Efficient Surface Reconstruction from Its Distance Transformse a relevant error metric tool to compare results and show our new method is more accurate than Marching Cube which is the most widely used triangulation algorithm in the surface reconstruction process of scanned objects.作者: 膠狀 時間: 2025-3-31 09:29
Arithmetic Discrete Planes Are Quasicrystalsnstruction process for tilings. We then introduce a substitution rule acting on discrete planes, which maps faces of unit cubes to unions of faces, and we discuss some applications to discrete geometry.作者: Fecal-Impaction 時間: 2025-3-31 15:40
Affine Connections, and Midpoint Formation element x in a ring . is called nilpotent if ..?=?0 for suitable non-negative integer ..).Synthetic differential geometry (SDG) is an axiomatic theory, based on such nilpotent infinitesimals. It can be proved, via topos theory, that the axiomatics covers both the differential-geometric notions of algebraic geometry and those of calculus.作者: 孤獨(dú)無助 時間: 2025-3-31 21:27
On Three Constrained Versions of the Digital Circular Arc Recognition Problemboundary that is incident to a given point, or a center that is on a given straight line. Solving these subproblems is interesting in itself, but also for the recognition of digital circular arcs. The proposed algorithm can be iteratively used for this problem. Moreover, since the algorithm is online, it provides a way to segment digital curves.作者: paradigm 時間: 2025-3-31 23:19
Multiscale Discrete Geometryblinear algorithm computing the exact characteristics of a DSS whenever it is a subset of a known standard line. We finally deduce an algorithm for computing a multiscale representation of a digital shape, based only on a DSS decomposition of its boundary.作者: Exposure 時間: 2025-4-1 03:42 作者: SOW 時間: 2025-4-1 08:11
Multi-Label Simple Points Definition for 3D?Images Digital Deformable Modelwith a greedy energy minimization algorithm. A discrete area estimator is used to approach at best standard regularizers classically used in continuous energy minimizing methods. The effectiveness of our approach is shown on several 3D image segmentations.
