Coupled Deep Learning for Heterogeneous Face Recognition

Heterogeneous face matching is a challenge issue in face recognition due to large domain difference as well as insufficient pairwise images in different modalities during training. This paper proposes a coupled deep learning (CDL) approach for the heterogeneous face matching. CDL seeks a shared feature space in which the heterogeneous face matching problem can be approximately treated as a homogeneous face matching problem. The objective function of CDL mainly includes two parts. The first part contains a trace norm and a block-diagonal prior as relevance constraints, which not only make unpaired images from multiple modalities be clustered and correlated, but also regularize the parameters to alleviate overfitting. An approximate variational formulation is introduced to deal with the difficulties of optimizing low-rank constraint directly. The second part contains a cross modal ranking among triplet domain specific images to maximize the margin for different identities and increase data for a small amount of training samples. Besides, an alternating minimization method is employed to iteratively update the parameters of CDL. Experimental results show that CDL achieves better performance on the challenging CASIA NIR-VIS 2.0 face recognition database, the IIIT-D Sketch database, the CUHK Face Sketch (CUFS), and the CUHK Face Sketch FERET (CUFSF), which significantly outperforms state-of-the-art heterogeneous face recognition methods.Comment: AAAI 201

Adversarial Discriminative Heterogeneous Face Recognition

The gap between sensing patterns of different face modalities remains a challenging problem in heterogeneous face recognition (HFR). This paper proposes an adversarial discriminative feature learning framework to close the sensing gap via adversarial learning on both raw-pixel space and compact feature space. This framework integrates cross-spectral face hallucination and discriminative feature learning into an end-to-end adversarial network. In the pixel space, we make use of generative adversarial networks to perform cross-spectral face hallucination. An elaborate two-path model is introduced to alleviate the lack of paired images, which gives consideration to both global structures and local textures. In the feature space, an adversarial loss and a high-order variance discrepancy loss are employed to measure the global and local discrepancy between two heterogeneous distributions respectively. These two losses enhance domain-invariant feature learning and modality independent noise removing. Experimental results on three NIR-VIS databases show that our proposed approach outperforms state-of-the-art HFR methods, without requiring of complex network or large-scale training dataset

Anti-Makeup: Learning A Bi-Level Adversarial Network for Makeup-Invariant Face Verification

Makeup is widely used to improve facial attractiveness and is well accepted by the public. However, different makeup styles will result in significant facial appearance changes. It remains a challenging problem to match makeup and non-makeup face images. This paper proposes a learning from generation approach for makeup-invariant face verification by introducing a bi-level adversarial network (BLAN). To alleviate the negative effects from makeup, we first generate non-makeup images from makeup ones, and then use the synthesized non-makeup images for further verification. Two adversarial networks in BLAN are integrated in an end-to-end deep network, with the one on pixel level for reconstructing appealing facial images and the other on feature level for preserving identity information. These two networks jointly reduce the sensing gap between makeup and non-makeup images. Moreover, we make the generator well constrained by incorporating multiple perceptual losses. Experimental results on three benchmark makeup face datasets demonstrate that our method achieves state-of-the-art verification accuracy across makeup status and can produce photo-realistic non-makeup face images.Comment: The paper is accepted by AAAI-1

Could Blockchain Decentralize Supply Chain? A Dynamic Analysis of Token Delivery Motivations of Mid-tier Suppliers in Blockchain-driven Supply Chain Finance

Blockchain, or distributed ledger technology (DLT), is expected to be a disruptive technology by enabling a highly decentralized and trust-free business environment. Yet the business pursuit for profit maximization calls for a more centralized structure and thereby conflicts with the decentralized ideology of blockchain. In the context of blockchain-driven supply chain finance (SCF), while blockchain technology enables the decentralization of information, the decentralization of cash flow still relies on mid-tier suppliers’ token delivery in a centralized transaction structure. In other words, mid-tier suppliers can become a “bottleneck” in blockchain-driven SCF. In this paper, we consider the supply chain network as a complex system where firms are self-organized and adaptive to their competitive environment. Via this theoretical lens, we investigate how the application of blockchain technology (information flow), mid-tier suppliers’ token delivery (cash flow) and supply chain transaction structures (goods flow) interplay over time. We propose that in short term, blockchain technology increases mid-tier suppliers’ transaction efficiency and thus motivates mid-tier suppliers’ token delivery and promotes the decentralization of supply chain transaction structure; in long term, the decentralized supply chain transaction structure will in turn negatively affect mid-tier suppliers’ token delivery motivations and drive the centralization of a supply chain. We will test our theoretical propositions by a series of simulation experiments in an agent-based model

Improving Multilingual Instruction Finetuning via Linguistically Natural and Diverse Datasets

Advancements in Large Language Models (LLMs) have significantly enhanced instruction-following capabilities. However, most Instruction Fine-Tuning (IFT) datasets are predominantly in English, limiting model performance in other languages. Traditional methods for creating multilingual IFT datasets such as translating existing English IFT datasets or converting existing NLP datasets into IFT datasets by templating, struggle to capture linguistic nuances and ensure prompt (instruction) diversity. To address this issue, we propose a novel method for collecting multilingual IFT datasets that preserves linguistic naturalness and ensures prompt diversity. This approach leverages English-focused LLMs, monolingual corpora, and a scoring function to create high-quality, diversified IFT datasets in multiple languages. Experiments demonstrate that LLMs finetuned using these IFT datasets show notable improvements in both generative and discriminative tasks, indicating enhanced language comprehension by LLMs in non-English contexts. Specifically, on the multilingual summarization task, LLMs using our IFT dataset achieved 17.57% and 15.23% improvements over LLMs fine-tuned with translation-based and template-based datasets, respectively

Clinical Characteristics and Prognosis of Patients With Pulmonary Mucoepidermoid Carcinoma: A SEER-Based Analysis

BackgroundPrimary pulmonary mucoepidermoid carcinoma (PMEC) is an extremely rare malignancy. Its clinical characteristics and prognosis are not fully understood. This study evaluated clinical characteristics and prognostic factors of PMEC and established a nomogram to predict its 1-, 3-, 5- and 10-year cancer-specific survival (CSS) rates.MethodsIn the Surveillance, Epidemiology, and End Results database from January 1, 1975 to December 31, 2016, patients pathologically diagnosed with PMEC were identified. Kaplan–Meier analysis and Cox regression were performed to evaluate the CSS stratified by different covariates. A predictive nomogram model was built and validated by the concordance index (C-index) and calibration curves.ResultsA total of 585 PMEC patients were identified. A total of 408 (70%) of patients were placed into the training cohort, and 177 (30%) patients were placed into the validation cohort. The 5- and 10-year CSS rates of stage I–II PMEC patients were 91.4 and 88.9, respectively. The 1-, 3- and 5-year CSS rates of stage III–IV PMEC were 56.5, 39.45, and 32.1%, respectively. Survival curves showed that older age, large tumor size, poor differentiation, and high TNM stage were associated with a significantly worse prognosis. CSS outcomes were significantly better in patients who received surgical treatments (surgical alone, surgery plus radiation and/or chemotherapy). Patients who received radiation and/or chemotherapy had the worst prognosis. Multivariate Cox results revealed that covariates, including age, tumor laterality, tumor sizes, pathological differentiation, lymph node metastasis, distant metastasis, TNM stage and therapy, were independent prognostic factors for PMEC. These factors were used to construct a nomogram. The C-index of the nomogram was 0.921. The calibration curve presented favorable consistency between the predicted CSS and actual observations. This nomogram was validated by the validation cohort. The C-index of the validation cohort was 0.968.ConclusionAge, bilateral tumors, tumor size, pathological differentiation grade, lymph node metastasis, distant metastasis, TNM stage and therapy were independent prognostic factors of PMEC patients. The first nomogram for predicting the CSS of PMEC was built and validated, showing its potential value in practice