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

image retrieval based on color features integrated with anisotropic directionality

Journal of Systems Engineering and Electronics 2010年第1期21卷 127-133页

作者： Jing Bai Xiaohua Wang Licheng Jiao Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China Institute of Intelligent Information Processing Xidian University Xi'an 710071 P. R. China

A novel image retrieval approach based on color features and anisotropic directional information is proposed for content based image retrieval systems （CBIR）. The color feature is described by the color histogram （CH）, which is translation and rotation invariant. However, the CH does not contain spatial information which is very important for the image retrieval. To overcome this shortcoming, the subband energy of the lifting directionlet transform （L-DT） is proposed to describe the directional information, in which L-DT is characterized by multi-direction and anisotropic basis functions compared with the wavelet transform. A global similarity measure is designed to implement the fusion of both color feature and anisotropic directionality for the retrieval process. The retrieval experiments using a set of COREL images demonstrate that the higher query precision and better visual effect can be achieved.

关键词： image retrieval color histogram directionlet transform anisotropic similarity.

来源：评论

学校读者我要写书评

暂无评论

Switching mechanism for TiO_2 memristor and quantitative analysis of exponential model parameters

引用

Chinese Physics B 2015年第8期24卷 598-604页

作者：王小平陈敏沈轶 School of Automation Huazhong University of Science and Technology Key Laboratory of Ministry of Education for Image Processing and Intelligent Control Huazhong University of Science and Technology

The memristor, as the fourth basic circuit element, has drawn worldwide attention since its physical implementation was released by HP Labs in 2008. However, at the nano-scale, there are many difficulties for memristor physical realization. So a better understanding and analysis of a good model will help us to study the characteristics of a memristor. In this paper, we analyze a possible mechanism for the switching behavior of a memristor with a Pt/TiO2/Pt structure, and explain the changes of electronic barrier at the interface of Pt/TiO2. Then, a quantitative analysis about each parameter in the exponential model of memristor is conducted based on the calculation results. The analysis results are validated by simulation results. The efforts made in this paper will provide researchers with theoretical guidance on choosing appropriate values for(α, β, χ, γ) in this exponential model.

关键词： memristor switching behavior electronic barrier exponential model

来源：评论

学校读者我要写书评

暂无评论

Research on feature classification method of network text data based on association rules

引用

International Journal of Computers and Applications 2020年第2期42卷 157-163页

作者： Huang, Hongben Guangxi Colleges and Universities Key Laboratory of Image Processing and Intelligent Information System Wuzhou University Wuzhou China

Due to the large number of features, sparse data, low precision of feature extraction, and long time-consuming. Using the current method to classify the text data features, it is difficult to achieve better results. A method of feature classification of network text data based on association rules is proposed. A single word is used as a classification feature to extract the association feature item of text data. The feature item after dimension reduction is to construct classifier. Through the support vector machine algorithm, the network text data feature classification is realized. The highest precision ratio of Hangxia et al.’s study [Hangxia Z, Jiajun Y, Huan R. Text categorization based on deep belief network. Comput Eng Sci. 2016;38(5):871–876] is 69%, the highest precision ratio of Wenjuan et al.’s study [Wenjuan S, Shun L, Fei Y. Iterative text classification framework based on background learning. Comput Eng Applic. 2015;51(9):129–134] is 85%, and the highest precision ratio of the proposed method is 93%. The precision of this method is higher, which shows that the method can accurately reflect the feature class information of text data and reduce the error rate of text classification. Experimental results show that the proposed method can improve the accuracy of classification results and has high robustness. © 2018, © 2018 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

Multi-objective carrier chaotic evolutionary algorithm for DNA sequences design

引用

Progress in Natural Science:Materials International 2007年第12期17卷 1515-1520页

作者： Xiao Jianhua, Xu Jin, Geng Xiutang and Pan Linqiang(key laboratory of image processing and intelligent Control, Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China) Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China

DNA computing is a new vista of computation, which is of biochemical type. Since each piece of information is encoded in biological sequences, their design is crucial for successful DNA computation. DNA sequence design is involved with a number of design criteria, which is difficult to be solved by the traditional optimization methods. In this paper, the multi-objective carrier chaotic evolution algorithm (MCCEA) is introduced to solve the DNA sequence design problem. By merging the chaotic search base on power function carrier, a set of good DNA sequences are generated. Furthermore, the simulation results show the efficiency of our method.

关键词： DNA computing carrier chaotic search multi-objective evolutionary algorithm DNA sequences design.

来源：评论

学校读者我要写书评

暂无评论

MP-MAT: A 3D-AND-INSTANCE-AWARE HUMAN MATTING AND EDITING FRAMEWORK WITH MULTIPLANE REPRESENTATION

arXiv

引用

arXiv 2025年

作者： Jiao, Siyi Zeng, Wenzheng Li, Yerong Zhang, Huayu Gao, Changxin Sang, Nong Shou, Mike Zheng Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology China Show Lab National University of Singapore Singapore

Human instance matting aims to estimate an alpha matte for each human instance in an image, which is challenging as it easily fails in complex cases requiring disentangling mingled pixels belonging to multiple instances along hairy and thin boundary structures. In this work, we address this by introducing MP-Mat, a novel 3D-and-instance-aware matting framework with multiplane representation, where the multiplane concept is designed from two different perspectives: scene geometry level and instance level. Specifically, we first build feature-level multiplane representations to split the scene into multiple planes based on depth differences. This approach makes the scene representation 3D-aware, and can serve as an effective clue for splitting instances in different 3D positions, thereby improving interpretability and boundary handling ability especially in occlusion areas. Then, we introduce another multiplane representation that splits the scene in an instance-level perspective, and represents each instance with both matte and color. We also treat background as a special instance, which is often overlooked by existing methods. Such an instance-level representation facilitates both foreground and background content awareness, and is useful for other down-stream tasks like image editing. Once built, the representation can be reused to realize controllable instance-level image editing with high efficiency. Extensive experiments validate the clear advantage of MP-Mat in matting task. We also demonstrate its superiority in image editing tasks, an area under-explored by existing matting-focused methods, where our approach under zero-shot inference even outperforms trained specialized image editing techniques by large margins. Code is open-sourced at https://***/JiaoSiyi/***. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A membrane-inspired algorithm with a memory mechanism for knapsack problems

引用

Journal of Zhejiang University-Science C(Computers and Electronics) 2013年第8期14卷 612-622页

作者： Juan-juan HE Jian-hua XIAO Xiao-long SHI Tao SONG Key Laboratory of Image Processing and Intelligent Control School of AutomationHuazhong University of Science and Technology The Logistics Research Center Nankai University

Membrane algorithms are a class of distributed and parallel algorithms inspired by the structure and behavior of living cells. Many attractive features of living cells have already been abstracted as operators to improve the performance of algorithms. In this work, inspired by the function of biological neuron cells storing information, we consider a memory mechanism by introducing memory modules into a membrane algorithm. The framework of the algorithm consists of two kinds of modules (computation modules and memory modules), both of which are arranged in a ring neighborhood topology. They can store and process information, and exchange information with each other. We test our method on a knapsack problem to demonstrate its feasibility and effectiveness. During the process of approaching the optimum solution, feasible solutions are evolved by rewriting rules in each module, and the information transfers according to directions defined by communication rules. Simulation results showed that the performance of membrane algorithms with memory cells is superior to that of algorithms without memory cells for solving a knapsack problem. Furthermore, the memory mechanism can prevent premature convergence and increase the possibility of finding a global solution.

关键词： Membrane algorithm Memory mechanism Knapsack problem

来源：评论

学校读者我要写书评

暂无评论

Flocking in Multi-Agent Systems with Multiple Virtual Leaders Based Only on Position Measurements

引用

Communications in Theoretical Physics 2012年第5期57卷 801-807页

作者：苏厚胜 Department of Control Science and Engineering Image Processing and Intelligent Control Key Laboratory of Education Ministry of ChinaHuazhong University of Science and Technology

Most existing flocking algorithms assume one single virtual leader and rely on information on both relative positions and relative velocities among neighboring *** this paper,the problem of controlling a flock of mobile autonomous agents to follow multiple virtual leaders is investigated by using only position information in the sense that agents with the same virtual leader asymptotically attain the same velocity and track the corresponding virtual leader based on only position measurements.A flocking algorithm is proposed under which every agent asymptotically attains its desired velocity,collision between agents can be avoided,and the final tight formation minimizes all agents' global potentials.A simulation example is presented to verify and illustrate the theoretical results.

关键词： distributed control flocking multi-agent system multiple virtual leaders

来源：评论

学校读者我要写书评

暂无评论

Uniform Solution to QSAT by P Systems with Proteins

引用

电子学报(英文版) 2012年第4期21卷 667-672页

作者： LU Chun SHI Xiaolong Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China

P systems are distributed parallel computing models in the area of membrane computing, which are inspired by the structure and the functioning of living cells, as well as the organization of cells in tissues, organs, and other higher order structures. P systems with proteins on membranes are a class of P systems, which have proved to be very efficient computing devices. Specifically, it was known that the Quantified satisfiability problem (QSAT) of a Boolean formula can be solved by a semi-uniform family of P systems with proteins on membranes and with membrane division. However, it remains open whether a uniform families of P systems with proteins on membranes can solve in polynomial time exactly the class of problems PSPACE. In this work, we present a uniform solution to QSAT problem by P systems with proteins on membranes in a linear time with respect to both the number n of Boolean variables and the number m of clauses of the instance, which answers the above open problem.

关键词：蛋白质膜 P系统分布式并行计算多项式时间 PSPACE 高级结构细胞膜计算模型 Membrane computing, Membrane protein, PSPACE-complete problem, Quantified satisflability problem （QSAT problem）, Uniform solution.

来源：评论

学校读者我要写书评

暂无评论

Taming Consistency Distillation for Accelerated Human image Animation

arXiv

引用

arXiv 2025年

作者： Wang, Xiang Zhang, Shiwei Yuan, Hangjie Wei, Yujie Zhang, Yingya Gao, Changxin Wang, Yuehuan Sang, Nong Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology China Alibaba Group China Fudan University China

Recent advancements in human image animation have been propelled by video diffusion models, yet their reliance on numerous iterative denoising steps results in high inference costs and slow speeds. An intuitive solution involves adopting consistency models, which serve as an effective acceleration paradigm through consistency distillation. However, simply employing this strategy in human image animation often leads to quality decline, including visual blurring, motion degradation, and facial distortion, particularly in dynamic regions. In this paper, we propose the DanceLCM approach complemented by several enhancements to improve visual quality and motion continuity at low-step regime: (1) segmented consistency distillation with an auxiliary light-weight head to incorporate supervision from real video latents, mitigating cumulative errors resulting from single full-trajectory generation;(2) a motion-focused loss to centre on motion regions, and explicit injection of facial fidelity features to improve face authenticity. Extensive qualitative and quantitative experiments demonstrate that DanceLCM achieves results comparable to state-of-the-art video diffusion models with a mere 2-4 inference steps, significantly reducing the inference burden without compromising video quality. The code and models will be made publicly available. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Immunodominance and clonal selection inspired multiobjective clustering

引用

Progress in Natural Science:Materials International 2009年第6期19卷 751-758页

作者： Wenping Ma , Licheng Jiao, Maoguo Gong key laboratory of intelligent Perception and image Understanding of the Ministry of Education of China, Institute of intelligent Information processing, Xidian University, Xi’an 710071, China [a]Key Laboratory of Intelligent Perception and Image Understanding of the Ministry of Education of China Institute of Intelligent Information Processing Xidian University Xi’an 710071 China

The biological immune system is a highly parallel and distributed adaptive system. The information processing abilities of the immune system provide important insights into the field of computation. Based on immunodominance in the biological immune system and the clonal selection mechanism, a novel data mining method, Immune Dominance Clonal Multiobjective Clustering algorithm (IDCMC), is presented. The algorithm divides an individual population into three sub-populations according to three different measurements, and adopts different evolution and selection strategies for each sub-population. The update of each sub-population, however, is not carried out in isolation. The periodic combination operation of the analysis of the three sub-populations represents considerable advantages in its global search ability. The clustering task is a multiobjective optimization problem, which is more robust with respect to the variety of cluster structures of different datasets than a single-objective clustering algorithm. In addition, the new algorithm can determine the number of clusters automatically, which should identify the most promising clustering solutions in the candidate set. The experimental results, using artificial datasets with different manifold structure and handwritten digit datasets, show that the IDCMC outperforms the PESA-Ⅱ-based clustering method, the genetic algorithm-based clustering technique and the original K-Means algorithm in solving most of the problems tested.

关键词： Artificial immune systems Multiobjective optimization Clustering Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：