標(biāo)題: Titlebook: Discrete Geometry and Mathematical Morphology; Third International Sara Brunetti,Andrea Frosini,Simone Rinaldi Conference proceedings 2024 [打印本頁] 作者: whiplash 時(shí)間: 2025-3-21 17:49
書目名稱Discrete Geometry and Mathematical Morphology影響因子(影響力)
書目名稱Discrete Geometry and Mathematical Morphology影響因子(影響力)學(xué)科排名
書目名稱Discrete Geometry and Mathematical Morphology網(wǎng)絡(luò)公開度
書目名稱Discrete Geometry and Mathematical Morphology網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Discrete Geometry and Mathematical Morphology被引頻次
書目名稱Discrete Geometry and Mathematical Morphology被引頻次學(xué)科排名
書目名稱Discrete Geometry and Mathematical Morphology年度引用
書目名稱Discrete Geometry and Mathematical Morphology年度引用學(xué)科排名
書目名稱Discrete Geometry and Mathematical Morphology讀者反饋
書目名稱Discrete Geometry and Mathematical Morphology讀者反饋學(xué)科排名
作者: 傻 時(shí)間: 2025-3-21 23:11
Recognition of?Arithmetic Line Segments?and?Hyperplanes Using the?Stern-Brocot Treelly, naive arithmetic hyperplanes, and we present a new approach to recognise these discrete structures based on the Stern-Brocot tree. The algorithm for DSS recognition proposes an alternative method to the state of the art, keeping the linear complexity and incremental character. While most of the作者: Orgasm 時(shí)間: 2025-3-22 01:54
Bijective Digitized 3D Rotation Based on?Beam Shearsquence of three 2D shears along coordinate axes, leading to a decomposition of a 3D rotation into nine (beam) shears in total. We define a 3D digitized rotation using nine digitized beam shears, i.e., we round the result of each shear before applying the next one. As digitized shears are bijective, 作者: 悅耳 時(shí)間: 2025-3-22 06:47 作者: PAEAN 時(shí)間: 2025-3-22 09:30
Decomposition of?Rational Discrete Planes. Up to translation and symmetry, they are completely determined by a normal vector .. Excepted for a few well-identified cases, it is shown that there are two approximations . of ., satisfying ., such that the discrete plane of normal . can be partitioned into two sets having respectively the combi作者: Annotate 時(shí)間: 2025-3-22 14:24
Differential Maximum Euclidean Distance Transform Computation in?Component Treesong other applications, the maximum distance transform (DT) value can describe the thickness of the connected components of the image. In this paper, we propose using the maximum distance transform value as an attribute of component tree nodes. We present a novel algorithm to compute the maximum DT 作者: Annotate 時(shí)間: 2025-3-22 17:05 作者: 杠桿 時(shí)間: 2025-3-22 23:15
Digital Calculus Frameworks and?Comparative Evaluation of?Their Laplace-Beltrami Operatorsnal problems onto them. However digital surfaces (boundary of voxels) cannot benefit directly from the classical mesh calculus frameworks, since their vertex and face geometry is too poor to capture the geometry of the underlying smooth Euclidean surface well enough. This paper proposes two new calc作者: Guileless 時(shí)間: 2025-3-23 04:08 作者: dominant 時(shí)間: 2025-3-23 09:28
A Khalimsky-Like Topology on?the?Triangular Gridsquare grid, causing the fact that the digital version of the Jordan curve theorem needs some special care. In a nutshell, the paradox can be interpreted by lines, e.g., two different color diagonals of a chessboard that go through each other without sharing a pixel. The triangular grid also has a s作者: Affection 時(shí)間: 2025-3-23 11:24
Group Equivariant Networks Using Morphological Operatorsished on the subject and the literature keeps increasing. This paper aims to fill the lack of morphological approaches on the matter. We propose a set of group equivariant layers using morphological operators, several model configurations are tested and compared with a convolutional equivalent netwo作者: 爭(zhēng)議的蘋果 時(shí)間: 2025-3-23 16:40
An Algorithm to?Train Unrestricted Sequential Discrete Morphological Neural Networkso date has been the morphological neural networks (MNN). Although MNN have performed better than CNN in solving some problems, they inherit their black-box nature. Furthermore, in the case of binary images, they are approximations that loose the Boolean lattice structure of MM operators and, thus, i作者: 似少年 時(shí)間: 2025-3-23 21:11
Discovering Repeated Patterns from?the?Onsets in?a?Multidimensional Representation of?MusicThe main idea proposed here is to use the onsets to discover musical patterns. By definition, the morphological erosion of musical data by a musical pattern corresponds to its onsets. However, the erosion of musical data by the onsets is not always equal to the musical pattern. We propose a theorem 作者: CLOT 時(shí)間: 2025-3-23 22:21
The Lattice Overparametrization Paradigm for?the?Machine Learning of?Lattice Operators of operators based on prior information with low bias, and low complexity relative to the sample size. From a computational perspective, there should be an efficient algorithm to minimize an empirical error over the class. From an understanding point of view, the properties of the learned operator 作者: ANIM 時(shí)間: 2025-3-24 04:12
https://doi.org/10.1007/978-3-030-05958-3 from dimension 3. If we consider now .-simplices instead of a segment (2-simplex), we achieve an equivalence in arbitrary dimension .. Secondly, we exhibit another characterization of full convexity, which is recursive with respect to the dimension and uses simple axis projections. This latter char作者: 空中 時(shí)間: 2025-3-24 06:55
The Conservative Party and Women’s Suffrageute twice as fast as the node-reconstruction approach. Our proposed attribute is increasing and its applicability is exemplified by the design of an extinction value filter. The ability to select thin connected components, like cables, of our filter is compared to filters using other increasing attr作者: 沉思的魚 時(shí)間: 2025-3-24 13:42 作者: Charlatan 時(shí)間: 2025-3-24 18:49 作者: Vaginismus 時(shí)間: 2025-3-24 19:26 作者: creatine-kinase 時(shí)間: 2025-3-25 03:12
Some Geometric and?Tomographic Results on?Gray-Scale Images作者: 結(jié)束 時(shí)間: 2025-3-25 07:08
New Characterizations of Full Convexity from dimension 3. If we consider now .-simplices instead of a segment (2-simplex), we achieve an equivalence in arbitrary dimension .. Secondly, we exhibit another characterization of full convexity, which is recursive with respect to the dimension and uses simple axis projections. This latter char作者: 可忽略 時(shí)間: 2025-3-25 09:13
Differential Maximum Euclidean Distance Transform Computation in?Component Treesute twice as fast as the node-reconstruction approach. Our proposed attribute is increasing and its applicability is exemplified by the design of an extinction value filter. The ability to select thin connected components, like cables, of our filter is compared to filters using other increasing attr作者: 永久 時(shí)間: 2025-3-25 15:08
An Algorithm to?Train Unrestricted Sequential Discrete Morphological Neural Networkse is composed only of operators that can be decomposed as the supremum, infimum, and complement of erosions and dilations. In this paper, we propose an algorithm to learn unrestricted sequential DMNN, whose architecture is given by the composition of general W-operators. We illustrate the algorithm 作者: MARS 時(shí)間: 2025-3-25 16:45 作者: 舔食 時(shí)間: 2025-3-25 21:26 作者: ascend 時(shí)間: 2025-3-26 03:16
978-3-031-57792-5The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: Vertebra 時(shí)間: 2025-3-26 05:22
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281109.jpg作者: Tdd526 時(shí)間: 2025-3-26 12:32
Chapter 8: The Give-Back of the Givingets of ., especially Euclidean balls. We shed light on the hierarchical structure of these rotations, induced by their discontinuity (characterized by hinge angles) and the size of the considered ball. We propose efficient algorithmic schemes leading to the construction of combinatorial models (tree作者: Individual 時(shí)間: 2025-3-26 14:56
Plato killed a moth in my dreamlly, naive arithmetic hyperplanes, and we present a new approach to recognise these discrete structures based on the Stern-Brocot tree. The algorithm for DSS recognition proposes an alternative method to the state of the art, keeping the linear complexity and incremental character. While most of the作者: anticipate 時(shí)間: 2025-3-26 18:19
Chapter 7: Ajahn Chah Gives a Teachingquence of three 2D shears along coordinate axes, leading to a decomposition of a 3D rotation into nine (beam) shears in total. We define a 3D digitized rotation using nine digitized beam shears, i.e., we round the result of each shear before applying the next one. As digitized shears are bijective, 作者: 徹底明白 時(shí)間: 2025-3-26 22:23
https://doi.org/10.1007/978-3-030-05958-3ected and even simply connected whatever the dimension, while remaining digitally convex in the usual sense. Several characterizations were proposed in former works, either based on lattice intersection enumeration with several convex hulls, or using the idempotence of an envelope operator. We conti作者: Harass 時(shí)間: 2025-3-27 01:52
Avant-garde Women and Women’s Suffrage. Up to translation and symmetry, they are completely determined by a normal vector .. Excepted for a few well-identified cases, it is shown that there are two approximations . of ., satisfying ., such that the discrete plane of normal . can be partitioned into two sets having respectively the combi作者: 臭名昭著 時(shí)間: 2025-3-27 05:46
The Conservative Party and Women’s Suffrageong other applications, the maximum distance transform (DT) value can describe the thickness of the connected components of the image. In this paper, we propose using the maximum distance transform value as an attribute of component tree nodes. We present a novel algorithm to compute the maximum DT 作者: 我還要背著他 時(shí)間: 2025-3-27 10:59 作者: Synapse 時(shí)間: 2025-3-27 16:19
Josefina Erikson,Lenita Freidenvallnal problems onto them. However digital surfaces (boundary of voxels) cannot benefit directly from the classical mesh calculus frameworks, since their vertex and face geometry is too poor to capture the geometry of the underlying smooth Euclidean surface well enough. This paper proposes two new calc作者: Modify 時(shí)間: 2025-3-27 21:44
https://doi.org/10.1007/978-3-031-52359-5ht to one of the two focal points. Fitting of egg-shapes thus requires optimization of 6 parameters. Our approach simplifies this to a 1D parameter space exploration. First, we utilize a least square algorithm to fit an ellipse to the boundary. While the desired egg-shape shares the orientation of t作者: dura-mater 時(shí)間: 2025-3-27 22:50 作者: 寬容 時(shí)間: 2025-3-28 04:47
Sugarcane Biofuel Production in Indonesiaished on the subject and the literature keeps increasing. This paper aims to fill the lack of morphological approaches on the matter. We propose a set of group equivariant layers using morphological operators, several model configurations are tested and compared with a convolutional equivalent netwo作者: Obverse 時(shí)間: 2025-3-28 08:43
https://doi.org/10.1007/978-3-642-73875-3o date has been the morphological neural networks (MNN). Although MNN have performed better than CNN in solving some problems, they inherit their black-box nature. Furthermore, in the case of binary images, they are approximations that loose the Boolean lattice structure of MM operators and, thus, i作者: 寬敞 時(shí)間: 2025-3-28 13:13 作者: Friction 時(shí)間: 2025-3-28 16:35 作者: sorbitol 時(shí)間: 2025-3-28 19:28
Discrete Geometry and Mathematical Morphology978-3-031-57793-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: cultivated 時(shí)間: 2025-3-29 02:19
Decomposition of?Rational Discrete Planesnatorial structure of discrete planes of normal . and .. Christoffel graphs are used to compactly encode the structure of discretes planes. This result may have practical interest in discrete geometry for the analysis of planar features.作者: Esalate 時(shí)間: 2025-3-29 06:42 作者: Mendicant 時(shí)間: 2025-3-29 11:08 作者: 拋射物 時(shí)間: 2025-3-29 15:19
Conference proceedings 2024uctures and Tilings;?Learning Based Morphology;?Hierarchical and Graph-Based Models, Analysis and Segmentation;?Discrete and Combinatorial Topology; and Mathematical Morphology and Digital Geometry for Applications..作者: prosthesis 時(shí)間: 2025-3-29 18:47
0302-9743 screte Structures and Tilings;?Learning Based Morphology;?Hierarchical and Graph-Based Models, Analysis and Segmentation;?Discrete and Combinatorial Topology; and Mathematical Morphology and Digital Geometry for Applications..978-3-031-57792-5978-3-031-57793-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Neuropeptides 時(shí)間: 2025-3-29 21:35 作者: 幼稚 時(shí)間: 2025-3-30 02:24
0302-9743 , DGMM 2024, held in Florence, Italy during April 15–18, 2024...The 34 full papers included in this book were carefully reviewed and selected from 51 submissions.?They were organized in topical sections as follows: Digital Geometry - Models, Transforms, and Visualization;?Computational Aspects of Di作者: 精確 時(shí)間: 2025-3-30 07:18 作者: 削減 時(shí)間: 2025-3-30 09:30
Chapter 7: Ajahn Chah Gives a Teachingd rotation using nine digitized beam shears, i.e., we round the result of each shear before applying the next one. As digitized shears are bijective, our 3D digitized rotation inherits the same property. Experiments show that the average error of our digitized rotation compared to the continuous one is kept under 1 (around 0.8).作者: 空氣 時(shí)間: 2025-3-30 13:57 作者: Stress-Fracture 時(shí)間: 2025-3-30 18:24
Bijectivity Analysis of?Finite Rotations on?,: A?Hierarchical Approach hinge angles) and the size of the considered ball. We propose efficient algorithmic schemes leading to the construction of combinatorial models (trees) of the bijective finite rotations. These algorithms and structures open the way to a better understanding of the notion of bijectivity with respect to finite vs. infinite discrete rotations.作者: 花爭(zhēng)吵 時(shí)間: 2025-3-30 21:14
Bijective Digitized 3D Rotation Based on?Beam Shearsd rotation using nine digitized beam shears, i.e., we round the result of each shear before applying the next one. As digitized shears are bijective, our 3D digitized rotation inherits the same property. Experiments show that the average error of our digitized rotation compared to the continuous one is kept under 1 (around 0.8).作者: 牲畜欄 時(shí)間: 2025-3-31 01:50 作者: 費(fèi)解 時(shí)間: 2025-3-31 05:46 作者: Delude 時(shí)間: 2025-3-31 12:32 作者: 起草 時(shí)間: 2025-3-31 15:41
https://doi.org/10.1007/978-3-642-73875-3which guarantees the equality if the musical pattern satisfies a topological condition. This condition is met when the patterns do not intersect, or only slightly, which is coherent in a musical context. Due to the importance of repetition in music, this idea proves to be relevant for the musical pattern discovery task.作者: Pageant 時(shí)間: 2025-3-31 18:20
Plato killed a moth in my dream by the branch of the Stern-Brocot tree. This generalisation shows the close link between arithmetic hyperplanes and the generalised Stern-Brocot tree and opens up interesting perspectives for the recognition of pieces of arithmetic hyperplanes.
