作者: URN 時間: 2025-3-21 21:09 作者: extinct 時間: 2025-3-22 04:17 作者: 獸群 時間: 2025-3-22 06:03
Branch Voxels and Junctions in 3D Skeletonsan space. This paper applies the concept of branch points in the 3D orthogonal grid, motivated by the need to analyze curve-like structures in digital images. These curve-like structures have been derived as 3D skeletons (by means of thinning). This paper discusses approaches of defining branch indi作者: 胖人手藝好 時間: 2025-3-22 11:57 作者: cochlea 時間: 2025-3-22 15:53 作者: cochlea 時間: 2025-3-22 18:55
Matching of the Multi-channel Images with Improved Nonparametric Transformations and Weighted Binaryits many desirable properties at relatively small computation complexity: It concentrates on capturing mutual relation among pixels in a small neighbourhoods rather than bare intensity values, thus improving matching discrimination. It is also more resistive against noise and uneven lighting conditi作者: APNEA 時間: 2025-3-22 23:30 作者: Ventricle 時間: 2025-3-23 05:22
A New Sub-pixel Map for Image Analysisd to pixel accuracy. This leads to limitations in the representation of complex structures (such as junctions, triangulations, and skeletons) and discards the sub-pixel information available in grayvalue and color images. We extend the planar map formalism to sub-pixel accuracy and introduce various作者: Affection 時間: 2025-3-23 06:13
Extended Mumford-Shah Regularization in Bayesian Estimation for Blind Image Deconvolution and Segmenoisy images or video sequences. The Mumford-Shah functional is extended to have cost terms for the estimation of blur kernels via a newly introduced prior solution space. This functional is minimized using Γ-convergence approximation in an embedded alternating minimization within Neumann conditions.作者: conifer 時間: 2025-3-23 13:11
Polygonal Approximation of Point Setsnts (surface patches) are known. In particular, point sets can be obtained by laser range scanner mounted on a moving robot or given as edge pixels/voxels in digital images. Polygonal approximation of edge pixels can also be interpreted as grouping of edge pixels to parts of object contours. The pre作者: 有限 時間: 2025-3-23 16:33
Linear Discrete Line Recognition and Reconstruction Based on a Generalized Preimagecross a given set of pixels. Moreover, pixels can be considered in any order and do not need to be connected. A new invertible 2D discrete curve reconstruction algorithm based on the proposed recognition method completes this paper. This algorithm computes a polygonal line so that its standard digit作者: Adrenaline 時間: 2025-3-23 21:45
Digital Line Recognition, Convex Hull, Thickness, a Unified and Logarithmic Techniqueharacterization of the DSS is purely geometrical: all the points must lie between two lines whose distance (relative to the infinite norm) is less than 1. A common approach used to solve this question is to compute the convex hull of the given points. Recent papers explain how to update the minimum 作者: seroma 時間: 2025-3-24 01:35 作者: 誓言 時間: 2025-3-24 02:22 作者: Default 時間: 2025-3-24 08:55
On the Notion of Dimension in Digital Spacese an alternative one for the case of planar digital objects. It makes up certain shortcomings of the definition from [17] and implies dimensionality properties analogous to those familiar from classical topology. We also establish relations between dimension of digital objects and their Euler charac作者: 手榴彈 時間: 2025-3-24 12:52 作者: 使饑餓 時間: 2025-3-24 18:41 作者: Inflammation 時間: 2025-3-24 19:38
Susan A. Howell,Alireza Abdolrasouli operations where . is a bound on all integers defining vertices and edges. We also provide an incremental version of the algorithm whose update complexity is shown to be .(log . + log .). We apply this algorithm to construct the arithmetical line with minimal thickness, which contains a given set o作者: 細(xì)菌等 時間: 2025-3-25 00:21 作者: HILAR 時間: 2025-3-25 06:01 作者: Exclude 時間: 2025-3-25 09:23 作者: 輕彈 時間: 2025-3-25 12:49
Surabhi Sinha,Rashmi Sarkar,Amrita Upadhyayaits many desirable properties at relatively small computation complexity: It concentrates on capturing mutual relation among pixels in a small neighbourhoods rather than bare intensity values, thus improving matching discrimination. It is also more resistive against noise and uneven lighting conditi作者: ensemble 時間: 2025-3-25 19:28
Jessica A. Savas,Reshma L. Mahtani DO fuzzy distance based hierarchical clustering. The method is general and can be of use in numerous applications. In our case we intend to use the clustering in an algorithm for delineation of objects corresponding to parts of proteins in 3D images. The image is defined as a fuzzy object and represen作者: 稱贊 時間: 2025-3-25 20:21
Skin Cancer in the Immunocompromisedd to pixel accuracy. This leads to limitations in the representation of complex structures (such as junctions, triangulations, and skeletons) and discards the sub-pixel information available in grayvalue and color images. We extend the planar map formalism to sub-pixel accuracy and introduce various作者: 形容詞 時間: 2025-3-26 03:36
Nasirah Atiq MD,Hok Bing Thio MD, PhDoisy images or video sequences. The Mumford-Shah functional is extended to have cost terms for the estimation of blur kernels via a newly introduced prior solution space. This functional is minimized using Γ-convergence approximation in an embedded alternating minimization within Neumann conditions.作者: Cognizance 時間: 2025-3-26 05:27 作者: 原來 時間: 2025-3-26 12:29
Robert A. Norman DO, MPH,Zachary Henrycross a given set of pixels. Moreover, pixels can be considered in any order and do not need to be connected. A new invertible 2D discrete curve reconstruction algorithm based on the proposed recognition method completes this paper. This algorithm computes a polygonal line so that its standard digit作者: Processes 時間: 2025-3-26 16:07
Skin Diseases in the Immunosuppressedharacterization of the DSS is purely geometrical: all the points must lie between two lines whose distance (relative to the infinite norm) is less than 1. A common approach used to solve this question is to compute the convex hull of the given points. Recent papers explain how to update the minimum 作者: CHECK 時間: 2025-3-26 19:30
Skin Diseases in Primary Immunodeficiencies,clidean rotation. For this kind of algorithm, to be incremental means to compute successively all the intermediate rotated copies of an image for angles in-between 0 and a destination angle. The discretized rotation consists in the composition of an Euclidean rotation with a discretization; the aim 作者: 違反 時間: 2025-3-26 22:02
Skin Disorders in Vulnerable Populationsoperties is topology. Only recently a sampling theorem for cubic grids could be proved which guarantees topology preservation [1]. The drawback of this theorem is that it requires more complicated reconstruction methods than the direct representation with voxels. In this paper we show that face cent作者: ASTER 時間: 2025-3-27 02:58
Types of Skin Disease and Their Causes,e an alternative one for the case of planar digital objects. It makes up certain shortcomings of the definition from [17] and implies dimensionality properties analogous to those familiar from classical topology. We also establish relations between dimension of digital objects and their Euler charac作者: 無能力之人 時間: 2025-3-27 08:41
Combinatorial Image Analysis978-3-540-35154-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 鐵塔等 時間: 2025-3-27 13:16 作者: 大量 時間: 2025-3-27 17:10 作者: mechanism 時間: 2025-3-27 19:16
Susan A. Howell,Alireza Abdolrasouli operations where . is a bound on all integers defining vertices and edges. We also provide an incremental version of the algorithm whose update complexity is shown to be .(log . + log .). We apply this algorithm to construct the arithmetical line with minimal thickness, which contains a given set of integer points.作者: MIRTH 時間: 2025-3-28 00:48
https://doi.org/10.1007/978-3-031-57836-6this context, we propose several new parallel algorithms, which are both fast and simple to implement, to obtain symmetrical skeletons of 2D objects in 2D or 3D grids. We prove some properties of these skeletons, related to topology preservation, and to the inclusion of the topological axis which may be seen as a generalization of the medial axis.作者: 智力高 時間: 2025-3-28 02:53 作者: judiciousness 時間: 2025-3-28 07:25 作者: GRILL 時間: 2025-3-28 12:44
Bernard Naafs,Roderick Hay,Aldo MorroneLet . be a simple closed ..-curve in . with .. elements, . ∈ {1, 2}. After doing a .-homotopic thinning of . to obtain a closed .-surface, we calculate the .-fundamental group of . by the use of some properties of an .-covering... 52XX, 52B05, 52Cxx, 57M05, 55P10, 57M10.作者: labyrinth 時間: 2025-3-28 16:24 作者: PURG 時間: 2025-3-28 19:54 作者: Arboreal 時間: 2025-3-29 00:40 作者: 你敢命令 時間: 2025-3-29 03:51 作者: Brittle 時間: 2025-3-29 10:08 作者: nepotism 時間: 2025-3-29 15:10
New 2D Parallel Thinning Algorithms Based on Critical Kernelsthis context, we propose several new parallel algorithms, which are both fast and simple to implement, to obtain symmetrical skeletons of 2D objects in 2D or 3D grids. We prove some properties of these skeletons, related to topology preservation, and to the inclusion of the topological axis which may be seen as a generalization of the medial axis.作者: 漂亮 時間: 2025-3-29 16:10
On the Notion of Dimension in Digital Spacese an alternative one for the case of planar digital objects. It makes up certain shortcomings of the definition from [17] and implies dimensionality properties analogous to those familiar from classical topology. We also establish relations between dimension of digital objects and their Euler characteristic.作者: Stress-Fracture 時間: 2025-3-29 21:24
Jessica A. Savas,Reshma L. Mahtani DOo group the points. The normalised Hubert’s statistic is used as validity index to determine the number of clusters. The method is tested on three 2D images; two synthetic images and one fuzzy distance transformed microscopy image of stem cells. All experiments show promising initial results.作者: Biguanides 時間: 2025-3-30 02:08
Nasirah Atiq MD,Hok Bing Thio MD, PhDegularization parameters using the L-curve method is presented. Numerical experiments show that the proposed algorithm is efficiency and robust in that it can handle images that are formed in different environments with different types and amounts of blur and noise.作者: Macronutrients 時間: 2025-3-30 05:14 作者: 無瑕疵 時間: 2025-3-30 10:25
Skin Diseases in Primary Immunodeficiencies,se description of the discontinuities turns to be the key ingredient that makes the resulting procedure optimally fast and exact. A complete description of the incremental rotation process is provided, also this result may be useful in the specification of a consistent set of definitions for discrete geometry.作者: pulse-pressure 時間: 2025-3-30 15:17 作者: 農(nóng)學(xué) 時間: 2025-3-30 20:15 作者: Definitive 時間: 2025-3-30 23:11 作者: famine 時間: 2025-3-31 03:29
Incremental and Transitive Discrete Rotationsse description of the discontinuities turns to be the key ingredient that makes the resulting procedure optimally fast and exact. A complete description of the incremental rotation process is provided, also this result may be useful in the specification of a consistent set of definitions for discrete geometry.作者: 物質(zhì) 時間: 2025-3-31 08:32
Skin Cancer in the Immunocompromisedards the sub-pixel information available in grayvalue and color images. We extend the planar map formalism to sub-pixel accuracy and introduce various algorithms to create such a map, thereby demonstrating significant gains over the existing approaches.作者: garrulous 時間: 2025-3-31 13:00
Robert A. Norman DO, MPH,Zachary Henrystruction algorithm based on the proposed recognition method completes this paper. This algorithm computes a polygonal line so that its standard digitization is equal to the discrete curve. These two methods are based on the definition of a new generalized preimage and the framework is the discrete analytical geometry.作者: optional 時間: 2025-3-31 14:24
A New Sub-pixel Map for Image Analysisards the sub-pixel information available in grayvalue and color images. We extend the planar map formalism to sub-pixel accuracy and introduce various algorithms to create such a map, thereby demonstrating significant gains over the existing approaches.作者: peak-flow 時間: 2025-3-31 21:06
Linear Discrete Line Recognition and Reconstruction Based on a Generalized Preimagestruction algorithm based on the proposed recognition method completes this paper. This algorithm computes a polygonal line so that its standard digitization is equal to the discrete curve. These two methods are based on the definition of a new generalized preimage and the framework is the discrete analytical geometry.作者: cathartic 時間: 2025-3-31 22:38 作者: hazard 時間: 2025-4-1 03:55 作者: murmur 時間: 2025-4-1 07:59 作者: Basilar-Artery 時間: 2025-4-1 11:15 作者: Notify 時間: 2025-4-1 17:48
Branch Voxels and Junctions in 3D Skeletonsces for voxels on 3D skeletons, where the notion of a junction will play a crucial role. We illustrate the potentials of using junctions in 3D image analysis based on a recent project of analyzing the distribution of astrocytes in human brain tissue.作者: notice 時間: 2025-4-1 21:11
Grayscale Watersheds on Perfect Fusion Graphs to topological watershed, a major advantage of this transformation is that, on perfect fusion graph, it can be computed thanks to a simple linear-time immersion-like algorithm. Finally, we derive characterizations of perfect fusion graphs based on thinness properties of both topological watersheds and C-watersheds.
