In this letter a new skeletonization algorithm is proposed. It combines techniques of fast construction of Euclidean Distance Maps(EDMs), ridge extraction, Hit-or-Miss Transformation(HMT) of structuring elements and t...In this letter a new skeletonization algorithm is proposed. It combines techniques of fast construction of Euclidean Distance Maps(EDMs), ridge extraction, Hit-or-Miss Transformation(HMT) of structuring elements and the set operators. It first produces the EDM image with no more than 4 passes through an image of any kinds, and then the ridge image is extracted by applying a turn-on scheme and performing a rain-fall elimination to accelerate the processing. The one-pixel wide skeleton is finally acquired by carrying out the HMTs of two structure elements and the SUBTRACT and OR operations. Experimental results obtained by practical applications are also presented.展开更多
An approach of distane map based imageenhancement (DMIE) is proposed. It is applied toconventional interpolations to get sharp images. Edgedetection is performed after images are interpolatedby linear interpolations. ...An approach of distane map based imageenhancement (DMIE) is proposed. It is applied toconventional interpolations to get sharp images. Edgedetection is performed after images are interpolatedby linear interpolations. To meet the two conditionsset for DMIE, i. e., no abrupt changes and no over-boosting, different boosting rate should be used inadjusting pixel intensities. When the boosting rate isdetermined by using the distance from enhancedpixels to nearest edges, edge-oriented imageenhancement is obtained. By using Erosion technique,the range for pixel intensity adiustment is set.Over-enhancement is avoided by limiting the pixel iutensities in enhancement within the range. A unifled linear-time algoritiml for disance transform is adopted to deal with the calculation of Euelidean distance of the images.Its computation complexity is 0(N).After the preparation,i.e.,distance transforming and erosion,the images get more and more sharpened while no over.boosting.Occurs by repeating the enhancement procedure ,The simplicity of the enhancement operation makes DMIE suitable for enhancement rate adjusting展开更多
In the present paper, the problem of handwritten character recognition has been tackled with multiresolution technique using discrete wavelet transform (DWT) and Euclidean distance metric (EDM). The technique has been...In the present paper, the problem of handwritten character recognition has been tackled with multiresolution technique using discrete wavelet transform (DWT) and Euclidean distance metric (EDM). The technique has been tested and found to be more accurate and faster. Characters is classified into 26 pattern classes based on appropriate properties. Features of the handwritten character images are extracted by DWT used with appropriate level of multiresolution technique, and then each pattern class is characterized by a mean vector. Distances from input pattern vector to all the mean vectors are computed by EDM. Minimum distance determines the class membership of input pattern vector. The proposed method provides good recognition accuracy of 90% for handwritten characters even with fewer samples.展开更多
In this paper, we propose a simpleyet-effective method for isotropic meshing relying on Euclidean distance transformation based centroidal Voronoi tessellation(CVT). Our approach improves the performance and robustnes...In this paper, we propose a simpleyet-effective method for isotropic meshing relying on Euclidean distance transformation based centroidal Voronoi tessellation(CVT). Our approach improves the performance and robustness of computing CVT on curved domains while simultaneously providing highquality output meshes. While conventional extrinsic methods compute CVTs in the entire volume bounded by the input model, we restrict the computation to a 3D shell of user-controlled thickness. Taking voxels which contain surface samples as sites, we compute the exact Euclidean distance transform on the GPU. Our algorithm is parallel and memory-efficient,and can construct the shell space for resolutions up to 20483 at interactive speed. The 3D centroidal Voronoi tessellation and restricted Voronoi diagrams are also computed efficiently on the GPU. Since the shell space can bridge holes and gaps smaller than a certain tolerance, and tolerate non-manifold edges and degenerate triangles, our algorithm can handle models with such defects, which typically cause conventional remeshing methods to fail. Our method can process implicit surfaces, polyhedral surfaces, and point clouds in a unified framework. Computational results show that our GPU-based isotropic meshing algorithm produces results comparable to state-ofthe-art techniques, but is significantly faster than conventional CPU-based implementations.展开更多
The success of new scientific areas can be assessed by their potential for contributing to new theoretical approaches aligned with real-world applications.The Euclidean distance transform(EDT)has fared well in both ca...The success of new scientific areas can be assessed by their potential for contributing to new theoretical approaches aligned with real-world applications.The Euclidean distance transform(EDT)has fared well in both cases,providing a sound theoretical basis for a number of applications,such as median axis transform,fractal analysis,skeletonization,and Voronoi diagrams.Despite its wide applicability,the discrete form of the EDT includes interesting properties that have not yet been fully exploited in the literature.In this paper,we are particularly interested in the properties of 1)working with multiple objects/labels;and 2)identifying and counting equidistant pixels/voxels from certain points of interest.In some domains(such as dataset classification,texture,and complexity analysis),the result of applying the EDT transform with different objects,and their respective tied distances,may compromise the performance.In this sense,we propose an efficient modification in the method presented in[1],which leads to a novel approach for computing the distance transform in a space with multiple objects,and for counting equidistant pixels/voxels.展开更多
文摘In this letter a new skeletonization algorithm is proposed. It combines techniques of fast construction of Euclidean Distance Maps(EDMs), ridge extraction, Hit-or-Miss Transformation(HMT) of structuring elements and the set operators. It first produces the EDM image with no more than 4 passes through an image of any kinds, and then the ridge image is extracted by applying a turn-on scheme and performing a rain-fall elimination to accelerate the processing. The one-pixel wide skeleton is finally acquired by carrying out the HMTs of two structure elements and the SUBTRACT and OR operations. Experimental results obtained by practical applications are also presented.
文摘An approach of distane map based imageenhancement (DMIE) is proposed. It is applied toconventional interpolations to get sharp images. Edgedetection is performed after images are interpolatedby linear interpolations. To meet the two conditionsset for DMIE, i. e., no abrupt changes and no over-boosting, different boosting rate should be used inadjusting pixel intensities. When the boosting rate isdetermined by using the distance from enhancedpixels to nearest edges, edge-oriented imageenhancement is obtained. By using Erosion technique,the range for pixel intensity adiustment is set.Over-enhancement is avoided by limiting the pixel iutensities in enhancement within the range. A unifled linear-time algoritiml for disance transform is adopted to deal with the calculation of Euelidean distance of the images.Its computation complexity is 0(N).After the preparation,i.e.,distance transforming and erosion,the images get more and more sharpened while no over.boosting.Occurs by repeating the enhancement procedure ,The simplicity of the enhancement operation makes DMIE suitable for enhancement rate adjusting
文摘In the present paper, the problem of handwritten character recognition has been tackled with multiresolution technique using discrete wavelet transform (DWT) and Euclidean distance metric (EDM). The technique has been tested and found to be more accurate and faster. Characters is classified into 26 pattern classes based on appropriate properties. Features of the handwritten character images are extracted by DWT used with appropriate level of multiresolution technique, and then each pattern class is characterized by a mean vector. Distances from input pattern vector to all the mean vectors are computed by EDM. Minimum distance determines the class membership of input pattern vector. The proposed method provides good recognition accuracy of 90% for handwritten characters even with fewer samples.
基金partially supported by Ac RF RG40/12MOE2013-T2-2-011+2 种基金partially supported by National Natural Science Foundation of China (Nos. 61432003 and 61322206)the TNList Cross-discipline Foundationpartially supported by HKSAR Research Grants Council (RGC) General Research Fund (GRF), CUHK/14207414
文摘In this paper, we propose a simpleyet-effective method for isotropic meshing relying on Euclidean distance transformation based centroidal Voronoi tessellation(CVT). Our approach improves the performance and robustness of computing CVT on curved domains while simultaneously providing highquality output meshes. While conventional extrinsic methods compute CVTs in the entire volume bounded by the input model, we restrict the computation to a 3D shell of user-controlled thickness. Taking voxels which contain surface samples as sites, we compute the exact Euclidean distance transform on the GPU. Our algorithm is parallel and memory-efficient,and can construct the shell space for resolutions up to 20483 at interactive speed. The 3D centroidal Voronoi tessellation and restricted Voronoi diagrams are also computed efficiently on the GPU. Since the shell space can bridge holes and gaps smaller than a certain tolerance, and tolerate non-manifold edges and degenerate triangles, our algorithm can handle models with such defects, which typically cause conventional remeshing methods to fail. Our method can process implicit surfaces, polyhedral surfaces, and point clouds in a unified framework. Computational results show that our GPU-based isotropic meshing algorithm produces results comparable to state-ofthe-art techniques, but is significantly faster than conventional CPU-based implementations.
基金supported by the Brazilian National Council for Scientific and Technological Development(CNPq)Araucaria Foundation+1 种基金Coordination for the Improvement of Higher Education Personnel(CAPES)Funding Authority for Studies and Projects(FINEP)。
文摘The success of new scientific areas can be assessed by their potential for contributing to new theoretical approaches aligned with real-world applications.The Euclidean distance transform(EDT)has fared well in both cases,providing a sound theoretical basis for a number of applications,such as median axis transform,fractal analysis,skeletonization,and Voronoi diagrams.Despite its wide applicability,the discrete form of the EDT includes interesting properties that have not yet been fully exploited in the literature.In this paper,we are particularly interested in the properties of 1)working with multiple objects/labels;and 2)identifying and counting equidistant pixels/voxels from certain points of interest.In some domains(such as dataset classification,texture,and complexity analysis),the result of applying the EDT transform with different objects,and their respective tied distances,may compromise the performance.In this sense,we propose an efficient modification in the method presented in[1],which leads to a novel approach for computing the distance transform in a space with multiple objects,and for counting equidistant pixels/voxels.
