arXiv subjects

Yunlong Wang

Publications and source records attributed to Yunlong Wang.

At least 91 records · Page 5Linked to original sources

arXiv2021

An End-to-End Autofocus Camera for Iris on the Move

For distant iris recognition, a long focal length lens is generally used to ensure the resolution ofiris images, which reduces the depth of field and leads to potential defocus blur. To accommodate users at different distances, it is necessary to control focus quickly and accurately. While for users in motion, it is expected to maintain the correct focus on the iris area continuously. In this paper, we introduced a novel rapid autofocus camera for active refocusing ofthe iris area ofthe moving objects using a focus-tunable lens. Our end-to-end computational algorithm can predict the best focus position from one single blurred image and generate a lens diopter control signal automatically. This scene-based active manipulation method enables real-time focus tracking of the iris area ofa moving object. We built a testing bench to collect real-world focal stacks for evaluation of the autofocus methods. Our camera has reached an autofocus speed ofover 50 fps. The results demonstrate the advantages of our proposed camera for biometric perception in static and dynamic scenes. The code is available at https://github.com/Debatrix/AquulaCam.

cs.CV↗

arXiv2021

CASIA-Face-Africa: A Large-scale African Face Image Database

Face recognition is a popular and well-studied area with wide applications in our society. However, racial bias had been proven to be inherent in most State Of The Art (SOTA) face recognition systems. Many investigative studies on face recognition algorithms have reported higher false positive rates of African subjects cohorts than the other cohorts. Lack of large-scale African face image databases in public domain is one of the main restrictions in studying the racial bias problem of face recognition. To this end, we collect a face image database namely CASIA-Face-Africa which contains 38,546 images of 1,183 African subjects. Multi-spectral cameras are utilized to capture the face images under various illumination settings. Demographic attributes and facial expressions of the subjects are also carefully recorded. For landmark detection, each face image in the database is manually labeled with 68 facial keypoints. A group of evaluation protocols are constructed according to different applications, tasks, partitions and scenarios. The performances of SOTA face recognition algorithms without re-training are reported as baselines. The proposed database along with its face landmark annotations, evaluation protocols and preliminary results form a good benchmark to study the essential aspects of face biometrics for African subjects, especially face image preprocessing, face feature analysis and matching, facial expression recognition, sex/age estimation, ethnic classification, face image generation, etc. The database can be downloaded from our http://www.cripacsir.cn/dataset/

cs.CV↗

arXiv2021

Center Prediction Loss for Re-identification

The training loss function that enforces certain training sample distribution patterns plays a critical role in building a re-identification (ReID) system. Besides the basic requirement of discrimination, i.e., the features corresponding to different identities should not be mixed, additional intra-class distribution constraints, such as features from the same identities should be close to their centers, have been adopted to construct losses. Despite the advances of various new loss functions, it is still challenging to strike the balance between the need of reducing the intra-class variation and allowing certain distribution freedom. In this paper, we propose a new loss based on center predictivity, that is, a sample must be positioned in a location of the feature space such that from it we can roughly predict the location of the center of same-class samples. The prediction error is then regarded as a loss called Center Prediction Loss (CPL). We show that, without introducing additional hyper-parameters, this new loss leads to a more flexible intra-class distribution constraint while ensuring the between-class samples are well-separated. Extensive experiments on various real-world ReID datasets show that the proposed loss can achieve superior performance and can also be complementary to existing losses.

cs.CV↗

arXiv2021

Quantum state transfer between two photons with polarization and orbital angular momentum via quantum teleportation technology

Quantum teleportation is a useful quantum information technology to transmit quantum states between different degrees of freedom. We here report a quantum state transfer experiment in the linear optical system, transferring a single photon state in the polarization degree of freedom (DoF) to another photon in the orbital angular momentum (OAM) quantum state via a biphoton OAM entangled channel. Our experimental method is based on quantum teleportation technology. The differences between ours and the original teleportation scheme is that the transfer state is known in ours, and our method is for different particles with different DoFs while the original one is for different particles with same DoF. Besides, our present experiment is implemented with a high Bell-efficiency since each of the four hybrid-entangled Bell states can be discriminated. We use six states of poles of the Bloch sphere to test our experiment, and the fidelity of the quantum state transfer is $91.8\pm1.3\%$.

quant-ph↗

arXiv2021

Experimental Demonstration of a Quantum Controlled-SWAP Gate with Multiple Degrees of Freedom of a Single Photon

Optimizing the physical realization of quantum gates is important to build a quantum computer. The controlled-SWAP gate, also named Fredkin gate, can be widely applicable in various quantum information processing schemes. In the present research, we propose and experimentally implement quantum Fredkin gate in a single-photon hybrid-degrees-of-freedom system. Polarization is used as the control qubit, and SWAP operation is achieved in a four-dimensional Hilbert space spanned by photonic orbital angular momentum. The effective conversion rate $\mathcal{P}$ of the quantum Fredkin gate in our experiment is $(95.4\pm 2.6)\%$. Besides, we find that a kind of Greenberger-Horne-Zeilinger-like states can be prepared by using our quantum Fredkin gate, and these nonseparale states can show its quantum contextual characteristic by the violation of Mermin inequality. Our experimental design and coding method are useful for quantum computing and quantum fundamental study in high-dimensional and hybrid coding quantum systems.

quant-ph↗

arXiv2021

Instance and Pair-Aware Dynamic Networks for Re-Identification

Re-identification (ReID) is to identify the same instance across different cameras. Existing ReID methods mostly utilize alignment-based or attention-based strategies to generate effective feature representations. However, most of these methods only extract general feature by employing single input image itself, overlooking the exploration of relevance between comparing images. To fill this gap, we propose a novel end-to-end trainable dynamic convolution framework named Instance and Pair-Aware Dynamic Networks in this paper. The proposed model is composed of three main branches where a self-guided dynamic branch is constructed to strengthen instance-specific features, focusing on every single image. Furthermore, we also design a mutual-guided dynamic branch to generate pair-aware features for each pair of images to be compared. Extensive experiments are conducted in order to verify the effectiveness of our proposed algorithm. We evaluate our algorithm in several mainstream person and vehicle ReID datasets including CUHK03, DukeMTMCreID, Market-1501, VeRi776 and VehicleID. In some datasets our algorithm outperforms state-of-the-art methods and in others, our algorithm achieves a comparable performance.

cs.CV↗

arXiv2021

SUOD: Accelerating Large-Scale Unsupervised Heterogeneous Outlier Detection

Outlier detection (OD) is a key machine learning (ML) task for identifying abnormal objects from general samples with numerous high-stake applications including fraud detection and intrusion detection. Due to the lack of ground truth labels, practitioners often have to build a large number of unsupervised, heterogeneous models (i.e., different algorithms with varying hyperparameters) for further combination and analysis, rather than relying on a single model. How to accelerate the training and scoring on new-coming samples by outlyingness (referred as prediction throughout the paper) with a large number of unsupervised, heterogeneous OD models? In this study, we propose a modular acceleration system, called SUOD, to address it. The proposed system focuses on three complementary acceleration aspects (data reduction for high-dimensional data, approximation for costly models, and taskload imbalance optimization for distributed environment), while maintaining performance accuracy. Extensive experiments on more than 20 benchmark datasets demonstrate SUOD's effectiveness in heterogeneous OD acceleration, along with a real-world deployment case on fraudulent claim analysis at IQVIA, a leading healthcare firm. We open-source SUOD for reproducibility and accessibility.

cs.LG↗

arXiv2021

Realization of a deterministic quantum Toffoli gate with a single photon

Quantum controlled-logic gates, including controlled NOT gate and Toffoli gate, play critical roles in lots of quantum information processing schemes. We design and experimentally demonstrate deterministic Toffoli gate by utilizing orbital-angular-momentum and polarization degrees of freedom of a single photon. In addition, we generate Bell states by using the controlled NOT gate. The effective conversion rate of the Toffoli gate in our experiment is $(95.1\pm3.2)\%$. Furthermore, our experimental setup does not require any auxiliary photons and probabilistic post selections.

quant-ph↗

arXiv2021

A Smartphone App to Support Sedentary Behavior Change by Visualizing Personal Mobility Patterns and Action Planning (SedVis): Development and Pilot Study

Given the high prevalence of sedentary behavior in daily life, simple yet practical solutions for behavior change are needed to avoid detrimental health effects. The mobile app SedVis was developed based on the health action process approach. The app provides personal mobility pattern visualization (for both physical activity and sedentary behavior) and action planning for sedentary behavior change. The primary aim of the study is to investigate the effect of mobility pattern visualization on users' action planning for changing their sedentary behavior. The secondary aim is to evaluate user engagement with the visualization and user experience of the app. In a 3-week user study, participants were allocated to either an active control group (n=8) or an intervention group (n=8). In the 1-week baseline period, none of the participants had access to the functions in the app. In the following 2-week intervention period, only the intervention group was given access to the visualizations, whereas both groups were asked to make action plans every day and reduce their sedentary behavior. The results suggested that the visualizations in SedVis had no effect on the participants' action planning according to both the NHST and Bayesian statistics. The intervention involving visualizations and action planning in SedVis had a positive effect on reducing participants' sedentary hours, with weak evidence according to Bayesian statistics, whereas no change in sedentary time was more likely in the active control condition. Furthermore, Bayesian analysis weakly suggested that the more frequently the users checked the app, the more likely they were to reduce their sedentary behavior.

cs.HC↗

arXiv2021

Directed Diversity: Leveraging Language Embedding Distances for Collective Creativity in Crowd Ideation

Crowdsourcing can collect many diverse ideas by prompting ideators individually, but this can generate redundant ideas. Prior methods reduce redundancy by presenting peers' ideas or peer-proposed prompts, but these require much human coordination. We introduce Directed Diversity, an automatic prompt selection approach that leverages language model embedding distances to maximize diversity. Ideators can be directed towards diverse prompts and away from prior ideas, thus improving their collective creativity. Since there are diverse metrics of diversity, we present a Diversity Prompting Evaluation Framework consolidating metrics from several research disciplines to analyze along the ideation chain - prompt selection, prompt creativity, prompt-ideation mediation, and ideation creativity. Using this framework, we evaluated Directed Diversity in a series of a simulation study and four user studies for the use case of crowdsourcing motivational messages to encourage physical activity. We show that automated diverse prompting can variously improve collective creativity across many nuanced metrics of diversity.

cs.HC↗

arXiv2020

eTREE: Learning Tree-structured Embeddings

Matrix factorization (MF) plays an important role in a wide range of machine learning and data mining models. MF is commonly used to obtain item embeddings and feature representations due to its ability to capture correlations and higher-order statistical dependencies across dimensions. In many applications, the categories of items exhibit a hierarchical tree structure. For instance, human diseases can be divided into coarse categories, e.g., bacterial, and viral. These categories can be further divided into finer categories, e.g., viral infections can be respiratory, gastrointestinal, and exanthematous viral diseases. In e-commerce, products, movies, books, etc., are grouped into hierarchical categories, e.g., clothing items are divided by gender, then by type (formal, casual, etc.). While the tree structure and the categories of the different items may be known in some applications, they have to be learned together with the embeddings in many others. In this work, we propose eTREE, a model that incorporates the (usually ignored) tree structure to enhance the quality of the embeddings. We leverage the special uniqueness properties of Nonnegative MF (NMF) to prove identifiability of eTREE. The proposed model not only exploits the tree structure prior, but also learns the hierarchical clustering in an unsupervised data-driven fashion. We derive an efficient algorithmic solution and a scalable implementation of eTREE that exploits parallel computing, computation caching, and warm start strategies. We showcase the effectiveness of eTREE on real data from various application domains: healthcare, recommender systems, and education. We also demonstrate the meaningfulness of the tree obtained from eTREE by means of domain experts interpretation.

cs.LG↗

arXiv2020

All-in-Focus Iris Camera With a Great Capture Volume

Imaging volume of an iris recognition system has been restricting the throughput and cooperation convenience in biometric applications. Numerous improvement trials are still impractical to supersede the dominant fixed-focus lens in stand-off iris recognition due to incremental performance increase and complicated optical design. In this study, we develop a novel all-in-focus iris imaging system using a focus-tunable lens and a 2D steering mirror to greatly extend capture volume by spatiotemporal multiplexing method. Our iris imaging depth of field extension system requires no mechanical motion and is capable to adjust the focal plane at extremely high speed. In addition, the motorized reflection mirror adaptively steers the light beam to extend the horizontal and vertical field of views in an active manner. The proposed all-in-focus iris camera increases the depth of field up to 3.9 m which is a factor of 37.5 compared with conventional long focal lens. We also experimentally demonstrate the capability of this 3D light beam steering imaging system in real-time multi-person iris refocusing using dynamic focal stacks and the potential of continuous iris recognition for moving participants.

eess.IV↗

arXiv2020

Recognition Oriented Iris Image Quality Assessment in the Feature Space

A large portion of iris images captured in real world scenarios are poor quality due to the uncontrolled environment and the non-cooperative subject. To ensure that the recognition algorithm is not affected by low-quality images, traditional hand-crafted factors based methods discard most images, which will cause system timeout and disrupt user experience. In this paper, we propose a recognition-oriented quality metric and assessment method for iris image to deal with the problem. The method regards the iris image embeddings Distance in Feature Space (DFS) as the quality metric and the prediction is based on deep neural networks with the attention mechanism. The quality metric proposed in this paper can significantly improve the performance of the recognition algorithm while reducing the number of images discarded for recognition, which is advantageous over hand-crafted factors based iris quality assessment methods. The relationship between Image Rejection Rate (IRR) and Equal Error Rate (EER) is proposed to evaluate the performance of the quality assessment algorithm under the same image quality distribution and the same recognition algorithm. Compared with hand-crafted factors based methods, the proposed method is a trial to bridge the gap between the image quality assessment and biometric recognition. The code is available at https://github.com/Debatrix/DFSNet.

eess.IV↗

arXiv2020

Dynamic Graph Representation for Partially Occluded Biometrics

The generalization ability of Convolutional neural networks (CNNs) for biometrics drops greatly due to the adverse effects of various occlusions. To this end, we propose a novel unified framework integrated the merits of both CNNs and graphical models to learn dynamic graph representations for occlusion problems in biometrics, called Dynamic Graph Representation (DGR). Convolutional features onto certain regions are re-crafted by a graph generator to establish the connections among the spatial parts of biometrics and build Feature Graphs based on these node representations. Each node of Feature Graphs corresponds to a specific part of the input image and the edges express the spatial relationships between parts. By analyzing the similarities between the nodes, the framework is able to adaptively remove the nodes representing the occluded parts. During dynamic graph matching, we propose a novel strategy to measure the distances of both nodes and adjacent matrixes. In this way, the proposed method is more convincing than CNNs-based methods because the dynamic graph method implies a more illustrative and reasonable inference of the biometrics decision. Experiments conducted on iris and face demonstrate the superiority of the proposed framework, which boosts the accuracy of occluded biometrics recognition by a large margin comparing with baseline methods.The code is avaliable at https://github.com/RenMin1991/Dyamic\_Graph\_Representation

cs.CV↗

arXiv2020

Promoting the Research of Health Behavior Change in Chinese HCI Community

Unhealthy lifestyles largely contribute to many chronic diseases, which makes the research on health behavior change crucial for both individuals and the whole society. As an interdisciplinary research field, health behavior change research in the HCI community is still in the early stage. This research field is notably less developed in Chinese HCI community. In this position paper, we will first illustrate the research of health behavior change in the HCI community based on our previous systematic review. According to the unique properties of Chinese society, we will then discuss both the potential advantages and challenges of conducting health behavior change research in China. Lastly, we will briefly introduce the SMARTACT project in Germany to provide a reference for future related research. This paper aims to draw more attention to this research field and promote its development in China.

cs.HC↗

arXiv2020

NaMemo: Enhancing Lecturers' Interpersonal Competence of Remembering Students' Names

Addressing students by their names helps a teacher to start building rapport with students and thus facilitates their classroom participation. However, this basic yet effective skill has become rather challenging for university lecturers, who have to handle large-sized (sometimes exceeding 100) groups in their daily teaching. To enhance lecturers' competence in delivering interpersonal interaction, we developed NaMemo, a real-time name-indicating system based on a dedicated face-recognition pipeline. This paper presents the system design, the pilot feasibility test, and our plan for the following study, which aims to evaluate NaMemo's impacts on learning and teaching, as well as to probe design implications including privacy considerations.

cs.HC↗

arXiv2020

No-regret Non-convex Online Meta-Learning

The online meta-learning framework is designed for the continual lifelong learning setting. It bridges two fields: meta-learning which tries to extract prior knowledge from past tasks for fast learning of future tasks, and online-learning which deals with the sequential setting where problems are revealed one by one. In this paper, we generalize the original framework from convex to non-convex setting, and introduce the local regret as the alternative performance measure. We then apply this framework to stochastic settings, and show theoretically that it enjoys a logarithmic local regret, and is robust to any hyperparameter initialization. The empirical test on a real-world task demonstrates its superiority compared with traditional methods.

cs.LG↗

arXiv2019

Learn Electronic Health Records by Fully Decentralized Federated Learning

Federated learning opens a number of research opportunities due to its high communication efficiency in distributed training problems within a star network. In this paper, we focus on improving the communication efficiency for fully decentralized federated learning over a graph, where the algorithm performs local updates for several iterations and then enables communications among the nodes. In such a way, the communication rounds of exchanging the common interest of parameters can be saved significantly without loss of optimality of the solutions. Multiple numerical simulations based on large, real-world electronic health record databases showcase the superiority of the decentralized federated learning compared with classic methods.

cs.LG↗