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

International Joint Conference on Neural Networks (IJCNN)

作者： Yanhua Chen Ming Dong Manjeet Rege Machine Vision and Pattern Recognition Laboratory Department of Computer Science Wayne State University Detroit MI USA

In order to help understand how the genes are affected by different disease conditions in a biological system, clustering is typically performed to analyze gene expression data. In this paper, we propose to solve the clustering problem using a graph theoretical approach, and apply a novel graph partitioning model -isoperimetric graph partitioning (IGP), to group biological samples from gene expression data. The IGP algorithm has several advantages compared to the well-established spectral graph partitioning (SGP) model. First, IGP requires a simple solution to a sparse system of linear equations instead of the eigen-problem in the SGP model. Second, IGP avoids degenerate cases produced by spectral approach to achieve a partition with higher accuracy. Moreover, we integrate unsupervised gene selection into the proposed approach through two-way ordering of gene expression data, such that we can eliminate irrelevant or redundant genes in the data and obtain an improved clustering result. We evaluate our approach on several well-known problems involving gene expression profiles of colon cancer and leukemia subtypes. Our experiment results demonstrate that IGP constantly outperforms SGP and produces a better result that is closer to the original labeling of sample sets provided by domain experts. Furthermore, the clustering accuracy is improved significantly when IGP is integrated with the unsupervised gene (feature) selection.

关键词： Gene expression Biological system modeling Diseases Biological systems Data analysis Performance analysis Clustering algorithms Partitioning algorithms Equations Colon

来源：评论

学校读者我要写书评

暂无评论

DocSegTr: An Instance-Level End-to-End Document Image Segmentation Transformer

arXiv

引用

arXiv 2022年

作者： Biswas, Sanket Banerjee, Ayan Lladós, Josep Pal, Umapada Computer Vision Center Computer Science Department Universitat Autònoma de Barcelona Spain Computer Vision and Pattern Recognition Unit Indian Statistical Institute India

Understanding documents with rich layouts is an essential step towards information extraction. Business intelligence processes often require the extraction of useful semantic content from documents at a large scale for subsequent decision-making tasks. In this context, instance-level segmentation of different document objects (title, sections, figures etc.) has emerged as an interesting problem for the document analysis and understanding community. To advance the research in this direction, we present a transformer-based model called DocSegTr for end-to-end instance segmentation of complex layouts in document images. The method adapts a twin attention module, for semantic reasoning, which helps to become highly computationally efficient compared with the state-of-the-art. To the best of our knowledge, this is the first work on transformer-based document segmentation. Extensive experimentation on competitive benchmarks like PubLayNet, PRIMA, Historical Japanese (HJ) and TableBank demonstrate that our model achieved comparable or better segmentation performance than the existing state-of-the-art approaches with the average precision of 89.4, 40.3, 83.4 and 93.3. This simple and flexible framework could serve as a promising baseline for instance-level recognition tasks in document images. © 2022, CC BY-SA.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Classifiability based omnivariate decision trees

Classifiability based omnivariate decision trees

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Y. Li M. Dong Machine Vision and Pattern Recognition Laboratory Department of Computer Science Wayne State University Detroit MI USA

Decision trees represent a simple and powerful method of induction from labeled examples. Univariate decision trees consider the value of a single attribute at each node, leading to the splits that are parallel to the axes. In linear multivariate decision trees, all the attributes are used and the partition at each node is based on a linear discriminate (a hyperplane). Nonlinear multivariate decision trees are able to divide the input space arbitrarily based on higher order parameterizations of the discriminate, though one should be aware of the increase of the complexity and the decrease in the number of examples available as moves further down the tree. In omnivariate decision trees, the decision node may be univariate, linear, or nonlinear. Such architecture frees the designer from choosing the appropriate tree type for a given problem. In this paper, we propose to do the model selection at each decision node based on a novel classifiability measure when building omnivariate decision trees. The classifiability measure captures the possible sources of misclassification with relative ease and is able to accurately reflect the complexity of subproblems at each node. The proposed approach does not require the time consuming statistic tests at each node and therefore does not suffer from as high computational burden as typical model selection algorithm. Our simulation results over several data sets indicate that our approach can achieve at least as good classification accuracy as statistical tests based model select algorithms, but in much faster speed.

关键词： Classification tree analysis Decision trees Testing Shape Machine vision pattern recognition Laboratories computer science Buildings Statistical analysis

来源：评论

学校读者我要写书评

暂无评论

3D object retrieval with semantic attributes 11

3D object retrieval with semantic attributes

引用

19th ACM International Conference on Multimedia ACM Multimedia 2011, MM'11

作者： Gong, Boqing Liu, Jianzhuang Wang, Xiaogang Tang, Xiaoou Department of Information Engineering Chinese University of Hong Kong Hong Kong Department of Electronic Engineering Chinese University of Hong Kong Hong Kong Shenzhen Key Laboratory for Computer Vision and Pattern Recognition Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China

ISBN: (纸本)9781450306164

Humans are capable of describing objects using attributes, such as "the object looks circular and is man-made". Motivated by these high-level descriptions, we build a user-friendly 3D object retrieval system, where the user can browse the database and search for targeted objects using semantic attributes. The main advantage of our system is that it does not require the user to find or sketch a 3D object as the query for 3D object retrieval. Besides, to the best of our knowledge, our system has obtained the best retrieval performance on three popular benchmarks. Copyright 2011 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Communication via eye blinks and eyebrow raises: Video-based human-computer interfaces

引用

Universal Access in the Information Society 2003年第4期2卷 359-373页

作者： Grauman, K. Betke, M. Lombardi, J. Gips, J. Bradski, G.R. Vision Interface Group AI Laboratory Massachusetts Institute of Technology 77 Massachusetts Avenue CambridgeMA02139 United States Computer Science Department Boston University 111 Cummington St BostonMA02215 United States EagleEyes Computer Science Department Boston College Fulton Hall Chestnut HillMA02467 United States Vision Graphics and Pattern Recognition Microcomputer Research Laboratory Intel Corporation SC12-303 2200 Mission College Blvd Santa ClaraCA95054-1537 United States

Two video-based human-computer interaction tools are introduced that can activate a binary switch and issue a selection command. "BlinkLink," as the first tool is called, automatically detects a user's eye blinks and accurately measures their durations. The system is intended to provide an alternate input modality to allow people with severe disabilities to access a computer. Voluntary long blinks trigger mouse clicks, while involuntary short blinks are ignored. The system enables communication using "blink patterns:" sequences of long and short blinks which are interpreted as semiotic messages. The second tool, "EyebrowClicker," automatically detects when a user raises his or her eyebrows and then triggers a mouse click. Both systems can initialize themselves, track the eyes at frame rate, and recover in the event of errors. No special lighting is required. The systems have been tested with interactive games and a spelling program. Results demonstrate overall detection accuracy of 95.6% for BlinkLink and 89.0% for EyebrowClicker. © Springer-Verlag 2003.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

Even big data is not enough: need for a novel reference modelling for forensic document authentication

Even big data is not enough: need for a novel reference mode...

引用

作者： Garain, Utpal Halder, Biswajit Computer Vision and Pattern Recognition Unit and Centre for Artificial Intelligence and Machine Learning Indian Statistical Institute 203 B. T. Road Kolkata700108 India Department of CSE Narula Institute of Technology Agarpara Kolkata700109 India

With the emergence of big data, deep learning (DL) approaches are becoming quite popular in many branches of science. Forensic science is no longer an exception. However, there are certain problems in forensic science where the solutions would hardly benefit from the recent advances in DL algorithms. Document authentication is one such problem where we can have many reference samples, and with the big data scenario probably we would have even more number of reference samples but number of defective or forged samples will remain an issue. Experts often encounter situations where there is no or hardly a scanty number of forged samples available. In such situation, employment of data-hungry algorithms would be inefficient as they will not be able to learn the forged samples properly. This paper addresses this problem and proposes a novel reference modelling framework for forensic document authentication. The approach is based on Mahalanobis space. Two questioned document examination problems have been studied to show the effectiveness of our reference modelling algorithm which has also been compared to a commonly used learning approach, namely neural network-based classification. © 2019, Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Motion constraint patterns

Motion constraint patterns

引用

1993 IEEE Workshop on Qualitative vision, WQV 1993

作者： Fermüller, Cornelia Computer Vision Laboratory Center for Automation Research University of Maryland College ParkMD20742-3275 United States Department for Pattern Recognition and Image Processing Institute for Automation Technical University Vienna Treitlstraße 3 ViennaA-1040 Austria

ISBN: (纸本)0818636920

The problem of egomotion recovery has been treated by using as input local image motion, with the published algorithms utilizing the geometric constraint relating 2-D local image motion (optical flow, correspondence, derivatives of the image flow) to 3-D motion and structure. Since it has proved very difficult to achieve accurate input (local image motion), a lot of effort has been devoted to the development of robust techniques. A new approach to the problem of egomotion estimation is taken, based on constraints of a global nature. It is proved that local normal flow measurements form global patterns in the image plane. The position of these patterns is related to the three dimensional motion parameters. By locating some of these patterns, which depend only on subsets of the motion parameters, through a simple search technique, the 3-D motion parameters can be found. The proposed algorithmic procedure is very robust, since it is not affected by small perturbations in the normal flow measurements. As a matter of fact, since only the sign of the normal flow measurement is employed, the direction of translation and the axis of rotation can be estimated with up to 100% error in the image measurements. © 1993 IEEE.

关键词： Flow measurement

来源：评论

学校读者我要写书评

暂无评论

CANDID: Robust change dynamics and deterministic update policy for dynamic background subtraction

arXiv

引用

arXiv 2018年

作者： Mandal, Murari Saxena, Prafulla Vipparthi, Santosh Kumar Murala, Subrahmanyam Department of Computer Science & Engineering MNIT Jaipur India Computer Vision and Pattern Recognition Lab Department of Electrical Engineering IIT Ropar India

Background subtraction in video provides the preliminary information which is essential for many computer vision applications. In this paper, we propose a sequence of approaches named CANDID to handle the change detection problem in challenging video scenarios. The CANDID adaptively initializes the pixel-level distance threshold and update rate. These parameters are updated by computing the change dynamics at a location. Further, the background model is maintained by formulating a deterministic update policy. The performance of the proposed method is evaluated over various challenging scenarios such as dynamic background and extreme weather conditions. The qualitative and quantitative measures of the proposed method outperform the existing state-of-the-art approaches. Copyright © 2018, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Compound attention embedded dual channel encoder-decoder for ms lesion segmentation from brain MRI

引用

Multimedia Tools and Applications 2024年 1-33页

作者： Ghosal, Palash Roy, Abhijit Agarwal, Rohit Purkayastha, Kunal Sharma, Aaditya Lochan Kumar, Amish Department of Information Technology Sikkim Manipal Institute of Technology Sikkim Manipal University Majhitar Sikkim Rangpo737136 India Department of Computer Science and Engineering National Institute of Technology West Bengal Durgapur713209 India Department of Computer Science and Engineering Sikkim Manipal Institute of Technology Sikkim Manipal University Majhitar Sikkim Rangpo737136 India Computer Vision and Pattern Recognition Unit Indian Statistical Institute West Bengal Kolkata700108 India

Multiple Sclerosis (MS) lesions’ segmentation is difficult due to their variegated sizes, shapes, and intensity levels. Besides this, the class imbalance problem and the availability of limited annotated data samples obstruct the building of highly efficient deep learning-based models. Though researchers have made many attempts to design efficient deep learning-based models, the maximum Dice Coefficient achieved by their models is fairly below the acceptable level of 0.70. The possible reason may be due to the inability to capture sufficient local and global features of the lesions required for accurate segmentation. In this paper, we present a new deep-learning architecture based on compound attention for MS lesion segmentation from magnetic resonance images that handles the challenges of capturing the local and global variable features of the MS lesions. The proposed model is equipped with a dual-channel CNN encoder-decoder structure employing residual connections in one channel and residual channel and spatial attention in the other. The residual connections alleviate the vanishing gradient problem and pass the fine-grained information through the channels, which is crucial for pixel-wise prediction. The attention mechanism used in a channel helps to capture long-range dependencies. Thus, the complete model leverages rich global and local information through the two channels for lesion segmentation. The problem of data imbalance is handled by using the Focal Tversky loss function. Through rigorous evaluation using 3-fold cross-validation on the MICCAI 2016 challenge dataset, our model demonstrates superior performance, achieving a Dice Coefficient of 0.73, surpassing state-of-the-art models in both qualitative and quantitative assessments. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词：

来源：评论

学校读者我要写书评

暂无评论

One-Shot Learning-Based Handwritten Word recognition 5th

One-Shot Learning-Based Handwritten Word Recognition

引用

5th Asian Conference on pattern recognition, ACPR 2019

作者： Chakrapani Gv, Asish Chanda, Sukalpa Pal, Umapada Doermann, David Electronics and Communication Department Manipal University Jaipur Jaipur India Centre for Image Analysis Department of Information Technology Uppsala University Uppsala Sweden Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata India University at Buffalo SUNY Buffalo United States

ISBN: (纸本)9783030412982

One-Shot and Few-shot Learning algorithms have emerged as techniques that can imitate a humans ability to learn from very few examples. This is an advantage over traditional deep networks which require a lot of training samples and lack of robustness due to their excessive domain specific discriminators. In this paper, we explore a one-shot learning approach to recognizing handwritten words using Siamese networks to classify the handwritten images at the word level. The Siamese network’s ability to compute similarities between two images is learned using a supervised metric but the fully trained Siamese network can be used to classify new data that has previously not been used to train the network. The model learns to discriminate inputs from a small labelled support set. By using a convolutional architecture we were able to achieve robust results. We also expect that training the system over a larger distributions of data will result in improved general handwritten word classification. Accuracy as high as 92.4% was obtained while performing 5-way one-shot word recognition on a publicly available dataset which is quite high in comparison to the state-of-the-art methods. © 2020, Springer Nature Switzerland AG.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：