Kernel Flow: a high channel count scalable time-domain functional near-infrared spectroscopy system.

SIGNIFICANCE: Time-domain functional near-infrared spectroscopy (TD-fNIRS) has been considered as the gold standard of noninvasive optical brain imaging devices. However, due to the high cost, complexity, and large form factor, it has not been as widely adopted as continuous wave NIRS systems. AIM: Kernel Flow is a TD-fNIRS system that has been designed to break through these limitations by maintaining the performance of a research grade TD-fNIRS system while integrating all of the components into a small modular device. APPROACH: The Kernel Flow modules are built around miniaturized laser drivers, custom integrated circuits, and specialized detectors. The modules can be assembled into a system with dense channel coverage over the entire head. RESULTS: We show performance similar to benchtop systems with our miniaturized device as characterized by standardized tissue and optical phantom protocols for TD-fNIRS and human neuroscience results. CONCLUSIONS: The miniaturized design of the Kernel Flow system allows for broader applications of TD-fNIRS.

Neutral face classification using personalized appearance models for fast and robust emotion detection.

Facial expression recognition is one of the open problems in computer vision. Robust neutral face recognition in real time is a major challenge for various supervised learning-based facial expression recognition methods. This is due to the fact that supervised methods cannot accommodate all appearance variability across the faces with respect to race, pose, lighting, facial biases, and so on, in the limited amount of training data. Moreover, processing each and every frame to classify emotions is not required, as user stays neutral for majority of the time in usual applications like video chat or photo album/web browsing. Detecting neutral state at an early stage, thereby bypassing those frames from emotion classification would save the computational power. In this paper, we propose a light-weight neutral versus emotion classification engine, which acts as a pre-processer to the traditional supervised emotion classification approaches. It dynamically learns neutral appearance at key emotion (KE) points using a statistical texture model, constructed by a set of reference neutral frames for each user. The proposed method is made robust to various types of user head motions by accounting for affine distortions based on a statistical texture model. Robustness to dynamic shift of KE points is achieved by evaluating the similarities on a subset of neighborhood patches around each KE point using the prior information regarding the directionality of specific facial action units acting on the respective KE point. The proposed method, as a result, improves emotion recognition (ER) accuracy and simultaneously reduces computational complexity of the ER system, as validated on multiple databases.

Random walks on graphs for salient object detection in images.

We formulate the problem of salient object detection in images as an automatic labeling problem on the vertices of a weighted graph. The seed (labeled) nodes are first detected using Markov random walks performed on two different graphs that represent the image. While the global properties of the image are computed from the random walk on a complete graph, the local properties are computed from a sparse k-regular graph. The most salient node is selected as the one which is globally most isolated but falls on a locally compact object. A few background nodes and salient nodes are further identified based upon the random walk based hitting time to the most salient node. The salient nodes and the background nodes will constitute the labeled nodes. A new graph representation of the image that represents the saliency between nodes more accurately, the "pop-out graph" model, is computed further based upon the knowledge of the labeled salient and background nodes. A semisupervised learning technique is used to determine the labels of the unlabeled nodes by optimizing a smoothness objective label function on the newly created "pop-out graph" model along with some weighted soft constraints on the labeled nodes.