Arrow Research search

Author name cluster

Terry Caelli

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.

2 papers
1 author row

Possible papers

2

JBHI Journal 2014 Journal Article

A Syntactic Two-Component Encoding Model for the Trajectories of Human Actions

  • Saiyi Li
  • Mario Ferraro
  • Terry Caelli
  • Pubudu N. Pathirana

Human actions have been widely studied for their potential application in various areas such as sports, pervasive patient monitoring, and rehabilitation. However, challenges still persist pertaining to determining the most useful ways to describe human actions at the sensor, then limb and complete action levels of representation and deriving important relations between these levels each involving their own atomic components. In this paper, we report on a motion encoder developed for the sensor level based on the need to distinguish between the shape of the sensor's trajectory and its temporal characteristics during execution. This distinction is critical as it provides a different encoding scheme than the usual velocity and acceleration measures which confound these two attributes of any motion. At the same time, we eliminate noise from sensors by comparing temporal and spatial indexing schemes and a number of optimal filtering models for robust encoding. Results demonstrate the benefits of spatial indexing and separating the shape and dynamics of a motion, as well as its ability to decompose complex motions into several atomic ones. Finally, we discuss how this specific type of sensor encoder bears on the derivation of limb and complete action descriptions.

Details DOI

NeurIPS Conference 2006 Conference Paper

implicit Online Learning with Kernels

  • Li Cheng
  • Dale Schuurmans
  • Shaojun Wang
  • Terry Caelli
  • S. V. N. Vishwanathan

We present two new algorithms for online learning in reproducing kernel Hilbert spaces. Our first algorithm, ILK (implicit online learning with kernels), employs a new, implicit update technique that can be applied to a wide variety of convex loss functions. We then introduce a bounded memory version, SILK (sparse ILK), that maintains a compact representation of the predictor without compromising solution quality, even in non-stationary environments. We prove loss bounds and analyze the convergence rate of both. Experimental evidence shows that our proposed algorithms outperform current methods on synthetic and real data.

PDF Details
v2026.09.13