Justus Piater

Justus Piater

Auto-generated profile, based on publicly available information

Justus Piater

University of Innsbruck

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2011 in Robotics and Autonomous Systems
Verified
Journal Article
Closed access
NKNorbert Krüger
Norbert Krüger
CGChristopher Geib
Christopher Geib
JPJustus Piater
Justus Piater
RPRonald Petrick
Ronald Petrick
MSMark Steedman
Mark Steedman
RDRüdiger Dillmann
Rüdiger Dillmann

1 September 2010 in Robotics and Autonomous Systems
Verified
Journal Article
Closed access
OKO.B. Kroemer
O.B. Kroemer
RDR. Detry
R. Detry
JPJ. Piater
J. Piater
Jan PetersJan Peters
Jan Peters

27 July 2005
Verified
Conference Paper
Closed access
RMRaphaël Maree
Raphaël Maree
PGP. Geurts
P. Geurts
JPJ. Piater
J. Piater
LWL. Wehenkel
L. Wehenkel
We present a novel, generic image classification method based on a recent machine learning algorithm (ensembles of extremely randomized decision trees). Images are classified using randomly extracted subwindows that are suitably normalized to yield robustness to certain image transformations. Our method is evaluated on four very different, publicly available datasets (COIL-100, ZuBuD,ETH-80, WANG). Our results show that our automatic approach is generic and robust to illumination, scale, and viewpoint changes. An extension of the method is proposed to improve its robustness with respect to rotation changes.

30 August 2018 in IEEE Transactions on Cognitive and Developmental Systems
Verified
Journal Article
Open access
TTTadahiro Taniguchi
Tadahiro Taniguchi
JPJustus Piater
Justus Piater
Florentin WörgötterFlorentin Wörgötter
Florentin Wörgötter
EUEmre Ugur
Emre Ugur
MHMatej Hoffmann
Matej Hoffmann
EOErhan Oztop
Erhan Oztop
Humans use signs, e.g., sentences in a spoken language, for communication and thought. Hence, symbol systems like language are crucial for our communication with other agents and adaptation to our real-world environment. The symbol systems we use in our human society adaptively and dynamically change over time. In the context of artificial intelligence (AI) and cognitive systems, the symbol grounding problem has been regarded as one of the central problems related to symbols. However, the symbol grounding problem was originally posed to connect symbolic AI and sensorimotor information and did not consider many interdisciplinary phenomena in human communication and dynamic symbol systems in our society, which semiotics considered. In this paper, we focus on the symbol emergence problem, addressing not only cognitive dynamics but also the dynamics of symbol systems in society, rather than the symbol grounding problem. We first introduce the notion of a symbol in semiotics from the humanities, to leave the very narrow idea of symbols in symbolic AI. Furthermore, over the years, it became more and more clear that symbol emergence has to be regarded as a multifaceted problem. Therefore, secondly, we review the history of the symbol emergence problem in different fields, including both biological and artificial systems, showing their mutual relations. We summarize the discussion and provide an integrative viewpoint and comprehensive overview of symbol emergence in cognitive systems. Additionally, we describe the challenges facing the creation of cognitive systems that can be part of symbol emergence systems.

3 April 2013 in IEEE Transactions on Autonomous Mental Development
Verified
Journal Article
Closed access
FWFlorentin Worgotter
Florentin Worgotter
EAEren Erdal Aksoy
Eren Erdal Aksoy
NKNorbert Kruger
Norbert Kruger
JPJustus Piater
Justus Piater
AUAleš Ude
Aleš Ude
MTMinija Tamosiunaite
Minija Tamosiunaite
Humans can perform a multitude of different actions with their hands (manipulations). In spite of this, so far there have been only a few attempts to represent manipulation types trying to understand the underlying principles. Here we first discuss how manipulation actions are structured in space and time. For this we use as temporal anchor points those moments where two objects (or hand and object) touch or un-touch each other during a manipulation. We show that by this one can define a relatively small tree-like manipulation ontology. We find less than 30 fundamental manipulations. The temporal anchors also provide us with information about when to pay attention to additional important information, for example when to consider trajectory shapes and relative poses between objects. As a consequence a highly condensed representation emerges by which different manipulations can be recognized and encoded. Examples of manipulations recognition and execution by a robot based on this representation are given at the end of this study.

1 March 2011 in Paladyn
Verified
Journal Article
Open access
RDR. Detry
R. Detry
DKD. Kraft
D. Kraft
OKO. Kroemer
O. Kroemer
LBLeon Bodenhagen
Leon Bodenhagen
Jan PetersJan Peters
Jan Peters
JPJ. Piater
J. Piater
We address the issue of learning and representing object grasp affordance models. We model grasp affordances with continuous probability density functions (grasp densities) which link object-relative grasp poses to their success probability. The underlying function representation is nonparametric and relies on kernel density estimation to provide a continuous model. Grasp densities are learned and refined from exploration, by letting a robot “play” with an object in a sequence of grasp-and-drop actions: the robot uses visual cues to generate a set of grasp hypotheses, which it then executes and records their outcomes. When a satisfactory amount of grasp data is available, an importance-sampling algorithm turns it into a grasp density. We evaluate our method in a largely autonomous learning experiment, run on three objects with distinct shapes. The experiment shows how learning increases success rates. It also measures the success rate of grasps chosen to maximize the probability of success, given reaching constraints.