標(biāo)題: Titlebook: Discrete Geometry for Computer Imagery; 13th International C Attila Kuba,László G. Nyúl,Kálmán Palágyi Conference proceedings 2006 Springer [打印本頁(yè)] 作者: cerebral-cortex 時(shí)間: 2025-3-21 17:20
書(shū)目名稱Discrete Geometry for Computer Imagery影響因子(影響力)
書(shū)目名稱Discrete Geometry for Computer Imagery影響因子(影響力)學(xué)科排名
書(shū)目名稱Discrete Geometry for Computer Imagery網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Discrete Geometry for Computer Imagery網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Discrete Geometry for Computer Imagery被引頻次
書(shū)目名稱Discrete Geometry for Computer Imagery被引頻次學(xué)科排名
書(shū)目名稱Discrete Geometry for Computer Imagery年度引用
書(shū)目名稱Discrete Geometry for Computer Imagery年度引用學(xué)科排名
書(shū)目名稱Discrete Geometry for Computer Imagery讀者反饋
書(shū)目名稱Discrete Geometry for Computer Imagery讀者反饋學(xué)科排名
作者: OWL 時(shí)間: 2025-3-21 20:42 作者: Neutral-Spine 時(shí)間: 2025-3-22 03:16
Duality and Geometry Straightness, Characterization and EnvelopeDuality applied to geometrical problems is widely used in many applications in computer vision or computational geometry. A classical example is the Hough Transform to detect linear structures in images. In this paper, we focus on two kinds of duality/polarity applied to geometrical problems: digital straightness detection and envelope computation.作者: lambaste 時(shí)間: 2025-3-22 06:46 作者: 思鄉(xiāng)病 時(shí)間: 2025-3-22 11:40 作者: instructive 時(shí)間: 2025-3-22 14:39
Geometry of Neighborhood Sequences in Hexagonal Gridtain values 1, 2 and 3. The grid is coordinatized by three coordinates in a symmetric way. Digital circles are classified based on digital distances using neighborhood sequences. They can be triangle, hexagon, enneagon and dodecagon. The corners of the convex hulls of these polygons are computed.作者: instructive 時(shí)間: 2025-3-22 18:49 作者: 具體 時(shí)間: 2025-3-22 23:44 作者: Anonymous 時(shí)間: 2025-3-23 03:32
A Network Flow Algorithm for Binary Image Reconstruction from Few Projections, black-and-white) that do . have an intrinsic lattice structure from a small number of projections. We describe how the reconstruction problem from only two projections can be formulated as a network flow problem in a graph, which can be solved efficiently. When only two projections are used, the r作者: 危機(jī) 時(shí)間: 2025-3-23 09:36 作者: 保存 時(shí)間: 2025-3-23 10:57
Reconstruction Algorithm and Switching Graph for Two-Projection Tomography with Prohibited Subregiongorithm gives a solution. We then study the relation of the switching graph for the solution sets with and without the prohibited region. Finally, we apply our idea to get a better reconstruction figure imposing prohibited region artificially.作者: Cpr951 時(shí)間: 2025-3-23 15:18 作者: MARS 時(shí)間: 2025-3-23 18:12
Quantised Angular Momentum Vectors and Projection Angle Distributions for Discrete Radon Transformate resulting angle sets are an alternative to those derived using the Farey fractions from number theory. The Farey angles arise naturally through the definitions of the Mojette and Finite Radon Transforms. Often a subset of the Farey angles needs to be selected when reconstructing images from a limi作者: Foolproof 時(shí)間: 2025-3-23 22:51
A Benchmark Evaluation of Large-Scale Optimization Approaches to Binary Tomography problems, this tomography problem involves thousands of variables. Applicability and performance of discrete tomography therefore largely depend on the criteria used for reconstruction and the optimization algorithm applied. From this viewpoint, we evaluate two major optimization strategies, simula作者: 變化 時(shí)間: 2025-3-24 03:38 作者: 古老 時(shí)間: 2025-3-24 09:08
Minimal Non-simple and Minimal Non-cosimple Sets in Binary Images on Cell Complexesent” and “26-simple” 1 in binary images on the 3-cells of a 3D cubical complex; the concepts of . and . 1 are generalizations of the concepts of “6-component” and “6-simple” 1. Over the past 20 years, the problems of determining just which sets of 1’s can be minimal non-simple, just which sets can b作者: grounded 時(shí)間: 2025-3-24 12:10
Reusing Integer Homology Information of Binary Digital Images. For doing this, the homology of the object is encoded in an algebraic-topological format (that we call AM-model). Moreover, in the case of 3D binary digital images, having as input AM-models for the images . and ., we design fast algorithms for computing the integer homology of . ∪., . ∩. and . ?.作者: 遺產(chǎn) 時(shí)間: 2025-3-24 17:36 作者: ingrate 時(shí)間: 2025-3-24 20:52 作者: degradation 時(shí)間: 2025-3-24 23:33 作者: avenge 時(shí)間: 2025-3-25 06:02 作者: MOAN 時(shí)間: 2025-3-25 09:40 作者: Grandstand 時(shí)間: 2025-3-25 13:29 作者: 矛盾 時(shí)間: 2025-3-25 19:06
Reconstruction Algorithm and Switching Graph for Two-Projection Tomography with Prohibited Subregiongorithm gives a solution. We then study the relation of the switching graph for the solution sets with and without the prohibited region. Finally, we apply our idea to get a better reconstruction figure imposing prohibited region artificially.作者: 生來(lái) 時(shí)間: 2025-3-25 22:37 作者: Hemodialysis 時(shí)間: 2025-3-26 00:43 作者: overwrought 時(shí)間: 2025-3-26 05:45
On the Lattice Structure of Subsets of Octagonal Neighborhood Sequences in ?n ?., with respect to two ordering relations .. and .. Both orderings have some natural meaning, especially .. compares the ”speed” how neighborhood sequences spread in ?.. We summarize our and the previous related results in a table. In particular, our theorems can be considered as extensions of some results from [1,2,3].作者: Coronary-Spasm 時(shí)間: 2025-3-26 08:47 作者: 虛構(gòu)的東西 時(shí)間: 2025-3-26 14:10 作者: SHOCK 時(shí)間: 2025-3-26 17:10 作者: 體貼 時(shí)間: 2025-3-26 21:34 作者: Retrieval 時(shí)間: 2025-3-27 01:38 作者: GNAW 時(shí)間: 2025-3-27 08:13 作者: transient-pain 時(shí)間: 2025-3-27 12:07 作者: 故意 時(shí)間: 2025-3-27 16:54 作者: Notorious 時(shí)間: 2025-3-27 20:03 作者: barium-study 時(shí)間: 2025-3-28 00:58
Supervision in Analytic Training. For doing this, the homology of the object is encoded in an algebraic-topological format (that we call AM-model). Moreover, in the case of 3D binary digital images, having as input AM-models for the images . and ., we design fast algorithms for computing the integer homology of . ∪., . ∩. and . ?..作者: 深陷 時(shí)間: 2025-3-28 04:10 作者: CRATE 時(shí)間: 2025-3-28 07:36 作者: 松雞 時(shí)間: 2025-3-28 11:53
https://doi.org/10.1007/119073503D; Computer; Hardware; Resolution; algorithm; algorithmic geometry; calculus; computational geometry; compu作者: ethereal 時(shí)間: 2025-3-28 17:08
978-3-540-47651-1Springer-Verlag GmbH Germany, part of Springer Nature 2006作者: 絕緣 時(shí)間: 2025-3-28 18:59
Supersymmetry Breaking Operators,In this paper we study the relationship between the Euclidean and the discrete world thru two operations based on the Euclidean scaling function: the discrete smooth scaling and the discrete based geometrical simplification.作者: RECUR 時(shí)間: 2025-3-29 02:45 作者: 使成波狀 時(shí)間: 2025-3-29 04:40 作者: 反應(yīng) 時(shí)間: 2025-3-29 11:01 作者: TIA742 時(shí)間: 2025-3-29 13:55
https://doi.org/10.1007/978-3-030-94047-8iscuss ways to place a maximal number unit square tiles on a chess board so that the shape they form has a minimal number of unit square neighbors. Previous works have shown that “digital spheres” have a minimum of neighbors for their area. We here characterize all shapes that are optimal and show t作者: BOOR 時(shí)間: 2025-3-29 15:56
The Standard Model of?Particle Physicsice ?.. We use this unified vision to explain the extension of the definition of Voss [1] to an arbitrary dimension and we show how to extend the definition of Figueiredo and Reveillès [2] to an arbitrary dimension.作者: 裝勇敢地做 時(shí)間: 2025-3-29 21:39
Springer Science+Business Media, LLCtain values 1, 2 and 3. The grid is coordinatized by three coordinates in a symmetric way. Digital circles are classified based on digital distances using neighborhood sequences. They can be triangle, hexagon, enneagon and dodecagon. The corners of the convex hulls of these polygons are computed.作者: meditation 時(shí)間: 2025-3-30 00:16 作者: 文字 時(shí)間: 2025-3-30 04:05 作者: NEXUS 時(shí)間: 2025-3-30 11:53 作者: arousal 時(shí)間: 2025-3-30 14:40 作者: acrimony 時(shí)間: 2025-3-30 19:44 作者: Arthr- 時(shí)間: 2025-3-30 22:13
Supervisie in onderwijs en ontwikkelinge transforms requiring only the addition operation. Over the last 10 years it has found many applications including image watermarking and encryption, tomographic reconstruction, robust data transmission and distributed data storage. This paper presents an elegant and efficient algorithm to directly作者: CLOWN 時(shí)間: 2025-3-31 01:58 作者: kidney 時(shí)間: 2025-3-31 07:23 作者: Minutes 時(shí)間: 2025-3-31 12:00 作者: 形容詞 時(shí)間: 2025-3-31 14:49
Rethinking the Spaces of Supervisionent” and “26-simple” 1 in binary images on the 3-cells of a 3D cubical complex; the concepts of . and . 1 are generalizations of the concepts of “6-component” and “6-simple” 1. Over the past 20 years, the problems of determining just which sets of 1’s can be minimal non-simple, just which sets can b作者: Acquired 時(shí)間: 2025-3-31 20:24
Supervision in Analytic Training. For doing this, the homology of the object is encoded in an algebraic-topological format (that we call AM-model). Moreover, in the case of 3D binary digital images, having as input AM-models for the images . and ., we design fast algorithms for computing the integer homology of . ∪., . ∩. and . ?.作者: 我還要背著他 時(shí)間: 2025-4-1 00:19
Supervising and Being Supervised ?., with respect to two ordering relations .. and .. Both orderings have some natural meaning, especially .. compares the ”speed” how neighborhood sequences spread in ?.. We summarize our and the previous related results in a table. In particular, our theorems can be considered as extensions of som作者: assail 時(shí)間: 2025-4-1 03:18 作者: constitutional 時(shí)間: 2025-4-1 07:00 作者: jaundiced 時(shí)間: 2025-4-1 13:37
On Minimal Perimeter Polyminoeshat they are all close to being digital spheres. In addition, we show a similar result when the 8-connectivity metric is assumed (i.e.?connectivity through vertices or edges, instead of edge connectivity as in 4-connectivity).作者: 敘述 時(shí)間: 2025-4-1 16:46
A Benchmark Evaluation of Large-Scale Optimization Approaches to Binary Tomographyted annealing and convex-concave regularization, for the case of binary-valued functions using various data sets. Extensive numerical experiments show that despite being quite different from the viewpoint of optimization, both strategies show similar reconstruction performance as well as robustness to noise.作者: Impugn 時(shí)間: 2025-4-1 18:46
Supervisie over groepspsychotherapiethat permits to decrease the overall time-complexity of the reconstruction algorithm to .(..log.). More generally, the reconstruction of Q-convex sets and convex lattice sets (intersection of a convex polygon with ?.) can be done in .(..log.)-time.作者: 商談 時(shí)間: 2025-4-2 00:35 作者: 文件夾 時(shí)間: 2025-4-2 05:22 作者: pulse-pressure 時(shí)間: 2025-4-2 10:29
