Jacob Grosek

CV
4papers
148citations
Novelty45%
AI Score39

4 Papers

7.0OPTICSMar 31
Bent optical waveguide finite element analysis with a 3D envelope Maxwell model

Jaime Mora-Paz, Stefan Henneking, Leszek Demkowicz et al.

With the goal of accurately extracting the optical field losses in a three-dimensional (3D), circularly coiled waveguide (e.g., bent optical fiber), this effort presents the numerical methodologies that are implemented for an envelope Maxwell model that propagates electromagnetic fields as an entirely boundary value problem. Our unique modeling approach includes an ultraweak variational formulation of the envelope Maxwell model in the curved geometry of the bending, which is discretized by the discontinuous Petrov-Galerkin (DPG) method, which permits residual-driven mesh and polynomial-order adaptivity. This also, then, requires a unique approach for constructing perfectly matched layers (PMLs) as absorbing boundary conditions in both the direction of optical field propagation and in the tangential directions, where unguided energy escapes the waveguide. Our coiled waveguide modeling technology extracts the mode confinement losses from the propagation of the coherent optical field through the bent waveguide. We verify our simulations against the semi-analytical results from the analogous bent slab waveguide problem, and we successfully demonstrate stable convergence to loss values for the 3D coiled optical fiber problem, which has never been done previously for our specific modeling approach.

NAMay 4, 2019
Simulation of Optical Fiber Amplifier Gain Using Equivalent Short Fibers

Dow Drake, Jay Gopalakrishnan, Tathagata Goswami et al.

Electromagnetic wave propagation in optical fiber amplifiers obeys Maxwell equations. Using coupled mode theory, the full Maxwell system within an optical fiber amplifier is reduced to a simpler model. The simpler model is made more efficient through a new scale model, referred to as an equivalent short fiber, which captures some of the essential characteristics of a longer fiber. The equivalent short fiber can be viewed as a fiber made using artificial (unphysical) material properties that in some sense compensates for its reduced length. The computations can be accelerated by a factor approximately equal to the ratio of the original length to the reduced length of the equivalent fiber. Computations using models of two commercially available fibers -- one doped with ytterbium, and the other with thulium -- show the practical utility of the concept. Extensive numerical studies are conducted to assess when the equivalent short fiber model is useful and when it is not.

CVApr 30, 2014
Selecting a Small Set of Optimal Gestures from an Extensive Lexicon

Jacob Grosek, J. Nathan Kutz

Finding the best set of gestures to use for a given computer recognition problem is an essential part of optimizing the recognition performance while being mindful to those who may articulate the gestures. An objective function, called the ellipsoidal distance ratio metric (EDRM), for determining the best gestures from a larger lexicon library is presented, along with a numerical method for incorporating subjective preferences. In particular, we demonstrate an efficient algorithm that chooses the best $n$ gestures from a lexicon of $m$ gestures where typically $n \ll m$ using a weighting of both subjective and objective measures.

CVApr 30, 2014
Dynamic Mode Decomposition for Real-Time Background/Foreground Separation in Video

Jacob Grosek, J. Nathan Kutz

This paper introduces the method of dynamic mode decomposition (DMD) for robustly separating video frames into background (low-rank) and foreground (sparse) components in real-time. The method is a novel application of a technique used for characterizing nonlinear dynamical systems in an equation-free manner by decomposing the state of the system into low-rank terms whose Fourier components in time are known. DMD terms with Fourier frequencies near the origin (zero-modes) are interpreted as background (low-rank) portions of the given video frames, and the terms with Fourier frequencies bounded away from the origin are their sparse counterparts. An approximate low-rank/sparse separation is achieved at the computational cost of just one singular value decomposition and one linear equation solve, thus producing results orders of magnitude faster than a leading separation method, namely robust principal component analysis (RPCA). The DMD method that is developed here is demonstrated to work robustly in real-time with personal laptop-class computing power and without any parameter tuning, which is a transformative improvement in performance that is ideal for video surveillance and recognition applications.