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

Patrick Mihelich

dblp:70/5679 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

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

Artificial intelligence and machine learning · 2Systems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 1

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
2 papers
Robot navigation and mapping · 46% Robot manipulation · 25% 3D vision · 22%
Human-computer interaction and pervasive computing
1 paper
Collaborative and social computing · 77% Human-AI interaction · 23%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping › mobile robot navigation › indoor navigation
indoor mobile robot navigation
0.112010
Autonomous door opening and plugging in with a personal robot · ICRA 2010
Robotics › Robot manipulation
mobile manipulation
0.112010
Autonomous door opening and plugging in with a personal robot · ICRA 2010
Computer vision › 3D vision
feature description and matching
0.112009
Compact signatures for high-speed interest point description and matching · ICCV 2009
Robotics › Robot navigation and mapping
SLAM
0.112009
Compact signatures for high-speed interest point description and matching · ICCV 2009
Collaborative and social computing
groupware
0.112006
groupTime: preference based group scheduling · CHI 2006
Robotics › Motion planning and robot control › robot control
compliant motion control
0.012010
Autonomous door opening and plugging in with a personal robot · ICRA 2010
Human-AI interaction
intelligent user interfaces
0.012006
groupTime: preference based group scheduling · CHI 2006

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

visual differencing · 0.1vision and laser sensing · 0.1compliant control · 0.1statistical classification · 0.1compressive sensing · 0.1ontology modeling · 0.1machine learning · 0.1
YearPublicationVenuePosition
2010 Autonomous door opening and plugging in with a personal robot
abstract
We describe an autonomous robotic system capable of navigating through an office environment, opening doors along the way, and plugging itself into electrical outlets to recharge as needed. We demonstrate through extensive experimentation that our robot executes these tasks reliably, without requiring any modification to the environment. We present robust detection algorithms for doors, door handles, and electrical plugs and sockets, combining vision and laser sensors. We show how to overcome the unavoidable shortcoming of perception by integrating compliant control into manipulation motions. We present a visual-differencing approach to high-precision plug-insertion that avoids the need for high-precision hand-eye calibration.
Wim Meeussen, Melonee Wise, Stuart Glaser, Sachin Chitta, Conor McGann, Patrick Mihelich, Eitan Marder-Eppstein, Marius Muja, Victor Eruhimov, Tully Foote, John M. Hsu, Radu Bogdan Rusu, Bhaskara Marthi, Gary R. Bradski, Kurt Konolige, Brian P. Gerkey, Eric Berger
ICRA6
2009 Compact signatures for high-speed interest point description and matching
abstract
Prominent feature point descriptors such as SIFT and SURF allow reliable real-time matching but at a computational cost that limits the number of points that can be handled on PCs, and even more on less powerful mobile devices. A recently proposed technique that relies on statistical classification to compute signatures has the potential to be much faster but at the cost of using very large amounts of memory, which makes it impractical for implementation on low-memory devices. In this paper, we show that we can exploit the sparseness of these signatures to compact them, speed up the computation, and drastically reduce memory usage. We base our approach on Compressive Sensing theory. We also highlight its effectiveness by incorporating it into two very different SLAM packages and demonstrating substantial performance increases.
Michael Calonder, Vincent Lepetit, Pascal Fua, Kurt Konolige, James Bowman, Patrick Mihelich
ICCV6
2006 groupTime: preference based group scheduling
abstract
As our business, academic, and personal lives continue to move at an ever-faster pace, finding times for busy people to meet has become an art. One of the most perplexing challenges facing groupware is effective asynchronous group scheduling (GS). This paper presents a lightweight interaction model for GS that can extend its reach beyond users of current group calendaring solutions. By expressing availability in terms of preferences, we create a flexible framework for GS that preserves plausible deniability while exerting social pressure to encourage honesty among users. We also propose an ontology that enables us to model user preferences with machine learning, predicting user responses to further lower cognitive load. The combination of visualization/direct manipulation with machine learning allows users to easily and efficiently optimize meeting times. We also suggest resulting design implications for this class of intelligent user interfaces.
Mike Brzozowski, Kendra Carattini, Scott R. Klemmer, Patrick Mihelich, Andrew Y. Ng
CHI4