322 research outputs found

    Complete Cross-triplet Loss in Label Space for Audio-visual Cross-modal Retrieval

    Full text link
    The heterogeneity gap problem is the main challenge in cross-modal retrieval. Because cross-modal data (e.g. audiovisual) have different distributions and representations that cannot be directly compared. To bridge the gap between audiovisual modalities, we learn a common subspace for them by utilizing the intrinsic correlation in the natural synchronization of audio-visual data with the aid of annotated labels. TNN-CCCA is the best audio-visual cross-modal retrieval (AV-CMR) model so far, but the model training is sensitive to hard negative samples when learning common subspace by applying triplet loss to predict the relative distance between inputs. In this paper, to reduce the interference of hard negative samples in representation learning, we propose a new AV-CMR model to optimize semantic features by directly predicting labels and then measuring the intrinsic correlation between audio-visual data using complete cross-triple loss. In particular, our model projects audio-visual features into label space by minimizing the distance between predicted label features after feature projection and ground label representations. Moreover, we adopt complete cross-triplet loss to optimize the predicted label features by leveraging the relationship between all possible similarity and dissimilarity semantic information across modalities. The extensive experimental results on two audio-visual double-checked datasets have shown an improvement of approximately 2.1% in terms of average MAP over the current state-of-the-art method TNN-CCCA for the AV-CMR task, which indicates the effectiveness of our proposed model.Comment: 9 pages, 5 figures, 3 tables, accepted by IEEE ISM 202

    Bivariate functions with low cc-differential uniformity

    Full text link
    Starting with the multiplication of elements in Fq2\mathbb{F}_{q}^2 which is consistent with that over Fq2\mathbb{F}_{q^2}, where qq is a prime power, via some identification of the two environments, we investigate the cc-differential uniformity for bivariate functions F(x,y)=(G(x,y),H(x,y))F(x,y)=(G(x,y),H(x,y)). By carefully choosing the functions G(x,y)G(x,y) and H(x,y)H(x,y), we present several constructions of bivariate functions with low cc-differential uniformity. Many PccN and APccN functions can be produced from our constructions.Comment: Low cc-differential uniformity, perfect and almost perfect cc-nonlinearity, the bivariate functio

    Do I Have Your Attention: A Large Scale Engagement Prediction Dataset and Baselines

    Full text link
    The degree of concentration, enthusiasm, optimism, and passion displayed by individual(s) while interacting with a machine is referred to as `user engagement'. Engagement comprises of behavioral, cognitive, and affect related cues. To create engagement prediction systems that can work in real-world conditions, it is quintessential to learn from rich, diverse datasets. To this end, a large scale multi-faceted engagement in the wild dataset EngageNet is proposed. 31 hours duration data of 127 participants representing different illumination conditions are recorded. Thorough experiments are performed exploring the applicability of different features, action units, eye gaze, head pose, and MARLIN. Data from user interactions (question-answer) are analyzed to understand the relationship between effective learning and user engagement. To further validate the rich nature of the dataset, evaluation is also performed on the EngageWild dataset. The experiments show the usefulness of the proposed dataset. The code, models, and dataset link are publicly available at https://github.com/engagenet/engagenet_baselines

    Differentiable Genetic Programming for High-dimensional Symbolic Regression

    Full text link
    Symbolic regression (SR) is the process of discovering hidden relationships from data with mathematical expressions, which is considered an effective way to reach interpretable machine learning (ML). Genetic programming (GP) has been the dominator in solving SR problems. However, as the scale of SR problems increases, GP often poorly demonstrates and cannot effectively address the real-world high-dimensional problems. This limitation is mainly caused by the stochastic evolutionary nature of traditional GP in constructing the trees. In this paper, we propose a differentiable approach named DGP to construct GP trees towards high-dimensional SR for the first time. Specifically, a new data structure called differentiable symbolic tree is proposed to relax the discrete structure to be continuous, thus a gradient-based optimizer can be presented for the efficient optimization. In addition, a sampling method is proposed to eliminate the discrepancy caused by the above relaxation for valid symbolic expressions. Furthermore, a diversification mechanism is introduced to promote the optimizer escaping from local optima for globally better solutions. With these designs, the proposed DGP method can efficiently search for the GP trees with higher performance, thus being capable of dealing with high-dimensional SR. To demonstrate the effectiveness of DGP, we conducted various experiments against the state of the arts based on both GP and deep neural networks. The experiment results reveal that DGP can outperform these chosen peer competitors on high-dimensional regression benchmarks with dimensions varying from tens to thousands. In addition, on the synthetic SR problems, the proposed DGP method can also achieve the best recovery rate even with different noisy levels. It is believed this work can facilitate SR being a powerful alternative to interpretable ML for a broader range of real-world problems

    Peran Daya Dukung Wilayah Terhadap Pengembangan USAha Peternakan Sapi Madura

    Get PDF
    Research conducted on the island of Madura. The aim of the research was analyzed the area-based development of beef cattle in Madura island. Primary research data was sourced from statistics in the Madura district in figures. Data was analyzed using Location Quotient (LQ) method. Data procesing conducted whith spreadsheet from Excel on Microsoft Windows 7. The results showed that the basis for the development of Madura cattle each regency were Pamekasan (sub-district Larangan, Pasean, Batumamar, Palengan, Proppo, Tlanakan, and Pegantenan), Sumenep (sub-district Gayam, Nonggunong and Batuputih), Bangkalan (subdistrict Kokop, Geger, Galis, Tanah Merah, and Blega) and Bangkalan (sub-district Ketapang, Sokobanah, Kedungdung, Sampang, Banyuates, Robatal, and Omben. Conclusion of the research was the development of Madura cattle concentrated in the base region of Madura cattle
    • …
    corecore