Goto

Collaborating Authors

 Pattern Recognition


Attention for Image Registration (AiR): an unsupervised Transformer approach

arXiv.org Artificial Intelligence

Image registration as an important basis in signal processing task often encounter the problem of stability and efficiency. Non-learning registration approaches rely on the optimization of the similarity metrics between the fix and moving images. Yet, those approaches are usually costly in both time and space complexity. The problem can be worse when the size of the image is large or the deformations between the images are severe. Recently, deep learning, or precisely saying, the convolutional neural network (CNN) based image registration methods have been widely investigated in the research community and show promising effectiveness to overcome the weakness of non-learning based methods. To explore the advanced learning approaches in image registration problem for solving practical issues, we present in this paper a method of introducing attention mechanism in deformable image registration problem. The proposed approach is based on learning the deformation field with a Transformer framework (AiR) that does not rely on the CNN but can be efficiently trained on GPGPU devices also. In a more vivid interpretation: we treat the image registration problem as the same as a language translation task and introducing a Transformer to tackle the problem. Our method learns an unsupervised generated deformation map and is tested on two benchmark datasets. The source code of the AiR will be released at Gitlab.


PingAn-VCGroup's Solution for ICDAR 2021 Competition on Scientific Table Image Recognition to Latex

arXiv.org Artificial Intelligence

Recognizing a table image into a Latex code is challenging due to complexity and diversity of table structures and long sequence problem compared to traditional OCR. The challenge aims at assessing the ability of state-of-the-art methods to recognize scientific tables into LaTeX codes. In this competition, there are two sub-tasks with different levels of difficulty. Subtask I Table Structure Reconstruction is to reconstruct the structure of a table image into the form of LaTeX code but ignore the content of the table. Subtask II Table Content Reconstruction is to reconstruct the structure and the content of a table image simultaneously into the form of LaTeX code.


Improving Fairness in Speaker Recognition

arXiv.org Artificial Intelligence

The human voice conveys unique characteristics of an individual, making voice biometrics a key technology for verifying identities in various industries. Despite the impressive progress of speaker recognition systems in terms of accuracy, a number of ethical and legal concerns has been raised, specifically relating to the fairness of such systems. In this paper, we aim to explore the disparity in performance achieved by state-of-the-art deep speaker recognition systems, when different groups of individuals characterized by a common sensitive attribute (e.g., gender) are considered. In order to mitigate the unfairness we uncovered by means of an exploratory study, we investigate whether balancing the representation of the different groups of individuals in the training set can lead to a more equal treatment of these demographic groups. Experiments on two state-of-the-art neural architectures and a large-scale public dataset show that models trained with demographically-balanced training sets exhibit a fairer behavior on different groups, while still being accurate. Our study is expected to provide a solid basis for instilling beyond-accuracy objectives (e.g., fairness) in speaker recognition.


End-to-End Approach for Recognition of Historical Digit Strings

arXiv.org Artificial Intelligence

The plethora of digitalised historical document datasets released in recent years has rekindled interest in advancing the field of handwriting pattern recognition. In the same vein, a recently published data set, known as ARDIS, presents handwritten digits manually cropped from 15.000 scanned documents of Swedish church books and exhibiting various handwriting styles. To this end, we propose an end-to-end segmentation-free deep learning approach to handle this challenging ancient handwriting style of dates present in the ARDIS dataset (4-digits long strings). We show that with slight modifications in the VGG-16 deep model, the framework can achieve a recognition rate of 93.2%, resulting in a feasible solution free of heuristic methods, segmentation, and fusion methods. Moreover, the proposed approach outperforms the well-known CRNN method (a model widely applied in handwriting recognition tasks).


Parallel Scale-wise Attention Network for Effective Scene Text Recognition

arXiv.org Artificial Intelligence

The paper proposes a new text recognition network for scene-text images. Many state-of-the-art methods employ the attention mechanism either in the text encoder or decoder for the text alignment. Although the encoder-based attention yields promising results, these schemes inherit noticeable limitations. They perform the feature extraction (FE) and visual attention (VA) sequentially, which bounds the attention mechanism to rely only on the FE final single-scale output. Moreover, the utilization of the attention process is limited by only applying it directly to the single scale feature-maps. To address these issues, we propose a new multi-scale and encoder-based attention network for text recognition that performs the multi-scale FE and VA in parallel. The multi-scale channels also undergo regular fusion with each other to develop the coordinated knowledge together. Quantitative evaluation and robustness analysis on the standard benchmarks demonstrate that the proposed network outperforms the state-of-the-art in most cases.


Stock Forecast Based On a Predictive Algorithm

#artificialintelligence

This forecast is part of the Revolut Stock Trading Package, one of I Know First's algorithmic trading tools. The full investment universe includes the most promising stocks presented on Revolut trading platform. Package Name: Revolut Stock Trading Recommended Positions: Long Forecast Length: 3 Months (1/19/21 – 4/19/21) I Know First Average: 17.09% This Revolut Stock Trading Package forecast had correctly predicted 10 out of 10 stock movements. The highest trade return came from IVZ, at 32.4%.


TeLCoS: OnDevice Text Localization with Clustering of Script

arXiv.org Artificial Intelligence

Recent research in the field of text localization in a resource constrained environment has made extensive use of deep neural networks. Scene text localization and recognition on low-memory mobile devices have a wide range of applications including content extraction, image categorization and keyword based image search. For text recognition of multi-lingual localized text, the OCR systems require prior knowledge of the script of each text instance. This leads to word script identification being an essential step for text recognition. Most existing methods treat text localization, script identification and text recognition as three separate tasks. This makes script identification an overhead in the recognition pipeline. To reduce this overhead, we propose TeLCoS: OnDevice Text Localization with Clustering of Script, a multi-task dual branch lightweight CNN network that performs real-time on device Text Localization and High-level Script Clustering simultaneously. The network drastically reduces the number of calls to a separate script identification module, by grouping and identifying some majorly used scripts through a single feed-forward pass over the localization network. We also introduce a novel structural similarity based channel pruning mechanism to build an efficient network with only 1.15M parameters. Experiments on benchmark datasets suggest that our method achieves state-of-the-art performance, with execution latency of 60 ms for the entire pipeline on the Exynos 990 chipset device.


Finding Motifs in Knowledge Graphs using Compression

arXiv.org Machine Learning

We introduce a method to find network motifs in knowledge graphs. Network motifs are useful patterns or meaningful subunits of the graph that recur frequently. We extend the common definition of a network motif to coincide with a basic graph pattern. We introduce an approach, inspired by recent work for simple graphs, to induce these from a given knowledge graph, and show that the motifs found reflect the basic structure of the graph. Specifically, we show that in random graphs, no motifs are found, and that when we insert a motif artificially, it can be detected. Finally, we show the results of motif induction on three real-world knowledge graphs.


Meet Facebook's Powerful New Image Recognition SEER A.I.

#artificialintelligence

If Facebook has an unofficial slogan, an equivalent to Google's "Don't Be Evil" or Apple's "Think Different," it is "Move Fast and Break Things." It means, at least in theory, that one should iterate to try news things and not be afraid of the possibility of failure. In 2021, however, with social media currently being blamed for a plethora of societal ills, the phrase should, perhaps, be modified to: "Move Fast and Fix Things." One of the many areas social media, not just Facebook, has been pilloried for is its spreading of certain images online. It's a challenging problem by any stretch of the imagination: Some 4,000 photo uploads are made to Facebook every single second.


Image Recognition AI: Algorithms And Applications

#artificialintelligence

This breakthrough does not really require someone to feed the information to the computer or be their eyes so to say. Because this new technique allows machines to interpret and categorize whatever they see in images or videos. In other words, computers now have their own eyes. Therefore, they work independently with the ability to recognize whatever is around them. Here the model will predict only one label per image. What this means that no matter the input or the diversity in the image, the machine will assign only a single label.