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

International Conference on Optics Photonics and Energy Engineering (OPEE)

作者： Zhou Xiao Mou xingang Zhang guilin National Key Laboratory of Science and Technology On Multi-spectral Information Processing Technologies Institute For Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781424452347;9781424452354;9781424452361

The framework of a second order morphology algorithm is proposed to enhance the dim small infrared target in sea clutter background with strong detector noise. First, a morphological filters bank is given. Each filter in the bank is designed to suppress its corresponding type texture. The second order process can be accomplished in two steps. The original infrared image is first filtered using each filter separately, and then the first order result is obtained by the combination of the filtered result images. The other step is essentially the same as the first one except the combination manner of the filtered result images. Second, the traditional SNR gain based evaluation of different small target enhancement algorithms is examined and a more reasonable method based on the distance between the target and the maximal background (DTMB) is described in this paper. Third, using the new evaluation method, the comparison is given by experiment through a sequence of infrared images with a dim small target. Experimental results demonstrate that the new proposed algorithm performs better in sea clutter background with strong detector noise than the traditional ones.

关键词： Morphology Filter bank Infrared detectors Nonlinear filters Background noise Infrared imaging Shape Working environment noise Optical filters Photonics

来源：评论

学校读者我要写书评

暂无评论

Nonconvex penalties with analytical solutions for one-bit compressive sensing

arXiv

引用

arXiv 2017年

作者： Huang, Xiaolin Yan, Ming Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University MOE Key Laboratory of System Control and Information Processing Shanghai200240 China Department of Computational Mathematics Science and Engineering Department of Mathematics Michigan State University East LansingMI48824 United States

One-bit measurements widely exist in the real world and can be used to recover sparse signals. This task is known as one-bit compressive sensing (1bit-CS). In this paper, we propose novel algorithms based on both convex and nonconvex sparsity-inducing penalties for robust 1bit-CS. We consider the dual problem, which has only one variable and provides a sufficient condition to verify whether a solution is globally optimal or not. For positive homogeneous penalties, a globally optimal solution can be obtained in two steps: a proximal operator and a normalization step. For other penalties, we solve the dual problem, and it needs to evaluate the proximal operators for many times. Then we provide fast algorithms for finding analytical solutions for three penalties: minimax concave penalty (MCP), 0norm, and sorted 1penalty. Specifically, our algorithm is more than 200 times faster than the existing algorithm for MCP. Its efficiency is comparable to the algorithm for the 1penalty in time, while its performance is much better than 1. Among these penalties, sorted 1is most robust to noise in different settings. Copyright © 2017, The Authors. All rights reserved.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Modeling Rumor Unidirectional Spreading from Online Social Networks to Offline 23

Modeling Rumor Unidirectional Spreading from Online Social N...

引用

Proceedings of the 2023 7th International Conference on Electronic Information Technology and Computer Engineering

作者： Qiyi Han Yi Chen Key Laboratory of Pattern Recognition and Intelligent Information Processing School of Computer Science Chengdu University China College of Electronic Engineering Chengdu University of Information Technology China

ISBN: (纸本)9798400708305

Online social networks not only facilitate the dissemination of information, but also increase the risk of rumors. This paper focuses on studying the unidirectional spread of rumors from online social networks to offline environments. To describe the dynamic process of rumor spreading, we derive a unidirectional coupled network structure and mean-field equations. We illustrate the performance of rumor spreading under various scenarios using computer simulations. The simulations reveal that rumors in unidirectional coupled networks spread faster and wider than those in single layer networks. Furthermore, with the assistance of unidirectional links, rumors tend to persist for a longer duration and cause more severe damages.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Interactive object segmentation using iterative adjustable graph cut

Interactive object segmentation using iterative adjustable g...

引用

IEEE Visual Communications and image processing (VCIP)

作者： Ran Shi Zhi Liu Yinzhu Xue Xiang Zhang School of Communication and Information Engineering Shanghai University Shanghai China Key Laboratory of Advanced Display and System Application Ministry of Education Shanghai University Shanghai China Institute of Image Processing and Pattern Recognition Shanghai Jiaotong University Shanghai China

Interactive object segmentation is widely used for extracting any user-interested objects from natural images. A common problem with many interactive segmentation approaches is that the object segmentation quality is degraded due to inaccurate object/background seeds provided by the user. This paper proposes an iterative adjustable graph cut to efficiently solve this problem. First, object/background seeds are initialized based on the object segmentation result obtained with the user-specified scribbles as the interactive input. Then, an iterative seed adjustment scheme is exploited to correct inaccurate seeds and extract new suitable seeds via graph cut, in which the balancing weight between energy terms are adaptively updated to protect stable seeds and speedup the iteration process. Finally, suitable seeds are obtained and graph cut is used to segment the objects. Experimental results demonstrate the better segmentation performance of our approach even if user provides rather rough seeds.

关键词： Object segmentation image segmentation Reliability Iterative methods Educational institutions image color analysis Error analysis

来源：评论

学校读者我要写书评

暂无评论

An efficient and scalable learning algorithm for Near-Earth objects detection in astronomy big image data

An efficient and scalable learning algorithm for Near-Earth ...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Ke Wang Ping Guo School of computer Science and Technology Beijing Institute of Technology Beijing P.R. China Image Processing and Pattern Recognition Laboratory Beijing Normal University Beijing P.R. China

ISBN: (纸本)9781479938414

In this paper, we investigate the efficiency and scalability of Gaussian mixture model based learning algorithm for the detection of Near-Earth objects in large scale astronomy image data. We propose an effective scheme to reduce the computational complexity of current learning algorithm, this is achieved by adopting the perceptual image hashing method. Our proposed scheme is validated on raw astronomy image data. The experiment results illustrate that both efficiency and scalability are improved significantly in astronomical scenario and other scenario.

关键词： Astronomy Scalability Big data Data mining Gaussian distribution Hamming distance Gaussian mixture model

来源：评论

学校读者我要写书评

暂无评论

Detection of Venous Thromboembolism Using Recurrent Neural Networks with Time-Series Data 24

Detection of Venous Thromboembolism Using Recurrent Neural N...

引用

3rd Asia Conference on Algorithms, Computing and Machine Learning, CACML 2024

作者： Xu, Can Huang, Yaqin Xiang, Xinni Lei, Haike Yang, Jie Shanghai Jiao Tong University Shanghai China Chongqing University Cancer Hospital Chongqing China West China Hospital Sichuan University Chengdu China Shanghai Jiao Tong University Institute of Image Processing and Pattern Recognition China Chongqing Key Laboratory of Translational Research for Cancer Metastasis and Individualized Treatment China West China School of Medicine China Chongqing Cancer Multi-omics Big Data Application Engineering Research Center China

ISBN: (纸本)9798400716416

Machine Learning (ML) has been widely applied to medical science for decades. As common knowledge, the progress of many diseases is often chronic and dynamic. Longitudinal data, or time-series data, has better descriptions of certain diseases, as it naturally captures the dynamic over time. Venous thromboembolism (VTE), as a regular complication of cancer tumour treatments, has been emphasized in many studies. Recent research has shown that ML algorithms incredibly contribute to VTE risk estimation and prediction. However, existing methods rarely consider the dynamic changes during the development of VTE, and often make decisions based on time-point data, such as the latest blood test results of patients. In this paper, we propose a VTE detection model that takes advantage of capturing dynamic information using time-series data. The model consists of a Recurrent Neural Network (RNN) based framework with time embedding and Attention mechanism to encode longitudinal features of patients. We test our proposed model on a real-world dataset that contains multiple times of blood test results of patients together with other clinical features. The network is compared with several commonly used ML models in previous VTE studies. The results show that our model outperforms all baseline models, and achieved a state-of-art performance with 80.0% accuracy and 0.881 AUC. © 2024 ACM.

关键词： Risk assessment

来源：评论

学校读者我要写书评

暂无评论

Label Words are Anchors: An Information Flow Perspective for Understanding In-Context Learning

arXiv

引用

arXiv 2023年

作者： Wang, Lean Li, Lei Dai, Damai Chen, Deli Zhou, Hao Meng, Fandong Zhou, Jie Sun, Xu National Key Laboratory for Multimedia Information Processing School of Computer Science Peking University China Pattern Recognition Center WeChat AI Tencent Inc. China

In-context learning (ICL) emerges as a promising capability of large language models (LLMs) by providing them with demonstration examples to perform diverse tasks. However, the underlying mechanism of how LLMs learn from the provided context remains under-explored. In this paper, we investigate the working mechanism of ICL through an information flow lens. Our findings reveal that label words in the demonstration examples function as anchors: (1) semantic information aggregates into label word representations during the shallow computation layers' processing;(2) the consolidated information in label words serves as a reference for LLMs' final predictions. Based on these insights, we introduce an anchor re-weighting method to improve ICL performance, a demonstration compression technique to expedite inference, and an analysis framework for diagnosing ICL errors in GPT2-XL. The promising applications of our findings again validate the uncovered ICL working mechanism and pave the way for future studies. © 2023, CC BY.

关键词： Demonstrations

来源：评论

学校读者我要写书评

暂无评论

Diffusion Theory as a Scalpel: Detecting and Purifying Poisonous Dimensions in Pre-trained Language Models Caused by Backdoor or Bias

arXiv

引用

arXiv 2023年

作者： Zhang, Zhiyuan Chen, Deli Zhou, Hao Meng, Fandong Zhou, Jie Sun, Xu National Key Laboratory for Multimedia Information Processing School of Computer Science Peking University China Pattern Recognition Center WeChat AI Tencent Inc. China

Pre-trained Language Models (PLMs) may be poisonous with backdoors or bias injected by the suspicious attacker during the fine-tuning process. A core challenge of purifying potentially poisonous PLMs is precisely finding poisonous dimensions. To settle this issue, we propose the Fine-purifying approach, which utilizes the diffusion theory to study the dynamic process of fine-tuning for finding potentially poisonous dimensions. According to the relationship between parameter drifts and Hessians of different dimensions, we can detect poisonous dimensions with abnormal dynamics, purify them by resetting them to clean pre-trained weights, and then fine-tune the purified weights on a small clean dataset. To the best of our knowledge, we are the first to study the dynamics guided by the diffusion theory for safety or defense purposes. Experimental results validate the effectiveness of Fine-purifying even with a small clean dataset. Copyright © 2023, The Authors. All rights reserved.

关键词： Diffusion

来源：评论

学校读者我要写书评

暂无评论

A fast VLSI architecture for two-dimensional discrete wavelet transform based on lifting scheme [image compression applications]

A fast VLSI architecture for two-dimensional discrete wavele...

引用

International Conference on Solid-State and Integrated Circuit Technology

作者： Chengyi Xiong Jinwen Tian Jian Liu College of Electronic Information Engineering South-Center University of Science and Technology Wuhan China Institute of Pattern Recognition & Artification Intelligence Key Laboratory of Education Ministry for Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)078038511X

This paper proposes a novel fast architecture for a 2D discrete wavelet transform by using a lifting scheme, Parallel and embedded decimation techniques are employed to optimize the architecture, which is mainly composed of two horizontal filter modules and one vertical filter module, working in parallel and pipeline fashion with 100% hardware utilization. The architecture is designed to generate two outputs in one working clock cycle, with every two subbands coefficients alternately. The total time for computing J levels of decomposition for an N/spl times/N image is approximately 2N/sup 2/(1-4/sup -J/)/3 clock cycles. In comparison with the other devices reported in previous literature, the design has many advantages including lower hardware complexity and area and power efficiency. The design is also fast, regular and simple, as well as well suited for VLSI implementation.

关键词： Discrete wavelet transforms Very large scale integration Filters Computer architecture Wavelet transforms Hardware Clocks image coding Matrix converters Pipelines

来源：评论

学校读者我要写书评

暂无评论

Detection level of mango based on neural network and digital image

引用

Journal of Chemical and Pharmaceutical Research 2014年第2期6卷 129-132页

作者： Li, Xiaoling Yuan, Jimin School of Computer Science and Technology of Chengdu University China University Key Laboratory of Pattern Recognition and Intelligent Information Processing China Department Computer Engineering of Chengdu Aeronautic Vocational and Technical College China

In view of the draw backs of mango grade identification in China, which still relies on photoelectric sorting and manual separation, this paper presents a processing method on the basis of the technology of computer vision and digital image. Utilizing image processing technology, the researcher calculated the length of the long-short-axis, marked the location of it and calculated the 7 parameters, chroma, length, width and etc.,4 of which are chosen as the key characteristics of the BP input of network to build a network and identify the level of mango through analysis of the external characteristics of mango. The method is based on traditional characteristics detection, using boundary tracking algorithm and the length of the new long-short-axis detection algorithm. The result of experiment indicates that the calculating method and judging of the level of mango are precise and accurate, with an average recognition rate of 92%. Therefore, the method has a great practical value, which can be applied to other agricultural products classification.

关键词： Fruits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：