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

Proceedings of the 13th Annual Meeting of the Forum for Information Retrieval Evaluation

作者： Chandan Biswas Debasis Ganguly Ujjwal Bhattacharya Computer Vision and Pattern Recognition Unit Indian Statistical Institute India University of Glasgow United Kingdom

ISBN: (纸本)9781450395960

Amidst an increasing number of infected cases during the Covid-19 pandemic, it is essential to trace, as early as possible, the susceptible people who might have been infected by the disease due to their close proximity with people who were tested positive for the virus. This early contact tracing is likely to limit the rate of spread of the infection within a locality. In this paper, we investigate how effectively and efficiently can such a list of susceptible people be found given a list of infected persons and their locations. By using the locations of the given list of infected persons as queries, we investigate the feasibility of applying approximate nearest neighbour (ANN) based indexing and retrieval approaches to obtain a list of top-k suspected users in real-time. Since leveraging information from true user location data can lead to privacy concerns, we also investigate the effectiveness of the ANN methods on privacy-aware encoding of the input data. Experiments conducted on real and synthetic datasets demonstrate that the top-k susceptible users retrieved with existing ANN approaches (KD-tree and HNSW) yield satisfactory recall values and achieves up to 21000 × speed-gain compared to exhaustive search, thus indicating that ANN approaches can potentially be applied, in practice, to facilitate real-time contact tracing even under the presence of imposed privacy constraints.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-angle based lively sclera biometrics at a distance

Multi-angle based lively sclera biometrics at a distance

引用

2014 IEEE Symposium Series on Computational Intelligence, IEEE SSCI 2014 - 2014 IEEE Symposium on Computational Intelligence in Biometrics and Identity Management, CIBIM 2014

作者： Das, Abhijit Pal, Umapada Ballester, Miguel Angel Ferrer Blumenstein, Michael Institute for Integrated and Intelligent Systems Griffith University GriffithQLD Australia Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata India IDeTIC University of Las Palmas de Gran Canaria Las Palmas Spain

ISBN: (纸本)9781479945344

This piece of work proposes a liveliness based sclera eye biometric, validation and recognition technique at a distance. The images in this work are acquired by a digital camera in the visible spectrum at varying distance of about 1 meter from the individual. Each individual during registration as well as validation is asked to look straight and move their eye ball up, left and right keeping their face straight to incorporate liveliness of the data. At first the image is divided vertically into two halves and the eyes are detected in each half of the face image that is captured, by locating the eye ball by a Circular Hough Transform. Then the eye image is cropped out automatically using the radius of the iris. Next a C-means-based segmentation is used for sclera segmentation followed by vessel enhancement by the adaptive histogram equalization and Haar filtering. The feature extraction was performed by patch-based Dense-LDP (Linear Directive pattern). Furthermore each training image is used to form a bag of features, which is used to produce the training model. Each of the images of the different poses is combined at the feature level and the image level to obtain higher accuracy and to incorporate liveliness. The fusion that produces the best result is considered. Support Vector Machines (SVMs) are used for classification. Here images from 82 individuals (both left and right eye i.e. 164 different eyes) are used and an appreciable Equal Error Rate of 0.52% is achieved in this work. © 2014 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

recognition of Multi-oriented Touching Characters in Graphical Documents

Recognition of Multi-oriented Touching Characters in Graphic...

引用

Indian Conference on computer vision, Graphics & Image Processing (ICVGIP)

作者： Partha Pratim Roy Umapada Pal Josep Lladós Computer Vision Center Universitat Autònoma Barcelona Bellaterra Spain Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata India

Touching characters are major problem of achieving higher recognition rate in optical character recognition (OCR). Present OCR systems do not perform well when adjacent characters touch. If characters are touched in graphical documents (e.g. map) then such touching string recognition is more difficult because in such documents touching characters appear in multi-oriented direction. In this paper, we present a scheme towards the recognition of English two-character multi-oriented touching strings. When two or more characters touch, they generate a big cavity region at the background portion and we used this background information in our scheme. To handle the background information, convex hull is used. In this scheme, at first, a set of initial segmentation points is predicted based on the concave residues of the convex hull of the touching characters. Next, based on the initial points, we select some candidate segmentation lines. Finally the recognition confidence of two sub-images of a touching string, obtained from each candidate segmentation line is computed. The candidate segmentation line from which we get optimum confidence is the actual segmentation line and the corresponding characters in favour of which the two segmentation parts show optimum confidence is the recognition result of the touching string. To compute the recognition confidence, SVM classifier is used. The features used in the SVM are invariant to character orientation. Circular ring and convex hull ring based approach has been used along with angular information of the contour pixels of the character to make the feature rotation invariant. From the experiment we obtained encouraging result.

关键词： Character recognition Optical character recognition software pattern recognition Support vector machines Support vector machine classification Image segmentation Frequency Image recognition Character generation Degradation

来源：评论

学校读者我要写书评

暂无评论

Siamese Network Based Pelage pattern Matching for Ringed Seal Re-identification

Siamese Network Based Pelage Pattern Matching for Ringed Sea...

引用

IEEE Winter Applications and computer vision Workshops (WACVW)

作者： Ekaterina Nepovinnykh Tuomas Eerola Heikki Kälviäinen Computer Vision and Pattern Recognition Laboratory (CVPRL) Lappeenranta-Lahti University of Technology LUT Lappeenranta Finland

ISBN: (数字)9781728171623

ISBN: (纸本)9781728171630

In this paper we propose a method to match pelage patterns of the Saimaa ringed seals enabling the re-identification of individuals. First, the pelage pattern is extracted from the seal's fur using a method based on the Sato tubeness filter. After this, the similarities of the pelage pattern patches are computed using a siamese network trained with a triplet loss function and a large dataset of manually selected patches. The similarities are then used to find the best matching patches from the images in the database of known individuals. Furthermore, we employ the proposed pattern matching method to build a full framework for the ringed seal re-identification, consisting of CNN-based animal segmentation, patch correspondence detection, and ranking the images in the database of known seal individuals based on the similarity to the query image. Our experiments on challenging datasets of Saimaa ringed seals show that the proposed method achieves promising identification results, providing a useful tool for the Saimaa ringed seal monitoring.

关键词： Seals Animals pattern matching Image segmentation Cameras Databases Tools

来源：评论

学校读者我要写书评

暂无评论

Hierarchical top down enhancement of robust PCA 9th

引用

Joint IAPR 9th International Workshop on Structural and Syntactic pattern recognition, SSPR 2002 and 4th International Workshop on Statistical Techniques in pattern recognition, SPR 2002

作者： Langs, Georg Bischof, Horst Kropatsch, Walter G. Pattern Recognition and Image Processing Group 183/2 Institute for Computer Aided Automation Vienna University of Technology Favoritenstr. 9 ViennaA-1040 Austria Institute for Computer Graphics and Vision TU Graz Inffeldgasse 16 2.OG GrazA-8010 Austria

ISBN: (纸本)3540440119

In this paper we deal with performance improvement of robust PCA algorithms by replacing regular subsampling of images by an irregular image pyramid adapted to the expected image content. The irregular pyramid is a structure built based on knowledge gained from the training set of images. It represents different regions of the image with different level of detail, depending on their importance for reconstruction. This strategy enables us to improve reconstruction results and therefore the recognition significantly. The training algorithm works on the data necessary to perform robust PCA and therefore requires no additional input. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Graph theoretical framework for simultaneously integrating visual and textual features for efficient web image clustering 08

Graph theoretical framework for simultaneously integrating v...

引用

17th International Conference on World Wide Web 2008, WWW'08

作者： Rege, Manjeet Dong, Ming Hua, Jing Machine Vision Pattern Recognition Lab. Department ot Computer Science Wayne State University Detroit MI 48202 United States Graphics and Imaging Lab. Department ot Computer Science Wayne State University Detroit MI 48202 United States

ISBN: (纸本)9781605580852

With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering has emerged as an important application. Some of the initial efforts along this direction revolved around clustering Web images based on the visual features of images or textual features by making use of the text surrounding the images. However, not much work has been done in using multimodal information for clustering Web images. In this paper, we propose a graph theoretical framework for simultaneously integrating visual and textual features for efficient Web image clustering. Specifically, we model visual features, images and words from surrounding text using a tripartite graph. Partitioning this graph leads to clustering of the Web images. Although, graph partitioning approach has been adopted before, the main contribution of this work lies in a new algorithm that we propose - Consistent Isoperimetric High-order Co-clustering (CIHC), for partitioning the tripartite graph. Computationally, CIHC is very quick as it requires a simple solution to a sparse system of linear equations. Our theoretical analysis and extensive experiments performed on real Web images demonstrate the performance of CIHC in terms of the quality, efficiency and scalability in partitioning the visual feature-image-word tripartite graph.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Interactive Multi-dimension Modulation with Dynamic Controllable Residual Learning for Image Restoration 1

引用

16th European Conference on computer vision, ECCV 2020

作者： He, Jingwen Dong, Chao Qiao, Yu ShenZhen Key Lab of Computer Vision and Pattern Recognition SIAT-SenseTime Joint Lab Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Beijing China SIAT Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

ISBN: (数字)9783030585655

ISBN: (纸本)9783030585648

Interactive image restoration aims to generate restored images by adjusting a controlling coefficient which determines the restoration level. Previous works are restricted in modulating image with a single coefficient. However, real images always contain multiple types of degradation, which cannot be well determined by one coefficient. To make a step forward, this paper presents a new problem setup, called multi-dimension (MD) modulation, which aims at modulating output effects across multiple degradation types and levels. Compared with the previous single-dimension (SD) modulation, the MD is setup to handle multiple degradations adaptively and relief unbalanced learning problem in different degradations. We also propose a deep architecture - CResMD with newly introduced controllable residual connections for multi-dimension modulation. Specifically, we add a controlling variable on the conventional residual connection to allow a weighted summation of input and residual. The values of these weights are generated by another condition network. We further propose a new data sampling strategy based on beta distribution to balance different degradation types and levels. With corrupted image and degradation information as inputs, the network can output the corresponding restored image. By tweaking the condition vector, users can control the output effects in MD space at test time. Extensive experiments demonstrate that the proposed CResMD achieve excellent performance on both SD and MD modulation tasks. Code is available at https://***/hejingwenhejingwen/CResMD. © 2020, Springer Nature Switzerland AG.

关键词： Modulation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Minimizing the topological structure of line images 7th

引用

7th Joint IAPR International Workshop on Structural and Syntactic pattern recognition, SSPR 1998 and 2nd International Workshop on Statistical Techniques in pattern recognition, SPR 1998

作者： Kropatsch, Walter G. Burge, Mark Vienna University of Technology Institute of Automation 183/2 Pattern Recognition and Image Processing Group Treitlstr.3 WienA-1040 Austria Johannes Kepler University Institute of Systems Science Computer Vision Laboratory LinzA-4040 Austria

ISBN: (纸本)3540648585

We present a new algorithm based on Dual Graph Contraction (DGC) to transform the Run Graph into its Minimum Line Property Preserving (MLPP) form which, when implemented in parallel, requires O(log(longestcurve)) steps. A MLPP graph of a line image compliments the structural information in geometric graph representations like the run graph. Using such a graph and its dual, line image analysis systems can efficiently detect topological features like loops and holes and make use of relations like containment. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

A robust block oriented watermarking scheme in spatial domain 1

引用

4th International Conference on Information and Communications Security, ICICS 2002

作者： Das, Tanmoy Kanti Maitra, Subhamoy Computer Vision and Pattern Recognition Unit Indian Statistical Institute 203 B T Road Calcutta700 108 India Applied Statistics Unit Indian Statistical Institute 203 B T Road Calcutta700 108 India

In this paper we present an invisible spatial domain watermarking technique. The technique divides the image into n small blocks and the intensity of some of these blocks are modified depending on the key, which is a ... 详细信息

ISBN: (数字)9783540361596

ISBN: (纸本)3540001646

关键词： Frequency domain analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：