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

Yiru Shen

dblp:132/8002 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
1since 2021 · last 2021
0000-0002-7263-1632ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 2 · 1 first-authorComputer networks · 1Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
3D vision · 67% Graph learning · 17% Learning paradigms · 17%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › point cloud analysis
point cloud learning
0.722018
FoldingNet: Point Cloud Auto-Encoder via Deep Grid Deformation · CVPR 2018
Mining Point Cloud Local Structures by Kernel Correlation and Graph Pooling · CVPR 2018
Machine learning › Graph learning › graph neural network
graph pooling
0.312018
Mining Point Cloud Local Structures by Kernel Correlation and Graph Pooling · CVPR 2018
Computer vision › 3D vision › point cloud analysis › point cloud learning
point cloud autoencoder
0.312018
FoldingNet: Point Cloud Auto-Encoder via Deep Grid Deformation · CVPR 2018
Computer vision › 3D vision › point cloud analysis › point cloud learning
point cloud representation learning
0.312018
FoldingNet: Point Cloud Auto-Encoder via Deep Grid Deformation · CVPR 2018
Machine learning › Learning paradigms
unsupervised learning
0.312018
FoldingNet: Point Cloud Auto-Encoder via Deep Grid Deformation · CVPR 2018

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

pointnet · 0.3nearest neighbor graph · 0.3graph neural network · 0.3deep learning · 0.3autoencoder · 0.3
YearPublicationVenuePosition
2021 A Dataset-Dispersion Perspective on Reconstruction Versus Recognition in Single-View 3D Reconstruction Networks
abstract
Neural networks (NN) for single-view 3D reconstruction (SVR) have gained in popularity. Recent work points out that for SVR, most cutting-edge NNs have limited performance on reconstructing unseen objects because they rely primarily on recognition (i.e., classification-based methods) rather than shape reconstruction. To understand this issue in depth, we provide a systematic study on when and why NNs prefer recognition to reconstruction and vice versa. Our finding shows that a leading factor in determining recognition versus reconstruction is how “dispersed” the training data is. Thus, we introduce the dispersion score, a new data-driven metric, to quantify this leading factor and study its effect on NNs. We hypothesize that NNs are biased toward recognition when training images are more dispersed and training shapes are less dispersed. Our hypothesis is supported and the dispersion score is proved effective through our experiments on synthetic and benchmark datasets. We show that the proposed metric is a principal way to analyze reconstruction quality and provides novel information in addition to the conventional reconstruction score. We have open-sourced our code.1
Yefan Zhou, Yiru Shen, Yujun Yan, Chen Feng 0002, Yaoqing Yang 0002
3DV2
2020 Dataset for Eye Tracking on a Virtual Reality Platform
abstract
We present a large scale data set of eye-images captured using a virtual-reality (VR) head mounted display mounted with two synchronized eye-facing cameras at a frame rate of 200 Hz under controlled illumination. This dataset is compiled from video capture of the eye-region collected from 152 individual participants and is divided into four subsets: (i) 12,759 images with pixel-level annotations for key eye-regions: iris, pupil and sclera (ii) 252,690 unlabeled eye-images, (iii) 91,200 frames from randomly selected video sequences of 1.5 seconds in duration, and (iv) 143 pairs of left and right point cloud data compiled from corneal topography of eye regions collected from a subset, 143 out of 152, participants in the study. A baseline experiment has been evaluated on the dataset for the task of semantic segmentation of pupil, iris, sclera and background, with the mean intersection-over-union (mIoU) of 98.3 %. We anticipate that this dataset will create opportunities to researchers in the eye tracking community and the broader machine learning and computer vision community to advance the state of eye-tracking for VR applications, which in its turn will have greater implications in Human-Computer Interaction.
Stephan J. Garbin, Oleg V. Komogortsev, Robert Cavin, Gregory Hughes, Yiru Shen, Immo Schuetz, Sachin S. Talathi
ETRA5
2018 Mining Point Cloud Local Structures by Kernel Correlation and Graph Pooling
abstract
Unlike on images, semantic learning on 3D point clouds using a deep network is challenging due to the naturally unordered data structure. Among existing works, PointNet has achieved promising results by directly learning on point sets. However, it does not take full advantage of a point's local neighborhood that contains fine-grained structural information which turns out to be helpful towards better semantic learning. In this regard, we present two new operations to improve PointNet with a more efficient exploitation of local structures. The first one focuses on local 3D geometric structures. In analogy to a convolution kernel for images, we define a point-set kernel as a set of learnable 3D points that jointly respond to a set of neighboring data points according to their geometric affinities measured by kernel correlation, adapted from a similar technique for point cloud registration. The second one exploits local high-dimensional feature structures by recursive feature aggregation on a nearest-neighbor-graph computed from 3D positions. Experiments show that our network can efficiently capture local information and robustly achieve better performances on major datasets. Our code is available at http://www.merl.com/research/license#KCNet.
Yiru Shen, Chen Feng 0002, Yaoqing Yang 0002, Dong Tian
CVPR1
2018 FoldingNet: Point Cloud Auto-Encoder via Deep Grid Deformation
abstract
Recent deep networks that directly handle points in a point set, e.g., PointNet, have been state-of-the-art for supervised learning tasks on point clouds such as classification and segmentation. In this work, a novel end-to-end deep auto-encoder is proposed to address unsupervised learning challenges on point clouds. On the encoder side, a graph-based enhancement is enforced to promote local structures on top of PointNet. Then, a novel folding-based decoder deforms a canonical 2D grid onto the underlying 3D object surface of a point cloud, achieving low reconstruction errors even for objects with delicate structures. The proposed decoder only uses about 7% parameters of a decoder with fully-connected neural networks, yet leads to a more discriminative representation that achieves higher linear SVM classification accuracy than the benchmark. In addition, the proposed decoder structure is shown, in theory, to be a generic architecture that is able to reconstruct an arbitrary point cloud from a 2D grid. Our code is available at http://www.merl.com/research/license#FoldingNet.
Yaoqing Yang 0002, Chen Feng 0002, Yiru Shen, Dong Tian
CVPR3
2017 Assessing the Accuracy of a Wrist Motion Tracking Method for Counting Bites Across Demographic and Food Variables
abstract
This paper describes a study to test the accuracy of a method that tracks wrist motion during eating to detect and count bites. The purpose was to assess its accuracy across demographic (age, gender, and ethnicity) and bite (utensil, container, hand used, and food type) variables. Data were collected in a cafeteria under normal eating conditions. A total of 271 participants ate a single meal while wearing a watch-like device to track their wrist motion. A video was simultaneously recorded of each participant and subsequently reviewed to determine the ground truth times of bites. Bite times were operationally defined as the moment when food or beverage was placed into the mouth. Food and beverage choices were not scripted or restricted. Participants were seated in groups of 2-4 and were encouraged to eat naturally. A total of 24 088 bites of 374 different food and beverage items were consumed. Overall the method for automatically detecting bites had a sensitivity of 75% with a positive predictive value of 89%. A range of 62-86% sensitivity was found across demographic variables with slower eating rates trending toward higher sensitivity. Variations in sensitivity due to food type showed a modest correlation with the total wrist motion during the bite, possibly due to an increase in head-toward-plate motion and decrease in hand-toward-mouth motion for some food types. Overall, the findings provide the largest evidence to date that the method produces a reliable automated measure of intake during unrestricted eating.
Yiru Shen, James Salley, Eric Muth, Adam W. Hoover
IEEE J. Biomed. Health Informatics1
2013 Turbo Trellis Coded hierarchical modulation for cooperative communications
abstract
A cooperative communication system assisted by Turbo Trellis-Coded Modulation (TTCM) relying on Hierarchical Modulation (HM) is proposed, which invokes iterative soft decoding. Our results demonstrated that the performance of the single-relay aided cooperative system can be improved by at least 4 dB at a BER of 10−5.
Yiru Shen, Soon Xin Ng, Lajos Hanzo
WCNC2