Optimal Feature Design for Vision-Guided Manipulation Azad Shademan, Master of Applied Science in Electrical and Computer Engineering Department, Ryerson University, 2005 Numerous industrial applications use vision-guided manipulation, where cameras are used to generate the feedback control signal. Current vision algorithms select a set of image features to estimate pose in real-time. Object de...

We apply the complexity-regularization principle to statistical ill-posed inverse problems in imaging. The class of problems studied includes restoration of images corrupted by Gaussian or Poisson noise and nonlinear transformations. We formulate a natural distortion measure in image space and develop nonasymptotic bounds on estimation performance in terms of an index of resolvability that char...

This thesis addresses two problems of network information theory: coding for relay networks and (accurate) approximations of distributions based on unnormalized informational divergence with applications to network security. For the former problem, we first consider short message noisy network coding (SNNC). SNNC differs from long message noisy network coding (LNNC) in that one transmits many s...

Reflective structural colors have backlight-free supremacy and can provide energy-efficient environmental-friendly color production for many applications. However, they are hindered by the complex process incorrect after fabrication. Here, a pixelated electrothermal oxidation technique is proposed that precisely tailor produce reflective covering entire visible range, providing possibility cust...

The July 2020 Mw 7.8 Shumagin earthquake occurred in the seismic gap region along Aleutian subduction zone. This interplate generated a small tsunami, but with unusual long-period waves ranging between 40 and 90 min. We examined cause of such an anomalous ocean wave through source modeling inverted from tsunami geodetic data. Our model indicates that plate-boundary rupture area was confined at ...

This paper considers the covert identification problem in which a sender aims to reliably convey an (ID) message set of receivers via binary-input discrete memoryless channel (BDMC), and simultaneously guarantee that communication is with respect warden who monitors another independent BDMC. We prove square-root law for problem. states ID size exp(exp(Θ(√{ n})) can be transmitted over n uses. t...