Header logo is


2013


no image
Erratum: Generalized Gilbert equation including inertial damping: Derivation from an extended breathing Fermi surface model [Phys. Rev. B 84, 172403 (2011)]

Fähnle, M., Steiauf, D., Illg, C.

{Physical Review B}, 88, American Physical Society, Woodbury, NY, 2013 (article)

mms

DOI [BibTex]

2013


DOI [BibTex]


no image
Strain and composition dependence of orbital polarization in nickel oxide superlattices

Wu, M., Benckiser, E., Haverkort, M. W., Franco, A., Lu, J., Nwankwo, U., Brück, S., Audehm, P., Goering, E., Macke, S., Hinkov, V., Wochner, P., Christiani, G., Heinze, S., Logvenov, G., Habermeier, H., Keimer, B.

{Physical Review B}, 88, Published by the American Physical Society through the American Institute of Physics, Woodbury, NY, 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Efficient focusing of 8 keV X-rays with multilayer Fresnel zone plates fabricated by atomic layer deposition and focused ion beam milling

Mayer, M., Keskinbora, K., Grévent, C., Szeghalmi, A., Knez, M., Weigand, M., Snigirev, A., Snigereva, I., Schütz, G.

{Journal of Synchrotron Radiation}, 20, pages: 433-440, Published for the International Union of Crystallography by Munksgaard, Copenhagen, Denmark, 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Rapid prototyping of Fresnel zone plates via direct Ga+ ion beam lithography for high-resolution x-ray imaging

Keskinbora, K., Grévent, C., Eigenthaler, U., Weigand, M., Schütz, G.

{ACS Nano}, 7(11):9788-9797, American Chemical Society, Washington, DC, 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Eine kryoflexible kovalente organische Gerüststruktur für die effiziente Trennung von Wasserstoffisotopien durch Quantensieben

Oh, H., Kalidindi, S. B., Um, Y., Bureekaew, S., Schmid, R., Fischer, R. A., Hirscher, M.

{Angewandte Chemie}, 125(50):13461-13464, Wiley-VCH Verl., Weinheim, 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Ultrafast demagnetization after laser irradiation in transition metals: Ab initio calculations of the spin-flip electron-phonon scattering with reduced exchange splitting

Illg, C., Haag, M., Fähnle, M.

{Physical Review B}, 88, American Physical Society, Woodbury, NY, 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Phase diagram for magnetic vortex core switching studied by ferromagnetic absorption spectroscopy and time-resolved transmission x-ray microscopy

Martens, M., Kamionka, T., Weigand, M., Stoll, H., Tyliszczak, T., Meier, G.

{Physical Review B}, 87, Published by the American Physical Society through the American Institute of Physics, Woodbury, NY, 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Optimal distribution of contact forces with inverse-dynamics control

Righetti, L., Buchli, J., Mistry, M., Kalakrishnan, M., Schaal, S.

The International Journal of Robotics Research, 32(3):280-298, March 2013 (article)

Abstract
The development of legged robots for complex environments requires controllers that guarantee both high tracking performance and compliance with the environment. More specifically the control of the contact interaction with the environment is of crucial importance to ensure stable, robust and safe motions. In this contribution we develop an inverse-dynamics controller for floating-base robots under contact constraints that can minimize any combination of linear and quadratic costs in the contact constraints and the commands. Our main result is the exact analytical derivation of the controller. Such a result is particularly relevant for legged robots as it allows us to use torque redundancy to directly optimize contact interactions. For example, given a desired locomotion behavior, we can guarantee the minimization of contact forces to reduce slipping on difficult terrains while ensuring high tracking performance of the desired motion. The main advantages of the controller are its simplicity, computational efficiency and robustness to model inaccuracies. We present detailed experimental results on simulated humanoid and quadruped robots as well as a real quadruped robot. The experiments demonstrate that the controller can greatly improve the robustness of locomotion of the robots.1

am mg

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
Thermodynamics as a theory of decision-making with information-processing costs

Ortega, PA, Braun, DA

Proceedings of the Royal Society of London A, 469(2153):1-18, May 2013 (article)

Abstract
Perfectly rational decision-makers maximize expected utility, but crucially ignore the resource costs incurred when determining optimal actions. Here, we propose a thermodynamically inspired formalization of bounded rational decision-making where information processing is modelled as state changes in thermodynamic systems that can be quantified by differences in free energy. By optimizing a free energy, bounded rational decision-makers trade off expected utility gains and information-processing costs measured by the relative entropy. As a result, the bounded rational decision-making problem can be rephrased in terms of well-known variational principles from statistical physics. In the limit when computational costs are ignored, the maximum expected utility principle is recovered. We discuss links to existing decision-making frameworks and applications to human decision-making experiments that are at odds with expected utility theory. Since most of the mathematical machinery can be borrowed from statistical physics, the main contribution is to re-interpret the formalism of thermodynamic free-energy differences in terms of bounded rational decision-making and to discuss its relationship to human decision-making experiments.

ei

DOI [BibTex]

DOI [BibTex]


no image
Tank-like module-based climbing robot using passive compliant joints

Seo, T., Sitti, M.

IEEE/ASME Transactions on Mechatronics, 18(1):397-408, 2013 (article)

pi

[BibTex]

[BibTex]


no image
Enhanced fabrication and characterization of gecko-inspired mushroom-tipped microfiber adhesives

Song, J., Mengüç, Y., Sitti, M.

Journal of Adhesion Science and Technology, 27(17):1921-1932, Routledge, 2013 (article)

pi

Project Page [BibTex]

Project Page [BibTex]


no image
Linear combination of one-step predictive information with an external reward in an episodic policy gradient setting: a critical analysis

Zahedi, K., Martius, G., Ay, N.

Frontiers in Psychology, 4(801), 2013 (article)

Abstract
One of the main challenges in the field of embodied artificial intelligence is the open-ended autonomous learning of complex behaviours. Our approach is to use task-independent, information-driven intrinsic motivation(s) to support task-dependent learning. The work presented here is a preliminary step in which we investigate the predictive information (the mutual information of the past and future of the sensor stream) as an intrinsic drive, ideally supporting any kind of task acquisition. Previous experiments have shown that the predictive information (PI) is a good candidate to support autonomous, open-ended learning of complex behaviours, because a maximisation of the PI corresponds to an exploration of morphology- and environment-dependent behavioural regularities. The idea is that these regularities can then be exploited in order to solve any given task. Three different experiments are presented and their results lead to the conclusion that the linear combination of the one-step PI with an external reward function is not generally recommended in an episodic policy gradient setting. Only for hard tasks a great speed-up can be achieved at the cost of an asymptotic performance lost.

al

link (url) DOI [BibTex]


no image
Switching modes in easy and hard axis magnetic reversal in a self-assembled antidot array

Haering, F., Wiedwald, U., Nothelfer, S., Koslowski, B., Ziemann, P., Lechner, L., Wallucks, A., Lebecki, K., Nowak, U., Gräfe, J., Goering, E., Schütz, G.

{Nanotechnology}, 24, IOP Pub., Bristol, UK, 2013 (article)

mms

DOI Project Page [BibTex]

DOI Project Page [BibTex]


no image
Time-resolved imaging of nonlinear magnetic domain-wall dynamics in ferromagnetic nanowires

Stein, F.-U., Bocklage, L., Weigand, M., Meier, G.

{Scientific Reports}, 3, Nature Publishing Group, London, UK, 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
A cryogenically flexible covalent organic framework for efficient hydrogen isotrope separation by quantum sieving

Oh, H., Kalidindi, S. B., Um, Y., Bureekaew, S., Schmid, R., Fischer, R. A., Hirscher, M.

{Angewandte Chemie International Edition in English}, 52(50):13219-13222, Wiley-VCH Verlag GmbH & Co. KGaA, D-69451 Weinheim, 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Unexpected room-temperature ferromagnetism in bulk ZnO

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

{Applied Physics Letters}, (103), American Institute of Physics, Melville, NY, 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Large-area hard magnetic L10-FePt and composite L10-FePt based nanopatterns

Goll, D., Bublat, T.

{Physica Status Solidi A-Applications and Materials Science}, 210(7):1261-1271, Wiley-VCH, Weinheim, 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Wave modes of collective vortex gyration in dipolar-coupled-dot-array magnonic crystals

Han, D., Vogel, A., Jung, H., Lee, K., Weigand, M., Stoll, H., Schütz, G., Fischer, P., Meier, G., Kim, S.

{Scientific Reports}, 3, Nature Publishing Group, London, UK, 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


Thumb xl houghforest
Class-Specific Hough Forests for Object Detection

Gall, J., Lempitsky, V.

In Decision Forests for Computer Vision and Medical Image Analysis, pages: 143-157, 11, (Editors: Criminisi, A. and Shotton, J.), Springer, 2013 (incollection)

ps

code Project Page [BibTex]

code Project Page [BibTex]


no image
Micro-scale mobile robotics

Diller, E., Sitti, M.

Foundations and Trends in Robotics, 2(3):143-259, Now Publishers Incorporated, 2013 (article)

pi

[BibTex]

[BibTex]


no image
Survey and Introduction to the Focused Section on Bio-Inspired Mechatronics

Sitti, M., Menciassi, A., Ijspeert, A., Low, K. H., Kim, S.

Mechatronics, IEEE/ASME Transactions on, 18(2):409-418, DOI: 10.1109/TMECH.2012. 2233492, 2013 (article)

pi

[BibTex]

[BibTex]


no image
Robustness of guided self-organization against sensorimotor disruptions

Martius, G.

Advances in Complex Systems, 16(02n03):1350001, 2013 (article)

Abstract
Self-organizing processes are crucial for the development of living beings. Practical applications in robots may benefit from the self-organization of behavior, e.g.~to increase fault tolerance and enhance flexibility, provided that external goals can also be achieved. We present results on the guidance of self-organizing control by visual target stimuli and show a remarkable robustness to sensorimotor disruptions. In a proof of concept study an autonomous wheeled robot is learning an object finding and ball-pushing task from scratch within a few minutes in continuous domains. The robustness is demonstrated by the rapid recovery of the performance after severe changes of the sensor configuration.

al

DOI [BibTex]

DOI [BibTex]


no image
Controlled Reduction with Unactuated Cyclic Variables: Application to 3D Bipedal Walking with Passive Yaw Rotation

Gregg, R., Righetti, L.

IEEE Transactions on Automatic Control, 58(10):2679-2685, October 2013 (article)

Abstract
This technical note shows that viscous damping can shape momentum conservation laws in a manner that stabilizes yaw rotation and enables steering for underactuated 3D walking. We first show that unactuated cyclic variables can be controlled by passively shaped conservation laws given a stabilizing controller in the actuated coordinates. We then exploit this result to realize controlled geometric reduction with multiple unactuated cyclic variables. We apply this underactuated control strategy to a five-link 3D biped to produce exponentially stable straight-ahead walking and steering in the presence of passive yawing.

mg

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
Ferromagnetism of zinc oxide nanograined films

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

{Journal of Experimental and Theoretical Physics Letters}, 97(6):367-377, Pleiades Publishing, Inc., 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Hydrogen adsorption properties of platinum decorated hierarchically structured templated carbons

Oh, H., Gennett, T., Atanassov, P., Kurttepeli, M., Bals, S., Hurst, K. E., Hirscher, M.

{Microporous and Mesoporous Materials}, pages: 66-74, Elsevier, Amsterdam, 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Extended s-d models for the dynamics of noncollinear magnetization: Short review of two different approaches

Fähnle, M., Zhang, S.

{Journal of Magnetism and Magnetic Materials}, 326, pages: 232-234, NH, Elsevier, Amsterdam, 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Correlation between spin structure oscillations and domain wall velocities

Bisig, A., Stärk, M., Mawass, M., Moutafis, C., Rhensius, J., Heidler, J., Büttner, F., Noske, M., Weigand, M., Eisebitt, S., Tyliszczak, T., Van Wayenberge, B., Stoll, H., Schütz, G., Kläui, M.

{Nature Communications}, 4, Nature Publishing Group, London, 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Recent advances in use of atomic layer deposition and focused ion beams for fabrication of Fresnel zone plates for hard x-rays

Keskinbora, K., Robisch, A., Mayer, M., Grévent, C., Szeghalmi, A. V., Knez, M., Weigand, M., Snigireva, I., Snigirev, A., Salditt, T., Schütz, G.

{Proceedings of SPIE (The International Society for Optical Engineering)}, 8851, 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Magnetic states in low-pinning high-anisotropy material nanostructures suitable for dynamic imaging

Büttner, F., Moutafis, C., Bisig, A., Wohlhüter, P., Günther, C. M., Mohanty, J., Geilhufe, J., Schneider, M., v. Korff Schmising, C., Schaffert, S., Pfau, B., Hantschmann, M., Riemeier, M., Emmel, M., Finizio, S., Jakob, G., Weigand, M., Rhensius, J., Franken, J. H., Lavrijsen, R., Swagten, H. J. M., Stoll, H., Eisebitt, S., Kläui, M.

{Physical Review B}, 87, Published by the American Physical Society through the American Institute of Physics, Woodbury, NY, 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


no image
Experimental and theoretical study of D2/H2 quantum sieving in a carbon molecular sieve

Gotzias, A., Charalambopoulou, G., Ampoumogli, A., Krkljus, I., Hirscher, M., Steriotis, T.

{Adsorption}, 19(2-4):373-379, Springer Science+Business Media, New York, 2013 (article)

mms

DOI [BibTex]

DOI [BibTex]


Thumb xl 2013 ivc rkek teaser
Non-parametric hand pose estimation with object context

Romero, J., Kjellström, H., Ek, C. H., Kragic, D.

Image and Vision Computing , 31(8):555 - 564, 2013 (article)

Abstract
In the spirit of recent work on contextual recognition and estimation, we present a method for estimating the pose of human hands, employing information about the shape of the object in the hand. Despite the fact that most applications of human hand tracking involve grasping and manipulation of objects, the majority of methods in the literature assume a free hand, isolated from the surrounding environment. Occlusion of the hand from grasped objects does in fact often pose a severe challenge to the estimation of hand pose. In the presented method, object occlusion is not only compensated for, it contributes to the pose estimation in a contextual fashion; this without an explicit model of object shape. Our hand tracking method is non-parametric, performing a nearest neighbor search in a large database (.. entries) of hand poses with and without grasped objects. The system that operates in real time, is robust to self occlusions, object occlusions and segmentation errors, and provides full hand pose reconstruction from monocular video. Temporal consistency in hand pose is taken into account, without explicitly tracking the hand in the high-dim pose space. Experiments show the non-parametric method to outperform other state of the art regression methods, while operating at a significantly lower computational cost than comparable model-based hand tracking methods.

ps

Publisher site pdf link (url) [BibTex]

Publisher site pdf link (url) [BibTex]

2005


no image
Kernel Methods for Measuring Independence

Gretton, A., Herbrich, R., Smola, A., Bousquet, O., Schölkopf, B.

Journal of Machine Learning Research, 6, pages: 2075-2129, December 2005 (article)

Abstract
We introduce two new functionals, the constrained covariance and the kernel mutual information, to measure the degree of independence of random variables. These quantities are both based on the covariance between functions of the random variables in reproducing kernel Hilbert spaces (RKHSs). We prove that when the RKHSs are universal, both functionals are zero if and only if the random variables are pairwise independent. We also show that the kernel mutual information is an upper bound near independence on the Parzen window estimate of the mutual information. Analogous results apply for two correlation-based dependence functionals introduced earlier: we show the kernel canonical correlation and the kernel generalised variance to be independence measures for universal kernels, and prove the latter to be an upper bound on the mutual information near independence. The performance of the kernel dependence functionals in measuring independence is verified in the context of independent component analysis.

ei

PDF PostScript PDF [BibTex]

2005


PDF PostScript PDF [BibTex]


no image
A Unifying View of Sparse Approximate Gaussian Process Regression

Quinonero Candela, J., Rasmussen, C.

Journal of Machine Learning Research, 6, pages: 1935-1959, December 2005 (article)

Abstract
We provide a new unifying view, including all existing proper probabilistic sparse approximations for Gaussian process regression. Our approach relies on expressing the effective prior which the methods are using. This allows new insights to be gained, and highlights the relationship between existing methods. It also allows for a clear theoretically justified ranking of the closeness of the known approximations to the corresponding full GPs. Finally we point directly to designs of new better sparse approximations, combining the best of the existing strategies, within attractive computational constraints.

ei

PDF [BibTex]

PDF [BibTex]


no image
Maximal Margin Classification for Metric Spaces

Hein, M., Bousquet, O., Schölkopf, B.

Journal of Computer and System Sciences, 71(3):333-359, October 2005 (article)

Abstract
In order to apply the maximum margin method in arbitrary metric spaces, we suggest to embed the metric space into a Banach or Hilbert space and to perform linear classification in this space. We propose several embeddings and recall that an isometric embedding in a Banach space is always possible while an isometric embedding in a Hilbert space is only possible for certain metric spaces. As a result, we obtain a general maximum margin classification algorithm for arbitrary metric spaces (whose solution is approximated by an algorithm of Graepel. Interestingly enough, the embedding approach, when applied to a metric which can be embedded into a Hilbert space, yields the SVM algorithm, which emphasizes the fact that its solution depends on the metric and not on the kernel. Furthermore we give upper bounds of the capacity of the function classes corresponding to both embeddings in terms of Rademacher averages. Finally we compare the capacities of these function classes directly.

ei

PDF PDF DOI [BibTex]

PDF PDF DOI [BibTex]


no image
Selective integration of multiple biological data for supervised network inference

Kato, T., Tsuda, K., Asai, K.

Bioinformatics, 21(10):2488 , October 2005 (article)

ei

PDF [BibTex]

PDF [BibTex]


no image
Assessing Approximate Inference for Binary Gaussian Process Classification

Kuss, M., Rasmussen, C.

Journal of Machine Learning Research, 6, pages: 1679 , October 2005 (article)

Abstract
Gaussian process priors can be used to define flexible, probabilistic classification models. Unfortunately exact Bayesian inference is analytically intractable and various approximation techniques have been proposed. In this work we review and compare Laplace‘s method and Expectation Propagation for approximate Bayesian inference in the binary Gaussian process classification model. We present a comprehensive comparison of the approximations, their predictive performance and marginal likelihood estimates to results obtained by MCMC sampling. We explain theoretically and corroborate empirically the advantages of Expectation Propagation compared to Laplace‘s method.

ei

PDF PDF [BibTex]

PDF PDF [BibTex]


no image
Clustering on the Unit Hypersphere using von Mises-Fisher Distributions

Banerjee, A., Dhillon, I., Ghosh, J., Sra, S.

Journal of Machine Learning Research, 6, pages: 1345-1382, September 2005 (article)

Abstract
Several large scale data mining applications, such as text categorization and gene expression analysis, involve high-dimensional data that is also inherently directional in nature. Often such data is L2 normalized so that it lies on the surface of a unit hypersphere. Popular models such as (mixtures of) multi-variate Gaussians are inadequate for characterizing such data. This paper proposes a generative mixture-model approach to clustering directional data based on the von Mises-Fisher (vMF) distribution, which arises naturally for data distributed on the unit hypersphere. In particular, we derive and analyze two variants of the Expectation Maximization (EM) framework for estimating the mean and concentration parameters of this mixture. Numerical estimation of the concentration parameters is non-trivial in high dimensions since it involves functional inversion of ratios of Bessel functions. We also formulate two clustering algorithms corresponding to the variants of EM that we derive. Our approach provides a theoretical basis for the use of cosine similarity that has been widely employed by the information retrieval community, and obtains the spherical kmeans algorithm (kmeans with cosine similarity) as a special case of both variants. Empirical results on clustering of high-dimensional text and gene-expression data based on a mixture of vMF distributions show that the ability to estimate the concentration parameter for each vMF component, which is not present in existing approaches, yields superior results, especially for difficult clustering tasks in high-dimensional spaces.

ei

PDF [BibTex]

PDF [BibTex]


no image
Support Vector Machines for 3D Shape Processing

Steinke, F., Schölkopf, B., Blanz, V.

Computer Graphics Forum, 24(3, EUROGRAPHICS 2005):285-294, September 2005 (article)

Abstract
We propose statistical learning methods for approximating implicit surfaces and computing dense 3D deformation fields. Our approach is based on Support Vector (SV) Machines, which are state of the art in machine learning. It is straightforward to implement and computationally competitive; its parameters can be automatically set using standard machine learning methods. The surface approximation is based on a modified Support Vector regression. We present applications to 3D head reconstruction, including automatic removal of outliers and hole filling. In a second step, we build on our SV representation to compute dense 3D deformation fields between two objects. The fields are computed using a generalized SVMachine enforcing correspondence between the previously learned implicit SV object representations, as well as correspondences between feature points if such points are available. We apply the method to the morphing of 3D heads and other objects.

ei

PDF [BibTex]

PDF [BibTex]


no image
Fast Protein Classification with Multiple Networks

Tsuda, K., Shin, H., Schölkopf, B.

Bioinformatics, 21(Suppl. 2):59-65, September 2005 (article)

Abstract
Support vector machines (SVM) have been successfully used to classify proteins into functional categories. Recently, to integrate multiple data sources, a semidefinite programming (SDP) based SVM method was introduced Lanckriet et al (2004). In SDP/SVM, multiple kernel matrices corresponding to each of data sources are combined with weights obtained by solving an SDP. However, when trying to apply SDP/SVM to large problems, the computational cost can become prohibitive, since both converting the data to a kernel matrix for the SVM and solving the SDP are time and memory demanding. Another application-specific drawback arises when some of the data sources are protein networks. A common method of converting the network to a kernel matrix is the diffusion kernel method, which has time complexity of O(n^3), and produces a dense matrix of size n x n. We propose an efficient method of protein classification using multiple protein networks. Available protein networks, such as a physical interaction network or a metabolic network, can be directly incorporated. Vectorial data can also be incorporated after conversion into a network by means of neighbor point connection. Similarly to the SDP/SVM method, the combination weights are obtained by convex optimization. Due to the sparsity of network edges, the computation time is nearly linear in the number of edges of the combined network. Additionally, the combination weights provide information useful for discarding noisy or irrelevant networks. Experiments on function prediction of 3588 yeast proteins show promising results: the computation time is enormously reduced, while the accuracy is still comparable to the SDP/SVM method.

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
Iterative Kernel Principal Component Analysis for Image Modeling

Kim, K., Franz, M., Schölkopf, B.

IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(9):1351-1366, September 2005 (article)

Abstract
In recent years, Kernel Principal Component Analysis (KPCA) has been suggested for various image processing tasks requiring an image model such as, e.g., denoising or compression. The original form of KPCA, however, can be only applied to strongly restricted image classes due to the limited number of training examples that can be processed. We therefore propose a new iterative method for performing KPCA, the Kernel Hebbian Algorithm which iteratively estimates the Kernel Principal Components with only linear order memory complexity. In our experiments, we compute models for complex image classes such as faces and natural images which require a large number of training examples. The resulting image models are tested in single-frame super-resolution and denoising applications. The KPCA model is not specifically tailored to these tasks; in fact, the same model can be used in super-resolution with variable input resolution, or denoising with unknown noise characteristics. In spite of this, both super-resolution a nd denoising performance are comparable to existing methods.

ei

Web DOI [BibTex]

Web DOI [BibTex]


no image
Phenotypic characterization of chondrosarcoma-derived cell lines

Schorle, C., Finger, F., Zien, A., Block, J., Gebhard, P., Aigner, T.

Cancer Letters, 226(2):143-154, August 2005 (article)

Abstract
Gene expression profiling of three chondrosarcoma derived cell lines (AD, SM, 105KC) showed an increased proliferative activity and a reduced expression of chondrocytic-typical matrix products compared to primary chondrocytes. The incapability to maintain an adequate matrix synthesis as well as a notable proliferative activity at the same time is comparable to neoplastic chondrosarcoma cells in vivo which cease largely cartilage matrix formation as soon as their proliferative activity increases. Thus, the investigated cell lines are of limited value as substitute of primary chondrocytes but might have a much higher potential to investigate the behavior of neoplastic chondrocytes, i.e. chondrosarcoma biology.

ei

Web [BibTex]

Web [BibTex]


no image
Local Rademacher Complexities

Bartlett, P., Bousquet, O., Mendelson, S.

The Annals of Statistics, 33(4):1497-1537, August 2005 (article)

Abstract
We propose new bounds on the error of learning algorithms in terms of a data-dependent notion of complexity. The estimates we establish give optimal rates and are based on a local and empirical version of Rademacher averages, in the sense that the Rademacher averages are computed from the data, on a subset of functions with small empirical error. We present some applications to classification and prediction with convex function classes, and with kernel classes in particular.

ei

PDF PostScript Web [BibTex]

PDF PostScript Web [BibTex]


no image
Learning the Kernel with Hyperkernels

Ong, CS., Smola, A., Williamson, R.

Journal of Machine Learning Research, 6, pages: 1043-1071, July 2005 (article)

Abstract
This paper addresses the problem of choosing a kernel suitable for estimation with a Support Vector Machine, hence further automating machine learning. This goal is achieved by defining a Reproducing Kernel Hilbert Space on the space of kernels itself. Such a formulation leads to a statistical estimation problem similar to the problem of minimizing a regularized risk functional. We state the equivalent representer theorem for the choice of kernels and present a semidefinite programming formulation of the resulting optimization problem. Several recipes for constructing hyperkernels are provided, as well as the details of common machine learning problems. Experimental results for classification, regression and novelty detection on UCI data show the feasibility of our approach.

ei

PDF [BibTex]

PDF [BibTex]


no image
Image Reconstruction by Linear Programming

Tsuda, K., Rätsch, G.

IEEE Transactions on Image Processing, 14(6):737-744, June 2005 (article)

Abstract
One way of image denoising is to project a noisy image to the subspace of admissible images derived, for instance, by PCA. However, a major drawback of this method is that all pixels are updated by the projection, even when only a few pixels are corrupted by noise or occlusion. We propose a new method to identify the noisy pixels by l1-norm penalization and to update the identified pixels only. The identification and updating of noisy pixels are formulated as one linear program which can be efficiently solved. In particular, one can apply the upsilon trick to directly specify the fraction of pixels to be reconstructed. Moreover, we extend the linear program to be able to exploit prior knowledge that occlusions often appear in contiguous blocks (e.g., sunglasses on faces). The basic idea is to penalize boundary points and interior points of the occluded area differently. We are also able to show the upsilon property for this extended LP leading to a method which is easy to use. Experimental results demonstrate the power of our approach.

ei

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
RASE: recognition of alternatively spliced exons in C.elegans

Rätsch, G., Sonnenburg, S., Schölkopf, B.

Bioinformatics, 21(Suppl. 1):i369-i377, June 2005 (article)

ei

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
Matrix Exponentiated Gradient Updates for On-line Learning and Bregman Projection

Tsuda, K., Rätsch, G., Warmuth, M.

Journal of Machine Learning Research, 6, pages: 995-1018, June 2005 (article)

Abstract
We address the problem of learning a symmetric positive definite matrix. The central issue is to design parameter updates that preserve positive definiteness. Our updates are motivated with the von Neumann divergence. Rather than treating the most general case, we focus on two key applications that exemplify our methods: on-line learning with a simple square loss, and finding a symmetric positive definite matrix subject to linear constraints. The updates generalize the exponentiated gradient (EG) update and AdaBoost, respectively: the parameter is now a symmetric positive definite matrix of trace one instead of a probability vector (which in this context is a diagonal positive definite matrix with trace one). The generalized updates use matrix logarithms and exponentials to preserve positive definiteness. Most importantly, we show how the derivation and the analyses of the original EG update and AdaBoost generalize to the non-diagonal case. We apply the resulting matrix exponentiated gradient (MEG) update and DefiniteBoost to the problem of learning a kernel matrix from distance measurements.

ei

PDF [BibTex]

PDF [BibTex]


no image
Texture and haptic cues in slant discrimination: Reliability-based cue weighting without statistically optimal cue combination

Rosas, P., Wagemans, J., Ernst, M., Wichmann, F.

Journal of the Optical Society of America A, 22(5):801-809, May 2005 (article)

Abstract
A number of models of depth cue combination suggest that the final depth percept results from a weighted average of independent depth estimates based on the different cues available. The weight of each cue in such an average is thought to depend on the reliability of each cue. In principle, such a depth estimation could be statistically optimal in the sense of producing the minimum variance unbiased estimator that can be constructed from the available information. Here we test such models using visual and haptic depth information. Different texture types produce differences in slant discrimination performance, providing a means for testing a reliability-sensitive cue combination model using texture as one of the cues to slant. Our results show that the weights for the cues were generally sensitive to their reliability, but fell short of statistically optimal combination—we find reliability-based re-weighting, but not statistically optimal cue combination.

ei

PDF Web [BibTex]

PDF Web [BibTex]


no image
Bayesian inference for psychometric functions

Kuss, M., Jäkel, F., Wichmann, F.

Journal of Vision, 5(5):478-492, May 2005 (article)

Abstract
In psychophysical studies, the psychometric function is used to model the relation between physical stimulus intensity and the observer’s ability to detect or discriminate between stimuli of different intensities. In this study, we propose the use of Bayesian inference to extract the information contained in experimental data to estimate the parameters of psychometric functions. Because Bayesian inference cannot be performed analytically, we describe how a Markov chain Monte Carlo method can be used to generate samples from the posterior distribution over parameters. These samples are used to estimate Bayesian confidence intervals and other characteristics of the posterior distribution. In addition, we discuss the parameterization of psychometric functions and the role of prior distributions in the analysis. The proposed approach is exemplified using artificially generated data and in a case study for real experimental data. Furthermore, we compare our approach with traditional methods based on maximum likelihood parameter estimation combined with bootstrap techniques for confidence interval estimation and find the Bayesian approach to be superior.

ei

PDF PDF DOI [BibTex]

PDF PDF DOI [BibTex]


no image
A gene expression map of Arabidopsis thaliana development

Schmid, M., Davison, T., Henz, S., Pape, U., Demar, M., Vingron, M., Schölkopf, B., Weigel, D., Lohmann, J.

Nature Genetics, 37(5):501-506, April 2005 (article)

Abstract
Regulatory regions of plant genes tend to be more compact than those of animal genes, but the complement of transcription factors encoded in plant genomes is as large or larger than that found in those of animals. Plants therefore provide an opportunity to study how transcriptional programs control multicellular development. We analyzed global gene expression during development of the reference plant Arabidopsis thaliana in samples covering many stages, from embryogenesis to senescence, and diverse organs. Here, we provide a first analysis of this data set, which is part of the AtGenExpress expression atlas. We observed that the expression levels of transcription factor genes and signal transduction components are similar to those of metabolic genes. Examining the expression patterns of large gene families, we found that they are often more similar than would be expected by chance, indicating that many gene families have been co-opted for specific developmental processes.

ei

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
Experimentally optimal v in support vector regression for different noise models and parameter settings

Chalimourda, A., Schölkopf, B., Smola, A.

Neural Networks, 18(2):205-205, March 2005 (article)

ei

PDF DOI [BibTex]

PDF DOI [BibTex]