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

IEEE International Conference on Data Mining (ICDM)

作者： Manjeet Rege Ming Dong Farshad Fotouhi Machine Vision and Pattern Recognition Laboratory Database and Multimedia Systems GroupDepartment of Computer Science Wayne State University Detroit MI USA Database and Multimedia Systems Group Database and Multimedia Systems GroupDepartment of Computer Science Wayne State University Detroit MI USA

In this paper, we present a novel graph theoretic approach to the problem of document-word co-clustering. In our approach, documents and words are modeled as the two vertices of a bipartite graph. We then propose isoperimetric co-clustering algorithm (ICA) - a new method for partitioning the document-word bipartite graph. ICA requires a simple solution to a sparse system of linear equations instead of the eigenvalue or SVD problem in the popular spectral co-clustering approach. Our extensive experiments performed on publicly available datasets demonstrate the advantages of ICA over spectral approach in terms of the quality, efficiency and stability in partitioning the document-word bipartite graph.

关键词： Bipartite graph Partitioning algorithms Independent component analysis Equations Eigenvalues and eigenfunctions Stability Data mining Random variables Mutual information machine vision

来源：评论

学校读者我要写书评

暂无评论

ICDAR2019 robust reading challenge on multi-lingual scene text detection and recognition-RRC-MLT-2019 15

ICDAR2019 robust reading challenge on multi-lingual scene te...

引用

15th IAPR International Conference on Document Analysis and recognition, ICDAR 2019

作者： Nayef, Nibal Liu, Cheng-Lin Ogier, Jean-Marc Patel, Yash Busta, Michal Chowdhury, Pinaki Nath Karatzas, Dimosthenis Khlif, Wafa Matas, Jiri Pal, Umapada Burie, Jean-Christophe L3i Laboratory University of la Rochelle France Computer Vision Center Universitat Autonoma de Barcelona Spain CVPR Unit Indian Statistical Institute India Robotics Institute Carnegie Mellon Universiry Pittsburgh United States Center for Machine Perception Department of Cybernetics Czech Technical University Prague Czech Republic National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences China

ISBN: (纸本)9781728128610

With the growing cosmopolitan culture of modern cities, the need of robust Multi-Lingual scene Text (MLT) detection and recognition systems has never been more immense. With the goal to systematically benchmark and push the state-of-the-art forward, the proposed competition builds on top of the RRC-MLT-2017 with an additional end-to-end task, an additional language in the real images dataset, a large scale multi-lingual synthetic dataset to assist the training, and a baseline End-to-End recognition method. The real dataset consists of 20,000 images containing text from 10 languages. The challenge has 4 tasks covering various aspects of multi-lingual scene text: (a) text detection, (b) cropped word script classification, (c) joint text detection and script classification and (d) end-to-end detection and recognition. In total, the competition received 60 submissions from the research and industrial communities. This paper presents the dataset, the tasks and the findings of the presented RRC-MLT-2019 challenge. © 2019 IEEE.

关键词： Competition

来源：评论

学校读者我要写书评

暂无评论

Compressed sensing ensemble classifier for human detection

Compressed sensing ensemble classifier for human detection

引用

4th International Conference on Intelligence science and Big Data Engineering, IScIDE 2013

作者： Zhang, Baochang Liu, Juan Gao, Yongsheng Liu, Jianzhuang Science and Technology on Aircraft Control Laboratory School of Automation Science and Electrical Engineering BeiHang University Beijing 100191 China School of Engineering Griffith University Australia Shenzhen Key Lab for Computer Vision and Pattern Recognition Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China Department of Information Engineering Chinese University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9783642420566

This paper proposes a novel Compressed Sensing Ensemble Classifier (CSEC) for human detection. The proposed CSEC employs the compressed sensing technique to get a more sparse model with a more reasonable selection of base classifiers. The major contributions of this paper are: 1) a novel principled framework for ensemble classifier design based on compressed sensing;2) a new concept of considering both the simplicity of ensemble classifier and irrelevance of base classifiers towards optimal classifier design;and 3) a quadratic function for CSEC optimization which includes a new optimizable positive semi-definite relevance matrix to simultaneously select appropriate base classifiers with minimized relevance. Experimental results on INRIA and SDL databases show that the performance of CSEC is better than two most popular classifiers SVM and AdaBoost, as well as a most recent method CLML. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

NORPPA: NOvel Ringed Seal Re-Identification by Pelage pattern Aggregation

NORPPA: NOvel Ringed Seal Re-Identification by Pelage Patter...

引用

IEEE Winter Applications and computer vision Workshops (WACVW)

作者： Ekaterina Nepovinnykh Tuomas Eerola Heikki Kälviäinen Ilia Chelak Department of Computational Engineering School of Engineering Sciences Computer Vision and Pattern Recognition Laboratory (CVPRL) Lappeenranta-Lahti University of Technology LUT Lappeenranta Finland Department of Computer Science Faculty of Science University of Helsinki Helsinki Finland

We propose a method for Saimaa ringed seal (Pusa hispida saimensis) re-identification. Access to large image volumes through camera trapping and crowdsourcing provides novel possibilities for animal conservation and monitoring and calls for automatic methods for analysis, in particular, when re-identifying individual animals from the images. The proposed method NOvel Ringed seal re-identification by Pelage pattern Aggregation (NORPPA) utilizes the permanent and unique pelage pattern of Saimaa ringed seals and content-based image retrieval techniques. First, the query image is preprocessed, and each seal instance is segmented. Next, the seal's pelage pattern is extracted using a U-net encoder-decoder based method. Then, CNN-based affine invariant features are embedded and aggregated into Fisher Vectors. Finally, the cosine distance between the Fisher Vectors is used to find the best match from a database of known individuals. We perform extensive experiments of various modifications of the method on challenging Saimaa ringed seals re-identification dataset. The proposed method is shown to produce the best re-identification accuracy on our dataset in comparisons with alternative approaches.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robust recovery of eigenimages in the presence of outliers and occlusions

引用

Journal of Computing and Information Technology 1996年第1期4卷 25-38页

作者： Leonardis, Aleš Bischof, Horst Department for Pattern Recognition and Image Processing Technical University Vienna Treitlstraße 3/1832 ViennaA-1040 Austria Computer Vision Laboratory Faculty of Computer and Information Science University of Ljubljana Tržaška 25 Ljubljana1000 Slovenia

The basic limitations of the current appearance-based matching methods using eigenimages are non-robust estimation of coefficients and inability to cope with problems related to occlusions and segmentation. In this paper we present a new approach which successfully solves these problems. The major novelty of our approach lies in the way how the coefficients of the eigenimages are determined. Instead of computing the coefficients by a projection of the data onto the eigenimages. we extract them by a hvpothesize-and-test paradigm using subsets of image points. Competing hypotheses arc then subject to a selection procedure based on the Minimum Description Length principle. The approach enables us not only lo reject outliers and to deal with occlusions but also to simultaneously use multiple classes of eigenimages.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Efficient Window Block Retrieval in Quadtree-Based Spatial Databases

引用

GeoInformatica 1997年第1期1.0卷 59-91页

作者： Aref, Walid G. Samet, Hanan Computer Science Department Center for Automation Research University of Maryland College Park MD 20742 United States University of Alexandria Egypt University of Maryland College Park United States Matsushita Info. Technol. Laboratory Princeton United States IBM Research Almaden CA United States University of Maryland Inst. for Advanced Computer Studies College Park MD United States ACM IEEE United States Department of Computer Science University of Maryland United States Computer Vision Laboratory Stanford University United States ACM IEEE Intl. Assoc. of Pattern Recognition

An algorithm is presented to answer window queries in a quadtree-based spatial database environment by retrieving all of the quadtree blocks in the underlying spatial database that cover the quadtree blocks that comprise the window. It works by decomposing the window operation into sub-operations over smaller window partitions. These partitions are the quadtree blocks corresponding to the window. Although a block b in the underlying spatial database may cover several of the smaller window partitions, b is only retrieved once rather than multiple times. This is achieved by using an auxiliary main memory data structure called the active border which requires O(n) additional storage for a window query of size n × n. As a result, the algorithm generates an optimal number of disk I/O requests to answer a window query (i.e., one request per covering quadtree block). A proof of correctness and an analysis of the algorithm's execution time and space requirements are given, as are some experimental results.

关键词： Active border Clipping Data structures Databases Design of algorithms Quadtree space decomposition Range query Spatial databases Window block retrieval

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Authentication Protocol Suitable for Constrained RFID Systems

引用

IEEE Access 2024年 12卷 61610-61628页

作者： Hosseinzadeh, Mehdi Servati, Mohammad Reza Rahmani, Amir Masoud Safkhani, Masoumeh Lansky, Jan Janoscova, Renata Ahmed, Omed Hassan Tanveer, Jawad Lee, Sang-Woong Duy Tan University Institute of Research and Development Da Nang550000 Viet Nam Duy Tan University School of Medicine and Pharmacy Da Nang550000 Viet Nam Shahid Rajaee Teacher Training University Department of Computer Engineering Tehran16788-15811 Iran National Yunlin University of Science and Technology Future Technology Research Center Douliou Yunlin64002 Taiwan School of Computer Science Tehran19395-5746 Iran University of Finance and Administration Faculty of Economic Studies Department of Computer Science and Mathematics Prague101 00 Czech Republic University of Human Development Department of Information Technology Sulaymaniyah0778-6 Iraq Sejong University Department of Computer Science and Engineering Seoul05006 Korea Republic of Gachon University Pattern Recognition and Machine Learning Laboratory Department of Ai Software Seongnam-si13557 Korea Republic of

RFID technology offers an affordable and user-friendly solution for contactless identification of objects and individuals. However, the widespread adoption of RFID systems raises concerns regarding security and privacy. Vulnerabilities such as message tampering, interception, and eavesdropping pose significant risks to the integrity of the system. This study examines the effectiveness of two recently proposed ultra-lightweight RFID authentication protocols, URASP and KUAJB, in addressing these security challenges. Surprisingly, our findings reveal that both URASP and KUAJB protocols are susceptible to secret disclosure attacks, despite their claims of providing robust security. Consequently, the development of a truly ultra-lightweight protocol that ensures adequate security becomes a formidable task. As a potential solution, the enhancement of the URASP protocol through the integration of a simple cryptographic primitive is suggested to bolster its security measures. © 2013 IEEE.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

A novel method of fingerprint minutiae extraction based on Gabor phase

A novel method of fingerprint minutiae extraction based on G...

引用

IEEE International Conference on Image Processing

作者： Xin Gao Xiaoguang Chen Jia Cao Zirui Deng Chongjin Liu Jufu Feng Key Laboratory of Machine Perception MOE Department of Machine Intelligence School of Electronics Engineering and Computer Science Peking University Beijing China Institute of Image Processing and Pattern Recognition North-China University of Technology Beijing China

In this paper, a novel method of fingerprint minutiae extraction on grey-scale images is proposed based on the Gabor phase field. The novelty of our approach is that the proposed algorithm is performed on the transform domain, i.e. the Gabor phase field of the fingerprint image. This is different from most existing minutiae extraction methods, in which the minutiae are usually extracted from the binarized and thinned fingerprint image. Experimental results on benchmark data sets demonstrate that the proposed algorithm has promising performances.

关键词： Pixel Feature extraction Image quality Fingerprint recognition Detectors Frequency estimation Software algorithms

来源：评论

学校读者我要写书评

暂无评论

Automatic Polyp Segmentation with Multiple Kernel Dilated Convolution Network

arXiv

引用

arXiv 2022年

作者： Tomar, Nikhil Kumar Srivastava, Abhishek Bagci, Ulas Jha, Debesh School of Informatics and Computer Science Indira Gandhi National Open University India Computer Vision and Pattern Recognition Unit Indian Statistical Institute India Machine and Hybrid Intelligence Lab Department of Radiology Feinberg School of Medicine Northwestern University United States

The detection and removal of precancerous polyps through colonoscopy is the primary technique for the prevention of colorectal cancer worldwide. However, the miss rate of colorectal polyp varies significantly among the endoscopists. It is well known that a computer-aided diagnosis (CAD) system can assist endoscopists in detecting colon polyps and minimize the variation among endoscopists. In this study, we introduce a novel deep learning architecture, named MKDCNet, for automatic polyp segmentation robust to significant changes in polyp data distribution. MKDCNet is simply an encoder-decoder neural network that uses the pre-trained ResNet50 as the encoder and novel multiple kernel dilated convolution (MKDC) block that expands the field of view to learn more robust and heterogeneous representation. Extensive experiments on four publicly available polyp datasets and cell nuclei dataset show that the proposed MKDCNet outperforms the state-of-the-art methods when trained and tested on the same dataset as well when tested on unseen polyp datasets from different distributions. With rich results, we demonstrated the robustness of the proposed architecture. From an efficiency perspective, our algorithm can process at (≈ 45) frames per second on RTX 3090 GPU. MKDCNet can be a strong benchmark for building real-time systems for clinical colonoscopies. The code of the proposed MKDCNet is available at https://***/nikhilroxtomar/MKDCNet. © 2022, CC BY.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Combining feature aggregation and geometric similarity for re-identification of patterned animals

arXiv

引用

arXiv 2023年

作者： Immonen, Veikka Nepovinnykh, Ekaterina Eerola, Tuomas Stewart, Charles V. Kälviäinen, Heikki Computer Vision and Pattern Recognition Laboratory Department of Computational Engineering School of Engineering Sciences Lappeenranta-Lahti University of Technology LUT LappeenrantaFI-53851 Finland Department of Computer Science Rensselaer Polytechnic Institute TroyNY12180 United States

Image-based re-identification of animal individuals allows gathering of information such as migration patterns of the animals over time. This, together with large image volumes collected using camera traps and crowdsourcing, opens novel possibilities to study animal populations. For many species, the re-identification can be done by analyzing the permanent fur, feather, or skin patterns that are unique to each individual. In this paper, we address the re-identification by combining two types of pattern similarity metrics: 1) pattern appearance similarity obtained by pattern feature aggregation and 2) geometric pattern similarity obtained by analyzing the geometric consistency of pattern similarities. The proposed combination allows to efficiently utilize both the local and global pattern features, providing a general re-identification approach that can be applied to a wide variety of different pattern types. In the experimental part of the work, we demonstrate that the method achieves promising re-identification accuracies for Saimaa ringed seals and whale sharks. © 2023, CC BY-NC-SA.

关键词： Animals

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：