Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons™

Open Access. Powered by Scholars. Published by Universities.®

2021

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 1561 - 1590 of 3477

Full-Text Articles in Computer Sciences

Spatially-Invariant Style-Codes Controlled Makeup Transfer, Han Deng, Chu Han, Hongmin Cai, Guoqiang Han, Shengfeng He Jun 2021

Spatially-Invariant Style-Codes Controlled Makeup Transfer, Han Deng, Chu Han, Hongmin Cai, Guoqiang Han, Shengfeng He

Research Collection School Of Computing and Information Systems

Transferring makeup from the misaligned reference image is challenging. Previous methods overcome this barrier by computing pixel-wise correspondences between two images, which is inaccurate and computational-expensive. In this paper, we take a different perspective to break down the makeup transfer problem into a two-step extraction-assignment process. To this end, we propose a Style-based Controllable GAN model that consists of three components, each of which corresponds to target style-code encoding, face identity features extraction, and makeup fusion, respectively. In particular, a Part-specific Style Encoder encodes the component-wise makeup style of the reference image into a style-code in an intermediate latent space …

Go to article

Learning Contextual Causality Between Daily Events From Time-Consecutive Images, Hongming Zhang, Yintong Huo, Xinran Zhao, Yangqiu Song, Dan Roth Jun 2021

Learning Contextual Causality Between Daily Events From Time-Consecutive Images, Hongming Zhang, Yintong Huo, Xinran Zhao, Yangqiu Song, Dan Roth

Research Collection School Of Computing and Information Systems

Conventional textual-based causal knowledge acquisition methods typically require laborious and expensive human annotations. As a result, their scale is often limited. Moreover, as no context is provided during the annotation, the resulting causal knowledge records (e.g., ConceptNet) typically do not consider the context. In this paper, we move out of the textual domain to explore a more scalable way of acquiring causal knowledge and investigate the possibility of learning contextual causality from the visual signal. Specifically, we first propose a high-quality dataset Vis-Causal and then conduct experiments to demonstrate that with good language and visual representations, it is possible to …

Go to article

Why Do Robots Have Smiley Faces?, Mark Findlay Jun 2021

Why Do Robots Have Smiley Faces?, Mark Findlay

Research Collection Yong Pung How School Of Law

The author discussed why engineers and designers provide machines with the semblance of friendliness, and why it takes more than that for humans to trust AI. The ground-breaking AI in community research and policy initiative by CAIDG, supported by the National Research Foundation Singapore under its Emerging Areas Research Projects Funding Initiative, seeks to understand how and why trust can be established when humans and machines come together.

Go to article

Riding Through The Silver Tsunami: A Data Driven Approach To Improve Senior Citizens’ Engagement With Community Senior Activity Centres, Joshua Jie Feng Lam, Hwee-Pink Tan Jun 2021

Riding Through The Silver Tsunami: A Data Driven Approach To Improve Senior Citizens’ Engagement With Community Senior Activity Centres, Joshua Jie Feng Lam, Hwee-Pink Tan

Research Collection School Of Computing and Information Systems

In Singapore, 1 in 4 persons will be elderly by 2030 In preparation for the Silver Tsunami, the Singapore government and community care providers have collaborations to promote active, independent living amongst elders Current implementation of data driven population health is focused on well being indices using data collected from the general population There is no literature on the use of data analytics in assessing elder

Go to article

Minimum Coresets For Maxima Representation Of Multidimensional Data, Yanhao Wang, Michael Mathioudakis, Yuchen Li, Kian-Lee Tan Jun 2021

Minimum Coresets For Maxima Representation Of Multidimensional Data, Yanhao Wang, Michael Mathioudakis, Yuchen Li, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

Coresets are succinct summaries of large datasets such that, for a given problem, the solution obtained from a coreset is provably competitive with the solution obtained from the full dataset. As such, coreset-based data summarization techniques have been successfully applied to various problems, e.g., geometric optimization, clustering, and approximate query processing, for scaling them up to massive data. In this paper, we study coresets for the maxima representation of multidimensional data: Given a set �� of points in R �� , where �� is a small constant, and an error parameter �� ∈ (0, 1), a subset �� ⊆ �� …

Go to article

Generating Face Images With Attributes For Free, Yaoyao Liu, Qianru Sun, He Xiangnan, Liu An-An, Su Yuting, Chua Tat-Seng Jun 2021

Generating Face Images With Attributes For Free, Yaoyao Liu, Qianru Sun, He Xiangnan, Liu An-An, Su Yuting, Chua Tat-Seng

Research Collection School Of Computing and Information Systems

With superhuman-level performance of face recognition, we are more concerned about the recognition of fine-grained attributes, such as emotion, age, and gender. However, given that the label space is extremely large and follows a long-tail distribution, it is quite expensive to collect sufficient samples for fine-grained attributes. This results in imbalanced training samples and inferior attribute recognition models. To this end, we propose the use of arbitrary attribute combinations, without human effort, to synthesize face images. In particular, to bridge the semantic gap between high-level attribute label space and low-level face image, we propose a novel neural-network-based approach that maps …

Go to article

Hierarchical Scheduling For Real-Time Periodic Tasks In Symmetric Multiprocessing, Tom Springer, Peiyi Zhao Jun 2021

Hierarchical Scheduling For Real-Time Periodic Tasks In Symmetric Multiprocessing, Tom Springer, Peiyi Zhao

Engineering Faculty Articles and Research

In this paper, we present a new hierarchical scheduling framework for periodic tasks in symmetric multiprocessor (SMP) platforms. Partitioned and global scheduling are the two main approaches used by SMP based systems where global scheduling is recommended for overall performance and partitioned scheduling is recommended for hard real-time performance. Our approach combines both the global and partitioned approaches of traditional SMP-based schedulers to provide hard real-time performance guarantees for critical tasks and improved response times for soft real-time tasks. Implemented as part of VxWorks, the results are confirmed using a real-time benchmark application, where response times were improved for soft …

Go to article

Pedestrian Attribute Recognition Using Two-Branch Trainable Gabor Wavelets Network, Imran N. Junejo Jun 2021

Pedestrian Attribute Recognition Using Two-Branch Trainable Gabor Wavelets Network, Imran N. Junejo

All Works

Keeping an eye on pedestrians as they navigate through a scene, surveillance cameras are everywhere. With this context, our paper addresses the problem of pedestrian attribute recognition (PAR). This problem entails recognizing attributes such as age-group, clothing style, accessories, footwear style etc. This multi-label problem is extremely challenging even for human observers and has rightly garnered attention from the computer vision community. Towards a solution to this problem, in this paper, we adopt trainable Gabor wavelets (TGW) layers and cascade them with a convolution neural network (CNN). Whereas other researchers are using fixed Gabor filters with the CNN, the proposed …

Go to article

Niching Grey Wolf Optimizer For Multimodal Optimization Problems, Rasel Ahmed, Amril Nazir, Shuhaimi Mahadzir, Mohammad Shorfuzzaman, Jahedul Islam Jun 2021

Niching Grey Wolf Optimizer For Multimodal Optimization Problems, Rasel Ahmed, Amril Nazir, Shuhaimi Mahadzir, Mohammad Shorfuzzaman, Jahedul Islam

All Works

Metaheuristic algorithms are widely used for optimization in both research and the industrial community for simplicity, flexibility, and robustness. However, multi-modal optimization is a difficult task, even for metaheuristic algorithms. Two important issues that need to be handled for solving multi-modal problems are (a) to categorize multiple local/global optima and (b) to uphold these optima till the ending. Besides, a robust local search ability is also a prerequisite to reach the exact global optima. Grey Wolf Optimizer (GWO) is a recently developed nature-inspired metaheuristic algorithm that requires less parameter tuning. However, the GWO suffers from premature convergence and fails to …

Go to article

Computational Analysis Of Protein Stability And Allosteric Interaction Networks In Distinct Conformational Forms Of The Sars Cov 2 Spike D614g Mutant: Reconciling Functional Mechanisms Through Allosteric Model Of Spike Regulation, Gennady M. Verkhivker, Steve Agajanian, Deniz Oztas, Grace Gupta Jun 2021

Computational Analysis Of Protein Stability And Allosteric Interaction Networks In Distinct Conformational Forms Of The Sars Cov 2 Spike D614g Mutant: Reconciling Functional Mechanisms Through Allosteric Model Of Spike Regulation, Gennady M. Verkhivker, Steve Agajanian, Deniz Oztas, Grace Gupta

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this study, we used an integrative computational approach to examine molecular mechanisms underlying functional effects of the D614G mutation by exploring atomistic modeling of the SARS-CoV-2 spike proteins as allosteric regulatory machines. We combined coarse-grained simulations, protein stability and dynamic fluctuation communication analysis with network-based community analysis to examine structures of the native and mutant SARS-CoV-2 spike proteins in different functional states. Through distance fluctuations communication analysis, we probed stability and allosteric communication propensities of protein residues in the native and mutant SARS-CoV-2 spike proteins, providing evidence that the D614G mutation can enhance long-range signaling of the allosteric spike …

Go to article

Requirements Metrics - A Working List, William L. Honig Jun 2021

Requirements Metrics - A Working List, William L. Honig

Computer Science: Faculty Publications and Other Works

A working set of metrics for review of requirements materials including documents.

Go to article

Establishing Suitable Metrics To Encourage Broader Use Of Atomic Requirements, William L. Honig Jun 2021

Establishing Suitable Metrics To Encourage Broader Use Of Atomic Requirements, William L. Honig

Computer Science: Faculty Publications and Other Works

Despite the apparent benefits of singular, individual, or atomic requirements, their use remains limited, and teaching their creation is difficult. The acceptance of a set of requirements metrics specifically designed to evaluate atomic requirements may lead to their better utilization and improved requirements engineering. Twelve metrics designed to measure atomic requirements are presented here: six used on individual requirements statements and six applied to a requirements document or set of requirement statements. Example metrics for individual requirements are Requirement Completeness and Requirement Atomicity; examples to measure multiple requirements include Requirements Traceablity and Requirements Purity. These metrics are designed to work …

Go to article

Blockchain For Automotive: An Insight Towards The Ipfs Blockchain-Based Auto Insurance Sector, Nishara Nizamuddin, Ahed Abugabah Jun 2021

Blockchain For Automotive: An Insight Towards The Ipfs Blockchain-Based Auto Insurance Sector, Nishara Nizamuddin, Ahed Abugabah

All Works

The advancing technology and industrial revolution have taken the automotive industry by storm in recent times. The auto sector’s constantly growing demand has paved the way for the automobile sector to embrace new technologies and disruptive innovations. The multi-trillion dollar, complex auto insurance sector is still stuck in the regulations of the past. Most of the customers still contact the insurance company by phone to buy new policies and process existing insurance claims. The customers still face the risk of fraudulent online brokers, as policies are mostly signed and processed on papers which often require human supervision, with a risk …

Go to article

Impact Of Personality Types And Matching Messaging On Password Strength, Anna Bakas, Anne Wagner, Spencer Johnston, Shelia Kennison, Eric Chan-Tin Jun 2021

Impact Of Personality Types And Matching Messaging On Password Strength, Anna Bakas, Anne Wagner, Spencer Johnston, Shelia Kennison, Eric Chan-Tin

Computer Science: Faculty Publications and Other Works

People often create passwords for their accounts that are insecure. An insecure password is often easy to guess– thus, hackers can easily access their victims’ accounts. It is important for users to know how to create and manage secure passwords so they can better protect themselves from hackers. It is well-known that different users have different personality types, such as Big Five and True Colors. This research examines if there is any link between personality types and password security behavior. Each participant was shown either a matching or mismatching message based on their personality type, and it was measured whether …

Go to article

Engaging Drivers Via Competition: A Case Study With Arena, Hao Cheng, Shuyu Wei, Lingyu Zhang, Zimu Zhou, Yongxin. Tong Jun 2021

Engaging Drivers Via Competition: A Case Study With Arena, Hao Cheng, Shuyu Wei, Lingyu Zhang, Zimu Zhou, Yongxin. Tong

Research Collection School Of Computing and Information Systems

Sustained work enthusiasms of drivers are crucial for the success of large-scale ride-hailing platforms. In this paper, we conduct the first-of-its-kind exploration to encourage active participation of drivers via competition. We design Arena, a competition where drivers compete for prizes via completing more trips. Through a pilot study covering over 2,600 participants, we uncover the easy-win problem, an overlooked and serious issue in competition design for real-world drivers. It refers to situations where one competitor does not show up during competition whereas the other easily wins. To solve the easy-win problem without impairing motivation of drivers, we devise a novel …

Go to article

Hierarchical Reinforcement Learning: A Comprehensive Survey, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan, Chai Quek Jun 2021

Hierarchical Reinforcement Learning: A Comprehensive Survey, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan, Chai Quek

Research Collection School Of Computing and Information Systems

Hierarchical Reinforcement Learning (HRL) enables autonomous decomposition of challenging long-horizon decision-making tasks into simpler subtasks. During the past years, the landscape of HRL research has grown profoundly, resulting in copious approaches. A comprehensive overview of this vast landscape is necessary to study HRL in an organized manner. We provide a survey of the diverse HRL approaches concerning the challenges of learning hierarchical policies, subtask discovery, transfer learning, and multi-agent learning using HRL. The survey is presented according to a novel taxonomy of the approaches. Based on the survey, a set of important open problems is proposed to motivate the future …

Go to article

Efficient Conditional Gan Transfer With Knowledge Propagation Across Classes, Shahbazi. Mohamad, Zhiwu Huang, Huang, Danda Pani Paudel, Ajad Chhatkuli, Gool L. Van Jun 2021

Efficient Conditional Gan Transfer With Knowledge Propagation Across Classes, Shahbazi. Mohamad, Zhiwu Huang, Huang, Danda Pani Paudel, Ajad Chhatkuli, Gool L. Van

Research Collection School Of Computing and Information Systems

Generative adversarial networks (GANs) have shown impressive results in both unconditional and conditional image generation. In recent literature, it is shown that pre-trained GANs, on a different dataset, can be transferred to improve the image generation from a small target data. The same, however, has not been well-studied in the case of conditional GANs (cGANs), which provides new opportunities for knowledge transfer compared to unconditional setup. In particular, the new classes may borrow knowledge from the related old classes, or share knowledge among themselves to improve the training. This motivates us to study the problem of efficient conditional GAN transfer …

Go to article

Monitoring Quality Of Life Indicators At Home From Sparse And Low-Cost Sensor Data., Dympna O'Sullivan, Rilwan Basaru, Simone Stumpf, Neil Maiden Jun 2021

Monitoring Quality Of Life Indicators At Home From Sparse And Low-Cost Sensor Data., Dympna O'Sullivan, Rilwan Basaru, Simone Stumpf, Neil Maiden

Conference papers

Supporting older people, many of whom live with chronic conditions or cognitive and physical impairments, to live independently at home is of increasing importance due to ageing demographics. To aid independent living at home, much effort is being directed at reliably detecting activities from sensor data to monitor people’s quality of life or to enhance self-management of their own health. Current efforts typically leverage smart homes which have large numbers of sensors installed to overcome challenges in the accurate detection of activities. In this work, we report on the results of machine learning models based on data collected with a …

Go to article

Grand-Vision: An Intelligent System For Optimized Deployment Scheduling Of Law Enforcement Agents, Jonathan Chase, Tran Phong, Kang Long, Tony Le, Hoong Chuin Lau Jun 2021

Grand-Vision: An Intelligent System For Optimized Deployment Scheduling Of Law Enforcement Agents, Jonathan Chase, Tran Phong, Kang Long, Tony Le, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Law enforcement agencies in dense urban environments, faced with a wide range of incidents to handle and limited manpower, are turning to data-driven AI to inform their policing strategy. In this paper we present a patrol scheduling system called GRAND-VISION: Ground Response Allocation and Deployment - Visualization, Simulation, and Optimization. The system employs deep learning to generate incident sets that are used to train a patrol schedule that can accommodate varying manpower, break times, manual pre-allocations, and a variety of spatio-temporal demand features. The complexity of the scenario results in a system with real world applicability, which we demonstrate through …

Go to article

Coordinating Multi-Party Vehicle Routing With Location Congestion Via Iterative Best Response, Waldy Joe, Hoong Chuin Lau Jun 2021

Coordinating Multi-Party Vehicle Routing With Location Congestion Via Iterative Best Response, Waldy Joe, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

This work is motivated by a real-world problem of coordinating B2B pickup-delivery operations to shopping malls involving multiple non-collaborative Logistics Service Providers (LSPs) in a congested city where space is scarce. This problem can be categorized as a Vehicle Routing Problem with Pickup and Delivery, Time Windows and Location Congestion with multiple LSPs (or ML-VRPLC in short), and we propose a scalable, decentralized, coordinated planning approach via iterative best response. We formulate the problem as a strategic game where each LSP is a self-interested agent but is willing to participate in a coordinated planning as long as there are sufficient …

Go to article

Set Team Orienteering Problem With Time Windows, Aldy Gunawan, Vincent F. Yu, Andros Nicas Sutanto, Panca Jodiawan Jun 2021

Set Team Orienteering Problem With Time Windows, Aldy Gunawan, Vincent F. Yu, Andros Nicas Sutanto, Panca Jodiawan

Research Collection School Of Computing and Information Systems

This research introduces an extension of the Orienteering Problem (OP), known as Set Team Orienteering Problem with Time Windows (STOPTW), in which customers are first grouped into clusters. Each cluster is associated with a profit that will be collected if at least one customer within the cluster is visited. The objective is to find the best route that maximizes the total collected profit without violating time windows and time budget constraints. We propose an adaptive large neighborhood search algorithm to solve newly introduced benchmark instances. The preliminary results show the capability of the proposed algorithm to obtain good solutions within …

Go to article

On Predicting Personal Values Of Social Media Users Using Community-Specific Language Features And Personal Value Correlation, Amila Silva, Pei Chi Lo, Ee-Peng Lim Jun 2021

On Predicting Personal Values Of Social Media Users Using Community-Specific Language Features And Personal Value Correlation, Amila Silva, Pei Chi Lo, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Personal values have significant influence on individuals’ behaviors, preferences, and decision making. It is therefore not a surprise that personal values of a person could influence his or her social media content and activities. Instead of getting users to complete personal value questionnaire, researchers have looked into a non-intrusive and highly scalable approach to predict personal values using user-generated social media data. Nevertheless, geographical differences in word usage and profile information are issues to be addressed when designing such prediction models. In this work, we focus on analyzing Singapore users’ personal values, and developing effective models to predict their personal …

Go to article

Adaptive Aggregation Networks For Class-Incremental Learning, Yaoyao Liu, Bernt Schiele, Qianru Sun Jun 2021

Adaptive Aggregation Networks For Class-Incremental Learning, Yaoyao Liu, Bernt Schiele, Qianru Sun

Research Collection School Of Computing and Information Systems

Class-Incremental Learning (CIL) aims to learn a classification model with the number of classes increasing phase-by-phase. An inherent problem in CIL is the stability-plasticity dilemma between the learning of old and new classes, i.e., high-plasticity models easily forget old classes, but high-stability models are weak to learn new classes. We alleviate this issue by proposing a novel network architecture called Adaptive Aggregation Networks (AANets) in which we explicitly build two types of residual blocks at each residual level (taking ResNet as the baseline architecture): a stable block and a plastic block. We aggregate the output feature maps from these two …

Go to article

Counterfactual Zero-Shot And Open-Set Visual Recognition, Zhongqi Yue, Tan Wang, Qianru Sun, Xian-Sheng Hua, Hanwang Zhang Jun 2021

Counterfactual Zero-Shot And Open-Set Visual Recognition, Zhongqi Yue, Tan Wang, Qianru Sun, Xian-Sheng Hua, Hanwang Zhang

Research Collection School Of Computing and Information Systems

We present a novel counterfactual framework for both Zero-Shot Learning (ZSL) and Open-Set Recognition (OSR), whose common challenge is generalizing to the unseen-classes by only training on the seen-classes. Our idea stems from the observation that the generated samples for unseen-classes are often out of the true distribution, which causes severe recognition rate imbalance between the seen-class (high) and unseen-class (low). We show that the key reason is that the generation is not Counterfactual Faithful, and thus we propose a faithful one, whose generation is from the sample-specific counterfactual question: What would the sample look like, if we set its …

Go to article

Cache-Efficient Fork-Processing Patterns On Large Graphs, Shengliang Lu, Shixuan Sun, Johns Paul, Yuchen Li, Bingsheng He Jun 2021

Cache-Efficient Fork-Processing Patterns On Large Graphs, Shengliang Lu, Shixuan Sun, Johns Paul, Yuchen Li, Bingsheng He

Research Collection School Of Computing and Information Systems

As large graph processing emerges, we observe a costly fork-processing pattern (FPP) that is common in many graph algorithms. The unique feature of the FPP is that it launches many independent queries from different source vertices on the same graph. For example, an algorithm in analyzing the network community profile can execute Personalized PageRanks that start from tens of thousands of source vertices at the same time. We study the efficiency of handling FPPs in state-of-the-art graph processing systems on multi-core architectures, including Ligra, Gemini, and GraphIt. We find that those systems suffer from severe cache miss penalty because of …

Go to article

Self-Adaptive Graph Traversal On Gpus, Mo Sha, Yuchen Li, Kian-Lee Tan Jun 2021

Self-Adaptive Graph Traversal On Gpus, Mo Sha, Yuchen Li, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

GPU’s massive computing power offers unprecedented opportunities to enable large graph analysis. Existing studies proposed various preprocessing approaches that convert the input graphs into dedicated structures for GPU-based optimizations. However, these dedicated approaches incur significant preprocessing costs as well as weak programmability to build general graph applications. In this paper, we introduce SAGE, a self-adaptive graph traversal on GPUs, which is free from preprocessing and operates on ubiquitous graph representations directly. We propose Tiled Partitioning and Resident Tile Stealing to fully exploit the computing power of GPUs in a runtime and self-adaptive manner. We also propose Sampling-based Reordering to further …

Go to article

First Train Timetabling And Bus Service Bridging In Intermodal Bus-And-Train Transit Networks, Liujiang Kang, Hao Li, Huijun Sun, Jianjun Wu, Zhiguang Cao, Nsabimana Buhigiro Jun 2021

First Train Timetabling And Bus Service Bridging In Intermodal Bus-And-Train Transit Networks, Liujiang Kang, Hao Li, Huijun Sun, Jianjun Wu, Zhiguang Cao, Nsabimana Buhigiro

Research Collection School Of Computing and Information Systems

Subway system is the main mode of transportation for city dwellers and is a quite signif-icant backbone to a city's operations. One of the challenges of subway network operation is the scheduling of the first trains each morning and its impact on transfers. To deal with this challenge, some cities (e.g. Beijing) use bus 'bridging' services, temporarily substitut -ing segments of the subway network. The present paper optimally identifies when to start each train and bus bridging service in an intermodal transit network. Starting from a mixed integer nonlinear programming model for the first train timetabling problem, we linearize and …

Go to article

Projecting Your View Attentively: Monocular Road Scene Layout Estimation Via Cross-View Transformation, Weixiang Yang, Qi Li, Wenxi Liu, Yuanlong Yu, Yuexin Ma, Shengfeng He, Jia Pan Jun 2021

Projecting Your View Attentively: Monocular Road Scene Layout Estimation Via Cross-View Transformation, Weixiang Yang, Qi Li, Wenxi Liu, Yuanlong Yu, Yuexin Ma, Shengfeng He, Jia Pan

Research Collection School Of Computing and Information Systems

HD map reconstruction is crucial for autonomous driving. LiDAR-based methods are limited due to the deployed expensive sensors and time-consuming computation. Camera-based methods usually need to separately perform road segmentation and view transformation, which often causes distortion and the absence of content. To push the limits of the technology, we present a novel framework that enables reconstructing a local map formed by road layout and vehicle occupancy in the bird's-eye view given a front-view monocular image only. In particular, we propose a cross-view transformation module, which takes the constraint of cycle consistency between views into account and makes full use …

Go to article

Reciprocal Transformations For Unsupervised Video Object Segmentation, Sucheng Ren, Wenxi Liu, Yongtuo Liu, Haoxin Chen, Guoqiang Han, Shengfeng He Jun 2021

Reciprocal Transformations For Unsupervised Video Object Segmentation, Sucheng Ren, Wenxi Liu, Yongtuo Liu, Haoxin Chen, Guoqiang Han, Shengfeng He

Research Collection School Of Computing and Information Systems

Unsupervised video object segmentation (UVOS) aims at segmenting the primary objects in videos without any human intervention. Due to the lack of prior knowledge about the primary objects, identifying them from videos is the major challenge of UVOS. Previous methods often regard the moving objects as primary ones and rely on optical flow to capture the motion cues in videos, but the flow information alone is insufficient to distinguish the primary objects from the background objects that move together. This is because, when the noisy motion features are combined with the appearance features, the localization of the primary objects is …

Go to article

Learning From The Master: Distilling Cross-Modal Advanced Knowledge For Lip Reading, Sucheng Ren, Yong Du, Jianming Lv, Guoqiang Han, Shengfeng He Jun 2021

Learning From The Master: Distilling Cross-Modal Advanced Knowledge For Lip Reading, Sucheng Ren, Yong Du, Jianming Lv, Guoqiang Han, Shengfeng He

Research Collection School Of Computing and Information Systems

Lip reading aims to predict the spoken sentences from silent lip videos. Due to the fact that such a vision task usually performs worse than its counterpart speech recognition, one potential scheme is to distill knowledge from a teacher pretrained by audio signals. However, the latent domain gap between the cross-modal data could lead to a learning ambiguity and thus limits the performance of lip reading. In this paper, we propose a novel collaborative framework for lip reading, and two aspects of issues are considered: 1) the teacher should understand bi-modal knowledge to possibly bridge the inherent cross-modal gap; 2) …

Go to article

First Prev Next Last