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

Jason L. Speyer

dblp:36/52 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0002-2349-2795ORCID · corroborated

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

Computer networks · 1Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging 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
1 paper
Robot manipulation · 50% 3D vision · 50%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation
continuum robot
0.412020
SCADE: Simultaneous Sensor Calibration and Deformation Estimation of FBG-Equipped Unmodeled Continuum Manipulators · IEEE Trans. Robotics 2020
Computer vision › 3D vision › motion estimation › non-rigid motion estimation
deformation field estimation
0.412020
SCADE: Simultaneous Sensor Calibration and Deformation Estimation of FBG-Equipped Unmodeled Continuum Manipulators · IEEE Trans. Robotics 2020
Medical and health informatics
shape estimation
0.112020
SCADE: Simultaneous Sensor Calibration and Deformation Estimation of FBG-Equipped Unmodeled Continuum Manipulators · IEEE Trans. Robotics 2020
Medical and health informatics
surgical robotics
0.112020
SCADE: Simultaneous Sensor Calibration and Deformation Estimation of FBG-Equipped Unmodeled Continuum Manipulators · IEEE Trans. Robotics 2020

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

stochastic filtering · 0.9sensor fusion · 0.9fiber bragg grating sensing · 0.9
YearPublicationVenuePosition
2020 SCADE: Simultaneous Sensor Calibration and Deformation Estimation of FBG-Equipped Unmodeled Continuum Manipulators
abstract
In this article, we present a novel stochastic algorithm called simultaneous sensor calibration and deformation estimation (SCADE) to address the problem of modeling deformation behavior of a generic continuum manipulator (CM) in free and obstructed environments. In SCADE, using a novel mathematical formulation, we introduce a priori model-independent filtering algorithm to fuse the continuous and inaccurate measurements of an embedded sensor (e.g., magnetic or piezoelectric sensors) with an intermittent but accurate data of an external imaging system (e.g., optical trackers or cameras). The main motivation of this article is the crucial need of obtaining an accurate shape/position estimation of a CM utilized in a surgical intervention. In these robotic procedures, the CM is typically equipped with an embedded sensing unit (ESU) while an external imaging modality (e.g., ultrasound or a fluoroscopy machine) is also available in the surgical site. The results of two different set of prior experiments in free and obstructed environments were used to evaluate the efficacy of SCADE algorithm. The experiments were performed with a CM specifically designed for orthopaedic interventions equipped with an inaccurate Fiber Bragg Grating (FBG) ESU and overhead camera. The results demonstrated the successful performance of the SCADE algorithm in simultaneous estimation of unknown deformation behavior of the utilized unmodeled CM together with realizing the time-varying drift of the poor-calibrated FBG sensing unit. Moreover, the results showed the phenomenal out-performance of the SCADE algorithm in estimation of the CM's tip position as compared to FBG-based position estimations.
Farshid Alambeigi, Sahba Aghajani Pedram, Jason L. Speyer, Jacob Rosen 0001, Iulian Iordachita, Russell H. Taylor, Mehran Armand
IEEE Trans. Robotics3
2003 Integrated predictive power control and dynamic channel assignment in mobile radio systems
abstract
It is known that dynamic allocation of channels and power in a frequency/time-division multiple access system can improve performance and achieve higher capacity. Various algorithms have been separately proposed for dynamic channel assignment (DCA) and power control. Moreover, integrated dynamic channel and power allocation (DCPA) algorithms have already been proposed based on simple power control algorithms. In this paper, we propose a DCPA scheme based on a novel predictive power control algorithm. The minimum interference DCA algorithm is employed, while simple Kalman filters are designed to provide the predicted measurements of both the channel gains and the interference levels, which are then used to update the power levels. Local and global stability of the network are analyzed and extensive computer simulations are carried out to show the improvement in performance, under the dynamics of user arrivals and departures and user mobility. It is shown that call droppings and call blockings are decreased while, on average, fewer channel reassignments per call are required.
Kambiz Shoarinejad, Jason L. Speyer, Gregory J. Pottie
IEEE Trans. Wirel. Commun.2
2002 Modeling and analysis of air campaign resource allocation: a spatio-temporal decomposition approach
abstract
In this paper, we address the modeling and analysis issues associated with a generic theater level campaign where two adversaries pit their military resources against each other over a sequence of multiple engagements. In particular, we consider the scenario of an air raid campaign where one adversary uses suppression of enemy air defense (SEAD) aircraft and bombers (BMBs) against the other adversary's invading ground troops (GTs) that are defended by their mobile air defense (AD) units. The original problem is decomposed into a temporal and a spatial resource allocation problem. The temporal resource allocation problem is formulated and solved in a game-theoretical framework as a multiple resource interaction problem with linear attrition functions. The spatial resource allocation problem is posed as a risk minimization problem in which the optimal corridor of ingress and optimal movement of the GTs and AD units are decided by the adversaries. These two solutions are integrated using an aggregation/deaggregation approach to evaluate resource strengths and distribute losses. Several simulation experiments were carried out to demonstrate the main ideas.
Debasish Ghose, Mikhail Krichman, Jason L. Speyer, Jeff S. Shamma
IEEE Trans. Syst. Man Cybern. Part A3