Header logo is


2016


no image
Magnetic vortex cores as tunable spin-wave emitters

Wintz, S., Tiberkevich, V., Weigand, M., Raabe, J., Lindner, J., Erbe, A., Slavin, A., Fassbender, J.

{Nature Nanotechnology}, 11(11):948-953, Nature Publishing Group, London, 2016 (article)

mms

DOI [BibTex]

2016


DOI [BibTex]


no image
The usable capacity of porous materials for hydrogen storage

Schlichtenmayer, M., Hirscher, M.

{Applied Physics A}, 122(4), Springer-Verlag Heidelberg, Heidelberg, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Ferromagnetic behaviour of ZnO: the role of grain boundaries

Straumal, B. B., Protasova, S. G., Mazilkin, A. A., Goering, E., Schütz, G., Straumal, P. B., Baretzky, B.

{Beilstein Journal of Nanotechnology}, 7, pages: 1936-1947, Beilstein-Institut, Frankfurt am Main, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Localized domain wall nucleation dynamics in asymmetric ferromagnetic rings revealed by direct time-resolved magnetic imaging

Richter, K., Krone, A., Mawass, M., Krüger, B., Weigand, M., Stoll, H., Schütz, G., Kläui, M.

{Physical Review B}, 94(2), American Physical Society, Woodbury, NY, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Observation of room-temperature magnetic skyrmions and their current-driven dynamics in ultrathin metallic ferromagnets

Woo, S., Litzius, K., Krüger, B., Im, M., Caretta, L., Richter, K., Mann, M., Krone, A., Reeve, R. M., Weigand, M., Agrawal, P., Lemesh, I., Mawass, M., Fischer, P., Kläui, M., Beach, G. S. D.

{Nature Materials}, 15(5):501-506, Nature Pub. Group, London, UK, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Step Timing Adjustement: a Step toward Generating Robust Gaits

Khadiv, M., Herzog, A., Moosavian, S. A. A., Righetti, L.

In 2016 IEEE-RAS 16th International Conference on Humanoid Robots (Humanoids), pages: 35-42, IEEE, Cancun, Mexico, 2016 (inproceedings)

Abstract
Step adjustment for humanoid robots has been shown to improve robustness in gaits. However, step duration adaptation is often neglected in control strategies. In this paper, we propose an approach that combines both step location and timing adjustment for generating robust gaits. In this approach, step location and step timing are decided, based on feedback from the current state of the robot. The proposed approach is comprised of two stages. In the first stage, the nominal step location and step duration for the next step or a previewed number of steps are specified. In this stage which is done at the start of each step, the main goal is to specify the best step length and step duration for a desired walking speed. The second stage deals with finding the best landing point and landing time of the swing foot at each control cycle. In this stage, stability of the gaits is preserved by specifying a desired offset between the swing foot landing point and the Divergent Component of Motion (DCM) at the end of current step. After specifying the landing point of the swing foot at a desired time, the swing foot trajectory is regenerated at each control cycle to realize desired landing properties. Simulation on different scenarios shows the robustness of the generated gaits from our proposed approach compared to the case where no timing adjustment is employed.

mg

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
Decision-Making under Ambiguity Is Modulated by Visual Framing, but Not by Motor vs. Non-Motor Context: Experiments and an Information-Theoretic Ambiguity Model

Grau-Moya, J, Ortega, PA, Braun, DA

PLoS ONE, 11(4):1-21, April 2016 (article)

Abstract
A number of recent studies have investigated differences in human choice behavior depending on task framing, especially comparing economic decision-making to choice behavior in equivalent sensorimotor tasks. Here we test whether decision-making under ambiguity exhibits effects of task framing in motor vs. non-motor context. In a first experiment, we designed an experience-based urn task with varying degrees of ambiguity and an equivalent motor task where subjects chose between hitting partially occluded targets. In a second experiment, we controlled for the different stimulus design in the two tasks by introducing an urn task with bar stimuli matching those in the motor task. We found ambiguity attitudes to be mainly influenced by stimulus design. In particular, we found that the same subjects tended to be ambiguity-preferring when choosing between ambiguous bar stimuli, but ambiguity-avoiding when choosing between ambiguous urn sample stimuli. In contrast, subjects’ choice pattern was not affected by changing from a target hitting task to a non-motor context when keeping the stimulus design unchanged. In both tasks subjects’ choice behavior was continuously modulated by the degree of ambiguity. We show that this modulation of behavior can be explained by an information-theoretic model of ambiguity that generalizes Bayes-optimal decision-making by combining Bayesian inference with robust decision-making under model uncertainty. Our results demonstrate the benefits of information-theoretic models of decision-making under varying degrees of ambiguity for a given context, but also demonstrate the sensitivity of ambiguity attitudes across contexts that theoretical models struggle to explain.

ei

DOI [BibTex]


no image
Outlook and challenges for hydrogen storage in nanoporous materials

Broom, D. P., Webb, C. J., Hurst, K. E., Parilla, P. A., Gennett, T., Brown, C. M., Zacharia, R., Tylianakis, E., Klontzas, E., Froudakis, G. E., Steriotis, T. A., Trikalitis, P. N., Anton, D. L., Hardy, B., Tamburello, D., Corgnale, C., van Hassel, B. A., Cossement, D., Chahine, R., Hirscher, M.

{Applied Physics A}, 122(3), Springer-Verlag Heidelberg, Heidelberg, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Quantum sieving for separation of hydrogen isotopes using MOFs

Oh, H., Hirscher, M.

{European Journal of Inorganic Chemistry}, 2016(27):4278-4289, Wiley-VCH, Weinheim, Germany, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Direct patterning of vortex generators on a fiber tip using a focused ion beam

Vayalamkuzhi, P., Bhattacharya, S., Eigenthaler, U., Keskinbora, K., Salman, C. T., Hirscher, M., Spatz, J. P., Viswanathan, N. K.

{Optics Letters}, 41(10):2133-2136, Optical Society of America, Washington, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Two-body problem of core-region coupled magnetic vortex stacks

Hänze, M., Adolff, C. F., Velten, S., Weigand, M., Meier, G.

{Physical Review B}, 93(5), American Physical Society, Woodbury, NY, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Irreproducibility in hydrogen storage material research

Broom, D. P., Hirscher, M.

{Energy \& Environmental Science}, 9(11):3368-3380, Royal Society of Chemistry, Cambridge, UK, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Effect of surface configurations on the room-temperature magnetism of pure ZnO

Chen, Y., Wang, Z., Leineweber, A., Baier, J., Tietze, T., Phillipp, F., Schütz, G., Goering, E.

{Journal of Materials Chemistry C}, 4(19):4166-4175, Royal Society of Chemistry, London, UK, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
On the synthesis and microstructure analysis of high performance MnBi

Chen, Y., Sawatzki, S., Ener, S., Sepehri-Amin, H., Leineweber, A., Gregori, G., Qu, F., Muralidhar, S., Ohkubo, T., Hono, K., Gutfleisch, O., Kronmüller, H., Schütz, G., Goering, E.

{AIP Advances}, 6(12), 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
The role of individual defects on the magnetic screening of HTSC films

Ruoß, S., Stahl, C., Weigand, M., Zahn, P., Bayer, J., Schütz, G., Albrecht, J.

{New Journal of Physics}, 18(10), IOP Publishing, Bristol, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Magnetic switching of nanoscale antidot lattices

Wiedwald, U., Gräfe, J., Lebecki, K. M., Skripnik, M., Haering, F., Schütz, G., Ziemann, P., Goering, E., Nowak, U.

{Beilstein Journal of Nanotechnology}, 7, pages: 733-750, Beilstein-Institut, Frankfurt am Main, 2016 (article)

mms

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
Hydrogen-based energy storage (IEA-HIA Task 32)

Buckley, C. E., Chen, P., van Hassel, B. A., Hirscher, M.

{Applied Physics A}, 122(2), Springer-Verlag Heidelberg, Heidelberg, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Local domain-wall velocity engineering via tailored potential landscapes in ferromagnetic rings

Richter, K., Krone, A., Mawass, M., Krüger, B., Weigand, M., Stoll, H., Schütz, G., Kläui, M.

{Physical Review Applied}, 5(2), American Physical Society, College Park, Md. [u.a.], 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Geometric control of the magnetization reversal in antidot lattices with perpendicular magnetic anisotropy

Gräfe, J., Weigand, M., Träger, N., Schütz, G., Goering, E. J., Skripnik, M., Nowak, U., Haering, F., Ziemann, P., Wiedwald, U.

{Physical Review B}, 93(10), American Physical Society, Woodbury, NY, 2016 (article)

mms

DOI Project Page Project Page [BibTex]

DOI Project Page Project Page [BibTex]


no image
Growth and characterizationof large weak topological insulator Bi2Tel single crystal by Bismuth self-flux method

Ryu, G., Son, K., Schütz, G.

{Journal of Crystal Growth}, 440, pages: 26-30, North-Holland, Amsterdam, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Additive interfacial chiral interaction in multilayers for stabilization of small individual skyrmions at room temperature

Moreau-Luchaire, C., Moutafis, C., Reyren, N., Sampaio, J., Vaz, C. A. F., Van Horne, N., Bouzehouane, K., Garcia, K., Deranlot, C., Warnicke, P., Wohlhüter, P., George, J.-M., Weigand, M., Raabe, J., Cros, V., Fert, A.

{Nature Nanotechnology}, 11(5):444-448, Nature Publishing Group, London, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Surface defect free growth of a spin dimer TlCuCl3 compound crystals and investigations on its optical and magnetic properties

Ryu, G., Son, K.

{Journal of Solid State Chemistry}, 237, pages: 358-363, Academic Press, Orlando, Fla., 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Physical and mathematical justification of the numerical Brillouin zone integration of the Boltzmann rate equation by Gaussian smearing

Illg, C., Haag, M., Teeny, N., Wirth, J., Fähnle, M.

{Journal of Theoretical and Applied Physics}, 10(1):1-6, Springer, Berlin, Heidelberg, Tehran, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Pinned orbital moments - A new contribution to magnetic anisotropy

Audehm, P., Schmidt, M., Brück, S., Tietze, T., Gräfe, J., Macke, S., Schütz, G., Goering, E.

{Scientific Reports}, 6, Nature Publishing Group, London, UK, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Comparative study of ALD SiO2 thin films for optical applications

Pfeiffer, K., Shestaeva, S., Bingel, A., Munzert, P., Ghazaryan, L., van Helvoirt, C., Kessels, W. M. M., Sanli, U. T., Grévent, C., Schütz, G., Putkonen, M., Buchanan, I., Jensen, L., Ristau, D., Tünnermann, A., Szeghalmi, A.

{Optical materials express}, 6(2):660-670, OSA, Washington, DC, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Combined first-order reversal curve and x-ray microscopy investigation of magnetization reversal mechanisms in hexagonal antidot lattices

Gräfe, J., Weigand, M., Stahl, C., Träger, N., Kopp, M., Schütz, G., Goering, E. J., Haering, F., Ziemann, P., Wiedwald, U.

{Physical Review B}, 93(1), American Physical Society, Woodbury, NY, 2016 (article)

mms

DOI Project Page Project Page [BibTex]

DOI Project Page Project Page [BibTex]


no image
Switching probabilities of magnetic vortex core reversal studied by table top magneto optic Kerr microscopy

Dieterle, G., Gangwar, A., Gräfe, J., Noske, M., Förster, J., Woltersdorf, G., Stoll, H., Back, C. H., Schütz, G.

{Applied Physics Letters}, 108(2), American Institute of Physics, Melville, NY, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Ultrafast demagnetization after femtosecond laser pulses: Transfer of angular momentum from the electronic system to magnetoelastic spin-phonon modes

Tsatsoulis, T., Illg, C., Haag, M., Müller, B. Y., Zhang, L., Fähnle, M.

{Physical Review B}, 93(13), American Physical Society, Woodbury, NY, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Developments in the Ni-Nb-Zr amorphous alloy membranes

Sarker, S., Chandra, D., Hirscher, M., Dolan, M., Isheim, D., Wermer, J., Viano, D., Baricco, M., Udovic, T. J., Grant, D., Palumbo, O., Paolone, A., Cantelli, R.

{Applied Physics A}, 122(3), Springer-Verlag Heidelberg, Heidelberg, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Resistance to the transport of H2 through the external surface of as-made and modified silicalite-1 (MFI)

Kalantzopoulos, G. N., Policicchio, A., Maccallini, E., Krkljus, I., Ciuchi, F., Hirscher, M., Agostino, R. G., Golemme, G.

{Microporous and Mesoporous Materials}, 220, pages: 290-297, Elsevier, Amsterdam, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Observation of pseudopartial grain boundary wetting in the NdFeB-based alloy

Straumal, B. B., Mazilkin, A. A., Protasova, S. G., Schütz, G., Straumal, A. B., Baretzky, B.

{Journal of Materials Engineering and Performance}, 25(8):3303-3309, 2016 (article)

mms

DOI [BibTex]

DOI [BibTex]

2009


no image
Machine Learning for Brain-Computer Interfaces

Hill, NJ.

Mini-Symposia on Assistive Machine Learning for People with Disabilities at NIPS (AMD), December 2009 (talk)

Abstract
Brain-computer interfaces (BCI) aim to be the ultimate in assistive technology: decoding a user‘s intentions directly from brain signals without involving any muscles or peripheral nerves. Thus, some classes of BCI potentially offer hope for users with even the most extreme cases of paralysis, such as in late-stage Amyotrophic Lateral Sclerosis, where nothing else currently allows communication of any kind. Other lines in BCI research aim to restore lost motor function in as natural a way as possible, reconnecting and in some cases re-training motor-cortical areas to control prosthetic, or previously paretic, limbs. Research and development are progressing on both invasive and non-invasive fronts, although BCI has yet to make a breakthrough to widespread clinical application. The high-noise high-dimensional nature of brain-signals, particularly in non-invasive approaches and in patient populations, make robust decoding techniques a necessity. Generally, the approach has been to use relatively simple feature extraction techniques, such as template matching and band-power estimation, coupled to simple linear classifiers. This has led to a prevailing view among applied BCI researchers that (sophisticated) machine-learning is irrelevant since "it doesn‘t matter what classifier you use once you‘ve done your preprocessing right and extracted the right features." I shall show a few examples of how this runs counter to both the empirical reality and the spirit of what needs to be done to bring BCI into clinical application. Along the way I‘ll highlight some of the interesting problems that remain open for machine-learners.

ei

PDF Web Web [BibTex]

2009


PDF Web Web [BibTex]


no image
Efficient Subwindow Search: A Branch and Bound Framework for Object Localization

Lampert, C., Blaschko, M., Hofmann, T.

IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(12):2129-2142, December 2009 (article)

Abstract
Most successful object recognition systems rely on binary classification, deciding only if an object is present or not, but not providing information on the actual object location. To estimate the object‘s location, one can take a sliding window approach, but this strongly increases the computational cost because the classifier or similarity function has to be evaluated over a large set of candidate subwindows. In this paper, we propose a simple yet powerful branch and bound scheme that allows efficient maximization of a large class of quality functions over all possible subimages. It converges to a globally optimal solution typically in linear or even sublinear time, in contrast to the quadratic scaling of exhaustive or sliding window search. We show how our method is applicable to different object detection and image retrieval scenarios. The achieved speedup allows the use of classifiers for localization that formerly were considered too slow for this task, such as SVMs with a spatial pyramid kernel or nearest-neighbor classifiers based on the chi^2 distance. We demonstrate state-of-the-art localization performance of the resulting systems on the UIUC Cars data set, the PASCAL VOC 2006 data set, and in the PASCAL VOC 2007 competition.

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
A computational model of human table tennis for robot application

Mülling, K., Peters, J.

In AMS 2009, pages: 57-64, (Editors: Dillmann, R. , J. Beyerer, C. Stiller, M. Zöllner, T. Gindele), Springer, Berlin, Germany, Autonome Mobile Systeme, December 2009 (inproceedings)

Abstract
Table tennis is a difficult motor skill which requires all basic components of a general motor skill learning system. In order to get a step closer to such a generic approach to the automatic acquisition and refinement of table tennis, we study table tennis from a human motor control point of view. We make use of the basic models of discrete human movement phases, virtual hitting points, and the operational timing hypothesis. Using these components, we create a computational model which is aimed at reproducing human-like behavior. We verify the functionality of this model in a physically realistic simulation of a BarrettWAM.

ei

Web DOI [BibTex]

Web DOI [BibTex]


no image
PAC-Bayesian Approach to Formulation of Clustering Objectives

Seldin, Y.

NIPS Workshop on "Clustering: Science or Art? Towards Principled Approaches", December 2009 (talk)

Abstract
Clustering is a widely used tool for exploratory data analysis. However, the theoretical understanding of clustering is very limited. We still do not have a well-founded answer to the seemingly simple question of "how many clusters are present in the data?", and furthermore a formal comparison of clusterings based on different optimization objectives is far beyond our abilities. The lack of good theoretical support gives rise to multiple heuristics that confuse the practitioners and stall development of the field. We suggest that the ill-posed nature of clustering problems is caused by the fact that clustering is often taken out of its subsequent application context. We argue that one does not cluster the data just for the sake of clustering it, but rather to facilitate the solution of some higher level task. By evaluation of the clustering‘s contribution to the solution of the higher level task it is possible to compare different clusterings, even those obtained by different optimization objectives. In the preceding work it was shown that such an approach can be applied to evaluation and design of co-clustering solutions. Here we suggest that this approach can be extended to other settings, where clustering is applied.

ei

PDF Web Web [BibTex]

PDF Web Web [BibTex]


no image
Generation of three-dimensional random rotations in fitting and matching problems

Habeck, M.

Computational Statistics, 24(4):719-731, December 2009 (article)

Abstract
An algorithm is developed to generate random rotations in three-dimensional space that follow a probability distribution arising in fitting and matching problems. The rotation matrices are orthogonally transformed into an optimal basis and then parameterized using Euler angles. The conditional distributions of the three Euler angles have a very simple form: the two azimuthal angles can be decoupled by sampling their sum and difference from a von Mises distribution; the cosine of the polar angle is exponentially distributed and thus straighforward to generate. Simulation results are shown and demonstrate the effectiveness of the method. The algorithm is compared to other methods for generating random rotations such as a random walk Metropolis scheme and a Gibbs sampling algorithm recently introduced by Green and Mardia. Finally, the algorithm is applied to a probabilistic version of the Procrustes problem of fitting two point sets and applied in the context of protein structure superposition.

ei

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
Semi-supervised Kernel Canonical Correlation Analysis of Human Functional Magnetic Resonance Imaging Data

Shelton, JA.

Women in Machine Learning Workshop (WiML), December 2009 (talk)

Abstract
Kernel Canonical Correlation Analysis (KCCA) is a general technique for subspace learning that incorporates principal components analysis (PCA) and Fisher linear discriminant analysis (LDA) as special cases. By finding directions that maximize correlation, KCCA learns representations tied more closely to underlying process generating the the data and can ignore high-variance noise directions. However, for data where acquisition in a given modality is expensive or otherwise limited, KCCA may suffer from small sample effects. We propose to use semi-supervised Laplacian regularization to utilize data that are present in only one modality. This manifold learning approach is able to find highly correlated directions that also lie along the data manifold, resulting in a more robust estimate of correlated subspaces. Functional magnetic resonance imaging (fMRI) acquired data are naturally amenable to subspace techniques as data are well aligned and such data of the human brain are a particularly interesting candidate. In this study we implemented various supervised and semi-supervised versions of KCCA on human fMRI data, with regression to single and multivariate labels (corresponding to video content subjects viewed during the image acquisition). In each variate condition, Laplacian regularization improved performance whereas the semi-supervised variants of KCCA yielded the best performance. We additionally analyze the weights learned by the regression in order to infer brain regions that are important during different types of visual processing.

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
Adaptive Importance Sampling for Value Function Approximation in Off-policy Reinforcement Learning

Hachiya, H., Akiyama, T., Sugiyama, M., Peters, J.

Neural Networks, 22(10):1399-1410, December 2009 (article)

Abstract
Off-policy reinforcement learning is aimed at efficiently using data samples gathered from a policy that is different from the currently optimized policy. A common approach is to use importance sampling techniques for compensating for the bias of value function estimators caused by the difference between the data-sampling policy and the target policy. However, existing off-policy methods often do not take the variance of the value function estimators explicitly into account and therefore their performance tends to be unstable. To cope with this problem, we propose using an adaptive importance sampling technique which allows us to actively control the trade-off between bias and variance. We further provide a method for optimally determining the trade-off parameter based on a variant of cross-validation. We demonstrate the usefulness of the proposed approach through simulations.

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
A PAC-Bayesian Approach to Formulation of Clustering Objectives

Seldin, Y., Tishby, N.

In Proceedings of the NIPS 2009 Workshop "Clustering: Science or Art? Towards Principled Approaches", pages: 1-4, NIPS Workshop "Clustering: Science or Art? Towards Principled Approaches", December 2009 (inproceedings)

Abstract
Clustering is a widely used tool for exploratory data analysis. However, the theoretical understanding of clustering is very limited. We still do not have a well-founded answer to the seemingly simple question of “how many clusters are present in the data?”, and furthermore a formal comparison of clusterings based on different optimization objectives is far beyond our abilities. The lack of good theoretical support gives rise to multiple heuristics that confuse the practitioners and stall development of the field. We suggest that the ill-posed nature of clustering problems is caused by the fact that clustering is often taken out of its subsequent application context. We argue that one does not cluster the data just for the sake of clustering it, but rather to facilitate the solution of some higher level task. By evaluation of the clustering’s contribution to the solution of the higher level task it is possible to compare different clusterings, even those obtained by different optimization objectives. In the preceding work it was shown that such an approach can be applied to evaluation and design of co-clustering solutions. Here we suggest that this approach can be extended to other settings, where clustering is applied.

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
Notes on Graph Cuts with Submodular Edge Weights

Jegelka, S., Bilmes, J.

In pages: 1-6, NIPS Workshop on Discrete Optimization in Machine Learning: Submodularity, Sparsity & Polyhedra (DISCML), December 2009 (inproceedings)

Abstract
Generalizing the cost in the standard min-cut problem to a submodular cost function immediately makes the problem harder. Not only do we prove NP hardness even for nonnegative submodular costs, but also show a lower bound of (|V |1/3) on the approximation factor for the (s, t) cut version of the problem. On the positive side, we propose and compare three approximation algorithms with an overall approximation factor of O(min{|V |,p|E| log |V |}) that appear to do well in practice.

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
Guest editorial: special issue on structured prediction

Parker, C., Altun, Y., Tadepalli, P.

Machine Learning, 77(2-3):161-164, December 2009 (article)

ei

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
Structured prediction by joint kernel support estimation

Lampert, CH., Blaschko, MB.

Machine Learning, 77(2-3):249-269, December 2009 (article)

ei

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
Learning new basic Movements for Robotics

Kober, J., Peters, J.

In AMS 2009, pages: 105-112, (Editors: Dillmann, R. , J. Beyerer, C. Stiller, M. Zöllner, T. Gindele), Springer, Berlin, Germany, Autonome Mobile Systeme, December 2009 (inproceedings)

Abstract
Obtaining novel skills is one of the most important problems in robotics. Machine learning techniques may be a promising approach for automatic and autonomous acquisition of movement policies. However, this requires both an appropriate policy representation and suitable learning algorithms. Employing the most recent form of the dynamical systems motor primitives originally introduced by Ijspeert et al. [1], we show how both discrete and rhythmic tasks can be learned using a concerted approach of both imitation and reinforcement learning, and present our current best performing learning algorithms. Finally, we show that it is possible to include a start-up phase in rhythmic primitives. We apply our approach to two elementary movements, i.e., Ball-in-a-Cup and Ball-Paddling, which can be learned on a real Barrett WAM robot arm at a pace similar to human learning.

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
From Motor Learning to Interaction Learning in Robots

Sigaud, O., Peters, J.

In Proceedings of 7ème Journées Nationales de la Recherche en Robotique, pages: 189-195, JNRR, November 2009 (inproceedings)

Abstract
The number of advanced robot systems has been increasing in recent years yielding a large variety of versatile designs with many degrees of freedom. These robots have the potential of being applicable in uncertain tasks outside well-structured industrial settings. However, the complexity of both systems and tasks is often beyond the reach of classical robot programming methods. As a result, a more autonomous solution for robot task acquisition is needed where robots adaptively adjust their behaviour to the encountered situations and required tasks. Learning approaches pose one of the most appealing ways to achieve this goal. However, while learning approaches are of high importance for robotics, we cannot simply use off-the-shelf methods from the machine learning community as these usually do not scale into the domains of robotics due to excessive computational cost as well as a lack of scalability. Instead, domain appropriate approaches are needed. We focus here on several core domains of robot learning. For accurate task execution, we need motor learning capabilities. For fast learning of the motor tasks, imitation learning offers the most promising approach. Self improvement requires reinforcement learning approaches that scale into the domain of complex robots. Finally, for efficient interaction of humans with robot systems, we will need a form of interaction learning. This contribution provides a general introduction to these issues and briefly presents the contributions of the related book chapters to the corresponding research topics.

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
A note on ethical aspects of BCI

Haselager, P., Vlek, R., Hill, J., Nijboer, F.

Neural Networks, 22(9):1352-1357, November 2009 (article)

Abstract
This paper focuses on ethical aspects of BCI, as a research and a clinical tool, that are challenging for practitioners currently working in the field. Specifically, the difficulties involved in acquiring informed consent from locked-in patients are investigated, in combination with an analysis of the shared moral responsibility in BCI teams, and the complications encountered in establishing effective communication with media.

ei

Web DOI [BibTex]

Web DOI [BibTex]


no image
Model Learning with Local Gaussian Process Regression

Nguyen-Tuong, D., Seeger, M., Peters, J.

Advanced Robotics, 23(15):2015-2034, November 2009 (article)

Abstract
Precise models of robot inverse dynamics allow the design of significantly more accurate, energy-efficient and compliant robot control. However, in some cases the accuracy of rigid-body models does not suffice for sound control performance due to unmodeled nonlinearities arising from hydraulic cable dynamics, complex friction or actuator dynamics. In such cases, estimating the inverse dynamics model from measured data poses an interesting alternative. Nonparametric regression methods, such as Gaussian process regression (GPR) or locally weighted projection regression (LWPR), are not as restrictive as parametric models and, thus, offer a more flexible framework for approximating unknown nonlinearities. In this paper, we propose a local approximation to the standard GPR, called local GPR (LGP), for real-time model online learning by combining the strengths of both regression methods, i.e., the high accuracy of GPR and the fast speed of LWPR. The approach is shown to have competitive learning performance for hig h-dimensional data while being sufficiently fast for real-time learning. The effectiveness of LGP is exhibited by a comparison with the state-of-the-art regression techniques, such as GPR, LWPR and ν-support vector regression. The applicability of the proposed LGP method is demonstrated by real-time online learning of the inverse dynamics model for robot model-based control on a Barrett WAM robot arm.

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
Event-Related Potentials in Brain-Computer Interfacing

Hill, NJ.

Invited lecture on the bachelor & masters course "Introduction to Brain-Computer Interfacing", October 2009 (talk)

Abstract
An introduction to event-related potentials with specific reference to their use in brain-computer interfacing applications and research.

ei

PDF [BibTex]

PDF [BibTex]


no image
BCI2000 and Python

Hill, NJ.

Invited lecture at the 5th International BCI2000 Workshop, October 2009 (talk)

Abstract
A tutorial, with exercises, on how to integrate your own Python code with the BCI2000 software package.

ei

PDF [BibTex]

PDF [BibTex]


no image
Implementing a Signal Processing Filter in BCI2000 Using C++

Hill, NJ., Mellinger, J.

Invited lecture at the 5th International BCI2000 Workshop, October 2009 (talk)

Abstract
This tutorial shows how the functionality of the BCI2000 software package can be extended with one‘s own code, using BCI2000‘s C++ API.

ei

PDF [BibTex]

PDF [BibTex]


no image
Detecting Objects in Large Image Collections and Videos by Efficient Subimage Retrieval

Lampert, CH.

In ICCV 2009, pages: 987-994, IEEE Computer Society, Piscataway, NJ, USA, Twelfth IEEE International Conference on Computer Vision, October 2009 (inproceedings)

Abstract
We study the task of detecting the occurrence of objects in large image collections or in videos, a problem that combines aspects of content based image retrieval and object localization. While most previous approaches are either limited to special kinds of queries, or do not scale to large image sets, we propose a new method, efficient subimage retrieval (ESR), which is at the same time very flexible and very efficient. Relying on a two-layered branch-and-bound setup, ESR performs object-based image retrieval in sets of 100,000 or more images within seconds. An extensive evaluation on several datasets shows that ESR is not only very fast, but it also achieves detection accuracies that are on par with or superior to previously published methods for object-based image retrieval.

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]