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

Güleser Kalayci Demir

dblp:15/3965 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2017
0000-0003-3808-5305ORCID · reported

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

Artificial intelligence and machine learning · 4 · 3 first-authorSystems, architecture and hardware · 2 · 1 first-authorApplied, 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
1 paper
Robot navigation and mapping · 50% Motion planning and robot control · 50%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › locomotion control
gait adaptation
0.012004
Terrain Classification through Weakly-structured Vehicle/terrain Interaction · ICRA 2004
Robotics › Robot navigation and mapping
terrain classification
0.012004
Terrain Classification through Weakly-structured Vehicle/terrain Interaction · ICRA 2004

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

visual servoing · 0.0hidden markov model · 0.0discriminant analysis · 0.0
YearPublicationVenuePosition
2017 A Spectral Graph Theoretical Approach to Oriented Energy Features
abstract
In this work, we propose a novel method for determining oriented energy features of an image. Oriented energy features, useful for many machine vision applications like contour detection, texture segmentation and motion analysis, are determined from the filters whose outputs are enhanced at the edges of the image at a given orientation. We use the eigenvectors and eigenvalues of graph Laplacian for determining the oriented energy features of an image. Our method is based on spectral graph theoretical approach in which a graph is assigned complex-valued edge weights whose phases encode orientation information. These edge weights give rise to a complex-valued Hermitian Laplacian whose spectrum enables us to extract oriented energy features of the image. We perform a set of numerical experiments to determine the efficiency and characteristics of the proposed method. In addition, we apply our feature extraction method to texture segmentation problem. We do this in comparison with other known methods, and show that our method performs better for various test textures.
Güleser Kalayci Demir
Int. J. Pattern Recognit. Artif. Intell.1
2005 Online local learning algorithms for linear discriminant analysis
Güleser Kalayci Demir, Kemal Ozmehmet
Pattern Recognit. Lett.1
2004 Terrain Classification through Weakly-structured Vehicle/terrain Interaction
abstract
We present a new terrain classification technique both for effective, autonomous locomotion over natural, unknown terrains and for the qualitative analysis of terrains for exploration and mapping. Our straight-forward approach requires a single camera with little processing of visual information. Specifically, we derived a gait bounce measure from visual servoing errors that result from vehicle-terrain interactions during normal locomotion. Characteristics of the terrain, such as roughness and compliance, manifest themselves in the spatial patterns of this signal and can be extracted using pattern classification techniques. For legged robots, different limb-terrain interactions generate gait bounce signals with different information content, thus deliberate limb motions can effect higher information content (i.e. the robot is an active sensor of terrain class). Segmentation of the gait cycle based on the limb-terrain interaction isolates portions of the gait bounce signal with high information content. The decoding of, then sequencing of, this content from each cycle segment yields a robust classification of terrain type from known benchmarks. To extract this spatio-temporal pattern of the gait bounce signal, we developed a meta-classifier using discriminant analysis and hidden Markov model. We present the gait bounce derivation. We demonstrate the viability of terrain classification for legged vehicles using gait bounce with a rigorous study of more than 700 trials, obtaining 84% accuracy. We describe how terrain classification can be used for gait adaptation, particularly in relation to an efficiency metric. We also demonstrate that our technique is generally applicable to other locomotion mechanisms such as wheels and treads.
Amy C. Larson, Richard M. Voyles, Güleser Kalayci Demir
ICRA3
2004 Motion estimation with cooperatively working multiple robots
abstract
We have investigated the performance of simultaneously estimating the 3D motion and structure for navigation when the scale information is obtained by utilizing the cooperative efforts of multiple robots. The method determines the relative positions of robots by tracking a specific geometric feature that is part of their structure, and then uses the extended Kalman filter to estimate the motion and structure. For implementation we used two CRAWLER Scouts, and performed several experiments to explore the effects of cooperative running of robots on the motion estimation.
Güleser Kalayci Demir, Richard M. Voyles, Amy C. Larson
IROS1
2003 Risk and user preferences in winner determination
abstract
We discuss a solution to the winner determination problem which takes into account not only costs but also risk aversion of the agent that accepts the bids and works for tasks that have time and precedence constraints. We develop an equivalent unit approach to the group of tasks to analyze the system and use Expected Utility Theory as the basic mechanism for decision-making. Our theoretical and experimental analysis shows that Expected Utility is especially useful for choosing between cheap-but-risky and costly-but-safe bids. Moreover, we show how bids with similar costs and similar probabilities of being successfully completed but different time windows can be efficiently selected or rejected.
Güleser Kalayci Demir, Maria L. Gini
ICEC1