Arrow Research search

Author name cluster

Terrance E. Boult

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

5 papers
2 author rows

Possible papers

5

AAAI Conference 2025 Conference Paper

GHOST: Gaussian Hypothesis Open-Set Technique

  • Ryan Rabinowitz
  • Steve Cruz
  • Manuel Günther
  • Terrance E. Boult

Evaluations of large-scale recognition methods typically focus on overall performance. While this approach is common, it often fails to provide insights into performance across individual classes, which can lead to fairness issues and misrepresentation. Addressing these gaps is crucial for accurately assessing how well methods handle novel or unseen classes and ensuring a fair evaluation. To address fairness in Open-Set Recognition (OSR), we demonstrate that per-class performance can vary dramatically. We introduce Gaussian Hypothesis Open Set Technique (GHOST), a novel hyperparameter-free algorithm that models deep features using class-wise multivariate Gaussian distributions with diagonal covariance matrices. We apply Z-score normalization to logits to mitigate the impact of feature magnitudes that deviate from the model’s expectations, thereby reducing the likelihood of the network assigning a high score to an unknown sample. We evaluate GHOST across multiple ImageNet-1K pre-trained deep networks and test it with four different unknown datasets. Using standard metrics such as AUOSCR, AUROC and FPR95, we achieve statistically significant improvements, advancing the state-of-the-art in large-scale OSR. Source code is provided online.

ICRA Conference 1990 Conference Paper

An algorithm to recover generalized cylinders from a single intensity view

  • Ari D. Gross
  • Terrance E. Boult

A general method is presented for recovering straight homogeneous generalized cylinders from monocular intensity images. In this method, it is assumed that the generalized cylinder being recovered has purely diffuse reflectance and that the diffuse reflectance coefficient is constant. It is demonstrated that contour information alone is insufficient to recover a straight homogeneous generalized cylinder uniquely. It is shown that the sign and magnitude of the Gaussian curvature at a point vary among members of a contour-equivalent class. The contour image fails to constrain two parameters of the underlying generalized cylinder, the 3D axis tilt and translation. A method for ruling straight homogeneous generalized cylinder images is described. Once the rulings of the image have been recovered, all parameters derivable from contour alone can be recovered, all parameters derivable from contour alone can be recovered. To recover the two remaining parameters (modulo scale) not constrained by image contour, additional information must be incorporated into the recovery process, e. g. intensity information. A method for recovering the tilt of the object using the ruled contour image and intensity values along extremal cross-section curves is derived, along with a method for recovering the location of the object's 3D axis from intensity values along meridians of the surface. The methods outlined constitute an algorithm for recovering all the shape parameters (modulo scale). >

ICRA Conference 1990 Conference Paper

Energy-based segmentation of very sparse range surfaces

  • Terrance E. Boult
  • Mark Lerner

A segmentation technique for very sparse surfaces is described. It is based on minimizing the energy of the surfaces in the scene. While it could be used in almost any system as part of surface reconstruction/model recovery, the algorithm is designed to be usable when the depth information is scattered and very sparse, as is generally the case with depth generated by stereo algorithms. Results from a sequential algorithm are presented, and a working prototype that executes on the massively parallel Connection Machine is discussed. The technique presented models the surfaces with reproducing kernel-based splines which can be shown to solve a regularized surface reconstruction problem. From the functional form of these splines the authors derive computable upper and lower bounds on the energy of a surface over a given finite region. The computation of the spline, and the corresponding surface representation are quite efficient for very sparse data. >