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

Discrete, recurrent, and scalable patterns in human judgement underlie affective picture ratings

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Azcona, Emanuel A. Kim, Byoung-Woo Vike, Nicole L. Bari, Sumra Lalvani, Shamal Stefanopoulos, Leandros Woodward, Sean Block, Martin Katsaggelos, Aggelos K. Breiter, Hans C. Image and Video Processing Lab Department of Electrical and Computer Engineering Northwestern University EvanstonIL United States Department of Psychiatry and Behavioral Sciences Northwestern University ChicagoIL United States Integrated Marketing Communications Northwestern University EvanstonIL United States Department of Computer Science Northwestern University EvanstonIL United States Department of Radiology Northwestern University ChicagoIL United States Laboratory of Neuroimaging and Genetics Department of Psychiatry Massachusetts General Hospital Harvard School of Medicine BostonMA United States

Operant keypress tasks, where each action has a consequence, have been analogized to the construct of "wanting" and produce lawful relationships in humans that quantify preferences for approach and avoidance behavior. It is unknown if rating tasks without an operant framework, which can be analogized to "liking", show similar lawful relationships. We studied three independent cohorts of participants (N = 501, 506, and 4,019 participants) collected by two distinct organizations, using the same 7-point Likert scale to rate negative to positive preferences for pictures from the International Affective Picture Set. Picture ratings without an operant framework produced similar value functions, limit functions, and tradeoff functions to those reported in the literature for operant keypress tasks, all with Rn goodness of fits above 0.75. These value, limit, and trade-off functions were discrete in their mathematical formulation, recurrent across all three independent cohorts, and demonstrated scaling between individual and group curves. In all three experiments, the computation of loss aversion showed 95% confidence intervals below the value of 2, arguing against a strong overweighting of losses relative to gains, as has previously been reported for keypress tasks or games of chance with calibrated uncertainty. Graphed features from the three cohorts were similar and argue that preference assessments meet three of four criteria for lawfulness, providing a simple, short, and low-cost method for the quantitative assessment of preference without forced choice decisions, games of chance, or operant keypressing. This approach can easily be implemented on any digital device with a screen (e.g., cellphones). © 2022, CC BY.

关键词： Big data

Improving Generalized Zero-Shot Learning by Semantic Discriminator

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Li, Xinpeng Ye, Mao Zhou, Lihua Zhang, Dan Zhu, Ce Liu, Yiguang School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu611731 China School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu611731 China Vision and Image Processing Laboratory School of Computer Science Sichuan University Chengdu610065 China

It is a recognized fact that the classification accuracy of unseen classes in the setting of Generalized Zero-Shot Learning (GZSL) is much lower than that of traditional Zero-Shot Leaning (ZSL). One of the reasons is that an instance is always misclassified to the wrong domain. Here we refer to the seen and unseen classes as two domains respectively. We propose a new approach to distinguish whether the instances come from the seen or unseen classes. First the visual feature of instance is projected into the semantic space. Then the absolute norm difference between the projected semantic vector and the class semantic embedding vector, and the minimum distance between the projected semantic vectors and the semantic embedding vectors of the seen classes are used as discrimination basis. This approach is termed as SD (Semantic Discriminator) because domain judgement of instance is performed in the semantic space. Our approach can be combined with any existing ZSL method and fully supervision classification model to form a new GZSL method. Furthermore, our approach is very simple and doesn’t need any fixed parameters. A large number of experiments show that the accuracy of our approach is 8.5% to 21.9% higher than the current best method. Copyright © 2020, The Authors. All rights reserved.

关键词： Discriminators

Anomaly Scoring for Prediction-Based Anomaly Detection in Time Series

学校读者我要写书评

暂无评论

Anomaly Scoring for Prediction-Based Anomaly Detection in Ti...

IEEE Aerospace Conference

作者： Tianyu Li Mary L. Comer Edward J. Delp Sundip R. Desai James L. Mathieson Richard H. Foster Moses W. Chan Video and Image Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette Indiana USA Advanced Technology Center Lockheed Martin Space Palo Alto California USA

ISBN: (数字)9781728127347

ISBN: (纸本)9781728127354

Prediction-based anomaly detection methods for time series have been studied for decades and demonstrated to be useful in many applications. However, many predictors cannot accurately predict values around abrupt changes in time series, which may result in false detections or missed detections. In this paper, the problem is addressed using an anomaly scoring method for prediction-based anomaly detection. A Long Short-Term Memory (LSTM) network is used for prediction, and a dynamic thresholding method is used for anomaly extraction from prediction error sequences. The pattern of falsely-detected anomalies, or false positive sequences (FPS), in training data is learned by a clustering algorithm. A score is assigned to each detected anomaly in test data according to its distance to the nearest FPS pattern learned from training data. The effectiveness of this method is demonstrated by testing it on a variety of public time series datasets.

关键词：

Three Dimensional Nuclei Segmentation and Classification of Fluorescence Microscopy images

学校读者我要写书评

暂无评论

Three Dimensional Nuclei Segmentation and Classification of ...

IEEE International Symposium on Biomedical Imaging

作者： Shuo Han Soonam Lee Alain Chen Changye Yang Paul Salama Kenneth W Dunn Edward J. Delp Video and Image Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette Indiana Indiana University-Purdue University Indianapolis Indiana Division of Nephrology School of Medicine Indiana University Indianapolis Indiana

ISBN: (数字)9781538693308

ISBN: (纸本)9781538693315

Segmentation and classification of cell nuclei in fluorescence 3D microscopy image volumes are fundamental steps for image analysis. However, accurate cell nuclei segmentation and detection in microscopy image volumes are hampered by poor image quality, crowding of nuclei, and large variation in nuclei size and shape. In this paper, we present an unsupervised volume to volume translation approach adapted from the Recycle-GAN using modified Hausdorff distance loss for synthetically generating nuclei with better shapes. A 3D CNN with a regularization term is used for nuclei segmentation and classification followed by nuclei boundary refinement. Experimental results demonstrate that the proposed method can successfully segment nuclei and identify individual nuclei.

关键词： Three-dimensional displays Microscopy Shape image segmentation Solid modeling Training Predictive models

Minutiae Triangle Graphs: A New Fingerprint Representation with Invariance Properties

学校读者我要写书评

暂无评论

Minutiae Triangle Graphs: A New Fingerprint Representation w...

International Conference on image and vision Computing New Zealand, IVCNZ

作者： Akmal-Jahan Mohamed-Abdul-Cader Watcharapong Chaidee Jasmine Banks Vinod Chandran Vision and Signal Processing Lab School of Electrical Engineering and Computer Science Queensland University of Technology Brisbane Australia Signal and Image Processing Laboratory Kasetsart University Bangkok Thailand

A new algorithm for matching finger or palm prints is presented for use where the full hand is considered as a biometric and only parts may be available in images for comparison. The algorithm uses an extended version of the minutiae-based approach treating the pattern as a graph of minutiae-like points. The procedure to identify minutiae-like points uses Gabor filtering, edge detection and thinning and following line patterns. A set of such points is subjected to Delaunay triangulation yielding a starting set of base-triangles for matching. There can be multiple matches of such triangles between the template and test - as similar triangles with a tolerance in the angles. Graphs are then grown to 5 and more nodes as long as a match can be found, until the maximum size matching graph is obtained. If the test matches a significant part of the template, the maximum order of graph matched will be high. The matching process is robust to transformations such as rotation, translation and scale changes. It can be applied to any part of the hand provided minutiae-like points are identifiable prior to the matching steps. The algorithm is tested using 158 fingerprint images from FVC 2002 DB1. 100 genuine and 5048 impostor scores are generated from 46 templates and 112 testing images. It had an EER of about 6%. It proves the principle behind the methodology and demonstrates that the method can be effective with degraded fingerprint images and is robust to similarity transformations present in the data. It can be applied for forensic fingerprint matching from the palm or parts other than the fingertips. By using multiple parts and multiple templates, the accuracy of the method will be improved with fusion in future versions of the algorithm.

关键词：

One-dimensional quasi bound states in the continuum with large operation bandwidth in the ω~k space for nonlinear optical applications

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Sun, Kaili Jiang, Hui Bykov, Dmitry A. Van, Vien Levy, Uriel Cai, Yangjian Han, Zhanghua Shandong Provincial Key Laboratory of Optics and Photonic Devices Center of Light Manipulation and Applications School of Physics and Electronics Shandong Normal University Jinan250358 China Image Processing Systems Institute Branch of the Federal Scientific Research Centre "Crystallography and Photonics" Russian Academy of Sciences 151 Molodogvardeyskaya st. Samara443001 Russia Department of Electrical and Computer Engineering University of Alberta EdmontonT6G 2V4 Canada Department of Applied Physics The center for Nanoscience and Nanotechnology The Hebrew University of Jerusalem Jerusalem Israel

The phenomenon of bound state in the continuum (BIC) with infinite quality factor and lifetime has emerged in recent years in photonics as a new tool of manipulating light-matter interactions. However, most of the investigated structures only support BIC resonances at very few discrete points in the ω~k space. Even when the BIC is switched to a quasi-BIC(QBIC) resonance through perturbation, its frequency will still be located within a narrow spectral band close to that of the original BIC, restricting their applications in many fields where random or multiple input frequencies beyond the narrow band are required. In this work, we demonstrate that a new set of QBIC resonances can be supported by making use of a special binary grating consisting of two alternatingly aligned ridge arrays with the same period and zero-approaching ridge width difference on a slab waveguide. These QBIC resonances are distributed continuously over a broad band along a line in the ω~k space and can thus be considered as one-dimensional QBICs. With the Q factors generally affected by the ridge difference, it is now possible to choose arbitrarily any frequencies on the dispersion line to achieve significantly enhanced light-matter interactions, facilitating many applications where multiple input wavelengths are required, e.g. sum or difference frequency generations in nonlinear optics. Copyright © 2022, The Authors. All rights reserved.

关键词： Resonance

Reduced Gaussian process regression for fault detection of chemical processes

学校读者我要写书评

暂无评论

Reduced Gaussian process regression for fault detection of c...

2019 International Conference on Internet of Things, Embedded Systems and Communications, IINTEC 2019

作者： Fezai, Radhia Mansouri, Majdi Bouguila, Nasreddine Nounou, Hazem Nounou, Mohamed Laboratory of Automatic Signal and Image Processing National School of Engineers of Monastir University of Monastir 5019 Tunisia Electrical and Computer Engineering Program Texas AM University at Qatar Doha Qatar Chemical Engineering Program Texas AM University at Qatar Doha Qatar

ISBN: (纸本)9781728151847

In this paper, a reduced Gaussian process regression (RGPR)-based generalized likelihood ratio test (GLRT) is proposed for fault detection in industrial systems. In contrast to the classical GPR technique, the RGPR model can handle domains with a large number of activities that require very large training sets. The developed RGPR-based GLRT method aims first to build a RGPR model, then, it consists to apply GLRT to the monitored residuals obtained from PGPR for fault detection purposes. The fault detection performance of the developed RGPR-based GLRT method is illustrated through the Tennessee Eastman process. The simulation results show that the RGPR-based GLRT method outperforms the conventional GPR-based GLRT technique in terms of miss detection rate and CPU-time. © 2019 IEEE.

关键词： Fault detection

Machine learning based Gaussian process regression for fault detection of Biological Systems

学校读者我要写书评

暂无评论

Machine learning based Gaussian process regression for fault...

2019 International Conference on Internet of Things, Embedded Systems and Communications, IINTEC 2019

ISBN: (纸本)9781728151847

Effective detection of faults in Biological processes is essential to observe the continuity of good functioning of the system under typical circumstances for ensuring safety. Therefore, the first objective of this paper is to develop a machine learning based Gaussian process regression (GPR) technique that can accurately model biological processes and compute the monitored residuals. The second objective is to apply a generalized likelihood ratio test (GLRT) to the evaluated residuals for fault detection purposes. The detection performance of the GPR-based GLRT is evaluated using a biological process representing a Cad System in E. Coli (CSEC) model. The GPR-based GLRT is used to enhance monitoring of the Cad System in E. coli process through monitoring some of the key variables involved in this process, such as enzymes, lysine, and cadaverine. © 2019 IEEE.

关键词： Fault detection

Disentanglement Then Reconstruction: Learning Compact Features for Unsupervised Domain Adaptation

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zhou, Lihua Ye, Mao Li, Xinpeng Zhu, Ce Liu, Yiguang Li, Xue School of Computer Science and Engineering University of Electronic Science and Technology of China ChengduP.R.611731 China School of Information and Communication Engineering University of Electronic Science and Technology of China ChengduP.R.611731 China Vision and Image Processing Laboratory School of Computer Science Sichuan University ChengduP.R.610065 China School of Information Technology and Electronic Engineering The University of Queensland BrisbaneQLD4072 Australia

Recent works in domain adaptation always learn domain invariant features to mitigate the gap between the source and target domains by adversarial methods. The category information are not sufficiently used which causes the learned domain invariant features are not enough discriminative. We propose a new domain adaptation method based on prototype construction which likes capturing data cluster centers. Specifically, it consists of two parts: disentanglement and reconstruction. First, the domain specific features and domain invariant features are disentangled from the original features. At the same time, the domain prototypes and class prototypes of both domains are estimated. Then, a reconstructor is trained by reconstructing the original features from the disentangled domain invariant features and domain specific features. By this reconstructor, we can construct prototypes for the original features using class prototypes and domain prototypes correspondingly. In the end, the feature extraction network is forced to extract features close to these prototypes. Our contribution lies in the technical use of the reconstructor to obtain the original feature prototypes which helps to learn compact and discriminant features. As far as we know, this idea is proposed for the first time. Experiment results on several public datasets confirm the state-of-the-art performance of our method. Copyright © 2020, The Authors. All rights reserved.

关键词： Machine learning