Multimodal decision-level fusion for person authentication

In this paper, the use of clustering algorithms for decision-level data fusion is proposed. Person authentication results coming from several modalities (e.g., still image, speech), are combined by using fuzzy k-means (FKM), fuzzy vector quantization (FVQ) algorithms, and median radial basis function (MRBF) network. The quality measure of the modalities data is used for fuzzification. Two modifications of the FKM and FVQ algorithms, based on a novel fuzzy vector distance definition, are proposed to handle the fuzzy data and utilize the quality measure. Simulations show that fuzzy clustering algorithms have better performance compared to the classical clustering algorithms and other known fusion algorithms. MRBF has better performance especially when two modalities are combined. Moreover, the use of the quality via the proposed modified algorithms increases the performance of the fusion system

Local Patch Blind Spectral Watermarking Method for 3D Graphics

International audienc

Universal DNA methylation age across mammalian tissues

DATA AVAILABILITY STATEMENT : The individual-level data from the Mammalian Methylation Consortium can be accessed from several online locations. All data from the Mammalian Methylation Consortium are posted on Gene Expression Omnibus (complete dataset, GSE223748). Subsets of the datasets can also be downloaded from accession numbers GSE174758, GSE184211, GSE184213, GSE184215, GSE184216, GSE184218, GSE184220, GSE184221, GSE184224, GSE190660, GSE190661, GSE190662, GSE190663, GSE190664, GSE174544, GSE190665, GSE174767, GSE184222, GSE184223, GSE174777, GSE174778, GSE173330, GSE164127, GSE147002, GSE147003, GSE147004, GSE223943 and GSE223944. Additional details can be found in Supplementary Note 2. The mammalian data can also be downloaded from the Clock Foundation webpage: https://clockfoundation.org/MammalianMethylationConsortium. The mammalian methylation array is available through the non-profit Epigenetic Clock Development Foundation (https://clockfoundation.org/). The manifest file of the mammalian array and genome annotations of CpG sites can be found on Zenodo (10.5281/zenodo.7574747). All other data supporting the findings of this study are available from the corresponding author upon reasonable request. The chip manifest files, genome annotations of CpG sites and the software code for universal pan-mammalian clocks can be found on GitHub95 at https://github.com/shorvath/MammalianMethylationConsortium/tree/v2.0.0. The individual R code for the universal pan-mammalian clocks, EWAS analysis and functional enrichment studies can be also found in the Supplementary Code.SUPPLEMENTARY MATERIAL 1 : Supplementary Tables 1–3 and Notes 1–6.SUPPLEMENTARY MATERIAL 2 : Reporting SummarySUPPLEMENTARY MATERIAL 3 : Supplementary Data 1–14.SUPPLEMENTARY MATERIAL 4 : Supplementary Code.Aging, often considered a result of random cellular damage, can be accurately estimated using DNA methylation profiles, the foundation of pan-tissue epigenetic clocks. Here, we demonstrate the development of universal pan-mammalian clocks, using 11,754 methylation arrays from our Mammalian Methylation Consortium, which encompass 59 tissue types across 185 mammalian species. These predictive models estimate mammalian tissue age with high accuracy (r > 0.96). Age deviations correlate with human mortality risk, mouse somatotropic axis mutations and caloric restriction. We identified specific cytosines with methylation levels that change with age across numerous species. These sites, highly enriched in polycomb repressive complex 2-binding locations, are near genes implicated in mammalian development, cancer, obesity and longevity. Our findings offer new evidence suggesting that aging is evolutionarily conserved and intertwined with developmental processes across all mammals.https://www.nature.com/nataginghj2024Zoology and EntomologySDG-15:Life on lan

Watermarking mesh based representations of 3-D objects using local moments

A new methodology for fingerprinting and watermarking three-dimensional (3-D) graphical objects is proposed in this paper. The 3-D graphical objects are described by means of polygonal meshes. The information to be embedded is provided as a binary code. A watermarking methodology has two stages: embedding and detecting the information that has been embedded in the given media. The information is embedded by means of local geometrical perturbations while maintaining the local connectivity. A neighborhood localized measure is used for selecting appropriate vertices for watermarking. A study is undertaken in order to verify the suitability of this measure for selecting vertices from regions where geometrical perturbations are less perceptible. Two different watermarking algorithms, that do not require the original 3-D graphical object in the detection stage, are proposed. The two algorithms differ with respect to the type of constraint to be embedded in the local structure: by using parallel planes and bounding ellipsoids, respectively. The information capacity of various 3-D meshes is analyzed when using the proposed 3-D watermarking algorithms. The robustness of the 3-D watermarking algorithms is tested to noise perturbation and to object cropping