It is still challenging to detect and locate anomalies by models trained only with normal samples. Methods using image reconstruction as a pretext task can provide precise localization but suffer from harnessing the reconstruction capability on unseen anomalies. This paper proposes a new framework of Multi-Task and Hard example Mining (MTHM) for anomaly detection and localization. The self-supervised multi-task setting creatively takes advantage of the competition among different tasks to learn more compact and efficient representations for detection tasks. Moreover, introducing other semantic tasks allows the shared encoder to learn beyond the pixel-to-pixel mapping of only a single image reconstruction task. Subsequent analysis experiments demonstrate that the proposed method can achieve a more suppressive reconstruction capability for anomalies. During the test process, the outputs of the other tasks can also provide valuable information for anomaly detection and localization. Furthermore, in combination with a novel hard example mining strategy, the byproducts of the image reconstruction task are inexpensively exploited as hard-to-detect samples for enhancing models’ detection ability. And as the model capability increases during training, the detection difficulty of these samples is able to increase adaptively. Our experiments show that hard samples generated in the later training stages can better approximate the real data distribution. With the help of the multi-task framework and hard example mining strategy, our method surpasses many state-of-the-art methods.
The performance of neural radiance field technologies deteriorates rapidly when sparse views are used as input. In this paper, we propose a simulated viewpoint enhancement for surface reconstruction that extracts diverse geometric features from the depth to address this limitation. We design a novel pseudo-view generation approach to simulate dense viewpoints, in which the RGB-D pairs are converted into new images corresponding to the translational poses through reprojection. To address potential holes in the pseudo-views resulting from occlusion in the reprojecting process, we propose a hole handling mechanism to exclude them during training. Additionally, normal information is derived from the depth, serving as supervision to enhance the scene geometry. Experiments conducted on various baseline models and datasets demonstrate that our algorithm effectively utilizes the inherent geometry embedded in the depth maps, leading to a significant improvement in the quality of 3D surface reconstruction compared to existing methods.
24 August 2023 in ACM Transactions on Multimedia Computing, Communications, and Applications
Real-time learning on real-world data streams with temporal relations is essential for intelligent agents. However, current online Continual Learning (CL) benchmarks adopt the mini-batch setting and are composed of temporally unrelated and disjoint tasks as well as pre-set class boundaries. In this paper, we delve into a real-world CL scenario for fresh recognition where algorithms are required to recognize a huge variety of products to facilitate the checkout speed. Products mainly consists of packaged cereals, seasonal fruits, and vegetables from local farms or shipped from overseas. Since algorithms process instance streams consisting of sequential images, we name this real-world CL problem as Instance-Based Continual Learning (IBCL) . Different from the current online CL setting, algorithms are required to perform instant testing and learning upon each incoming instance. Moreover, IBCL has no task boundaries or class boundaries and allows the evolution and the forgetting of old samples within each class. To promote the researches on real CL challenges, we propose the first real-world CL dataset coined the Continual Fresh Recognition (CFR) dataset, which consists of fresh recognition data streams (766 K labelled images in total) collected from 30 supermarkets. Based on the CFR dataset, we extensively evaluate the performance of current online CL methods under various settings and find that current prominent online CL methods operate at high latency and demand significant memory consumption to cache old samples for replaying. Therefore, we make the first attempt to design an efficient and effective Instant Training-Free Learning (ITFL) framework for IBCL. ITFL consists of feature extractors trained in the metric learning manner and reformulates CL as a temporal classification problem among several most similar classes. Unlike current online CL methods that cache image samples (150 KB per image) and rely on training to learn new knowledge, our framework only caches features (2 KB per image) and is free of training in deployment. Extensive evaluations across three datasets demonstrate that our method achieves comparable recognition accuracy to current methods with lower latency and less resource consumption. Our codes and datasets will be publicly available at https://github.com/detectRecog/IBCL .
Table structure recognition is a challenging task due to the various structures and complicated cell spanning relations. Previous methods handled the problem starting from elements in different granularities (rows/columns, text regions), which somehow fell into the issues like lossy heuristic rules or neglect of empty cell division. Based on table structure characteristics, we find that obtaining the aligned bounding boxes of text region can effectively maintain the entire relevant range of different cells. However, the aligned bounding boxes are hard to be accurately predicted due to the visual ambiguities. In this paper, we aim to obtain more reliable aligned bounding boxes by fully utilizing the visual information from both text regions in proposed local features and cell relations in global features. Specifically, we propose the framework of Local and Global Pyramid Mask Alignment, which adopts the soft pyramid mask learning mechanism in both the local and global feature maps. It allows the predicted boundaries of bounding boxes to break through the limitation of original proposals. A pyramid mask re-scoring module is then integrated to compromise the local and global information and refine the predicted boundaries. Finally, we propose a robust table structure recovery pipeline to obtain the final structure, in which we also effectively solve the problems of empty cells locating and division. Experimental results show that the proposed method achieves competitive and even new state-of-the-art performance on several public benchmarks.