Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

David Clifford

dblp:155/9096 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2021
0000-0003-4130-4134ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Trustworthy machine learning · 44% Motion planning and robot control · 28% Legged, aerial and field robots · 22%
Computer graphics and multimedia
1 paper
Visual content generation and editing · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Legged, aerial and field robots › field robotics
agricultural robotics
0.512021
Reaching Pruning Locations in a Vine Using a Deep Reinforcement Learning Policy · ICRA 2021
Robotics › Motion planning and robot control
robot learning
0.512021
Reaching Pruning Locations in a Vine Using a Deep Reinforcement Learning Policy · ICRA 2021
Machine learning › Trustworthy machine learning
robustness
0.512021
Semantically Robust Unpaired Image Translation for Data with Unmatched Semantics Statistics · ICCV 2021
Machine learning › Trustworthy machine learning › robustness
semantic robustness
0.512021
Semantically Robust Unpaired Image Translation for Data with Unmatched Semantics Statistics · ICCV 2021
Visual content generation and editing
image-to-image translation
0.512021
Semantically Robust Unpaired Image Translation for Data with Unmatched Semantics Statistics · ICCV 2021
Visual content generation and editing › image-to-image translation
unpaired image translation
0.512021
Semantically Robust Unpaired Image Translation for Data with Unmatched Semantics Statistics · ICCV 2021
Machine learning › Generative modeling › image generation › GAN-based image generation
GAN-based image translation
0.112021
Semantically Robust Unpaired Image Translation for Data with Unmatched Semantics Statistics · ICCV 2021
Robotics › Motion planning and robot control › robot control
inverse kinematics
0.112021
Reaching Pruning Locations in a Vine Using a Deep Reinforcement Learning Policy · ICRA 2021

Methods — techniques the papers use, named apart from their topics

multi-scale feature perturbation · 1.0adversarial perturbation · 1.0GAN · 1.0inverse kinematics · 0.5deep reinforcement learning · 0.5convolutional neural network · 0.5
YearPublicationVenuePosition
2021 Semantically Robust Unpaired Image Translation for Data with Unmatched Semantics Statistics
abstract
Many applications of unpaired image-to-image translation require the input contents to be preserved semantically during translations. Unaware of the inherently unmatched semantics distributions between source and target domains, existing distribution matching methods (i.e., GAN-based) can give undesired solutions. In particular, although producing visually reasonable outputs, the learned models usually flip the semantics of the inputs. To tackle this without using extra supervisions, we propose to enforce the translated outputs to be semantically invariant w.r.t. small perceptual variations of the inputs, a property we call "semantic robustness". By optimizing a robustness loss w.r.t. multi-scale feature space perturbations of the inputs, our method effectively reduces semantics flipping and produces translations that outperform existing methods both quantitatively and qualitatively.
Zhiwei Jia, Bodi Yuan, Kangkang Wang, David Clifford, Hao Su 0001
ICCV5
2021 Reaching Pruning Locations in a Vine Using a Deep Reinforcement Learning Policy
abstract
We outline a neural network-based pipeline for perception, control and planning of a 7 DoF robot for tasks that involve reaching into a dormant grapevine canopy. The proposed system consists of a 6 DoF industrial robot arm and a linear slider that can actuate on an entire grape vine. Our approach uses Convolutional Neural Networks to detect buds in dormant grape vines and a Reinforcement Learning based control strategy to reach desired cut-point locations for pruning tasks. Within this framework, three methodologies are developed and compared to reach the desired locations: the learned policy-based approach (RL), a hybrid method that uses the learned policy and an inverse kinematics solver (RL+IK), and lastly a classical approach commonly used in robotics. We first tested and validated the suitability of the proposed learning methodology in a simulated environment that resembled laboratory conditions. A reaching accuracy of up to 61.90% and 85.71% for the RL and RL+IK approaches respectively was obtained for a vine that the agent observed while learning. When testing in a new vine, the accuracy was up to 66.66% and 76.19% for RL and RL+IK, respectively. The same methods were then deployed on a real system in an end to end procedure: autonomously scan the vine using a vision system, create its model and finally use the learned policy to reach cutting points. The reaching accuracy obtained in these tests was 73.08%.
Francisco Yandún, Tanvir Parhar, Abhisesh Silwal, David Clifford, Gabriella Levine, Sergey Yaroshenko, George Kantor
ICRA4