An Algorithm for projective point matching in the presence of spurious points An analysis of the performance of RANSAC in the presence of spurious points, and a discussion of why the Denton/Beveridge key feature local search algorithm performs better on difficult point matching problems. Further results for the key feature algorithm are presented. From The February 2007 issue of Pattern Recognition.
Doctoral Dissertation. Dissertation on Two Dimensional Projective Point Matching. Presents a local search algorithm from solving point matching problems related by a projective transform. Paired with a heuristic key feature algorithm it is quite effective for many problems. Also contains an overview of other general point matching algorithms, the mathematical details of finding the optimal pose for a set of correspondence under similarity, general affine, and projective transforms, and comparisons with other algorithms. From Colorado State University, 2002.
Two Dimensional Projective Point Matching. A short explanation of the local search and key feature algorithm, with a few results. A good starting point for reading about this work. Appear at the 5th IEEE Southwest Symposium on Image Analysis and Interpretation, in April of 2002. Originally on pages 77-81.
The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt. An examination of Nagata and Kobayashi's EAX operator for solving the Traveling Sales Person problem with a genetic algorithm. We compare their technique with 2-opt hill climbing. From Parallel Problem Solving From Nature V, 1998.
A Software Implementation Progress Model. Work done with Dwayne Towell on a model for the rate of implementation progress. From FASE 2006.
Software Engineering as Technology Transfer. Work done with Daniel Cooke on a vision of software engineering as the mechanism for technology transfer in the software community. From SEKE 2003.
Master's Thesis. Masters thesis, on Accurate Use of Software Reliability Growth Models. Presents work on estimating the parameters of the exponential and logarithmic models, and a discussion of using static parameters to stabilize these estimates. From Colorado State University, 1999.
Module Size Distribution and Defect Density. This paper presents a model relating a module's size to its defect density. Originally appeared at the International Symposium of Software Reliability Engineering, 2000.
Requirements Volatility and Defect Density. Dealing with how changes to requirements after the start of development effect the evolving defect density of a systems as the software is written. Originally appeared at the International Symposium of Software Reliability Engineering, 1999.
Estimating The Number of Residual Defects. The papers examines the Malaiya and Denton coverage based model, its origins, and application to the estimation of software defects. From the Third IEEE International Symposium on High-Assurance Systems Engineering Symposium, Washington D.C., November 1998. Pages 98-105.
Estimating the Number of Defects: A Simple and Intuitive Approach. A more user oriented version of the previous paper. This paper foregoes heavy mathematics in favor a simpler interpretation of the work, including an easy to use linear version of the model and how to determine when it is appropriate to use. Originally appearing at the International Symposium of Software Reliability Engineering, Paderborn, Germany, November 1998.
What do Software Reliability Parameters Represent? A new interpretation of the parameters of the logarithmic software reliability growth model, a software defect density model, and who you can use both of the them to make a priori estimation about the software development process. Originally appeared in Proc. International Symposium on Image Analysis and Interpretation, Albuquerque, NM, 1997. Pages 124-135.