22 research outputs found
Bottom-Up and Top-Down Reasoning with Hierarchical Rectified Gaussians
Convolutional neural nets (CNNs) have demonstrated remarkable performance in
recent history. Such approaches tend to work in a unidirectional bottom-up
feed-forward fashion. However, practical experience and biological evidence
tells us that feedback plays a crucial role, particularly for detailed spatial
understanding tasks. This work explores bidirectional architectures that also
reason with top-down feedback: neural units are influenced by both lower and
higher-level units.
We do so by treating units as rectified latent variables in a quadratic
energy function, which can be seen as a hierarchical Rectified Gaussian model
(RGs). We show that RGs can be optimized with a quadratic program (QP), that
can in turn be optimized with a recurrent neural network (with rectified linear
units). This allows RGs to be trained with GPU-optimized gradient descent. From
a theoretical perspective, RGs help establish a connection between CNNs and
hierarchical probabilistic models. From a practical perspective, RGs are well
suited for detailed spatial tasks that can benefit from top-down reasoning. We
illustrate them on the challenging task of keypoint localization under
occlusions, where local bottom-up evidence may be misleading. We demonstrate
state-of-the-art results on challenging benchmarks.Comment: To appear in CVPR 201
Active Learning with Partial Feedback
While many active learning papers assume that the learner can simply ask for
a label and receive it, real annotation often presents a mismatch between the
form of a label (say, one among many classes), and the form of an annotation
(typically yes/no binary feedback). To annotate examples corpora for multiclass
classification, we might need to ask multiple yes/no questions, exploiting a
label hierarchy if one is available. To address this more realistic setting, we
propose active learning with partial feedback (ALPF), where the learner must
actively choose both which example to label and which binary question to ask.
At each step, the learner selects an example, asking if it belongs to a chosen
(possibly composite) class. Each answer eliminates some classes, leaving the
learner with a partial label. The learner may then either ask more questions
about the same example (until an exact label is uncovered) or move on
immediately, leaving the first example partially labeled. Active learning with
partial labels requires (i) a sampling strategy to choose (example, class)
pairs, and (ii) learning from partial labels between rounds. Experiments on
Tiny ImageNet demonstrate that our most effective method improves 26%
(relative) in top-1 classification accuracy compared to i.i.d. baselines and
standard active learners given 30% of the annotation budget that would be
required (naively) to annotate the dataset. Moreover, ALPF-learners fully
annotate TinyImageNet at 42% lower cost. Surprisingly, we observe that
accounting for per-example annotation costs can alter the conventional wisdom
that active learners should solicit labels for hard examples.Comment: ICLR 201
Analysis on the vibration modes of the electric vehicle motor stator
The lightweight design of the electric vehicle motor brought about more serious vibration and noise problem of the motor. An accurate modal calculation was the basis for the study of the vibration and noise characteristics of the electric vehicle motor. The finite element method was used to perform the modal simulation of the PMSM. Through the reasonable simplification and equivalence of the motor stator model, the first 7 orders natural frequencies and corresponding modes of the motor stator under the free state were calculated. After that, the accuracy of the finite element model was verified by the hammering modal experiment of the prototype. Furthermore, the above results will provide the theoretical basis for the electric vehicle motor’s vibration control and NVH improvement
Research on vibration response of a reducer of electric vehicle
In order to study the vibration response of reducer of electric vehicle, a model for the reducer is established in ANSYS Motion, a multi-body dynamics software. Firstly, a 3D model of the reducer is built, including such assemblies as its shaft, gears, bearing, and its case. Secondly, based on the finite element model, the modal simulation is carried out. Finally, under the specified operating condition when the motor speed increases from 0 rpm to 10000Â rpm, with using the STFT method, the vibration response of the reducer is obtained through the multi-body dynamics simulation. After comparing the simulation results between different marked nodes, the conclusion indicates that this process can calculate the vibration characteristics of the reducer quickly and accurately and can lay the foundation for the structural optimization in terms of vibration and acoustic properties
Active Learning with Partial Feedback
While many active learning papers assume that the learner can simply ask for a label and receive it, real annotation often presents a mismatch between the form of a label (say, one among many classes), and the form of an annotation (typically yes/no binary feedback). To annotate examples corpora for multiclass classification, we might need to ask multiple yes/no questions, exploiting a label hierarchy if one is available. To address this more realistic setting, we propose active learning with partial feedback (ALPF), where the learner must actively choose both which example to label and which binary question to ask. At each step, the learner selects an example, asking if it belongs to a chosen (possibly composite) class. Each answer eliminates some classes, leaving the learner with a partial label. The learner may then either ask more questions about the same example (until an exact label is uncovered) or move on immediately, leaving the first example partially labeled. Active learning with partial labels requires (i) a sampling strategy to choose (example, class) pairs, and (ii) learning from partial labels between rounds. Experiments on Tiny ImageNet demonstrate that our most effective method improves 26% (relative) in top-1 classification accuracy compared to i.i.d. baselines and standard active learners given 30% of the annotation budget that would be required (naively) to annotate the dataset. Moreover, ALPF-learners fully annotate TinyImageNet at 42% lower cost. Surprisingly, we observe that accounting for per-example annotation costs can alter the conventional wisdom that active learners should solicit labels for hard examples
Unconstrained Face Detection and Open-Set Face Recognition Challenge
Face detection and recognition benchmarks have shifted toward more difficult
environments. The challenge presented in this paper addresses the next step in
the direction of automatic detection and identification of people from outdoor
surveillance cameras. While face detection has shown remarkable success in
images collected from the web, surveillance cameras include more diverse
occlusions, poses, weather conditions and image blur. Although face
verification or closed-set face identification have surpassed human
capabilities on some datasets, open-set identification is much more complex as
it needs to reject both unknown identities and false accepts from the face
detector. We show that unconstrained face detection can approach high detection
rates albeit with moderate false accept rates. By contrast, open-set face
recognition is currently weak and requires much more attention.Comment: This is an ERRATA version of the paper originally presented at the
International Joint Conference on Biometrics. Due to a bug in our evaluation
code, the results of the participants changed. The final conclusion, however,
is still the sam