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

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Jin-Mao Wei Wei-Guo Yi Ming-Yang Wang Institute of Computational Intelligence Northeast Normal University Changchun Jilin China Open Symbol Computation and Knowledge Engineering Laboratory of State Education Department Jilin University China

In this paper, we analyze the method of support-confidence framework when mining association rules. In order to avoid the limitation in the criterion, we propose a new method of match as the substitution of confidence. We analyze in detail the property of the proposed measurement. Experimental results show that there is higher correlation between the antecedent and the consequent of the rules produced by the improved method compared with the rules produced by the support-confidence framework. Furthermore, the improved method decreases the generation of redundancy rules.

关键词： Data mining Association rules Frequency Transaction databases computational intelligence knowledge engineering Laboratories Electronic mail Merchandise Neural networks

来源：评论

学校读者我要写书评

暂无评论

Independent and Collaborative Demosaicking Neural Networks 5

Independent and Collaborative Demosaicking Neural Networks

引用

5th ACM International Conference on Multimedia in Asia, MMAsia 2023

作者： Niu, Yan Zhang, Lixue Li, Chenlai State Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education College of Computer Science and Technology Jilin University Jilin Changchun China College of Computer Science and Technology Jilin University Changchun China School of Artificial Intelligence Shenzhen Polytechnic University Shenzhen China

ISBN: (纸本)9798400702051

Existing demosaicking neural models generally reconstruct the red, green and blue channels by one unified network. This has the advantage of allowing the RGB channels to share latent features. However, it is unnoticed that the training samples are severely unbalanced among the three channels. As a consequence, a unified model trained to fit the red or blue sample distributions is prone to under-fit the green samples. In this paper, we demonstrate the existence of such conflicts, and analyze the reason behind this phenomenon. To solve this disadvantage, we decouple the traditional three-in-one demosaicking to three independent but collaborative sub-tasks, respecting the distribution of samples in each spectrum. We show that, by our decoupling strategy, a very simple architecture can achieve high accuracy with high efficiency. For substantiation, we construct a model that has merely 1.3M parameters in total, and compares its accuracy to state of the art methods of similar or larger model size, across a wide variety of benchmark datasets. The proposed independent and collaborative architecture gains performance improvement over comparable models in both accuracy and inference time. © 2023 Copyright held by the owner/author(s).

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Low cost edge sensing for high quality demosaicking

arXiv

引用

arXiv 2018年

作者： Niu, Yan State Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China

Digital cameras that use Color Filter Arrays (CFA) entail a demosaicking procedure to form full RGB images. As today's camera users generally require images to be viewed instantly, demosaicking algorithms for real applications must be fast. Moreover, the associated cost should be lower than the cost saved by using CFA. For this purpose, we revisit the classical Hamilton-Adams (HA) algorithm, which outperforms many sophisticated techniques in both speed and accuracy. Based on a close look at HA's strength and weakness, we design a very low cost edge sensing scheme. Briefly, it guides demosaicking by a logistic functional of the difference between directional variations. We extensively compare our algorithm with 28 demosaicking algorithms by running their open source codes on benchmark datasets. Compared to methods of similar computational cost, our method achieves substantially higher accuracy;Whereas compared to methods of similar accuracy, our method has significantly lower cost. Moreover, on test images of currently popular resolution, the quality of our algorithm is comparable to top performers, whereas its speed is tens of times faster. Copyright © 2018, The Authors. All rights reserved.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Fast Kernel for Calculating Structural Information Similarities

Fast Kernel for Calculating Structural Information Similarit...

引用

International IEEE Conference on Intelligent Systems, IS

作者： Jin-Mao Wei Shu-Qin Wang Jing Wang Jun-Ping You Institute of Computational Intelligence Northeast Normal University China Open Symbol Computation and Knowledge Engineering Laboratory of State Education Jilin University Changchun Jilin China School of Mathematics & Statistics Northeast Normal University Changchun Jilin China

Structural similarity computation plays a crucial role in many applications such as in searching similar documents, in comparing chemical compounds, in finding genetic similarities, etc. We propose in this paper to use structural information content (SIC) for measuring structural information, considering both the nodes and edges of trees. We utilize a binary encoding approach for assigning the weights of different layer nodes and determining if some tree is a subtree of another tree. By defining a fast kernel and recursively computing SICs, we evaluate the structural information similarities of data trees to pattern trees. In the paper, we present the algorithm for calculating SICs with computation complexity of O(n), and use simple examples to instantiate the performance of the proposed method

关键词： Kernel Chemical compounds Silicon carbide XML Genetics Encoding Clustering algorithms Intelligent systems Intelligent structures Pattern analysis

来源：评论

学校读者我要写书评

暂无评论

The vehicle audio encryption system based on scrambling thought

The vehicle audio encryption system based on scrambling thou...

引用

2018 International Conference on Network, Communication, Computer engineering (NCCE 2018)

作者： Peibin Wu Jindong Zhang Yang Liu Dongqi Han Yiding Sun College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University State Key Laboratory of Automobile Simulation and Control Jilin University

ISBN: (纸本)9781510871076

In this paper,the vehicle audio encryption system based on scrambling thought and applied to vehicle-mounted media is *** pseudo random number is generated each time it is encrypted,and it is substituted into the Fibonacci transform to generate a key with variable *** audio data is divided by the number of pseudo random numbers into the Fibonacci sequence,and is encrypted in permutation *** Fibonacci transform has symmetry and creates an audio file that cannot be parsed and played after the permutation *** the security analysis of encryption algorithm,the audio files of different length are *** key space,anti-attack ability,key sensitivity and other indicators are tested to achieve good *** addition,this algorithm is simple in calculation and can realize the ideal real-time performance in practical application.

关键词： vehicle media audio encryption scrambling thought security analysis

来源：评论

学校读者我要写书评

暂无评论

Live Video Streaming Authentication for Vehicle Multimedia based on Merkle Tree

Live Video Streaming Authentication for Vehicle Multimedia b...

引用

2018 International Conference on Network, Communication, Computer engineering (NCCE 2018)

作者： Dongqi Han Jindong Zhang Yang Liu Peibin Wu Yiding Sun College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University State Key Laboratory of Automobile Simulation and Control Jilin University

ISBN: (纸本)9781510871076

Merkle tree has been widely applied in the field of P2 P *** this paper,an efficient authentication scheme is proposed in the integrity check module for vehicle live video streaming system by optimizing the construction and verification of the Merkle *** can create and check nodes at the same time in a shorter time without trusted *** the same time,in order to prevent the oversensitivity of hash algorithm,this paper uses the perceptual hash algorithm to generate the hash value of nodes in the Merkle *** performance evaluation and analysis,our algorithm can build a Merkle tree with 2 N-1 nodes only after the N+log2 N times hash *** has better time performance than the traditional tree,whether receiving attacks or *** it is proved that the scheme is secure under the condition that the vehicle live video streaming system is safe.

关键词： vehicle streaming media system Merkle tree P2P-streaming integrity authentication perceptual hash algorithm

来源：评论

学校读者我要写书评

暂无评论

Incremental algorithm for detecting community structure in dynamic networks

Incremental algorithm for detecting community structure in d...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Bo Yang Da-You Liu Open Symbol Computation and Knowledge Engineering Laboratory of State Education Department Jilin University Changchun China Jilin University Changchun Jilin CN Coll. of Comput. Sci. & Technol. Jilin Univ. Changchun China

Community structure is an important property of networks. Being able to identify communities can provide invaluable help in exploiting and understanding both social and non-social networks. Several algorithms have been developed up till now. However all these algorithms can work well only with small or moderate networks with vertexes of order 10/sup 4/. Additionally, all existing algorithms are off-line and can not work well with highly dynamic networks such as Web, in which Web pages are updated frequently every day. When the already clustered network is updated, the entire network including original and incremental parts has to be recalculated, even only slight changes involved. To address this problem we develop an incremental algorithm which allows for detecting community structure in large-scale and dynamic networks. Based on the community structure it detect previously our algorithm takes little time to reclassify the entire network including both original and incremental parts. Furthermore, our algorithm is faster than most existing algorithms such as Girvan and Newman's algorithm and its improved versions. Also our algorithm can help to visualize these community structures in network and provide a new approach to research the evolving process of dynamic networks.

关键词： Intelligent networks Clustering algorithms Partitioning algorithms Social network services Machine learning algorithms Computer networks Visualization Web sites Biochemistry educational institutions

来源：评论

学校读者我要写书评

暂无评论

Image annotation refinement using dynamic weighted voting based on mutual information

Journal of Software

引用

Journal of Software 2011年第11 SPEC. ISSUE期6卷 2239-2246页

作者： Song, Haiyu Li, Xiongfei Wang, Pengjie Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Institute of Computer Graphics and Image Processing Dalian Nationalities University Dalian China State Key Laboratory of CAD and CG Zhejiang University Hangzhou China

Automatic image annotation is a promising solution to narrow the semantic gap between low-level content and high-level semantic concept, which has been an active research area in the fields of image retrieval, pattern recognition, and machine learning. However, even the most dedicated annotation algorithms are often unsatisfactory. Image annotation refinement has attracted much more attention recently. In this paper, a novel refinement algorithm using dynamic voting based on mutual information is proposed. Unlike the traditional refinement algorithm, the proposed algorithm adopts dynamic weighted voting to measure the dependence between the candidate annotations, which not only permits that the annotations with higher probabilities deny the annotations with lower probabilities, but also permits that the annotations with lower probabilities deny the annotations with higher probabilities. The proposed refinement algorithm adopts progressive method instead of iterative, which can significantly decrease the time cost of refining annotations. In order to further improve efficiency without sacrificing precision, we propose the block-based normalized cut algorithm to segment image. Experiments conducted on standard Washington Ground Truth Image Database demonstrate the effectiveness and efficiency of our proposed approach for refining image annotations. © 2011 ACADEMY PUBLISHER.

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

Toward Moiré-Free and Detail-Preserving Demosaicking

arXiv

引用

arXiv 2023年

作者： Li, Xuanchen Niu, Yan Zhao, Bo Shi, Haoyuan An, Zitong State Key Laboratory of Symbol Computation and Knowledge Engineering College of Computer Science and Technology Ministry of Education Jilin University Changchun China The College of Software Jilin University Changchun130012 China

3D convolutions are commonly employed by demosaicking neural models, in the same way as solving other image restoration problems. Counter-intuitively, we show that 3D convolutions implicitly impede the RGB color spectra from exchanging complementary information, resulting in spectral-inconsistent inference of the local spatial high frequency components. As a consequence, shallow 3D convolution networks suffer the Moiré artifacts, but deep 3D convolutions cause over-smoothness. We analyze the fundamental difference between demosaicking and other problems that predict lost pixels between available ones (e.g., super-resolution reconstruction), and present the underlying reasons for the confliction between Moiré-free and detail-preserving. From the new perspective, our work decouples the common standard convolution procedure to spectral and spatial feature aggregations, which allow strengthening global communication in the spectral dimension while respecting local contrast in the spatial dimension. We apply our demosaicking model to two tasks: Joint Demosaicking-Denoising and Independently Demosaicking. In both applications, our model substantially alleviates artifacts such as Moiré and over-smoothness at similar or lower computational cost to currently top-performing models, as validated by diverse evaluations. Source code will be released along with paper publication. Copyright © 2023, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Adaptive feature selection and extraction approaches for image retrieval based on region

引用

Journal of Multimedia 2010年第1期5卷 85-92页

Image retrieval based on region is one of the most promising and active research directions in recent year's CBIR, while region segmentation, feature selection and feature extraction of region are key issues. However, the existing approaches always adopt a uniform approach of segmentation and feature extraction for all images in the same system. In this paper, we propose adaptive image segmentation and feature extraction approach according to different category image for image retrieval system. To improve performance, we propose adaptive segmentation approach according to different category image. Textured image is segmented by Gaussian Mixture Models (GMM), while non-textured image is segmented by our proposed block-based normalized cut. To accurately describe feature of region, we propose weight assignment method for centroid pixel and its neighbor by convolution with normal distribution when image segmentation by GMM. To improve generalization, we propose adaptive number of Fourier descriptors of shape signature which depends on the energy distribution of Fourier descriptors, instead of fixed number by experience. To simply and efficiently describe the spatial relationships of multi-object or multi-region in same image, we apply simplified topological relationships. The experiments demonstrate that proposed approaches are superior to the traditional approaches. © 2010 ACADEMY PUBLISHER.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：