The reviewed record of science sign in
Pith

arxiv: 2201.07404 · v2 · pith:K6BF6VEB · submitted 2022-01-19 · eess.IV · cs.LG

Compressed Smooth Sparse Decomposition

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:K6BF6VEBrecord.jsonopen to challenge →

classification eess.IV cs.LG
keywords smoothsparseimagedecompositionmethodacquisitioncompresseddetection
0
0 comments X
read the original abstract

Image-based anomaly detection systems are of vital importance in various manufacturing applications. The resolution and acquisition rate of such systems is increasing significantly in recent years under the fast development of image sensing technology. This enables the detection of tiny defects in real-time. However, such a high resolution and acquisition rate of image data not only slows down the speed of image processing algorithms but also increases data storage and transmission cost. To tackle this problem, we propose a fast and data-efficient method with theoretical performance guarantee that is suitable for sparse anomaly detection in images with a smooth background (smooth plus sparse signal). The proposed method, named Compressed Smooth Sparse Decomposition (CSSD), is a one-step method that unifies the compressive image acquisition and decomposition-based image processing techniques. To further enhance its performance in a high-dimensional scenario, a Kronecker Compressed Smooth Sparse Decomposition (KronCSSD) method is proposed. Compared to traditional smooth and sparse decomposition algorithms, significant transmission cost reduction and computational speed boost can be achieved with negligible performance loss. Simulation examples and several case studies in various applications illustrate the effectiveness of the proposed framework.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.