Toward Depth Estimation Using Mask-Based Lensless Cameras

Recently, coded masks have been used to demonstrate a thin form-factor lensless camera, FlatCam, in which a mask is placed immediately on top of a bare image sensor. In this paper, we present an imaging model and algorithm to jointly estimate depth and intensity information in the scene from a single or multiple FlatCams. We use a light field representation to model the mapping of 3D scene onto the sensor in which light rays from different depths yield different modulation patterns. We present a greedy depth pursuit algorithm to search the 3D volume and estimate the depth and intensity of each pixel within the camera field-of-view. We present simulation results to analyze the performance of our proposed model and algorithm with different FlatCam settings

Open Quantum Systems in Noninertial Frames

We study the effects of decoherence on the entanglement generated by Unruh effect in noninertial frames by using bit flip, phase damping and depolarizing channels. It is shown that decoherence strongly influences the initial state entanglement. The entanglement sudden death can happens irrespective of the acceleration of the noninertial frame under the action of phase flip and phase damping channels. It is investigated that an early sudden death happens for large acceleration under the depolarizing environment. Moreover, the entanglement increases for a highly decohered phase flip channel.Comment: 11 pages, 6 eps figure

Noisy Relativistic Quantum Games in Noninertial Frames

The influence of noise and of Unruh effect on quantum Prisoners' dilemma is investigated both for entangled and unentangled initial states. The noise is incorporated through amplitude damping channel. For unentangled initial state, the decoherence compensates for the adverse effect of acceleration of the frame and the effect of acceleration becomes irrelevant provided the game is fully decohered. It is shown that the inertial player always out scores the noninertial player by choosing defection. For maximally entangled initially state, we show that for fully decohered case every strategy profile results in either of the two possible equilibrium outcomes. Two of the four possible strategy profiles become Pareto Optimal and Nash equilibrium and no dilemma is leftover. It is shown that other equilibrium points emerge for different region of values of decoherence parameter that are either Pareto optimal or Pareto inefficient in the quantum strategic spaces. It is shown that the Eisert et al miracle move is a special move that leads always to distinguishable results compare to other moves. We show that the dilemma like situation is resolved in favor of one player or the other.Comment: 14 pages and 6 figure

Total Edge Irregularity Strength for Graphs

An edge irregular total $k$-labelling $f : V(G)\cup E(G)\rightarrow \{1,2,\dots,k\}$ of a graph $G$ is a labelling of the vertices and the edges of $G$ in such a way that any two different edges have distinct weights. The weight of an edge $e$, denoted by $wt(e)$, is defined as the sum of the label of $e$ and the labels of two vertices which incident with $e$, i.e. if $e=vw$, then $wt(e)=f(e)+f(v)+f(w)$. The minimum $k$ for which $G$ has an edge irregular total $k$-labelling is called the total edge irregularity strength of $G.$ In this paper, we determine total edge irregularity of connected and disconnected graphs