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

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： Yen-Chieh Ouyang Bo-Han Chen Meng-Chueh Lee Tsang-Sen Liu Mang Ou-Yang Hsian-Min Chen Chao-Cheng Wu Chia-Hsien Wen Min-Shao Shih Chein-I Chang Yung-Jhe Yan Department of Electrical Engineering National Chung Hsing University Taiwan Institute of communication Engineering National Chung Hsing University Taiwan Taiwan Agriculture Research Institute Nantou Taiwan Department of Electrical and Computer Engineering National Chiao-Tung University Hsinchu City Taiwan Center for Quantitative Imaging in Medicine Taichung Veterans General Hospital Taiwan Department of Electrical Engineering National Taipei University of Technology Taipei Taiwan Department of Computer Science and Information Management Providence University Taiwan Remote Sensing Signal and Image Processing Laboratory University of Maryland Baltimore MD USA

Fusarium wilt on Phalaenopsis is a disease that makes farmers suffer seriously. Although Phalaenopsis does not die immediately with Fusarium wilt, it seriously decreases the quality that buyers cannot accept. In this paper, we introduce an emerging method to detect Fusarium wilt at the base of Phalaenopsis stems. The detection model divides Phalaenopsis samples into two categories, healthy and infection. The band selection (BS) processing technique based on band prioritization (BP) is applied to extract significant bands and eliminate redundant bands. Subsequently, some algorithms which are constrained energy minimization (CEM), spectral information divergence(SID) and SeQuential N-FINDER to detect the Fusarium wilt, and we hope the research would help farmers decrease their losses.

关键词： Hyperspectral imaging Support vector machines Diseases signal to noise ratio Hybrid fiber coaxial cables Correlation

来源：评论

学校读者我要写书评

暂无评论

Weighted linear discriminant analysis based on class saliency information

arXiv

引用

arXiv 2018年

作者： Xu, Lei Iosifidis, Alexandros Gabbouj, Moncef Laboratory of Signal Processing Tampere University of Technology Tampere Finland Department of Engineering Electrical and Computer Engineering Aarhus University Aarhus Denmark

In this paper, we propose a new variant of Linear Discriminant Analysis to overcome underlying drawbacks of traditional LDA and other LDA variants targeting problems involving imbalanced classes. Traditional LDA sets assumptions related to Gaussian class distribution and neglects influence of outlier classes, that might hurt in performance. We exploit intuitions coming from a probabilistic interpretation of visual saliency estimation in order to define saliency of a class in multi-class setting. Such information is then used to redefine the between-class and within-class scatters in a more robust manner. Compared to traditional LDA and other weight-based LDA variants, the proposed method has shown certain improvements on facial image classification problems in publicly available datasets. Copyright © 2018, The Authors. All rights reserved.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Why is the Winner the Best?

Why is the Winner the Best?

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： M. Eisenmann A. Reinke V. Weru M. D. Tizabi F. Isensee T. J. Adler S. Ali V. Andrearczyk M. Aubreville U. Baid S. Bakas N. Balu S. Bano J. Bernal S. Bodenstedt A. Casella V. Cheplygina M. Daum M. De Bruijne A. Depeursinge R. Dorent J. Egger D. G. Ellis S. Engelhardt M. Ganz N. Ghatwary G. Girard P. Godau A. Gupta L. Hansen K. Harada M. Heinrich N. Heller A. Hering A. Huaulmé P. Jannin A. E. Kavur O. Kodym M. Kozubek J. Li H. Li J. Ma C. Martín-Isla B. Menze A. Noble V. Oreiller N. Padoy S. Pati K. Payette T. Rädsch J. Rafael-Patiño V. Singh Bawa S. Speidel C. H. Sudre K. Van Wijnen M. Wagner D. Wei A. Yamlahi M. H. Yap C. Yuan M. Zenk A. Zia D. Zimmerer D. Aydogan B. Bhattarai L. Bloch R. Brüngel J. Cho C. Choi Q. Dou I. Ezhov C. M. Friedrich C. Fuller R. R. Gaire A. Galdran Á. García Faura M. Grammatikopoulou S. Hong M. Jahanifar I. Jang A. Kadkhodamohammadi I. Kang F. Kofler S. Kondo H. Kuijf M. Li M. Luu T. Martinčič P. Morais M. A. Naser B. Oliveira D. Owen S. Pang J. Park S. Park S. Płotka E. Puybareau N. Rajpoot K. Ryu N. Saeed A. Shephard P. Shi D. Štepec R. Subedi G. Tochon H. R. Torres H. Urien J. L. Vilaça K. A. Wahid H. Wang J. Wang L. Wang X. Wang B. Wiestler M. Wodzinski F. Xia J. Xie Z. Xiong S. Yang Y. Yang Z. Zhao K. Maier-Hein P. F. Jäger A. Kopp-Schneider L. Maier-Hein Division of Intelligent Medical Systems German Cancer Research Center (DKFZ) Heidelberg Germany Helmholtz Imaging German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Division of Biostatistics German Cancer Research Center (DKFZ) Heidelberg Germany Division of Medical Image Computing German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Engineering and Physical Sciences School of Computing University of Leeds Leeds UK Institute of Informatics School of Management HES-SO Valais-Wallis University of Applied Sciences and Arts Western Switzerland Sierre Switzerland Department of Nuclear Medicine and Molecular Imaging Lausanne University Hospital Lausanne Switzerland Technische Hochschule Ingolstadt Ingolstadt Germany Center for Artificial Intelligence and Data Science for Integrated Diagnostics (AI2D) and Center for Biomedical Image Computing and Analytics (CBICA) University of Pennsylvania Philadelphia PA USA Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology University of Washington Seattle WA USA Department of Computer Science Wellcome/EPSRC Centre for Interventional and Surgical Sciences (WEISS) University College London London UK Universitat Autònoma de Barcelona & Computer Vision Center Barcelona Spain Division of Translational Surgical Oncology National Center for Tumor Diseases (NCT/UCC) Dresden Dresden Germany Department of Advanced Robotics Istituto Italiano di Tecnologia Italy Department of Electronics Information and Bioengineering Politecnico di Milano Milan Italy IT University of Copenhagen Copenhagen Denmark Department of General Visceral and Transplantation Surgery Heidelberg University Hospital Heidelberg Germany Department of Radiology and Nuc

International benchmarking competitions have become fundamental for the comparative performance assessment of image analysis methods. However, little attention has been given to investigating what can be learnt from these competitions. Do they really generate scientific progress? What are common and successful participation strategies? What makes a solution superior to a competing method? To address this gap in the literature, we performed a multicenter study with all 80 competitions that were conducted in the scope of IEEE ISBI 2021 and MICCAI 2021. Statistical analyses performed based on comprehensive descriptions of the submitted algorithms linked to their rank as well as the underlying participation strategies revealed common characteristics of winning solutions. These typically include the use of multi-task learning (63%) and/or multi-stage pipelines (61%), and a focus on augmentation (100%), image preprocessing (97%), data curation (79%), and post-processing (66%). The “typical” lead of a winning team is a computer scientist with a doctoral degree, five years of experience in biomedical image analysis, and four years of experience in deep learning. Two core general development strategies stood out for highly-ranked teams: the reflection of the metrics in the method design and the focus on analyzing and handling failure cases. According to the organizers, 43% of the winning algorithms exceeded the state of the art but only 11% completely solved the respective domain problem. The insights of our study could help researchers (1) improve algorithm development strategies when approaching new problems, and (2) focus on open research questions revealed by this work.

关键词：

来源：评论

学校读者我要写书评

暂无评论

WEIGHTED LINEAR DISCRIMINANT ANALYSIS BASED ON CLASS SALIENCY INFORMATION

WEIGHTED LINEAR DISCRIMINANT ANALYSIS BASED ON CLASS SALIENC...

引用

IEEE International Conference on Image processing

作者： Lei Xu Alexandros Iosifidis Moncef Gabbouj Laboratory of Signal Processing Tampere University of Technology Tampere Finland Department of Engineering Electrical & Computer Engineering Aarhus University Aarhus Denmark

关键词： Estimation Probabilistic logic Visualization Optimization Linear discriminant analysis Task analysis Robustness

来源：评论

学校读者我要写书评

暂无评论

STUDY OF DENSE NETWORK APPROACHES FOR SPEECH EMOTION RECOGNITION

STUDY OF DENSE NETWORK APPROACHES FOR SPEECH EMOTION RECOGNI...

引用

IEEE International Conference on Acoustics, Speech and signal processing

作者： Mohammed Abdelwahab Carlos Busso Multimodal Signal Processing (MSP) Laboratory Department of Electrical Computer Engineering The University of Texas at Dallas Richardson TX 75080 USA

ISBN: (纸本)9781538646595

Deep neural networks have been proven to be very effective in various classification problems and show great promise for emotion recognition from speech. Studies have proposed various architectures that further improve the performance of emotion recognition systems. However, there are still various open questions regarding the best approach to building a speech emotion recognition system. Would the system's performance improve if we have more labeled data? How much do we benefit from data augmentation? What activation and regularization schemes are more beneficial? How does the depth of the network affect the performance? We are collecting the MSP-Podcast corpus, a large dataset with over 30 hours of data, which provides an ideal resource to address these questions. This study explores various dense architectures to predict arousal, valence and dominance scores. We investigate varying the training set size, width, and depth of the network, as well as the activation functions used during training. We also study the effect of data augmentation on the network's performance. We find that bigger training set improves the performance. Batch normalization is crucial to achieving a good performance for deeper networks. We do not observe significant differences in the performance in residual networks compared to dense networks.

关键词： Speech emotion recognition Deep Neural Networks emotion recognition System performance Speech Network Activating function

来源：评论

学校读者我要写书评

暂无评论

NOVEL REALIZATIONS OF SPEECH-DRIVEN HEAD MOVEMENTS WITH GENERATIVE ADVERSARIAL NETWORKS

NOVEL REALIZATIONS OF SPEECH-DRIVEN HEAD MOVEMENTS WITH GENE...

引用

IEEE International Conference on Acoustics, Speech and signal processing

作者： Najmeh Sadoughi Carlos Busso Multimodal Signal Processing (MSP) Laboratory Department of Electrical and Computer Engineering The University of Texas at Dallas Richardson TX 75080 USA

ISBN: (纸本)9781538646595

Head movement is an integral part of face-to-face communications. It is important to investigate methodologies to generate naturalistic movements for conversational agents (CAs). The predominant method for head movement generation is using rules based on the meaning of the message. However, the variations of head movements by these methods are bounded by the predefined dictionary of gestures. Speech-driven methods offer an alternative approach, learning the relationship between speech and head movements from real recordings. However, previous studies do not generate novel realizations for a repeated speech signal. Conditional generative adversarial network (GAN) provides a framework to generate multiple realizations of head movements for each speech segment by sampling from a conditioned distribution. We build a conditional GAN with bidirectional long-short term memory (BLSTM), which is suitable for capturing the long-short term dependencies of time-continuous signals. This model learns the distribution of head movements conditioned on speech prosodic features. We compare this model with a dynamic Bayesian network (DBN) and BLSTM models optimized to reduce mean squared error (MSE) or to increase concordance correlation. The objective evaluations and subjective evaluations of the results showed better performance for the conditional GAN model compared with these baseline systems.

关键词： Head movements synthesis speech-driven animation conditional generative adversarial networks Head Movements Speech Head Conditional Voice signal Mean square error

来源：评论

学校读者我要写书评

暂无评论

BigNeuron: a resource to benchmark and predict performance of algorithms for automated tracing of neurons in light microscopy datasets

引用

Nature methods 2023年第6期20卷 824-835页

作者： Linus Manubens-Gil Zhi Zhou Hanbo Chen Arvind Ramanathan Xiaoxiao Liu Yufeng Liu Alessandro Bria Todd Gillette Zongcai Ruan Jian Yang Miroslav Radojević Ting Zhao Li Cheng Lei Qu Siqi Liu Kristofer E Bouchard Lin Gu Weidong Cai Shuiwang Ji Badrinath Roysam Ching-Wei Wang Hongchuan Yu Amos Sironi Daniel Maxim Iascone Jie Zhou Erhan Bas Eduardo Conde-Sousa Paulo Aguiar Xiang Li Yujie Li Sumit Nanda Yuan Wang Leila Muresan Pascal Fua Bing Ye Hai-Yan He Jochen F Staiger Manuel Peter Daniel N Cox Michel Simonneau Marcel Oberlaender Gregory Jefferis Kei Ito Paloma Gonzalez-Bellido Jinhyun Kim Edwin Rubel Hollis T Cline Hongkui Zeng Aljoscha Nern Ann-Shyn Chiang Jianhua Yao Jane Roskams Rick Livesey Janine Stevens Tianming Liu Chinh Dang Yike Guo Ning Zhong Georgia Tourassi Sean Hill Michael Hawrylycz Christof Koch Erik Meijering Giorgio A Ascoli Hanchuan Peng Institute for Brain and Intelligence Southeast University Nanjing China. Microsoft Corporation Redmond WA USA. Tencent AI Lab Bellevue WA USA. Computing Environment and Life Sciences Directorate Argonne National Laboratory Lemont IL USA. Kaya Medical Seattle WA USA. University of Cassino and Southern Lazio Cassino Italy. Center for Neural Informatics Structures and Plasticity Krasnow Institute for Advanced Study George Mason University Fairfax VA USA. Faculty of Information Technology Beijing University of Technology Beijing China. Beijing International Collaboration Base on Brain Informatics and Wisdom Services Beijing China. Nuctech Netherlands Rotterdam the Netherlands. Janelia Research Campus Howard Hughes Medical Institute Ashburn VA USA. Department of Electrical and Computer Engineering University of Alberta Edmonton Alberta Canada. Ministry of Education Key Laboratory of Intelligent Computation and Signal Processing Anhui University Hefei China. Paige AI New York NY USA. Scientific Data Division and Biological Systems and Engineering Division Lawrence Berkeley National Lab Berkeley CA USA. Helen Wills Neuroscience Institute and Redwood Center for Theoretical Neuroscience UC Berkeley Berkeley CA USA. RIKEN AIP Tokyo Japan. Research Center for Advanced Science and Technology (RCAST) The University of Tokyo Tokyo Japan. School of Computer Science University of Sydney Sydney New South Wales Australia. Texas A&M University College Station TX USA. Cullen College of Engineering University of Houston Houston TX USA. Graduate Institute of Biomedical Engineering National Taiwan University of Science and Technology Taipei Taiwan. National Centre for Computer Animation Bournemouth University Poole UK. PROPHESEE Paris France. Department of Neuroscience Columbia University New York NY USA. Mortimer B. Zuckerman Mind Brain Behavior Institute Columbia University New York NY USA. Department of Computer Science Northern Illinois Universit

BigNeuron is an open community bench-testing platform with the goal of setting open standards for accurate and fast automatic neuron tracing. We gathered a diverse set of image volumes across several species that is representative of the data obtained in many neuroscience laboratories interested in neuron tracing. Here, we report generated gold standard manual annotations for a subset of the available imaging datasets and quantified tracing quality for 35 automatic tracing algorithms. The goal of generating such a hand-curated diverse dataset is to advance the development of tracing algorithms and enable generalizable benchmarking. Together with image quality features, we pooled the data in an interactive web application that enables users and developers to perform principal component analysis, t-distributed stochastic neighbor embedding, correlation and clustering, visualization of imaging and tracing data, and benchmarking of automatic tracing algorithms in user-defined data subsets. The image quality metrics explain most of the variance in the data, followed by neuromorphological features related to neuron size. We observed that diverse algorithms can provide complementary information to obtain accurate results and developed a method to iteratively combine methods and generate consensus reconstructions. The consensus trees obtained provide estimates of the neuron structure ground truth that typically outperform single algorithms in noisy datasets. However, specific algorithms may outperform the consensus tree strategy in specific imaging conditions. Finally, to aid users in predicting the most accurate automatic tracing results without manual annotations for comparison, we used support vector machine regression to predict reconstruction quality given an image volume and a set of automatic tracings.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reduced Dimension Minimum BER PSK Precoding for Constrained Transmit signals in Massive MIMO

Reduced Dimension Minimum BER PSK Precoding for Constrained ...

引用

2018 IEEE International Conference on Acoustics, Speech, and signal processing, ICASSP 2018

作者： Lee Swindlehurst, A. Jedda, Hela Fijalkowt, Inbar Center for Pervasive Communications and Computing University of California Irvine IrvineCA92697 United States Department of Signal Processing Dept. of Electrical Computer Engineering Technical University of Munich Munich80290 Germany ETIS ENSEA CNRS Universitc Paris-Seine Universite Cergy-Pontoise CergyF-95000 France

ISBN: (纸本)9781538646588

Recently a number of nonlinear precoding algorithms have been developed for designing a downlink transmit signal that is constrained by some nonlinearity, such as one-bit quantization, power-amplifier saturation or constant modulus. These methods use iterative search algorithms to directly design the signal that is transmitted from each antenna. Since the dimension of the search space equals the number of antennas, the computational complexity of these approaches can be high for massive MIMO scenarios. Thus, in this paper we pose the problem in a smaller dimensional space by constraining the signal prior to the nonlinearity to be the output of a linear precoder. The search is then over the vector of predistorted symbols at the input to the linear precoder, which is typically much smaller than the number of antennas. We focus on algorithms that minimize the bit error rate at the receivers, and show that performance can be obtained that is similar to algorithms that operate directly in the antenna domain. © 2018 IEEE.

关键词： Precoding Transmitting antennas MIMO communication Phase shift keying Downlink Predistortion"

来源：评论

学校读者我要写书评

暂无评论

An Efficient Successive Cancellation Polar Decoder Based on New Folding Approaches 12

An Efficient Successive Cancellation Polar Decoder Based on ...

引用

2017 IEEE 12th International Conference on ASIC

作者： Xiao Liang Yechao She Harish Vangala Xiaohu You Chuan Zhang Emanuele Viterbo Lab of Efficient Architectures for Digital-communication and Signal-processing(LEADS) National Mobile Communications Research Laboratory Southeast University Department of Electronic and Computer Engineering HKUST Department of Electrical and Computer Systems Engineering Monash University

ISBN: (纸本)9781509066261;9781509066254

In this paper,an efficient successive cancellation(SC) polar decoder based on new folding approaches is *** main approach of this paper is called k-level decomposition with 2 *** k and p,the derived architecture can have a very low processing complexity with proper combinations of decomposition method and folding *** to state-of-the-art designs,hardware utilization ratio(HUR) of processing elements can be drastically improved with small latency ***,the memory complexity remains ***,decomposition and folding operations can also be applied to a family of hybrid polar *** validate efficiency of these approaches,two folded SC decoders with N = 64 and 1024 respectively are implemented with Altera Stratix V *** two demos require only 68.3% and 39.1%ALMs,compared to the non-decomposed SC decoder.

关键词： Polar code SC decoder k-level decomposition folding technique VLSI implementation

来源：评论

学校读者我要写书评

暂无评论

Forecasting of jump arrivals in stock prices: New attention-based network architecture using limit order book data

arXiv

引用

arXiv 2018年

作者： Mäkinen, Milla Kanniainen, Juho Gabbouj, Moncef Iosifidis, Alexandros Laboratory of Signal Processing Tampere University of Technology Finland Laboratory of Industrial and Information Management Tampere University of Technology Finland Department of Engineering Electrical and Computer Engineering Aarhus University Denmark

The existing literature provides evidence that limit order book data can be used to predict short-term price movements in stock markets. This paper proposes a new neural network architecture for predicting return jump arrivals in equity markets with high-frequency limit order book data. This new architecture, based on Convolutional Long Short-Term Memory with Attention, is introduced to apply time series representation learning with memory and to focus the prediction attention on the most important features to improve performance. The data set consists of order book data on five liquid U.S. stocks. The use of the attention mechanism makes it possible to analyze the importance of the inclusion limit order book data and other input variables. By using this mechanism, we provide evidence that the use of limit order book data was found to improve the performance of the proposed model in jump prediction, either clearly or marginally, depending on the underlying stock. This suggests that path-dependence in limit order book markets is a stock specific feature. Moreover, we find that the proposed approach with an attention mechanism outperforms the multi-layer perceptron network as well as the convolutional neural network and Long Short-Term memory model. Copyright © 2018, The Authors. All rights reserved.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：