arXiv subjects

Sora Choi

Publications and source records attributed to Sora Choi.

5 recordsLinked to original sources

arXiv2018

Fusion of Correlated Decisions Using Regular Vine Copulas

In this paper, we propose a regular vine copula based methodology for the fusion of correlated decisions. Regular vine copula is an extremely flexible and powerful graphical model to characterize complex dependence among multiple modalities. It can express a multivariate copula by using a cascade of bivariate copulas, the so-called pair copulas. Assuming that local detectors are single threshold binary quantizers and taking complex dependence among sensor decisions into account, we design an optimal fusion rule using a regular vine copula under the Neyman-Pearson framework. In order to reduce the computational complexity resulting from the complex dependence, we propose an efficient and computationally light regular vine copula based optimal fusion algorithm. Numerical experiments are conducted to demonstrate the effectiveness of our approach.

eess.SP↗

arXiv2015

Sensor Selection for Target Tracking in Wireless Sensor Networks with Uncertainty

In this paper, we propose a multiobjective optimization framework for the sensor selection problem in uncertain Wireless Sensor Networks (WSNs). The uncertainties of the WSNs result in a set of sensor observations with insufficient information about the target. We propose a novel mutual information upper bound (MIUB) based sensor selection scheme, which has low computational complexity, same as the Fisher information (FI) based sensor selection scheme, and gives estimation performance similar to the mutual information (MI) based sensor selection scheme. Without knowing the number of sensors to be selected a priori, the multiobjective optimization problem (MOP) gives a set of sensor selection strategies that reveal different trade-offs between two conflicting objectives: minimization of the number of selected sensors and minimization of the gap between the performance metric (MIUB and FI) when all the sensors transmit measurements and when only the selected sensors transmit their measurements based on the sensor selection strategy. Illustrative numerical results that provide valuable insights are presented.

eess.SY↗

arXiv2004

Quantum key distribution between two groups using secret sharing

In this paper, we investigate properties of some multi-particle entangled states and, from the properties applying the secret sharing present a new type of quantum key distribution protocols as generalization of quantum key distribution between two persons. In the protocols each group can retrieve the secure key string, only if all members in each group should cooperate with one another. We also show that the protocols are secure against an external eavesdropper using the intercept/resend strategy.

quant-ph↗

arXiv2004

Secure quantum cryptographic network based on quantum key distribution

We present a protocol for quantum cryptographic network consisting of a quantum network center and many users, in which any pair of parties with members chosen from the whole users on request can secure a quantum key distribution by help of the center. The protocol is based on the quantum authentication scheme given by Barnum et al. [Proc. 43rd IEEE Symp. FOCS'02, p. 449 (2002)]. We show that exploiting the quantum authentication scheme the center can safely make two parties share nearly perfect entangled states used in the quantum key distribution. This implies that the quantum cryptographic network protocol is secure against all kinds of eavesdropping.

quant-ph↗

arXiv2003

Faithful sharing of multipartite entanglement over noisy quantum channels

We present a protocol in which two or more parties can share multipartite entanglement over noisy quantum channels. The protocol is based on the entanglement purification presented by Shor and Preskill [Phys. Rev. Lett. 85, 441 (2000)] and the quantum teleportation via an isotropic state. We show that a nearly perfect purification implies a nearly perfect sharing of multipartite entanglement between two parties so that the protocol can assure a faithful sharing of multipartite entanglement with Shor and Preskill's proof on the entanglement purification.

quant-ph↗