Searcharxiv⌕ Search

arXiv subjects

Kittipat Apicharttrisorn

Publications and source records attributed to Kittipat Apicharttrisorn.

4 recordsLinked to original sources

Cloak of Invisibility: Real-Time Privacy-Preserving Volumetric Video Streaming

Volumetric video streaming turns privacy into a 3D, multi-view problem. Unlike ordinary video, where sensitive content can often be redacted frame by frame, RGB-D volumetric pipelines capture people, rooms, and personal objects from multiple cameras and fuse them into a shared 3D representation. A private object missed in one view, or only partially removed before fusion, can therefore reappear in the reconstructed scene. This creates a privacy challenge for 3D telepresence, education, entertainment, and immersive applications: private content should be removed before raw visual and geometric data leave the camera side, while the public part of the scene should remain useful for real-time reconstruction. Existing volumetric streaming systems mainly optimize reconstruction, data movement, and latency, while privacy-preserving vision methods are designed for single-camera, single-frame images and do not directly address calibrated multi-view RGB-D fusion. We present InViStream, a real-time "privacy-from-source" system designed for this setting. InViStream addresses three challenges in volumetric capture: private objects may appear differently across views, RGB masking alone can leave geometric privacy leakage in depth, and public/private instances of the same class must be separated consistently before cloud-side fusion. To address these challenges, InViStream combines object detection with depth-aware masking, propagates public/private decisions across calibrated views, and fuses only sanitized point clouds. We evaluate InViStream on synthetic and real RGB-D scenes, including offices, conference rooms, living rooms, and settings with multiple public and private people and objects. InViStream achieves synthetic Dice/Recall of 0.799/0.891 and real Dice/Recall of 0.792/0.908, with synthetic SSIM above 0.98 and real-time streaming above 30 FPS.

cs.CV↗

Stable Desynchronization for Wireless Sensor Networks: (I) Concepts and Algorithms

Desynchronization is one of the primitive services for complex networks because it arranges nodes to take turns accessing a shared resource. TDMA is a practical application of desynchronization because it allows node to share a common medium. In this paper, we propose a novel desynchronization algorithm using artificial force field called Multi-hop Desynchronization With an ARtificial Force field or M-DWARF and use it to solve TDMA problems in wireless sensor networks (WSNs). M-DWARF solves hidden terminal problems in multi-hop networks by using relative time relaying and improves resource utilization by employing force absorption. M-DWARF is suitable for use in WSNs because of its low complexity and autonomous operations. We implement M-DWARF using TinyOS and experiment it on both TelosB motes and TOSSIM. From our investigation, M-DWARF is the only desynchronization algorithm that achieves fast convergence with high stability, while maintaining channel utilization fairness. Moreover, we are the first to provide a stability analysis using dynamical systems and to prove that M-DWARF is stable at equilibrium. (This paper is the first part of the series Stable Desynchronization for Wireless Sensor Networks - (I) Concepts and Algorithms (II) Performance Evaluation (III) Stability Analysis)

cs.NI↗

Stable Desynchronization for Wireless Sensor Networks: (II) Performance Evaluation

In this paper, we evaluate M-DWARF performance by experimentation and simulation. We validate its functionalities on TelosB motes and compare its performance with EXT-DESYNC, and LIGHTWEIGHT on TOSSIM. On simulation, we test the algorithms on several multihop topologies and discuss both the average and problematic cases. In addition, we investigate the impacts of period length (T) and compare channel utilization fairness among the desynchronization algorithms. Finally, we propose a method to reduce desynchronization overhead. (This paper is the second part of the series Stable Desynchronization for Wireless Sensor Networks - (I) Concepts and Algorithms (II) Performance Evaluation (III) Stability Analysis)

cs.NI↗

Stable Desynchronization for Wireless Sensor Networks: (III) Stability Analysis

In this paper, we use dynamical systems to analyze stability of desynchronization algorithms at equilibrium. We start by illustrating the equilibrium of a dynamic systems and formalizing force components and time phases. Then, we use Linear Approximation to obtain Jaconian (J) matrixes which are used to find the eigenvalues. Next, we employ the Hirst and Macey theorem and Gershgorins theorem to find the bounds of those eigenvalues. Finally, if the number of nodes (n) is within such bounds, the systems are stable at equilibrium. (This paper is the last part of the series Stable Desynchronization for Wireless Sensor Networks - (I) Concepts and Algorithms (II) Performance Evaluation (III) Stability Analysis)

cs.NI↗