Thomas C. Henderson
University of Utah
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Thomas C. Henderson.
international conference on robotics and automation | 1999
William B. Thompson; Jonathan C. Owen; H.J. de St. Germain; S.R. Stark; Thomas C. Henderson
Reverse engineering of mechanical parts requires extraction of information about an instance of a particular part sufficient to replicate the part using appropriate manufacturing techniques. This is important in a wide variety of situations, since functional CAD models are often unavailable or unusable for parts which must be duplicated or modified. Computer vision techniques applied to three-dimensional (3-D) data acquired using noncontact, 3-D position digitizers have the potential for significantly aiding the process. Serious challenges must be overcome, however, if sufficient accuracy is to be obtained and if models produced from sensed data are to be truly useful for manufacturing operations. The paper describes a prototype of a reverse engineering system which uses manufacturing features as geometric primitives. This approach has two advantages over current practice. The resulting models can be directly imported into feature-based CAD systems without loss of the semantics and topological information inherent in feature-based representations. In addition, the feature-based approach facilitates methods capable of producing highly accurate models, even when the original 3-D sensor data has substantial errors.
IEEE Transactions on Pattern Analysis and Machine Intelligence | 1989
Charles D. Hansen; Thomas C. Henderson
The authors explore the connection between CAGD (computer-aided geometric design) and computer vision. A method for the automatic generation of recognition strategies based on the 3-D geometric properties of shape has been devised and implemented. It uses a novel technique to quantify the following properties of features which compose models used in computer vision: robustness, completeness, consistency, cost, and uniqueness. By utilizing this information, the automatic synthesis of a specialized recognition scheme, called a strategy tree, is accomplished. Strategy trees describe, in a systematic and robust manner, the search process used for recognition and localization of particular objects in the given scene. The consist of selected 3-D features which satisfy system constraints and corroborating evidence subtrees which are used in the formation of hypotheses. Verification techniques, used to substantiate or refute these hypotheses are explored. Experiments utilizing 3-D data are presented. >
Journal of Robotic Systems | 1985
Thomas C. Henderson; Charles D. Hansen; Bir Bhanu
Logical Sensor System Specification (LSS) has been introduced as a convenient means for specifying multi-sensor systems and their implementations. In this article we demonstrate how control issues can be handled in the context of LSS. In particular, the Logical Sensor Specification is extended to include a control mechanism which permits control information to (1) flow from more centralized processing to more peripheral processes, and (2) be generated locally in the logical sensor by means of a micro-expert system specific to the interface represented by the given logical sensor. Examples are given including a proposed scheme for controlling the Utah/MIT dextrous hand.
Robotics and Autonomous Systems | 2004
Andrew L. Nelson; Edward Grant; Thomas C. Henderson
Abstract In this work, we describe the evolutionary training of artificial neural network controllers for competitive team game playing behaviors by teams of real mobile robots. This research emphasized the development of methods to automate the production of behavioral robot controllers. We seek methods that do not require a human designer to define specific intermediate behaviors for a complex robot task. The work made use of a real mobile robot colony (EVolutionary roBOTs) and a closely coupled computer-based simulated training environment. The acquisition of behavior in an evolutionary robotics system was demonstrated using a robotic version of the game Capture the Flag . In this game, played by two teams of competing robots, each team tries to defend its own goal while trying to ‘attack’ another goal defended by the other team. Robot neural controllers relied entirely on processed video data for sensing of their environment. Robot controllers were evolved in a simulated environment using evolutionary training algorithms. In the evolutionary process, each generation consisted of a competitive tournament of games played between the controllers in an evolving population. Robot controllers were selected based on whether they won or lost games in the course of a tournament. Following a tournament, the neural controllers were ranked competitively according to how many games they won and the population was propagated using a mutation and replacement strategy. After several hundred generations, the best performing controllers were transferred to teams of real mobile robots, where they exhibited behaviors similar to those seen in simulation including basic navigation, the ability to distinguish between different types of objects, and goal tending behaviors.
International Journal of Parallel Programming | 1987
Ashok Samal; Thomas C. Henderson
Mackworth and Freuder have analyzed the time complexity of several constraint satisfaction algorithms.(1) Mohr and Henderson have given new algorithms, AC-4 and PC-3, for arc and path consistency, respectively, and have shown that the arc consistency algorithm is optimal in time complexity and of the same order space complexity as the earlier algorithms.(2) In this paper, we give parallel algorithms for solving node and arc consistency. We show that any parallel algorithm for enforcing are consistency in the worst case must have O(na) sequential steps, wheren is number of nodes, anda is the number of labels per node. We give several parallel algorithms to do arc consistency. It is also shown that they all have optimal time complexity. The results of running the parallel algorithms on a BBN Butterfly multiprocessor are also presented.
Springer Handbook of Robotics, 2nd Ed. | 2016
Hugh F. Durrant-Whyte; Thomas C. Henderson
Multisensor data fusion is the process of combining observations from a number of different sensors to provide a robust and complete description of an environment or process of interest. Data fusion finds wide application in many areas of robotics such as object recognition, environment mapping, and localization.
IEEE Transactions on Pattern Analysis and Machine Intelligence | 1983
Thomas C. Henderson
The representation of 3-D objects is an important step in solving many problems in scene analysis. One of the most successful techniques is that based on the surfaces of objects. We describe several methods for obtaining such surface representations from various types of intrinsic images. In particular, previous work is reviewed and an algorithm based on region growing is investigated in terms of its efficiency in segmenting a set of points in 3-D space into planar faces. Information on the neighborhood structure of the points in the form of a spatial proximity graph is used to direct the segmentation. Applications to industrial objects are demonstrated.
IEEE Transactions on Pattern Analysis and Machine Intelligence | 1987
Jun Gu; Wei Wang; Thomas C. Henderson
Discrete relaxation techniques have proven useful in solving a wide range of problems in digital signal and digital image processing, artificial intelligence, operations research, and machine vision. Much work has been devoted to finding efficient hardware architectures. This paper shows that a conventional hardware design for a Discrete Relaxation Algorithm (DRA) suffers from O(n2m3) time complexity and O(n2m2) space complexity. By reformulating DRA into a parallel computational tree and using a multiple tree-root pipelining scheme, time complexity is reduced to O(nm), while the space complexity is reduced by a factor of 2. For certain relaxation processing, the space complexity can even be decreased to O(nm). Furthermore, a technique for dynamic configuring an architectural wavefront is used which leads to an O(n) time highly concurrent DRA3 architecture.
IEEE Transactions on Pattern Analysis and Machine Intelligence | 1981
Larry S. Davis; Thomas C. Henderson
A major application of syntactic pattern recognition is the analysis of two-dimensional shape. This paper describes a new syntactic shape analysis technique which combines the constraint propagation techniques which have been so successful in computer vision with the syntactic representation techniques which have been successfully applied to a wide variety of shape analysis problems. Shapes are modeled by stratified shape grammars. These grammars are designed so that local constraints can be compiled from the grammar describing the appearance of pieces of shape at various levels of description. Applications to the analysis of airplane shapes are presented.
The International Journal of Robotics Research | 1988
Thomas C. Henderson; Eliot Weitz; Charles D. Hansen; Amar Mitiche
We describe an approach which facilitates and makes explicit the organization of the knowledge necessary to map multi sensor system requirements onto an appropriate assembly of algorithms, processors, sensors, and actuators. We have previously introduced the multisensor kernel system and logi cal sensor specifications as a means for high-level specifi cation of multisensor systems. The main goals of such a characterization are to develop a coherent treatment of multi sensor information, to allow system reconfiguration for both fault tolerance and dynamic response to environmental con ditions, and to permit the explicit description of control. In this paper we show how logical sensors can be incorpo rated into an object-based approach for the interpretation of 3D structure. Considering the inherent difficulties in inter preting general configurations of lines in space, and consider ing the ubiquitousness of special line configurations in manu factured environments and objects, we advocate the use of computational units tuned to the occurrence of special config urations. The organized use of these units circumvents the inherent difficulties in interpreting general configurations of lines. After a brief examination of the problem of interpreting general configurations of lines in space, a number of compu tational units are proposed which are naturally derived from angular relations. The process of propagation (which allows interpretation to spread over the image) is also advocated. Such computational units and processes, which are simple and efficient, can be conveniently organized in a rule-based framework where the occurrence of the various special config urations can be tested. The multisensor knowledge system provides such a framework.