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

PromptHC: Multi-attention prompt guided haze-weather crowd counting

Expert systems with Applications 2025年 286卷

作者： Jienan Shen Liangang Tong Shaohua Li Weihang Kong School of Information Science and Engineering Yanshan University Qinhuangdao 066004 China Information Technology Center Yanshan University Qinhuangdao 066004 China Hebei Key Laboratory of Computer Virtual Technology and System Integration Qinhuangdao 066004 China

Existing crowd counting methods encounter the challenge of degraded performance in hazy weather due to the blurring of pedestrian outlines. However, current hazy-weather crowd counting methods primarily focus on extracting crowd features, often neglecting the varying degrees of distortion in pedestrian outlines caused by inhomogeneous haze distribution. To this end, this paper develops a multi-attention prompt guided method for hazy-weather crowd counting, termed PromptHC. Specially, to explore the relationship between varying haze concentrations and the pedestrian outlines, a multi-attention dynamically adjustable prompt module is designed to provide crucial prompts about crowd features in hazy weather. Meanwhile, to further enhance the anti-interference capability of the model in hazy weather, a progressive guidance module is incorporated, which effectively reduces interference from different haze concentrations by guiding the learning of crowd attention. Furthermore, a global context-enhanced crowd feature extraction module is designed to capture precise global information. A series of ablation studies verify the actual effectiveness of each core component of the PromptHC. In addition, we conduct a performance comparison with the current mainstream methods on two hazy-weather datasets. Experimental results show the feasibility and superiority of the PromptHC for the hazy-weather crowd counting task.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Road network information based edge bundling

引用

Journal of Information and Computational Science 2015年第13期12卷 4909-4918页

作者： Nie, Junlan Zhang, Jikai Xin, Shuyue Guo, Dongliang College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

To solve edge confusion problems in the geo-related graph visualization, here we present an edge bundling algorithm based on the road network information. First, the improved Dijkstra shortest path algorithm is employed to calculate the related path of original edges, and slicing quadratic Bezier curves are fitted out to replace original edges according to these path information. And then, the curve segments that satisfy conditions are merged together according to the control point consolidation strategy and thickened according to their weights, which simplifies the bundling result and also effectively shows the heat of each path;Finally, for the interested curves in the human-computer interaction, highlighted transition colors are introduced to character their directivity, and the effect is intuitive. The experimental results show that, our algorithm can effectively bundle original edges, which reduces the confusion degree of the graph. Meanwhile, the bundling result is more close to the original path, which improves the readability and understandability of the graph effectively. ©, 2015, Journal of Information and Computational Science. All right reserved.

关键词： Human computer interaction

来源：评论

学校读者我要写书评

暂无评论

Improving neighbourhood quality for CHUCKY: An empirical study

引用

Journal of Computational Information systems 2015年第16期11卷 5967-5977页

作者： Zhao, Fengda Yang, Ke Ren, Jiadong College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

Vulnerability discovery is at the centre of attention in computer security. Most vulnerability detection methods need considerable human auditing, thus making vulnerability detection inefficient and unreliable. Similar neighbourhood-based missing check detection method solves this problem to some degree. However, semantic noises that degrade the quality of the neighbourhood list remain. To reduce these noises, we firstly define a q-gram-based name similarity to measure the correlation of function names or file names. The context similarity of function is then defined to measure the commonness of two functional working environment. Finally, two filters are proposed: one is the naive neighbourhood filter which filters irrelative functions by name similarity;the other is the improved integrate neighbourhood filter, which awards strong correlated functions by recognising remarkable name and context similarity. The filter-based methods are experimentally evaluated in five widely used open-source software and are compared with the original method. Result shows that the improved neighbourhood rank lists are more accurate than the original list. © 2015 by Binary Information Press

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

A novel approach to efficiently mine structural patterns from software execution sequence

引用

Journal of Computational Information systems 2015年第3期11卷 1109-1119页

作者： Huang, Guoyan Zhang, Bing Ren, Rong Ren, Jiadong College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

Analyzing structure of a software system is not sufficient for understanding its functionality. Certain characteristics of software are often hidden in its structure and can only be discovered when the various execution sequence of the software are identified. Analysis of execution sequence, therefore, becomes an indispensable aid in software comprehension. In this paper, a novel approach to efficiently mine structural patterns from software execution sequence is proposed. First, software execution traces are modeled as sequential patterns. Due to loops, patterns can occur multiple times within a trace, which leads to high cost of time and super complexity of the research. Then, an algorithm is designed to eliminate repetitive patterns (ERP) in software and software sequential pattern mining (SSPM) algorithm is presented to divide software unique sequential patterns into different patterns in order to mine structural characteristics of the software. At last, by the comparative analysis of similarity between different pattern collections, it draws the conclusion that software system can be compartmentalized into n fixed patterns. Experimental results also prove the conclusion well. ©, 2015, Binary Information Press. All right reserved.

关键词： Computer software

来源：评论

学校读者我要写书评

暂无评论

Non-human-like characters' facial animation driven by one or two actors

引用

Journal of Information and Computational Science 2015年第10期12卷 3937-3944页

作者： Tang, Yong Liu, Yuhan Guo, Dan Liang, Haiyan Luo, Yanqing Lv, Mengya College of Information Science and Engineering Yanshan University Qinhuangdao China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

We present a novel system that can transfer facial expressions from an actor to a non-human-like character. Compared with a lot of previous studies, our system requires no special light conditions or facial markers for actors' performance. More significantly, our work can find vertex correspondences between the human face and characters with dissimilar facial structures by creating local-coordinate systems on the character. Experiments show that in our system not only one actor's performance is accurately transferred to non-human-like characters but also two actors' expressions can be simultaneously retargeted to one non-human-like character. Through our approach, virtual characters can have much more vivid expressions. 1548-7741/Copyright © 2015 Binary Information Press

关键词： Animation

来源：评论

学校读者我要写书评

暂无评论

Kainate induced gamma oscillations and spike-gamma relationship analysis

引用

Advances in Information Sciences and Service Sciences 2012年第21期4卷 606-612页

作者： Wen, Dong Peng, Ce Li, Xiaoli Lu, Chengbiao The Key Laboratory for Computer Virtual Technology System Integration of HeBei Province Yanshan University Qinhuangdao Hebei 066004 China Institue of Electrical Engineering Yanshan University Qinhuangdao Hebei 066004 China

Neuronal oscillations in the gamma frequency range and spikes have been reported in many cortical areas in the information processing, but the role of spikes play in cortical processing remains unclear. The aim of this study was to examine the role of kainate in the generation of oscillatory field activity at gamma frequency in the hippocampal slice prepared from rat brain, and to determine the phase relationship between spikes and gamma oscillations. The kainate induced large amplitude field population spiking activity, which is correlated linearly with the field gamma oscillations. The relationship between timing of spikes and the phase of gamma oscillation was determined by an analysis of circular statistics. Further analysis with Rayleigh test revealed that the relationship of phase-locking between spikes and gamma rhythm is of statistical significance. These data demonstrate that kainate sensitive neuronal networks within hippocampus are able to generate gamma oscillations which are modulated by large amplitude population spikes and phase-locking of spikes to the gamma rhythm suggest the role of memory enhancement in the presence of Kainate receptor activation.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

Mining weighted closed sequential patterns by memory indexing

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content technology and its Applications 2012年第19期6卷 432-440页

作者： Ren, Jiadong Li, Shuo Dong, Jun College of Information Science and Engineering Yanshan University Qinhuangdao Hebei 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao City 066004 China

There exist two major problems in weighted closed sequential patterns mining. The first is that only the weights of items are considered and they ignore the time-interval information of data elements during the mining process;the second is that the existing weighted closed sequential pattern mining algorithms need to scan the sequence database many times or to construct numerous intermediate databases. To address these problems, we propose a memory-based algorithm, MIWCSpan (Memory Indexing for Weighted Closed Sequential pattern mining), for weighted closed sequential pattern mining. In the algorithm, we define a novel sequence weighting approach to find more interesting sequential patterns. Both the weight of sequence items and the time-interval of the data elements are considered in this approach. Moreover, an improved index set based on time-interval, p-iidx, is defined. The structure is a set of triples which store the pointer pointing to the sequence containing p, the time-interval of p in the sequence and the position where p occurs. In the mining process, MIWCSpan first scans the sequence database to read the database into memory. Then it adopts the find-then-index technique recursively to find the items which can constitute a weighted closed sequential pattern and construct p-iidx for the possible weighted closed sequential pattern. At last, the algorithm uses the close-detecting to mine the weighted closed sequential patterns efficiently. The experimental results show that MIWCSpan is better on running time, and it has good scalability.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Subspace clustering based on finding effective spaces

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content technology and its Applications 2012年第22期6卷 580-589页

作者： Ren, Jiadong Liu, Zhigang Dong, Jun College of Information Science and Engineering Yanshan University Qinhuangdao Hebei 066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao City 066004 China

In high-dimensional data space, because the data is sparse inherently, clusters tend to exist in different subspaces, which makes the traditional methods no longer suitable for use. In this paper, we present SCFES, a subspace clustering algorithm based on finding effective spaces. First, we define the effective dimension. By calculating relative entropy we remove redundancy dimensions which affect clustering accuracy. Second, according to the data distribution in the effective dimensions, we get the effective intervals through merging adjacent intervals. The effective space is composed of effective intervals. Third, we extend the density estimator based on undirected acyclic connected graph by using weight so as to estimate the expectation of existing clusters in the space, at the same time combine it with the monotonicity of the clustering criterion mentioned in the CLIQUE algorithm to prune candidates. Consequently we get the effective spaces. Finally, we adopt the structure of sibling tree to store all the effective spaces and use DBSCAN algorithm based on density to generate maximal subspace clusters in some effective spaces. Experimental results show that SCFES effectively finds arbitrarily shaped and positioned clusters in different subspaces. Meanwhile SCFES has better clustering quality and scalability.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Data stream clustering algorithm based on spatial directed graph

引用

Advances in Information Sciences and Service Sciences 2012年第20期4卷 241-249页

作者： Ren, Jiadong Yuan, Xuemei Dong, Jun College of Information Science and Engineering Yanshan University Qinhuangdao Hebei 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao City 066004 China

Recently, the grid-density based clustering has become one of the major issues among all of the clustering approaches, it has special advantages over other clustering algorithms, such as less computation and the ability of clustering with arbitrarily shape, which are particularly useful for the data stream clustering. This paper defines a spatial directed graph named Grid-Based Graph (GBG) to store the non-empty grids in data space, and proposes a data stream clustering algorithm based on spatial directed graph GBGSClu (Grid-Based Graph Stream Clustering). GBG graph composes of vertices and directed edges, if a vertex A has a neighboring dense vertex B, and then there is a directed edge from vertex B to A in GBG. The algorithm maps the data stream into the non-empty vertices online, updates the vertices' feature vectors with the arriving of data stream, deletes the sparse vertices every gap time, generates GBG graph when the clustering quest coming and finally clusters on the current structure. The eventual clustering results can be obtained by only checking the vertices' in-degree which can reduce the computation needed in clustering. The validity and efficiency of GBGSClu algorithm have been tested and verified by clustering on real and synthetic datasets.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Real-time simulation of action-driven 3D subtle facial expressions

引用

Journal of Computational Information systems 2014年第5期10卷 2137-2144页

作者： Tang, Yong Liang, Haiyan Guo, Dan Lv, Mengya Zhao, Jing College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China

While the large-scale deformations such as the Laplacian deformation method could not synthesize new expressional details, this paper proposes a method for simulating different subtle facial expressions based on the Kinect acquisition system and the facial expressional reconstruction technique. Firstly, we generate the coarse skin textures with pore details and those normal maps. Secondly, we use blending wrinkle maps to render animated details on a human face based on a GPU shader program. Finnaly, according to the action units captured by the Kinect, we calculate the dynamic texture mapping and the weight of wrinkles, and apply the wrinkles function to simulate the motion of wrinkles. Experimental results show that our method can generate facial details in real time. The method suits the fields such as digital entertainment and video conferences. © 2014 Binary Information Press.

关键词： Blending

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：