標題: Titlebook: Discrete Geometry for Computer Imagery; 18th IAPR Internatio Elena Barcucci,Andrea Frosini,Simone Rinaldi Conference proceedings 2014 Sprin [打印本頁] 作者: Concave 時間: 2025-3-21 17:28
書目名稱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-21 23:52 作者: SEMI 時間: 2025-3-22 04:04 作者: IOTA 時間: 2025-3-22 06:47 作者: Dendritic-Cells 時間: 2025-3-22 10:34 作者: 巫婆 時間: 2025-3-22 13:04 作者: 巫婆 時間: 2025-3-22 20:51
Cloud Platform Optimization for HPCmproves by a ratio of . the previous known bound in . [3]. This new bound is the exact maximum that can be reached. Moreover, we prove that for a given number of squares ., the Minimal Length Covering Curves of . squares are polygonal curves with integer vertices, an appropriate number of diagonal s作者: Mundane 時間: 2025-3-22 22:39 作者: fixed-joint 時間: 2025-3-23 03:16 作者: 膝蓋 時間: 2025-3-23 09:33 作者: 現(xiàn)任者 時間: 2025-3-23 13:09
Manuj Subhankar Sahoo,Pallav Kumar Baruahs distance transformation or medial axis extraction. In the literature, several authors have discussed about conditions on the metric to be considered in a separable approach. In this article, we present generic separable algorithms to efficiently compute Voronoi maps and distance transformations fo作者: 流浪 時間: 2025-3-23 17:30
N. Khare,S. Chaudhry,A. K. Gupta,V. S. Tomard path finding. The anti-aliased Euclidean distance transform (AAEDT), previously presented for two-dimensional images, uses the gray-level information in, for example, area sampled images to calculate distances with sub-pixel precision. Here, we extend the studies of AAEDT to three dimensions, and 作者: 簡略 時間: 2025-3-23 21:58 作者: AMEND 時間: 2025-3-24 00:08
Bixuan Fan,Gerard J. Milburn,Thomas M. Staceractive user input. Different approaches are associated with different fundamental advantages as well as difficulties. In this paper, we investigate the stability of segmentation with respect to perturbations in seed point position for a recently introduced pseudo-distance method referred to as the 作者: 不怕任性 時間: 2025-3-24 06:16 作者: 美色花錢 時間: 2025-3-24 08:23 作者: Arresting 時間: 2025-3-24 13:11 作者: lanugo 時間: 2025-3-24 18:28 作者: 加強防衛(wèi) 時間: 2025-3-24 21:55 作者: 直覺好 時間: 2025-3-25 02:04 作者: 路標 時間: 2025-3-25 07:01 作者: 敵手 時間: 2025-3-25 11:13
Fabrication of Josephson Junctionshe digitization step . tends to 0. On the one hand, it has been proved that the local estimators do not verify this convergence. On the other hand, DSS and MLP based estimators have been proved to converge but only under some convexity and smoothness or polygonal assumptions. In this frame, a new es作者: Mingle 時間: 2025-3-25 12:45 作者: Esophagitis 時間: 2025-3-25 16:22 作者: 眨眼 時間: 2025-3-25 20:04
Peng Cheng,Yutong Lu,Yunfei Du,Zhiguang Chenake advantage of the properties of this framework, to propose a generic thinning scheme for obtaining “thin” skeletons from objects made of voxels. From this scheme, we derive algorithms that produce curvilinear or surface skeletons, based on the notion of 1D or 2D isthmus.作者: accrete 時間: 2025-3-26 00:28
Theory of Antiferromagnetic Superconductorse Freeman square box quantization is not well-defined for such curves, and discuss possible workarounds to deal with them. In the second part, we prove that first-order differential estimators (tangent, normal, length) based on tangent words are multi-grid convergent, for any (..) regular curve, without assuming any form of convexity.作者: CUMB 時間: 2025-3-26 06:02
Facet Connectedness of Discrete Hyperplanes with Zero Intercept: The General Cases connected is a right unbounded interval of ?.. Its lower bound, called the . of v with shift ., may be computed by means of the fully subtractive algorithm. A careful study of the behaviour of this algorithm allows us to give exhaustive results about the connectedness of the hyperplane at the conn作者: elucidate 時間: 2025-3-26 09:52
About the Maximum Cardinality of the Digital Cover of a Curve with a Given Lengthmproves by a ratio of . the previous known bound in . [3]. This new bound is the exact maximum that can be reached. Moreover, we prove that for a given number of squares ., the Minimal Length Covering Curves of . squares are polygonal curves with integer vertices, an appropriate number of diagonal s作者: calamity 時間: 2025-3-26 15:35 作者: perjury 時間: 2025-3-26 20:46
Isthmus-Based Parallel and Asymmetric 3D Thinning Algorithmsake advantage of the properties of this framework, to propose a generic thinning scheme for obtaining “thin” skeletons from objects made of voxels. From this scheme, we derive algorithms that produce curvilinear or surface skeletons, based on the notion of 1D or 2D isthmus.作者: 吊胃口 時間: 2025-3-26 21:18
Completions and Simple Homotopynd (.,.) may be transformed to a trivial couple by simple homotopic deformations that keep . inside .. Thus, these objects are linked by a “relative homotopy relation”..We formalize these notions by means of completions, which are inductive properties expressed in a declarative way. In a previous wo作者: 傲慢物 時間: 2025-3-27 03:49 作者: 贊成你 時間: 2025-3-27 08:48
Anti-Aliased Euclidean Distance Transform on 3D Sampling Latticesd path finding. The anti-aliased Euclidean distance transform (AAEDT), previously presented for two-dimensional images, uses the gray-level information in, for example, area sampled images to calculate distances with sub-pixel precision. Here, we extend the studies of AAEDT to three dimensions, and 作者: 熱心助人 時間: 2025-3-27 10:17 作者: Diastole 時間: 2025-3-27 17:10
The Minimum Barrier Distance – Stability to Seed Point Positionractive user input. Different approaches are associated with different fundamental advantages as well as difficulties. In this paper, we investigate the stability of segmentation with respect to perturbations in seed point position for a recently introduced pseudo-distance method referred to as the 作者: 同音 時間: 2025-3-27 21:17 作者: Anonymous 時間: 2025-3-27 23:22 作者: 慷慨不好 時間: 2025-3-28 03:05 作者: 材料等 時間: 2025-3-28 06:15
Parameter-Free and Multigrid Convergent Digital Curvature Estimators step. Focusing on multigrid convergent estimators, most of them require a user specified parameter to define the scale at which the analysis is performed (size of a convolution kernel, size of local patches for polynomial fitting, etc). In a previous work, we have proposed a new class of estimators作者: 沒有準備 時間: 2025-3-28 12:54
Freeman Digitization and Tangent Word Based Estimatorse Freeman square box quantization is not well-defined for such curves, and discuss possible workarounds to deal with them. In the second part, we prove that first-order differential estimators (tangent, normal, length) based on tangent words are multi-grid convergent, for any (..) regular curve, wit作者: Constituent 時間: 2025-3-28 15:51
Determination of Length and Width of a Line-Segment by Using a Hough Transformne. We present a novel method for determining also length and width of a line segment by using the Hough transform. Our method uses statistical analysis of voting cells around a peak in the Hough space. In image space, the voting cells and voting values are analysed. The functional relationship betw作者: liposuction 時間: 2025-3-28 20:45
Stable Shape Comparison of Surfaces via Reeb Graphsis whether Reeb graphs are robust against function perturbations that may occur because of noise and approximation errors in the data acquisition process. In this work we tackle the problem of stability by providing an editing distance between Reeb graphs of orientable surfaces in terms of the cost 作者: Pigeon 時間: 2025-3-28 23:03 作者: NAV 時間: 2025-3-29 05:29
Non-additive Bounded Sets of Uniqueness in ?,oints, contained in a multidimensional grid . (where for .?∈??, [.]?=?{0,1,...,.???1}), are investigated by means of .-rays in a given set . of lattice directions. Without introducing any noise effect, one aims in finding the minimal cardinality of . which guarantees solution to the uniqueness probl作者: heterogeneous 時間: 2025-3-29 07:26 作者: hegemony 時間: 2025-3-29 15:12
Conference proceedings 2014ical sections on Models for Discrete Geometry, Discrete and Combinatorial Topology, Geometric Transforms, Discrete Shape Representation, Recognition and Analysis, Discrete Tomography, Morphological Analysis, Discrete Modelling and Visualization, Discrete and Combinatorial Tools for Image Segmentation and Analysis.作者: Indurate 時間: 2025-3-29 16:56 作者: 惡名聲 時間: 2025-3-29 23:19 作者: cortisol 時間: 2025-3-30 03:40 作者: overweight 時間: 2025-3-30 07:20 作者: CURB 時間: 2025-3-30 09:20 作者: 翻布尋找 時間: 2025-3-30 16:07
J. Ashkenazi,C. G. Kuper,Amiram Ron on digital shape boundaries based on Integral Invariants. In this paper, we propose new variants of these estimators which are parameter-free and ensure multigrid convergence in 2D. As far as we know, these are the first parameter-free multigrid convergent curvature estimators.作者: syring 時間: 2025-3-30 19:21 作者: Panacea 時間: 2025-3-30 21:01
J. Ashkenazi,C. G. Kuper,Amiram Ronmultaneously by resolving the equations generated by comparing the corresponding coefficients of two functions. We tested and verified the proposed method on simulated and real-world images. Obtained experimental results demonstrate the accuracy of our novel method for determining length and width of detected line segments.作者: 極微小 時間: 2025-3-31 03:40
Determination of Length and Width of a Line-Segment by Using a Hough Transformmultaneously by resolving the equations generated by comparing the corresponding coefficients of two functions. We tested and verified the proposed method on simulated and real-world images. Obtained experimental results demonstrate the accuracy of our novel method for determining length and width of detected line segments.作者: 攤位 時間: 2025-3-31 06:49
0302-9743 CI 2014, held in Siena, Italy, September 2014. The 34 revised full papers presented were carefully selected from 60 submissions. The papers are organized in topical sections on Models for Discrete Geometry, Discrete and Combinatorial Topology, Geometric Transforms, Discrete Shape Representation, Rec作者: 痛苦一下 時間: 2025-3-31 11:20 作者: 隱語 時間: 2025-3-31 14:22
Conference proceedings 2014eld in Siena, Italy, September 2014. The 34 revised full papers presented were carefully selected from 60 submissions. The papers are organized in topical sections on Models for Discrete Geometry, Discrete and Combinatorial Topology, Geometric Transforms, Discrete Shape Representation, Recognition a作者: 遺傳 時間: 2025-3-31 18:02
https://doi.org/10.1007/978-3-319-69953-0ion”..The main result of the paper is a theorem that makes clear the link between homotopic pairs and dyads. Thus, we prove that, in the unified framework of completions, it is possible to handle notions relative to both homotopy and homology.作者: 帶傷害 時間: 2025-3-31 23:23
