People search via deep compressed sensing techniques

Bing Xian Lu, Yu Chung Tsai, Kuo Shih Tseng

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


People search can be reformulated as submodular maximization problems to achieve solutions with theoretical guarantees. However, the number of submodular function outcome is from N sets. Compressing functions via nonlinear Fourier transform and spraying out sets are two ways to overcome this issue. This research proposed the submodular deep compressed sensing of convolutional sparse coding (SDCS-CSC) and applied the Topological Fourier Sparse Set (TFSS) algorithms to solve people search problems. The TFSS is based on topological and compressed sensing techniques, while the CSC is based on DCS techniques. Both algorithms enable an unmanned aerial vehicle to search for the people in environments. Experiments demonstrate that the algorithms can search for the people more efficiently than the benchmark approaches. This research also suggests how to select CSC or TFSS algorithms for different search problems.

Original languageEnglish
Pages (from-to)2320-2348
Number of pages29
Issue number7
StatePublished - 2 Jul 2022


  • deep compressed sensing
  • people search
  • submodularity
  • topology


Dive into the research topics of 'People search via deep compressed sensing techniques'. Together they form a unique fingerprint.

Cite this