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

Semi-supervised classification method of SAR images using spectral clustering in contourlet domain

学校读者我要写书评

暂无评论

Journal of Physics: Conference Series 2020年第4期1486卷

作者： Kaiwen Jiang Degan Zhang Haixia Xu Key Laboratory of Computer Vision and System (Tianjin University of Technology) Ministry of Education 300384 China Tianjin Key Lab of Intelligent Computing & Novel software Technology Tianjin University of Technology Tianjin China School of Electronic and Information Engineering Tianjin Vocational Institute Tianjin 300410 China

A new based on Semi-supervised classification theory for SAR images in contourlet domain is proposed, in this paper. Attempting to get better and faster performance, the PSO algorithm (Particle swarm optimization algorithm) and contourlet domain is proposed to instead of traditional k-means algorithm. PSO is used to find the global optimum by performing a global search in the whole solution space. And then, contourlet is applied in front of construct the similarity matrix to extract more effective eigenvalues. In section five, the proposed algorithm got better classification results than the traditional k-means algorithm which is proved by experimental results show that in terms of running time, classification accuracy and Kappa coefficient.

关键词：

NTIRE 2020 Challenge on Image and Video Deblurring

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Seungjun, Nah Sanghyun, Son Radu, Timofte Kyoung Mu, Lee Tseng, Yu Xu, Yu-Syuan Chiang, Cheng-Ming Tsai, Yi-Min Brehm, Stephan Scherer, Sebastian Xu, Dejia Chu, Yihao Sun, Qingyan Jiang, Jiaqin Duan, Lunhao Yao, Jian Purohit, Kuldeep Suin, Maitreya Rajagopalan, A.N. Ito, Yuichi Hrishikesh, P.S. Puthussery, Densen Akhil, K.A. Jiji, C.V. Kim, Guisik Deepa, P.L. Xiong, Zhiwei Huang, Jie Liu, Dong Kim, Sangmin Nam, Hyungjoon Kim, Jisu Jeong, Jechang Huang, Shihua Fan, Yuchen Yu, Jiahui Yu, Haichao Huang, Thomas S. Zhou, Ya Li, Xin Liu, Sen Chen, Zhibo Dutta, Saikat Das, Sourya Dipta Garg, Shivam Sprague, Daniel Patel, Bhrij Huck, Thomas Department of ECE ASRI SNU Korea Republic of Computer Vision Lab ETH Zurich Switzerland MediaTek Inc University of Augsburg Chair for Multimedia Computing and Computer Vision Lab Germany Peking University China Beijing University of Posts and Telecommunications China Beijing Jiaotong University China Wuhan University China Indian Institute of Technology Madras India Vermilion College of Engineering Trivandrum India CVML Chung-Ang University Korea Republic of APJ Abdul Kalam Technological University India University of Science and Technology of China China Image Communication Signal Processing Laboratory Hanyang University Korea Republic of Southern University of Science and Technology China University of Illinois at Urbana-Champaign United States CAS Key Laboratory of Technology in Geo-Spatial Information Processing and Application System University of Science and Technology of China China IIT Madra Jadavpur University India University of Texas Austin United States Duke University Computer Science Department United States

Motion blur is one of the most common degradation artifacts in dynamic scene photography. This paper reviews the NTIRE 2020 Challenge on Image and Video Deblurring. In this challenge, we present the evaluation results from 3 competition tracks as well as the proposed solutions. Track 1 aims to develop single-image deblurring methods focusing on restoration quality. On Track 2, the image deblurring methods are executed on a mobile platform to find the balance of the running speed and the restoration accuracy. Track 3 targets developing video deblurring methods that exploit the temporal relation between input frames. In each competition, there were 163, 135, and 102 registered participants and in the final testing phase, 9, 4, and 7 teams competed. The winning methods demonstrate the state-of-the-art performance on image and video deblurring tasks. Copyright © 2020, The Authors. All rights reserved.

关键词： Image enhancement

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Liao, Hao Liu, Ming-Kai Mariani, Manuel Sebastian Zhou, Mingyang Wu, Xingtong National Engineering Laboratory for Big Data System Computing Technology Guangdong Province Key Laboratory of Popular High Performance Computers College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of China Chengdu610051 China URPP Social Networks Universität Zürich CH-8050 Switzerland

When investigating the spreading of a piece of information or the diffusion of an innovation, we often lack information on the underlying propagation network. Reconstructing the hidden propagation paths based on the observed diffusion process is a challenging problem which has recently attracted attention from diverse research fields. To address this reconstruction problem, based on static similarity metrics commonly used in the link prediction literature, we introduce new node-node temporal similarity metrics. The new metrics take as input the time-series of multiple independent spreading processes, based on the hypothesis that two nodes are more likely to be connected if they were often infected at similar points in time. This hypothesis is implemented by introducing a time-lag function which penalizes distant infection times. We find that the choice of this time-lag strongly affects the metrics' reconstruction accuracy, depending on the network's clustering coefficient and we provide an extensive comparative analysis of static and temporal similarity metrics for network reconstruction. Our findings shed new light on the notion of similarity between pairs of nodes in complex networks. Copyright © 2019, The Authors. All rights reserved.

关键词： Information services

Spatial sparse subspace clustering for compressive spectral imaging

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Zhu, Jianchen Zhang, Tong Zhao, Shengjie Hinojosa, Carlos Liu, Zengli Arce, Gonzalo R. Key Laboratory of Embedded System and Service Computing Ministry of Education School of Software Engineering Tongji University Shanghai201804 China School of Electronic and Information Engineering Tongji University Shanghai201804 China Department of System Engineering and Informatics Universidad Industrial de Santander Bucaramanga680002 Colombia Institute of information engineering and automation Computer Center Kunming University of Science and Technology Kunming650500 China Department of Electrical and Computer Engineering University of Delaware NewarkDE19716 United States

This paper aims at developing a clustering approach with spectral images directly from CASSI compressive measurements. The proposed clustering method first assumes that compressed measurements lie in the union of multiple low-dimensional subspaces. Therefore, sparse subspace clustering (SSC) is an unsupervised method that assigns compressed measurements to their respective subspaces. In addition, a 3D spatial regularizer is added into the SSC problem, thus taking full advantages of the spatial information contained in spectral images. The performance of the proposed spectral image clustering approach is improved by taking optimal CASSI measurements obtained when optimal coded apertures are used in CASSI system. Simulation with one real dataset illustrates the accuracy of the proposed spectral image clustering approach. Copyright © 2019, The Authors. All rights reserved.

关键词： Spectroscopy

Joint learning of discriminative low-dimensional image representations based on dictionary learning and two-layer orthogonal projections

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Wei, Xian Shen, Hao Li, Yuanxiang Tang, Xuan Jin, Bo Zhao, Lijun Murphey, Yi Lu Fujian Institute of Research on the Structure of Matter Chinese Academy of Sciences China Technical University of Munich Germany and fortiss GmbH Munich Germany Shanghai Key Lab for Trustworthy Computing School of Computer Science and Software Engineering East China Normal University China School of Aeronautics & Astronautics Shanghai Jiao Tong University Shanghai200240 China State Key Laboratory of Robotics and System Harbin Institute of Technology Harbin150006 China Department of Electrical and Computer Engineering University of Michigan-Dearborn DearbornMI48128 United States

This work investigates the problem of efficiently learning discriminative low-dimensional representations of multi-class large-scale image objects. We propose a generic deep learning approach by taking advantages of Convolutional Neural Networks (CNN), sparse dictionary learning, and orthogonal projections. CNN is not only powerful on feature extraction, but also robust to spatial variance and changes. Sparse dictionary learning is well known for disentangling nonlinear underlying discriminative factors in data. The orthogonal projection is a notable efficient tool to project multi-class data onto low dimensional discriminative subspace. The proposed procedure can be summarized as follows. At first, a CNN is employed to extract high-dimensional (HD) preliminary convolutional features. Secondly, to avoid the high computational cost of direct sparse coding on HD CNN features, we present to learn sparse representation (SR) in an orthogonal projected space over a task-driven sparsifying dictionary. We then exploit the discriminative projection on SR. The whole learning process is treated as a joint optimization problem of trace quotient maximization, which involves the CNN parameters, the orthogonal projection on CNN features, the dictionary and the discriminative projection on sparse codes. The related cost function is well defined on product manifold of the Stiefel manifold, the Oblique manifold, and the Grassmann manifold. It is optimized via a geometrical stochastic gradient descent algorithm. Finally, the quality of dictionary and projections learned by the proposed approach is further investigated in terms of image classification. The experimental results show that the approach can achieve a strongly competitive performance with state-of-the-art image classification methods. Copyright © 2019, The Authors. All rights reserved.

关键词： Convolution

Petri Net Control Method for Pipe-line systems and Its Implementation via CIF3 ⁎

学校读者我要写书评

暂无评论

IFAC-PapersOnLine 2019年第24期52卷 261-266页

作者： YuHao Fu JiLiang Luo Huifeng Wu Jianhong Ye Yi-sheng Huang College Information Science and Engineering Huaqiao University Xiamen 361021 China College Information Science and Engineering Huaqiao University Xiamen 361021 China and also with Fujian Engineering Research Center of Motor Control and System Optimal Schedule Xiamen 361021 China Institute of Intelligent and Software Technology Hangzhou Dianzi University Hangzhou 310018 China Computer Science and Technology Huaqiao University Xiamen 361021 China and also with Fujian Provincial Key Laboratory of Data Intensive Computing Quanzhou 362000 China Department of Electrical Engineering National Ilan University Taiwan

As for a pipe-line system subjected to complex operations, an approach is proposed to synthesize the controller via Petri nets (PNs) such that the plant is run as concurrently as possible and the loads of equipments are balanced. A P-timed and labeled PN is designed to model the whole process of a pipe-line system, where tasks, including transporting material from one tank to another and cleaning tank, are represented by operational places, and level sensors amounted in tanks are represented by labels assigned to transitions. Further, monitor places are designed to resolve the conflict relations among tasks due to the shared valves and pipes. An method is presented to translate an PN controller into a CIF3 (Compositional Interchange Format) model, which can be converted into a PLC program in the CIF3 tool. A beer filtration plant is taken as an example to illustrate the approach, and its simulation experiments are carried out to verify the theoretic results.

关键词： Chemical plant Valve control Petri net CIF3

New Big Data Collecting Method Based on Compressive Sensing in WSN

学校读者我要写书评

暂无评论

New Big Data Collecting Method Based on Compressive Sensing ...

International Conference on computer Communications and Networks (ICCCN)

作者： De-gan Zhang Xiao-hua Liu Yu-ya Cui Hong-tao Peng School of Computer Science &Engineering Tianjin University of Technology Tianjin China Computing & Novel software Technology Tianjin Key Lab of Intelligent Tianjin China Ministry of Education Key Laboratory of Computer Vision and System(TJUT) Tianjin China National Petroleum Corporation (CNPC) Managers Training Institute Beijing China

Considered the wireless sensor network clustering structure, a new big data collecting method based on compressive sensing is proposed. The collection process is as follows: in the cluster, the sink node sets the corresponding seed vector based on the distribution of network, and then sends it to each cluster head. Cluster head can generate corresponding own random spacing sparse matrix based on its received seed vector, and collect data through compressive sensing technology; Among clusters, clusters forward measurement values to sink node along multi-hop routing tree which we built before. Performance analyzing and comparison of results show that this method is superior to other methods regardless of in a cluster or inter-cluster.

关键词： Wireless sensor networks Compressed sensing Sparse matrices Big Data Routing Energy consumption Training

Distributed Fault-tolerant Tracking Control for Multi-agent system in the Environments with Obstacles 35

学校读者我要写书评

暂无评论

Distributed Fault-tolerant Tracking Control for Multi-agent ...

第35届中国控制会议

作者： HUANG Jie ZHOU Ning CHEN Hongzhi Faculty of Mathematics and Natural Sciences University of Groningen Institute of the Cloud Computing and Big Data for Smart Agriculture and Forestry College of Computer and Information SciencesFujian Agriculture and Forestry University State Key Laboratory of Hybrid Process Industry Automation System and Equipment Technology China Iron and Steel Research Institute Group

ISBN: (纸本)9781509009107

This paper investigates the problem of collision-free coordination tracking control for multi-agent system under modeling uncertainties,actuator faults and *** syncretizing the Null-Space-based Behavioral(NSB) control and finite-time control method,a novel reference velocity signal is predesigned to achieve finite-time obstacle avoidance and coordination *** a set of finite-time coordination control laws are presented to guarantee all the agents to track a dynamic target while avoiding obstacles/***,numerical simulation is presented to demonstrate the efficacy of the control strategy.

关键词： Distributed Control Obstacle Avoidance Fault-tolerant Control Finite-time Control Modeling Uncertainties

Novel Detection Service Method for Moving Object in IOT

学校读者我要写书评

暂无评论

Novel Detection Service Method for Moving Object in IOT

2016 3rd International Conference on Materials Engineering,Manufacturing technology and Control(ICMEMTC 2016)

作者： Jie Chen Degan Zhang School of Electronic and Information Engineering Tianjin Vocational Institute Tianjin Key Lab of Intelligent Computing & Novel software Technology Tianjin University of Technology Key Laboratory of Computer Vision and System (Tianjin University of Technology) Ministry of Education

In embedded Internet of Things(IOT) environment, there are the troubles such as complex background, illumination changes, shadows and other factors for detecting moving object, so we put forward a new detection service method through mixing Gaussian Mixture Model(GMM), edge detection service method and continuous frame difference method in this paper. In time domain, the new method uses GMM to model and updates the background. In spatial domain, it uses the hybrid detection service method which mixes edge detection service method, continuous frame difference method and GMM to get initial contour of moving object, and gets ultimate moving object. This method not only can well adapt to the illumination gradients and background disturbance occurred on scene, but also can well solve some problems such as inaccurate target detection, incomplete edge detection, cavitation and ghost which usually appears in traditional method. As experimental result showing, this method holds better real-time and robustness. It is not only easily implemented, but also can accurately detect moving object.

关键词： GMM embedded IOT moving object detection service