11 October 2022 in IEEE Transactions on Image Processing
Referring Expression Comprehension (REC) aims to localize an image region of a given object described by a natural-language expression. While promising performance has been demonstrated, existing REC algorithms make a strong assumption that training data feeding into a model are given upfront, which degrades its practicality for real-world scenarios. In this paper, we propose Continual Referring Expression Comprehension (CREC), a new setting for REC, where a model is learning on a stream of incoming tasks. In order to continuously improve the model on sequential tasks without forgetting prior learned knowledge and without repeatedly re-training from a scratch, we propose an effective baseline method named Dual Modular Memorization (DMM), which alleviates the problem of catastrophic forgetting by two memorization modules: Implicit-Memory and Explicit-Memory. Specifically, the former module aims to constrain drastic changes to important parameters learned on old tasks when learning a new task; while the latter module maintains a buffer pool to dynamically select and store representative samples of each seen task for future rehearsal. We create three benchmarks for the new CREC setting, by respectively re-splitting three widely-used REC datasets RefCOCO, RefCOCO+ and RefCOCOg into sequential tasks. Extensive experiments on the constructed benchmarks demonstrate that our DMM method significantly outperforms other alternatives, based on two popular REC backbones. We make the source code and benchmarks publicly available to foster future progress in this field: https://github.com/zackschen/DMM.
6 December 2011 in Procedia Engineering
LZW algorithm is adopted in this paper to compress the bridge vibration data. Based on the data structure of chained lists, an improved version of the algorithm, in which a new method called forward-moving on frequently-used entries is applied, is implemented and optimized. It can be drawn that using the above-mentioned method can effectively improve the searching speed and save compression time. In addition, optimizing the location of forward-moved frequently-used entries and selecting the appropriate statistical frequency have better optimization effects. Finally, implemented with C language, the algorithm is proved to have high compression efficiency with less time cost in the practical compression of bridge vibration data.
8 January 2022 in Frontiers of Computer Science
15 July 2025 in Pattern Recognition