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

A New Method of Shredded Paper image Stitching and Restoration 3

学校读者我要写书评

暂无评论

A New Method of Shredded Paper Image Stitching and Restorati...

3rd International Conference on Industrial Informatics - Computing Technology, Intelligent Technology, Industrial Information Integration, ICIICII 2017

作者： Pan, Zixiao Wang, Mei School of Automation Wuhan University of Technology Wuhan China Laboratory of Image Processing and Pattern Recognition Yantai Vocational College Yan China

ISBN: (纸本)9781538624340

For the image restoration problem of shredded paper broken by shredder with the same marginal feature, a new method based on spatial feature classification is proposed in this paper. Because no obvious marginal feature for rule shredder paper can be used to split, the feature similarity classification processing can greatly reduce the solution scale and improve the algorithm efficiency. The horizontal projection position of shredded paper image can be used to distinguish the same line for the shredded paper with words. Then the marginal moment invariants distance are defined by the left and right part spatial correlation information. The original order of adjacent shredded paper in the same line can be ensured by the minimum marginal distance. Similarly ordering up and down can be completed by the minimum marginal distance among up-down part stitching images. For the image stitching and restoration of large-scale rule shredded paper, the actual experimental result shows the good stability, efficiency and strong robustness. © 2017 IEEE.

关键词： Restoration

Camera Abnormal Movement and Foreign Object Invasion Detection Based on Cumulative Edge Distribution Probability Model

学校读者我要写书评

暂无评论

Camera Abnormal Movement and Foreign Object Invasion Detecti...

2018 International Conference on Security, pattern Analysis, and Cybernetics, SPAC 2018

作者： Yu, Xiangru Cai, Fudong Dou, Yimin Li, Jinping Institute of Pattern Recognition and Intelligent System School of Information Science and Engineering University of Jinan Jinan China Shandong Provincial Key Laboratory of Network Based Intelligent Computing Jinan China Shandong College University Key Laboratory of Information Processing and Cognitive Computing in 13th Five-year University of Jinan Jinan China Shandong Senter Electronic Co. Ltd Zibo China

ISBN: (纸本)9781728105512

In practice, there often exist some occasions where video surveillance can only be realized by using rechargeable batteries due to the high cost of power supply. In order to extend the battery life, images can only be taken at a certain interval. Obviously, image difference is an important method to obtain various changes in this case. Among these changes, foreign invasion is one of the focuses. However, due to bolt shedding, abnormal weather and other factors, the camera may have abnormal movement which may seriously affect the detection effect of image difference method. Therefore, it is an urgent issue to find an effective way to detect the abnormal movement of camera and improve the detection accuracy of foreign invasion. Considering the characteristics of this kind of image sequences, we propose an effective algorithm to detect the camera abnormal movement and foreign object invasion based on a cumulative edge distribution probability model. Since sky region is relatively simple, we only discuss changes in sky region to detect camera abnormal movement. Our algorithm has 6 basic steps: firstly, segment the sky region;secondly, extract the edge information of the current image and the preceding adjacent image in the image sequence;thirdly, determine if the edge information of two adjacent images coincide. If consistent, then go to the next step, otherwise, it indicates that the camera has abnormal movement, then alarm;fourthly, calculate the cumulative edge probability distribution model in the sky region by using the historical image sequence;fifthly, by using adaptive Parzen window, determine if foreign object invasion exists by comparing the probability model of cumulative edge distribution with edge distribution of the current image;sixthly, update the cumulative edge distribution probability model in sky region. The algorithm achieves good results in practical applications. Through the test of thousands of images taken in the wild, the detection accuracy of

关键词： Cameras

CNN-based invertible wavelet scattering for the investigation of diffusion properties of the in vivo human heart in diffusion tensor imaging

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Deng, Zeyu Wang, Lihui Kuai, Zixiang Chen, Qijian Cheng, Xinyu Yang, Feng Yang, Jie Zhu, Yuemin Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province College of Computer Science and Technology Guizhou University Guiyang550025 China Imaging Center Harbin Medical University Cancer Hospital Harbin150081 China School of Computer and Information Technology Beijing Jiaotong University Beijing100044 China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China University Lyon INSA Lyon CNRS Inserm IRP Metislab CREATIS UMR5220 U1206 LyonF-69621 France

In vivo diffusion tensor imaging (DTI) is a promising technique to investigate noninvasively the fiber structures of the in vivo human heart. However, signal loss due to motions remains a persistent problem in in vivo cardiac DTI. We propose a novel motion-compensation method for investigating in vivo myocardium structures in DTI with free-breathing acquisitions. The method is based on an invertible Wavelet Scattering achieved by means of Convolutional Neural Network (WSCNN). It consists of first extracting translation-invariant wavelet scattering features from DW images acquired at different trigger delays and then mapping the fused scattering features into motion-compensated spatial DW images by performing an inverse wavelet scattering transform achieved using CNN. The results on both simulated and acquired in vivo cardiac DW images showed that the proposed WSCNN method effectively compensates for motion-induced signal loss and produces in vivo cardiac DW images with better quality and more coherent fiber structures with respect to existing methods, which makes it an interesting method for measuring correctly the diffusion properties of the in vivo human heart in DTI under free breathing. Copyright © 2019, The Authors. All rights reserved.

关键词： Diffusion tensor imaging

Forecast of Traffic Vehicle Demand Based on AHP Decision Model

学校读者我要写书评

暂无评论

Journal of Physics: Conference Series 2020年第1期1670卷

作者： Jie Xia Jintao Tan Li Li Musong Gu College of Information Science and Technology Chengdu University Chengdu China School of Electronic Science and Engineering University of Electronic Science and Technology of China Chengdu China Key Laboratory of Pattern Recognition and Intelligent Information Processing Institutions of Higher Education of Sichuan Province Chengdu University Chengdu China

The development of high technology has driven the rapid growth of civil aviation passenger demand. However, most current studies ignore the impact of increased passenger traffic on ground vehicle demand. This paper studies the demand forecast of transportation vehicles in a specific environment. Taxis are under huge service pressure when faced with the characteristics of irregular time distribution and high dynamics. After the taxi driver escorts the passenger to the airport, it is a big problem whether to leave without a load or go to the car pool. This paper uses Analytic Hierarchy Process (AHP) to construct a judgment matrix, establishes an airport taxi demand forecast model based on the best interests. Taking the status of taxi operation in Kunming Changshui International Airport as an example, the results show that the model can predict taxi demand more accurately and has practical guidance significance. Compared with traditional schemes, it is more conducive to improving driver's income.

关键词：

Optimized hidden markov model based on constrained particle swarm optimization

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Chang, Liu Ouzrout, Yacine Nongaillard, Antoine Bouras, Abdelaziz Jiliu, Zhou DISP Laboratory University Lumiere of Lyon 2 France Key Laboratory of Pattern Recognition and Intelligent Information Processing in Sichuan China College of Information Science and Technology Chengdu University Chengdu China

As one of Bayesian analysis tools, Hidden Markov Model (HMM) has been used to in extensive applications. Most HMMs are solved by Baum-Welch algorithm (BWHMM) to predict the model parameters, which is difficult to find global optimal solutions. This paper proposes an optimized Hidden Markov Model with Particle Swarm Optimization (PSO) algorithm and so is called PSOHMM. In order to overcome the statistical constraints in HMM, the paper develops re-normalization and re-mapping mechanisms to ensure the constraints in HMM. The experiments have shown that PSOHMM can search better solution than BWHMM, and has faster convergence speed. Copyright © 2018, The Authors. All rights reserved.

关键词： Hidden Markov models

A FAST RADIO BURST DISCOVERED IN FAST DRIFT SCAN SURVEY

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zhu, Weiwei Li, Di Luo, Rui Miao, Chenchen Zhang, Bing Spitler, Laura Lorimer, Duncan Kramer, Michael Champion, David Yue, Youling Cameron, Andrew Cruces, Marilyn Duan, Ran Feng, Yi Han, Jun Hobbs, George Niu, Chenhui Niu, Jiarui Pan, Zhichen Qian, Lei Shi, Dai Tang, Ningyu Wang, Pei Wang, Hongfeng Yuan, Mao Zhang, Lei Zhang, Xinxin Cao, Shuyun Feng, Li Gan, Hengqian Gao, Long Gu, Xuedong Guo, Minglei Hao, Qiaoli Huang, Lin Huang, Menglin Jiang, Peng Jin, Chengjin Li, Hui Li, Qi Li, Qisheng Liu, Hongfei Pan, Gaofeng Peng, Bo Qian, Hui Shi, Xiangwei Song, Jinyuo Song, Liqiang Sun, Caihong Sun, Jinghai Wang, Hong Wang, Qiming Wang, Yi Xie, Xiaoyao Yan, Jun Yang, Li Yang, Shimo Yao, Rui Yu, Dongjun Yu, Jinglong Zhang, Chengmin Zhang, Haiyan Zhang, Shuxin Zheng, Xiaonian Zhou, Aiying Zhu, Boqin Zhu, Lichun Zhu, Ming Zhu, Wenbai Zhu, Yan CAS Key Laboratory of FAST NAOC Chinese Academy of Sciences Beijing100101 China University of Chinese Academy of Sciences Beijing100049 China CSIRO Astronomy and Space Science PO Box 76 EppingNSW1710 Australia Department of Physics and Astronomy University of Nevada Las Vegas Las VegasNV89154 United States National Astronomical Observatories Chinese Academy of Sciences Beijing100012 China Max-Planck-Institut fr Radioastronomie Auf dem Hgel 69 BonnD-53121 Germany Department of Physics and Astronomy West Virginia University P.O. Box 6315 MorgantownWV26506 United States Center for Gravitational Waves and Cosmology Chestnut Ridge Research Building MorgantownWV26505 United States Image Processing and Pattern Recognition Laboratory School of Artificial Intelligence Beijing Normal University Beijing100875 China School of Information Management Dezhou University Dezhou253023 China Institute for Astronomical Science Dezhou University Dezhou253023 China

We report the discovery of a highly dispersed fast radio burst, FRB 181123, from an analysis of ∼1500 hr of drift-scan survey data taken using the Five-hundred-meter Aperture Spherical radio Telescope (FAST). The pulse has three distinct emission components, which vary with frequency across our 1.0–1.5 GHz observing band. We measure the peak flux density to be > 0.065 Jy and the corresponding fluence > 0.2 Jy ms. Based on the observed dispersion measure of 1812 cm−3 pc, we infer a redshift of ∼ 1.9. From this, we estimate the peak luminosity and isotropic energy to be . 2 × 1043 erg s−1 and . 2 × 1040 erg, respectively. With only one FRB from the survey detected so far, our constraints on the event rate are limited. We derive a 95% confidence lower limit for the event rate of 900 FRBs per day for FRBs with fluences > 0.025 Jy ms. We performed follow-up observations of the source with FAST for four hours and have not found a repeated burst. We discuss the implications of this discovery for our understanding of the physical mechanisms of FRBs. Copyright © 2020, The Authors. All rights reserved.

关键词： Surveys

Fast signal recovery from saturated measurements by linear loss and nonconvex penalties

学校读者我要写书评

暂无评论

arXiv 2018年

作者： He, Fan Huang, Xiaolin Liu, Yipeng Yan, Ming Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University The MOE Key Laboratory of System Control and Information Processing Shanghai200240 China School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu611731 China The Department of Computational Mathematics Science and Engineering Michigan State University MI United States

Sign information is the key to overcoming the inevitable saturation error in compressive sensing systems, which causes information loss and results in bias. For sparse signal recovery from saturation, we propose to use a linear loss to improve the effectiveness from existing methods that utilize hard constraints/hinge loss for sign consistency. Due to the use of linear loss, an analytical solution in the update progress is obtained, and some nonconvex penalties are applicable, e.g., the minimax concave penalty, the 0 norm, and the sorted 1 norm. Theoretical analysis reveals that the estimation error can still be bounded. Generally, with linear loss and nonconvex penalties, the recovery performance is significantly improved, and the computational time is largely saved, which is verified by the numerical experiments. Copyright © 2018, The Authors. All rights reserved.

关键词： Compressed sensing

Oracle Character recognition by Nearest Neighbor Classification with Deep Metric Learning

学校读者我要写书评

暂无评论

Oracle Character Recognition by Nearest Neighbor Classificat...

International Conference on Document Analysis and recognition

作者： Yi-Kang Zhang Heng Zhang Yong-Ge Liu Qing Yang Cheng-Lin Liu National Laboratory of Pattern Recognition Chinese Academy of Sciences Beijing P.R. China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing P.R. China School of Computer & Information Engineering Anyang Normal University Henan P.R. China Ministry of Education Key Laboratory of Oracle Bone Inscriptions Information Processing Henan P.R. China CAS Center for Excellence of Brain Science and Intelligence Technology Beijing P.R. China

Oracle character is one kind of the earliest hieroglyphics, which can be dated back to Shang Dynasty in China. Oracle character recognition is important for modern archaeology, ancient text understanding, and historical chronology, etc. To overcome the limitation and class imbalance of training data in oracle character recognition, we propose a classification method based on deep metric learning. We use a convolutional neural network (CNN) to map the character images to an Euclidean space where the distance between different samples can measure their similarities such that classification can be performed by the Nearest Neighbor (NN) rule. Because new categories are still being discovered in reality, our model enables the rejection of unseen categories and the configuration of new categories. To accelerate NN classification, we also propose a prototype pruning method with little loss of accuracy. The proposed method exceeds the state of the art on the public dataset Oracle-20K and outperforms CNN with softmax layer on a new dataset Oracle-AYNU.

关键词： Prototypes Character recognition Measurement Artificial neural networks Training Acceleration Network architecture

Learning data-adaptive nonparametric kernels

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Liu, Fanghui Huang, Xiaolin Gong, Chen Yang, Jie Li, Li Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Department of Automation Tsinghua University

Kernel methods have been extensively used in a variety of machine learning tasks such as classification, clustering, and dimensionality reduction. For complicated practical tasks, the traditional kernels, e.g., Gaussian kernel and sigmoid kernel, or their combinations are often not sufficiently flexible to fit the data. In this paper, we present a Data-Adaptive Nonparametric Kernel (DANK) learning framework in a data-driven manner. To be specific, in model formulation, we impose an adaptive matrix on the kernel/Gram matrix in an entry-wise strategy. Since we do not specify the formulation of the adaptive matrix, each entry in the adaptive matrix can be directly and flexibly learned from the data. Therefore, the solution space of the learned kernel is largely expanded, which makes our DANK model flexible to capture the data with different local statistical properties. Specifically, the proposed kernel learning framework can be seamlessly embedded to support vector machines (SVM) and support vector regression (SVR), which has the capability of enlarging the margin between classes and reducing the model generalization error. Theoretically, we demonstrate that the objective function of our DANK model embedded in SVM/SVR is gradient-Lipschitz continuous. Thereby, the training process for kernel and parameter learning in SVM/SVR can be efficiently optimized in a unified framework. Further, to address the scalability issue in nonparametric kernel learning framework, we decompose the entire optimization problem in DANK into several smaller easy-to-solve problems, so that our DANK model can be efficiently approximated by this partition. The effectiveness of this approximation is demonstrated by both empirical studies and theoretical guarantees. Experimentally, the proposed DANK model embedded in SVM/SVR achieves encouraging performance on various classification and regression benchmark datasets when compared with other representative kernel learning based algorithms. Copyrig

关键词： Matrix algebra