检索结果-内蒙古大学图书馆

An Image-Sequence Compressing Algorithm Based on Homography Transformation for Unmanned Aerial Vehicle

学校读者我要写书评

暂无评论

An Image-Sequence Compressing Algorithm Based on Homography ...

International Symposium on Intelligence Information Processing and Trusted Computing (IPTC)

作者： Junbin Gong Chenlin Zheng Jinwen Tian Dingxue Wu Institute for Pattern Recognition and Artificial Intelligence National key laboratory of science and technology on multi-spectral information processing Huazhong University of Science and Technology Wuhan China College of Computer Science and Technology Huanggang Normal University Huangang China

Focus on the image compressing problem of unmanned aerial vehicle with high compression ratio, fixed compressing ratio and low computational complexity requirement, a low-complexity image-sequence compressing algorithm based on homography transformation was proposed. The image sequences were dynamically divided into frame-groups according the data from airborne inertial navigation systems, and the intermediate frames in the same frame-group was b i-directionally predicted by the first-frame and the end-frame with homography transformation. The homography matrix was got approximately by the airborne inertial navigation systems firstly and then was accurately computed by fast multiple sub-areas template matching. At the end the first frame and the residual images of the intermediate frames of the same frame-group was merged into a big image and coded by JPEG2000 to generate fixed-size code streams. The experiment results show that the proposed algorithm was with high compression performance, low computational complexity and excellent capacity for code-size control and will has good prospect in engineer.

关键词： Image coding Unmanned aerial vehicles Cameras Transform coding Image restoration Image sequences Heuristic algorithms

FWLBP: A scale invariant descriptor for texture classification

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Roy, Swalpa Kumar Bhattacharya, Nilavra Chanda, Bhabatosh Chaudhuri, Bidyut B. Ghosh, Dipak Kumar Optical Character Recognition Laboratory Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata700108 India School of Information University of Texas AustinTX78712 United States Image Processing Laboratory Electronics and Communication Sciences Unit Indian Statistical Institute Kolkata700108 India Department of Electronics and Communication Engineering National Institute of Technology Rourkela Rourkela769008 India

In this paper we propose a novel texture descriptor called Fractal Weighted Local Binary pattern (FWLBP). The fractal dimension (FD) measure is relatively invariant to scale-changes, and presents a good correlation with human viewpoint of surface roughness. We have utilized this property to construct a scale-invariant descriptor. Here, the input image is sampled using an augmented form of the local binary pattern (LBP) over three different radii, and then used an indexing operation to assign FD weights to the collected samples. The final histogram of the descriptor has its features calculated using LBP, and its weights computed from the FD image. The proposed descriptor is scale invariant, and is also robust in rotation or reflection, and partially tolerant to noise and illumination changes. In addition, the local fractal dimension is relatively insensitive to the bi-Lipschitz transformations, whereas its extension is adequate to precisely discriminate the fundamental of texture primitives. Experiment results carried out on standard texture databases show that the proposed descriptor achieved better classification rates compared to the state-of-the-art descriptors. Copyright © 2018, The Authors. All rights reserved.

关键词： Fractal dimension

A new unified method for detecting text from marathon runners and sports players in video

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Nag, Sauradip Shivakumara, Palaiahnakote Pal, Umapada Lu, Tong Blumenstein, Michael Kalyani Government Engineering College Kalyani Kolkata India Faculty of Computer Science and Information Technology University of Malaya Kuala Lumpur Malaysia Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata India National Key Lab for Novel Software Technology Nanjing University Nanjing China Sydney Australia

Detecting text located on the torsos of marathon runners and sports players in video is a challenging issue due to poor quality and adverse effects caused by flexible/colorful clothing, and different structures of human bodies or actions. This paper presents a new unified method for tackling the above challenges. The proposed method fuses gradient magnitude and direction coherence of text pixels in a new way for detecting candidate regions. Candidate regions are used for determining the number of temporal frame clusters obtained by K-means clustering on frame differences. This process in turn detects key frames. The proposed method explores Bayesian probability for skin portions using color values at both pixel and component levels of temporal frames, which provides fused images with skin components. Based on skin information, the proposed method then detects faces and torsos by finding structural and spatial coherences between them. We further propose adaptive pixels linking a deep learning model for text detection from torso regions. The proposed method is tested on our own dataset collected from marathon/sports video and three standard datasets, namely, RBNR, MMM and R-ID of marathon images, to evaluate the performance. In addition, the proposed method is also tested on the standard natural scene datasets, namely, CTW1500 and MS-COCO text datasets, to show the objectiveness of the proposed method. A comparative study with the state-of-the-art methods on bib number/text detection of different datasets shows that the proposed method outperforms the existing methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Pixels

NORPPA: NOvel Ringed seal re-identification by Pelage pattern Aggregation

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Nepovinnykh, Ekaterina Chelak, Ilia Eerola, Tuomas Kälviäinen, Heikki Computer Vision and Pattern Recognition Laboratory Department of Computational Engineering School of Engineering Science Lappeenranta-Lahti University of Technology Lut P.O.Box 20 Lappeenranta53851 Finland Department of Computer Science Faculty of Science University of Helsinki P.O. Box 4 Helsinki00100 Finland

We propose a method for Saimaa ringed seal (Pusa hispida saimensis) re-identification. Access to large image volumes through camera trapping and crowdsourcing provides novel possibilities for animal monitoring and conservation and calls for automatic methods for analysis, in particular, when re-identifying individual animals from the images. The proposed method NOvel Ringed seal re-identification by Pelage pattern Aggregation (NORPPA) utilizes the permanent and unique pelage pattern of Saimaa ringed seals and content-based image retrieval techniques. First, the query image is preprocessed, and each seal instance is segmented. Next, the seal's pelage pattern is extracted using a U-net encoder-decoder based method. Then, CNN-based affine invariant features are embedded and aggregated into Fisher Vectors. Finally, the cosine distance between the Fisher Vectors is used to find the best match from a database of known individuals. We perform extensive experiments of various modifications of the method on a new challenging Saimaa ringed seals re-identification dataset. The proposed method is shown to produce the best re-identification accuracy on our dataset in comparisons with alternative approaches. © 2022, CC BY-NC-ND.

关键词： Animals

Modified lifting algorithm and VLSI architecture for the 9/7 wavelet filters

学校读者我要写书评

暂无评论

Modified lifting algorithm and VLSI architecture for the 9/7...

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Chen-Gyi Xiong Zhi-Rong Gao Jin-Wen Tian Jian Liu The State Key Laboratory of Education Commission for Image Processing and Intelligent Control Institute of Pattern Recognition & Artificial Intelligence Huazhong University of Science and Technology Wuhan China Department of Computer Science Wuhan University of Science and Engineering Hebei China

ISBN: (纸本)0780384032

A new parallel-based lifting algorithm (PBLA) for the 9/7 filters, exploring the parallelism of arithmetic operations in each lifting step, was proposed in this paper. It shortened significantly the critical path of computation, and resulted in a fast VLSI implementation architecture. In comparison with the conventional lifting algorithm based implementation (CLABI), the latency is reduced by more than half from (4T/sub m/ + 8T/sub a/) to (T/sub m/ + 4T/sub a/), which is competitive to that of convolution based implementation CBI, and can be further reduced to Tm by inserting 3 stages of pipeline. The experimental results demonstrate that the proposed architecture has good performances in both speed and area.

关键词： Very large scale integration Discrete wavelet transforms Filters Image coding Delay Parallel processing Arithmetic Convolution Hardware Transform coding

Self-slimmed vision Transformer

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zong, Zhuofan Li, Kunchang Song, Guanglu Wang, Yali Qiao, Yu Leng, Biao Liu, Yu School of Computer Science and Engineering Beihang University China SenseTime Research China ShenZhen Key Lab of Computer Vision and Pattern Recognition SIAT-SenseTime Joint Lab Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China SIAT Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society China Shanghai AI Laboratory China

vision transformers (ViTs) have become the popular structures and outperformed convolutional neural networks (CNNs) on various vision tasks. However, such powerful transformers bring a huge computation burden, because of the exhausting token-to-token comparison. The previous works focus on dropping insignificant tokens to reduce the computational cost of ViTs. But when the dropping ratio increases, this hard manner will inevitably discard the vital tokens, which limits its efficiency. To solve the issue, we propose a generic self-slimmed learning approach for vanilla ViTs, namely SiT. Specifically, we first design a novel Token Slimming Module (TSM), which can boost the inference efficiency of ViTs by dynamic token aggregation. As a general method of token hard dropping, our TSM softly integrates redundant tokens into fewer informative ones. It can dynamically zoom visual attention without cutting off discriminative token relations in the images, even with a high slimming ratio. Furthermore, we introduce a concise Feature Recalibration Distillation (FRD) framework, wherein we design a reverse version of TSM (RTSM) to recalibrate the unstructured token in a flexible auto-encoder manner. Due to the similar structure between teacher and student, our FRD can effectively leverage structure knowledge for better convergence. Finally, we conduct extensive experiments to evaluate our SiT. It demonstrates that our method can speed up ViTs by 1.7× with negligible accuracy drop, and even speed up ViTs by 3.6× while maintaining 97% of their performance. Surprisingly, by simply arming LV-ViT with our SiT, we achieve new state-of-the-art performance on ImageNet. Code is available at https://***/Sense-X/SiT. © 2021, CC BY.

关键词： Distillation

A Survey on Cross-Lingual Summarization

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wang, Jiaan Meng, Fandong Zheng, Duo Liang, Yunlong Li, Zhixu Qu, Jianfeng Zhou, Jie School of Computer Science and Technology Soochow University Suzhou China Pattern Recognition Center WeChat AI Tencent Inc China Shanghai Key Laboratory of Data Science School of Computer Science Fudan University Shanghai China Beijing University of Posts and Telecommunications Beijing China

Cross-lingual summarization is the task of generating a summary in one language (e.g., English) for the given document(s) in a different language (e.g., Chinese). Under the globalization background, this task has attracted increasing attention of the computational linguistics community. Nevertheless, there still remains a lack of comprehensive review for this task. Therefore, we present the first systematic critical review on the datasets, approaches, and challenges in this field. Specifically, we carefully organize existing datasets and approaches according to different construction methods and solution paradigms, respectively. For each type of datasets or approaches, we thoroughly introduce and summarize previous efforts and further compare them with each other to provide deeper analyses. In the end, we also discuss promising directions and offer our thoughts to facilitate future research. This survey is for both beginners and experts in cross-lingual summarization, and we hope it will serve as a starting point as well as a source of new ideas for researchers and engineers interested in this area. Copyright © 2022, The Authors. All rights reserved.

关键词： Surveys

Adaptive kernel principal analysis for online feature extraction

学校读者我要写书评

暂无评论

World Academy of Science, Engineering and Technology 2009年 59卷 288-293页

作者： Ding, Mingtao Tian, Zheng Xu, Haixia Department of Science Northwestern Polytechnical University Xi'an China Department of Science Department of Computer Science and Engineering Northwestern Polytechnical University Xi'an China National Key Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing China Department of Computer Science and Engineering Northwestern Polytechnical University Xi'an China

The batch nature limits the standard kernel principal component analysis (KPCA) methods in numerous applications, especially for dynamic or large-scale data. In this paper, an efficient adaptive approach is presented for online extraction of the kernel principal components (KPC). The contribution of this paper may be divided into two parts. First, kernel covariance matrix is correctly updated to adapt to the changing characteristics of data. Second, KPC are recursively formulated to overcome the batch nature of standard *** formulation is derived from the recursive eigen-decomposition of kernel covariance matrix and indicates the KPC variation caused by the new data. The proposed method not only alleviates sub-optimality of the KPCA method for non-stationary data, but also maintains constant update speed and memory usage as the data-size increases. Experiments for simulation data and real applications demonstrate that our approach yields improvements in terms of both computational speed and approximation accuracy.

关键词： Covariance matrix

Fine-grained image classification using color exemplar classifiers

学校读者我要写书评

暂无评论

Fine-grained image classification using color exemplar class...

14th Pacific-Rim Conference on Multimedia, PCM 2013

作者： Zhang, Chunjie Xiong, Wei Liu, Jing Zhang, Yifan Liang, Chao Huang, Qingming School of Computer and Control Engineering University of Chinese Academy of Sciences 100049 Beijing China National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences P.O. Box 2728 Beijing China National Engineering Research Center for Multimedia Software Wuhan University 430072 Wuhan China Key Lab of Intell. Info. Process Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9783319037301

The use of local features has demonstrated its effectiveness for many visual applications. However, local features are often extracted with gray images. This ignores the useful information within different color channels which eventually hinders the final performance, especially for fine-grained image classification. Besides, the semantic information of local features is too weak to be applied for high-level visual applications. To cope with these problems, in this paper, we propose a novel fine-grained image classification method by using color exemplar classifiers. For each image, we first decompose it into multiple color channels to take advantage of the color information. For each color channel, we represent each image with a response histogram which is generated by exemplar classifiers. Experiments on several public image datasets demonstrate the effectiveness of the proposed color exemplar classifier based image classification method. © Springer International Publishing Switzerland 2013.

关键词： Image classification