arXiv subjects

Zhe Yang

Publications and source records attributed to Zhe Yang.

At least 91 records · Page 5Linked to original sources

arXiv2021

CrossRoI: Cross-camera Region of Interest Optimization for Efficient Real Time Video Analytics at Scale

Video cameras are pervasively deployed in city scale for public good or community safety (i.e. traffic monitoring or suspected person tracking). However, analyzing large scale video feeds in real time is data intensive and poses severe challenges to network and computation systems today. We present CrossRoI, a resource-efficient system that enables real time video analytics at scale via harnessing the videos content associations and redundancy across a fleet of cameras. CrossRoI exploits the intrinsic physical correlations of cross-camera viewing fields to drastically reduce the communication and computation costs. CrossRoI removes the repentant appearances of same objects in multiple cameras without harming comprehensive coverage of the scene. CrossRoI operates in two phases - an offline phase to establish cross-camera correlations, and an efficient online phase for real time video inference. Experiments on real-world video feeds show that CrossRoI achieves 42% - 65% reduction for network overhead and 25% - 34% reduction for response delay in real time video analytics applications with more than 99% query accuracy, when compared to baseline methods. If integrated with SotA frame filtering systems, the performance gains of CrossRoI reach 50% - 80% (network overhead) and 33% - 61% (end-to-end delay).

cs.DC↗

arXiv2021

DeepRT: A Soft Real Time Scheduler for Computer Vision Applications on the Edge

The ubiquity of smartphone cameras and IoT cameras, together with the recent boom of deep learning and deep neural networks, proliferate various computer vision driven mobile and IoT applications deployed on the edge. This paper focuses on applications which make soft real time requests to perform inference on their data - they desire prompt responses within designated deadlines, but occasional deadline misses are acceptable. Supporting soft real time applications on a multi-tenant edge server is not easy, since the requests sharing the limited GPU computing resources of an edge server interfere with each other. In order to tackle this problem, we comprehensively evaluate how latency and throughput respond to different GPU execution plans. Based on this analysis, we propose a GPU scheduler, DeepRT, which provides latency guarantee to the requests while maintaining high overall system throughput. The key component of DeepRT, DisBatcher, batches data from different requests as much as possible while it is proven to provide latency guarantee for requests admitted by an Admission Control Module. DeepRT also includes an Adaptation Module which tackles overruns. Our evaluation results show that DeepRT outperforms state-of-the-art works in terms of the number of deadline misses and throughput.

cs.DC↗

arXiv2020

Instant single-pixel imaging: on-chip real-time implementation based on instant ghost imaging algorithm

Single-pixel imaging (SPI) uses a single-pixel detector to create an image of an object. SPI relies on a computer to construct an image, thus increasing both the size and cost of SPI and limiting its application. We developed instant single-pixel imaging (ISPI), an on-chip SPI system that implements real-time imaging at a rate of 25 fps. ISPI uses the instant ghost imaging algorithm we proposed which leverages signal differences for image creation. It does not require a computer, which greatly reduces its cost and size. The reconstruct time of ISPI for image creation is almost zero because little processing is required after signal detection. ISPI paves the way for the practical application of SPI.

eess.IV↗

arXiv2020

Instant Ghost Imaging: Algorithm and On-chip Implementation

Ghost imaging (GI) is an imaging technique that uses the correlation between two light beams to reconstruct the image of an object. Conventional GI algorithms require large memory space to store the measured data and perform complicated offline calculations, limiting practical applications of GI. Here we develop an instant ghost imaging (IGI) technique with a differential algorithm and an implemented high-speed on-chip IGI hardware system. This algorithm uses the signal between consecutive temporal measurements to reduce the memory requirements without degradation of image quality compared with conventional GI algorithms. The on-chip IGI system can immediately reconstruct the image once the measurement finishes; there is no need to rely on post-processing or offline reconstruction. This system can be developed into a realtime imaging system. These features make IGI a faster, cheaper, and more compact alternative to a conventional GI system and make it viable for practical applications of GI.

eess.IV↗

arXiv2020

Instant ghost imaging: improving robustness for ghost imaging subject to optical background noise

Ghost imaging (GI) is an imaging technique that uses the second-order correlation between two light beams to obtain the image of an object. However, standard GI is affected by optical background noise, which reduces its practical use. We investigated the robustness of an instant ghost imaging (IGI) algorithm against optical background noise and compare it with the conventional GI algorithm. Our results show that IGI is extremely resistant to spatiotemporally varying optical background noise that can change over a large range. When the noise is large in relation to the signal, IGI will still perform well in conditions that prevent the conventional GI algorithm from generating an image because IGI uses signal differences for imaging. Signal differences are intrinsically resistant to common noise modes, so the IGI algorithm is strongly robust against noise. This research is of great significance for the practical application of GI.

eess.IV↗

arXiv2019

CAMEL: A Weakly Supervised Learning Framework for Histopathology Image Segmentation

Histopathology image analysis plays a critical role in cancer diagnosis and treatment. To automatically segment the cancerous regions, fully supervised segmentation algorithms require labor-intensive and time-consuming labeling at the pixel level. In this research, we propose CAMEL, a weakly supervised learning framework for histopathology image segmentation using only image-level labels. Using multiple instance learning (MIL)-based label enrichment, CAMEL splits the image into latticed instances and automatically generates instance-level labels. After label enrichment, the instance-level labels are further assigned to the corresponding pixels, producing the approximate pixel-level labels and making fully supervised training of segmentation models possible. CAMEL achieves comparable performance with the fully supervised approaches in both instance-level classification and pixel-level segmentation on CAMELYON16 and a colorectal adenoma dataset. Moreover, the generality of the automatic labeling methodology may benefit future weakly supervised learning studies for histopathology image analysis.

eess.IV↗

arXiv2019

BAGS: An automatic homework grading system using the pictures taken by smart phones

Homework grading is critical to evaluate teaching quality and effect. However, it is usually time-consuming to grade the homework manually. In automatic homework grading scenario, many optical mark reader (OMR)-based solutions which require specific equipments have been proposed. Although many of them can achieve relatively high accuracy, they are less convenient for users. In contrast, with the popularity of smart phones, the automatic grading system which depends on the image photographed by phones becomes more available. In practice, due to different photographing angles or uneven papers, images may be distorted. Moreover, most of images are photographed under complex backgrounds, making answer areas detection more difficult. To solve these problems, we propose BAGS, an automatic homework grading system which can effectively locate and recognize handwritten answers. In BAGS, all the answers would be written above the answer area underlines (AAU), and we use two segmentation networks based on DeepLabv3+ to locate the answer areas. Then, we use the characters recognition part to recognize students' answers. Finally, the grading part is designed for the comparison between the recognized answers and the standard ones. In our test, BAGS correctly locates and recognizes the handwritten answers in 91% of total answer areas.

cs.CV↗

arXiv2018

Enabling Multiple Access for Non-Line-of-Sight Light-to-Camera Communications

Light-to-Camera Communications (LCC) have emerged as a new wireless communication technology with great potential to benefit a broad range of applications. However, the existing LCC systems either require cameras directly facing to the lights or can only communicate over a single link, resulting in low throughputs and being fragile to ambient illuminant interference. We present HYCACO, a novel LCC system, which enables multiple light emitting diodes (LEDs) with an unaltered camera to communicate via the non-line-of-sight (NLoS) links. Different from other NLoS LCC systems, the proposed scheme is resilient to the complex indoor luminous environment. HYCACO can decode the messages by exploring the mixed reflected optical signals transmitted from multiple LEDs. By further exploiting the rolling shutter mechanism, we present the optimal optical frequencies and camera exposure duration selection strategy to achieve the best performance. We built a hardware prototype to demonstrate the efficiency of the proposed scheme under different application scenarios. The experimental results show that the system throughput reaches 4.5 kbps on iPhone 6s with three transmitters. With the robustness, improved system throughput and ease of use, HYCACO has great potentials to be used in a wide range of applications such as advertising, tagging objects, and device certifications.

cs.ET↗

arXiv2017

Beyond Powers of Two: Hexagonal Modulation and Non-Binary Coding for Wireless Communication Systems

Adaptive modulation and coding (AMC) is widely employed in modern wireless communication systems to improve the transmission efficiency by adjusting the transmission rate according to the channel conditions. Thus, AMC can provide very efficient use of channel resources especially over fading channels. Quadrature Amplitude Modulation (QAM) is an ef- ficient and widely employed digital modulation technique. It typically employs a rectangular signal constellation. Therefore the decision regions of the constellation are square partitions of the two-dimensional signal space. However, it is well known that hexagons rather than squares provide the most compact regular tiling in two dimensions. A compact tiling means a dense packing of the constellation points and thus more energy efficient data transmission. Hexagonal modulation can be difficult to implement because it does not fit well with the usual power- of-two symbol sizes employed with binary data. To overcome this problem, non-binary coding is combined with hexagonal modulation in this paper to provide a system which is compatible with binary data. The feasibility and efficiency are evaluated using a software-defined radio (SDR) based prototype. Extensive simulation results are presented which show that this approach can provide improved energy efficiency and spectrum utilization in wireless communication systems.

eess.SP↗

arXiv2017

Digital spiral object identification using random light

Photons that are entangled or correlated in orbital angular momentum have been extensively used for remote sensing, object identification and imaging. It has recently been demonstrated that intensity fluctuations give rise to the formation of correlations in the orbital angular momentum components and angular positions of random light. Here, we demonstrate that the spatial signatures and phase information of an object, with rotational symmetries, can be identified using classical orbital angular momentum correlations in random light. The Fourier components imprinted in the digital spiral spectrum of the object, measured through intensity correlations, unveil its spatial and phase information. Sharing similarities with conventional compressive sensing protocols that exploit sparsity to reduce the number of measurements required to reconstruct a signal, our technique allows sensing of an object with fewer measurements than other schemes that use pixel-by-pixel imaging. One remarkable advantage of our technique is the fact that it does not require the preparation of fragile quantum states of light and works at both low- and high-light levels. In addition, our technique is robust against environmental noise, a fundamental feature of any realistic scheme for remote sensing.

quant-ph↗

arXiv2016

Architectures of Soft Robotic Locomotion Enabled by Simple Mechanical Principles

In nature, a variety of limbless locomotion patterns flourish from the small or basic life form (Escherichia coli, the amoeba, etc.) to the large or intelligent creatures (e.g., slugs, starfishes, earthworms, octopuses, jellyfishes, and snakes). Many bioinspired soft robots based on locomotion have been developed in the past decades. In this work, based on the kinematics and dynamics of two representative locomotion modes (i.e., worm-like crawling and snake-like slithering), we propose a broad set of innovative designs for soft mobile robots through simple mechanical principles. Inspired by and go beyond existing biological systems, these designs include 1-D (dimensional), 2-D, and 3-D robotic locomotion patterns enabled by simple actuation of continuous beams. We report herein over 20 locomotion modes achieving various locomotion functions, including crawling, rising, running, creeping, squirming, slithering, swimming, jumping, turning, turning over, helix rolling, wheeling, etc. Some of them are able to reach high speed, high efficiency, and overcome obstacles. All these locomotion strategies and functions can be integrated into a simple beam model. The proposed simple and robust models are adaptive for severe and complex environments. These elegant designs for diverse robotic locomotion patterns are expected to underpin future deployments of soft robots and to inspire series of advanced designs.

cond-mat.soft↗

arXiv2015

Transfer of high-dimensional quantum state through an XXZ-Heisenberg quantum spin chain

We propose and analyze an efficient high-dimensional quantum state transfer scheme through an $XXZ$-Heisenberg spin chain in an inhomogeneous magnetic field. By the use of a combination of coherent quantum coupling and free spin-wave approximation, pure unitary evolution results in a perfect high-dimensional swap operation between two remote quantum registers mediated by a uniform quantum data bus, and the feasibility is confirmed by numerical simulations. Also, we observe that either the strong $z$-directional coupling or high quantum spin number can partly suppress the thermal excitations and protect quantum information from the thermal noises when the quantum data bus is in the thermal equilibrium state.

quant-ph↗

arXiv2015

Reflected Backward Stochastic Differential Equations for a Finite State Markov Chain Model and Applications to American Options

In this paper, we introduce a new kind of reflected backward stochastic differential equations (RBSDEs) driven by a martingale, in a Markov chain model, but not driven by Brownian motion, and give existence and uniqueness results for the new equations. Then we discuss American options in a finite state Markov chain model, in the presence of a stochastic discount function (SDF) and using the theory of the new RBSDEs. We show that there exists a constrained super-hedging strategy for an American option, which is unique in our framework as the solution to an RBSDE.

math.PR↗

arXiv2015

On Anticipated backward stochastic differential equations with Markov chain noise

In 2013, Lu and Ren \cite {luren} considered anticipated backward stochastic differential equations driven by finite state, continuous time Markov chain noise and established the existence and uniqueness of the solutions of these equations and a scalar comparison theorem. In this paper, we provide an estimate for their solutions and study the duality between these equations and stochastic differential delayed equations with Markov chain noise. Finally we derive another comparison theorem for these solutions depending only on the two drivers.

math.PR↗

arXiv2015

Some Properties of Reflected Backward Stochastic Differential Equations for a Finite State Markov Chain Model

In this paper, we provide an estimate for the solutions of reflected backward stochastic differential equations (RBSDEs) driven by a Markov chain, derive a continuous dependence property for their solutions with respect to the parameters of the equations, and show similar properties for solutions of backward stochastic differential equations (BSDEs). We finally establish a comparison result for the solutions of RBSDEs driven by a Markov chain.

math.PR↗

arXiv2014

Backward Stochastic Differential Equations with Continuous Coefficients in a Markov Chain Model and with Applications to European Options

In this paper we discuss backward stochastic differential equations with Markov chain noise, having continuous drivers. We obtain the existence of a solution which is possibly not unique. Moreover, we show there is a minimal solution for this kind of equation and derive the corresponding comparison result. This is applied to pricing of European options in a market with Markov chain noise.

math.PR↗

arXiv2014

Comparison and converse comparison theorems for backward stochastic differential equations with Markov chain noise

Comparison and converse comparison theorems are important parts of the research on backward stochastic differential equations. In this paper, we obtain comparison results for one dimensional backward stochastic differential equations with Markov chain noise, extending and generalizing previous work under natural and simplified hypotheses, and establish a converse comparison theorem for the same type of equation after giving the definition and properties of a type of nonlinear expectation: $f$-expectation.

math.PR↗

arXiv2014

Realistic Interpretation of Quantum Mechanics and Encounter-Delayed-Choice Experiment

A realistic interpretation(REIN) of wave function in quantum mechanics is briefly presented in this work. In REIN, the wave function of a microscopic object is just its real existence rather than a mere mathematical description. Quantum object can exist in disjoint regions of space which just as the wave function distributes, travels at a finite speed, and collapses instantly upon a measurement. The single photon interference in a Mach-Zehnder interferometer is analyzed using REIN. In particular, we proposed and experimentally implemented a generalized delayed-choice experiment, the encounter-delayed-choice(EDC) experiment, in which the second beam splitter is inserted at the encounter of the two sub-waves from the two arms. In the EDC experiment, the front parts of wave functions before the beam splitter insertion do not interfere and show the particle nature, and the back parts of the wave functions will interfere and show a wave nature. The predicted phenomenon is clearly demonstrated in the experiment, and supports the REIN idea.

quant-ph↗