The Experts below are selected from a list of 34353 Experts worldwide ranked by ideXlab platform

Rafael Munozsalinas - One of the best experts on this subject based on the ideXlab platform.

  • a new measurement for assessing polygonal approximation of curves
    Pattern Recognition, 2011
    Co-Authors: A Carmonapoyato, Rafael Munozsalinas, R Medinacarnicer, F J Madridcuevas, N L Fernandezgarcia
    Abstract:

    This paper presents a novel method for assessing the accuracy of unsupervised polygonal approximation algorithms. This measurement relies on a polygonal approximation called the ''reference approximation''. The reference approximation is obtained using the method of Perez and Vidal [11] by an iterative method that optimizes an objective function. Then, the proposed measurement is calculated by comparing the reference approximation with the approximation to be evaluated, taking into account the similarity between the polygonal approximation and the original contour, and penalizing polygonal approximations with an excessive number of points. A Comparative Experiment by using polygonal approximations obtained with commonly used algorithms showed that the proposed measurement is more efficient than other proposed measurements at comparing polygonal approximations with different number of points.

  • polygonal approximation of digital planar curves through break point suppression
    Pattern Recognition, 2010
    Co-Authors: A Carmonapoyato, R Medinacarnicer, F J Madridcuevas, Rafael Munozsalinas
    Abstract:

    This paper presents a new algorithm that detects a set of dominant points on the boundary of an eight-connected shape to obtain a polygonal approximation of the shape itself. The set of dominant points is obtained from the original break points of the initial boundary, where the integral square is zero. For this goal, most of the original break points are deleted by suppressing those whose perpendicular distance to an approximating straight line is lower than a variable threshold value. The proposed algorithm iteratively deletes redundant break points until the required approximation, which relies on a decrease in the length of the contour and the highest error, is achieved. A Comparative Experiment with another commonly used algorithm showed that the proposed method produced efficient and effective polygonal approximations for digital planar curves with features of several sizes.

A Carmonapoyato - One of the best experts on this subject based on the ideXlab platform.

  • a new measurement for assessing polygonal approximation of curves
    Pattern Recognition, 2011
    Co-Authors: A Carmonapoyato, Rafael Munozsalinas, R Medinacarnicer, F J Madridcuevas, N L Fernandezgarcia
    Abstract:

    This paper presents a novel method for assessing the accuracy of unsupervised polygonal approximation algorithms. This measurement relies on a polygonal approximation called the ''reference approximation''. The reference approximation is obtained using the method of Perez and Vidal [11] by an iterative method that optimizes an objective function. Then, the proposed measurement is calculated by comparing the reference approximation with the approximation to be evaluated, taking into account the similarity between the polygonal approximation and the original contour, and penalizing polygonal approximations with an excessive number of points. A Comparative Experiment by using polygonal approximations obtained with commonly used algorithms showed that the proposed measurement is more efficient than other proposed measurements at comparing polygonal approximations with different number of points.

  • polygonal approximation of digital planar curves through break point suppression
    Pattern Recognition, 2010
    Co-Authors: A Carmonapoyato, R Medinacarnicer, F J Madridcuevas, Rafael Munozsalinas
    Abstract:

    This paper presents a new algorithm that detects a set of dominant points on the boundary of an eight-connected shape to obtain a polygonal approximation of the shape itself. The set of dominant points is obtained from the original break points of the initial boundary, where the integral square is zero. For this goal, most of the original break points are deleted by suppressing those whose perpendicular distance to an approximating straight line is lower than a variable threshold value. The proposed algorithm iteratively deletes redundant break points until the required approximation, which relies on a decrease in the length of the contour and the highest error, is achieved. A Comparative Experiment with another commonly used algorithm showed that the proposed method produced efficient and effective polygonal approximations for digital planar curves with features of several sizes.

Michel André - One of the best experts on this subject based on the ideXlab platform.

  • Ultrastructural damage of Loligo vulgaris and Illex coindetii statocysts after low frequency sound exposure.
    PloS one, 2013
    Co-Authors: Marta Solé, Marc Lenoir, Mercè Durfort, Manel López-bejar, Antoni Lombarte, Michel André
    Abstract:

    There is a considerable lack of information concerning marine invertebrate sensitivity to sound exposure. However, recent findings on cuttlefish and octopi showed that exposure to artificial noise had a direct consequence on the functionality and physiology of the statocysts, sensory organs, which are responsible for their equilibrium and movements in the water column. Owing to a lack of available data on deep diving cephalopod species, we conducted a noise exposure Comparative Experiment on one Mediterranean squid, Illex coindetii, and on the European squid Loligo vulgaris. Scanning electron microscopy (SEM) revealed similar injuries in the inner structure of the statocysts, as those found in cuttlefish and octopi. In addition to the ultrastructural description of the lesions, we publish here the first images of the crista-cupula system and inner statocyst cavity of I. coindetii.

Odemir Martinez Bruno - One of the best experts on this subject based on the ideXlab platform.

  • polygonal approximation of digital planar curves through vertex betweenness
    Information Sciences, 2013
    Co-Authors: Andre Ricardo Backes, Odemir Martinez Bruno
    Abstract:

    Contour polygonal approximation is usually defined as a set of selected points, which describes a polygon and best represents the original contour. This paper presents a novel graph based approach to compute a polygonal approximation of a shape contour. In a graph, such points correspond to a high transitivity region of the graph. We use the vertex betweenness to measure the importance of each vertice in a graph according to the number of shortest paths where each vertice occurs. By selecting the vertices with higher vertex betweenness, a polygon which retains the main characteristics of the contour is achieved. By using benchmark curves, a Comparative Experiment with other commonly used algorithms is presented. Results indicate that the proposed approach produced efficient and effective polygonal approximations for digital planar curves.

Lingzhi Zhang - One of the best experts on this subject based on the ideXlab platform.

  • dinitrile compound containing ethylene oxide moiety with enhanced solubility of lithium salts as electrolyte solvent for high voltage lithium ion batteries
    Ionics, 2015
    Co-Authors: Jinglun Wang, Lingzhi Zhang
    Abstract:

    A dinitrile compound containing ethylene oxide moiety (4,7-dioxa-1,10-decanedinitrile, NEON) is synthesized as an electrolyte solvent for high-voltage lithium-ion batteries. The introduction of ethylene oxide moiety into the conventional aprotic aliphatic dinitrile compounds improves the solubility of lithium hexafluorophosphate (LiPF6) used commercially in the lithium-ion battery industry. The electrochemical performances of the NEON-based electrolyte (0.8 M LiPF6 + 0.2 M lithium oxalyldifluoroborate in NEON:EC:DEC, v:v:v = 1:1:1) are evaluated in graphite/Li, LiCoO2/Li, and LiCoO2/graphite cells. Half-cell tests show that the electrolyte exhibits significantly improved compatibility with graphite by the addition of vinylene carbonate and lithium oxalyldifluoroborate and excellent cycling stability with a capacity retention of 97 % after 50 cycles at a cutoff voltage of 4.4 V in LiCoO2/Li cell. A Comparative Experiment in LiCoO2/graphite full cells shows that the electrolyte (NEON:EC:DEC, v:v:v = 1:1:1) exhibits improved cycling stability at 4.4 V compared with the electrolyte without NEON (EC:DEC, v:v = 1:1), demonstrating that NEON has a great potential as an electrolyte solvent for the high-voltage application in lithium-ion batteries.

  • dinitrile compound containing ethylene oxide moiety with enhanced solubility of lithium salts as electrolyte solvent for high voltage lithium ion batteries
    Ionics, 2015
    Co-Authors: Jinglun Wang, Lingzhi Zhang
    Abstract:

    A dinitrile compound containing ethylene oxide moiety (4,7-dioxa-1,10-decanedinitrile, NEON) is synthesized as an electrolyte solvent for high-voltage lithium-ion batteries. The introduction of ethylene oxide moiety into the conventional aprotic aliphatic dinitrile compounds improves the solubility of lithium hexafluorophosphate (LiPF6) used commercially in the lithium-ion battery industry. The electrochemical performances of the NEON-based electrolyte (0.8 M LiPF6 + 0.2 M lithium oxalyldifluoroborate in NEON:EC:DEC, v:v:v = 1:1:1) are evaluated in graphite/Li, LiCoO2/Li, and LiCoO2/graphite cells. Half-cell tests show that the electrolyte exhibits significantly improved compatibility with graphite by the addition of vinylene carbonate and lithium oxalyldifluoroborate and excellent cycling stability with a capacity retention of 97 % after 50 cycles at a cutoff voltage of 4.4 V in LiCoO2/Li cell. A Comparative Experiment in LiCoO2/graphite full cells shows that the electrolyte (NEON:EC:DEC, v:v:v = 1:1:1) exhibits improved cycling stability at 4.4 V compared with the electrolyte without NEON (EC:DEC, v:v = 1:1), demonstrating that NEON has a great potential as an electrolyte solvent for the high-voltage application in lithium-ion batteries.