FKPIndexNet: An efficient learning framework for finger-knuckle-print database indexing to boost identification

2021 ◽  
pp. 108028
Author(s):  
Geetika Arora ◽  
Avantika Singh ◽  
Aditya Nigam ◽  
Hari Mohan Pandey ◽  
Kamlesh Tiwari
Author(s):  
Zhen Guo ◽  
Christos Faloutsos ◽  
Zhongfei (Mark) Zhang ◽  
Zhongfei (Mark) Zhang

This chapter presents a highly scalable and adaptable co-learning framework on multimodal data mining in a multimedia database. The co-learning framework is based on the multiple instance learning theory. The framework enjoys a strong scalability in the sense that the query time complexity is a constant, independent of the database scale, and the mining effectiveness is also independent of the database scale, allowing facilitating a multimodal querying to a very large scale multimedia database. At the same time, this framework also enjoys a strong adaptability in the sense that it allows incrementally updating the database indexing with a constant operation when the database is dynamically updated with new information. Hence, this framework excels many of the existing multimodal data mining methods in the literature that are neither scalable nor adaptable at all. Theoretic analysis and empirical evaluations are provided to demonstrate the advantage of the strong scalability and adaptability. While this framework is general for multimodal data mining in any specific domains, to evaluate this framework, the authors apply it to the Berkeley Drosophila ISH embryo image database for the evaluations of the mining performance. They have compared the framework with a state-of-the-art multimodal data mining method to demonstrate the effectiveness and the promise of the framework.


Data Mining ◽  
2013 ◽  
pp. 567-586
Author(s):  
Zhongfei (Mark) Zhang ◽  
Zhen Guo ◽  
Christos Faloutsos ◽  
Jia-Yu Pan

This chapter presents a highly scalable and adaptable co-learning framework on multimodal data mining in a multimedia database. The co-learning framework is based on the multiple instance learning theory. The framework enjoys a strong scalability in the sense that the query time complexity is a constant, independent of the database scale, and the mining effectiveness is also independent of the database scale, allowing facilitating a multimodal querying to a very large scale multimedia database. At the same time, this framework also enjoys a strong adaptability in the sense that it allows incrementally updating the database indexing with a constant operation when the database is dynamically updated with new information. Hence, this framework excels many of the existing multimodal data mining methods in the literature that are neither scalable nor adaptable at all. Theoretic analysis and empirical evaluations are provided to demonstrate the advantage of the strong scalability and adaptability. While this framework is general for multimodal data mining in any specific domains, to evaluate this framework, the authors apply it to the Berkeley Drosophila ISH embryo image database for the evaluations of the mining performance. They have compared the framework with a state-of-the-art multimodal data mining method to demonstrate the effectiveness and the promise of the framework.


2016 ◽  
Author(s):  
Tiberiu Teşileanu ◽  
Bence Ölveczky ◽  
Vijay Balasubramanian

AbstractTrial-and-error learning requires evaluating variable actions and reinforcing successful variants. In songbirds, vocal exploration is induced by LMAN, the output of a basal ganglia-circuit that also contributes a corrective bias to the vocal output. This bias is gradually consolidated in RA, a motor cortex analogue downstream of LMAN. We develop a new model of such two-stage learning. Using stochastic gradient descent, we derive how the activity in ‘tutor’ circuits (e.g., LMAN) should match plasticity mechanisms in ‘student’ circuits (e.g., RA) to achieve efficient learning. We further describe a reinforcement learning framework through which the tutor can build its teaching signal. We show that mismatches between the tutor signal and the plasticity mechanism can impair learning. Applied to birdsong, our results predict the temporal structure of the corrective bias from LMAN given a plasticity rule in RA. Our framework can be applied predictively to other paired brain areas showing two-stage learning.


eLife ◽  
2017 ◽  
Vol 6 ◽  
Author(s):  
Tiberiu Teşileanu ◽  
Bence Ölveczky ◽  
Vijay Balasubramanian

Trial-and-error learning requires evaluating variable actions and reinforcing successful variants. In songbirds, vocal exploration is induced by LMAN, the output of a basal ganglia-related circuit that also contributes a corrective bias to the vocal output. This bias is gradually consolidated in RA, a motor cortex analogue downstream of LMAN. We develop a new model of such two-stage learning. Using stochastic gradient descent, we derive how the activity in ‘tutor’ circuits (e.g., LMAN) should match plasticity mechanisms in ‘student’ circuits (e.g., RA) to achieve efficient learning. We further describe a reinforcement learning framework through which the tutor can build its teaching signal. We show that mismatches between the tutor signal and the plasticity mechanism can impair learning. Applied to birdsong, our results predict the temporal structure of the corrective bias from LMAN given a plasticity rule in RA. Our framework can be applied predictively to other paired brain areas showing two-stage learning.


2021 ◽  
pp. 102263
Author(s):  
Vien Ngoc Dang ◽  
Francesco Galati ◽  
Rosa Cortese ◽  
Giuseppe Di Giacomo ◽  
Viola Marconetto ◽  
...  

2021 ◽  
Vol 15 ◽  
Author(s):  
Ahana Gangopadhyay ◽  
Shantanu Chakrabartty

Growth-transform (GT) neurons and their population models allow for independent control over the spiking statistics and the transient population dynamics while optimizing a physically plausible distributed energy functional involving continuous-valued neural variables. In this paper we describe a backpropagation-less learning approach to train a network of spiking GT neurons by enforcing sparsity constraints on the overall network spiking activity. The key features of the model and the proposed learning framework are: (a) spike responses are generated as a result of constraint violation and hence can be viewed as Lagrangian parameters; (b) the optimal parameters for a given task can be learned using neurally relevant local learning rules and in an online manner; (c) the network optimizes itself to encode the solution with as few spikes as possible (sparsity); (d) the network optimizes itself to operate at a solution with the maximum dynamic range and away from saturation; and (e) the framework is flexible enough to incorporate additional structural and connectivity constraints on the network. As a result, the proposed formulation is attractive for designing neuromorphic tinyML systems that are constrained in energy, resources, and network structure. In this paper, we show how the approach could be used for unsupervised and supervised learning such that minimizing a training error is equivalent to minimizing the overall spiking activity across the network. We then build on this framework to implement three different multi-layer spiking network architectures with progressively increasing flexibility in training and consequently, sparsity. We demonstrate the applicability of the proposed algorithm for resource-efficient learning using a publicly available machine olfaction dataset with unique challenges like sensor drift and a wide range of stimulus concentrations. In all of these case studies we show that a GT network trained using the proposed learning approach is able to minimize the network-level spiking activity while producing classification accuracy that are comparable to standard approaches on the same dataset.


Author(s):  
Minghui Zheng ◽  
Zhu Chen ◽  
Xiao Liang

Abstract This paper provides a preliminary study for an efficient learning algorithm by reasoning the error from first principle physics to generate learning signals in near real time. Motivated by iterative learning control (ILC), this learning algorithm is applied to the feedforward control loop of the unmanned aerial vehicles (UAVs), enabling the learning from errors made by other UAVs with different dynamics or flying in different scenarios. This learning framework improves the data utilization efficiency and learning reliability via analytically incorporating the physical model mapping, and enhances the flexibility of the model-based methodology with equipping it with the self-learning capability. Numerical studies are performed to validate the proposed learning algorithm.


Author(s):  
Subhabrata Sengupta ◽  
Anish Banerjee ◽  
Satyajit Chakrabarti

E-Learning systems have unbound prospects to deliver unmatched effective learning services and feedback assistance than what it is presently offering through mediums like online tutoring, or other electronic educational management services. Different stages and application potentials of Semantic Web technology and it’s architecture can be applied at different sectors and phases of the E-Learning framework to amplify the quality and versatility of services. Features of Semantic Web have been explored in the sectors with respect to instructors to plan, analyse and execute their tasks and also in making a sustainable system that interprets the structure of distributed, self organized, and self-instructed online learning to monitor it’s influence on performance. The main objective of this work is to study how electronic and online learning frameworks can be improved and enhanced by the influence of semantic web technologies in understanding and simplifying concept clarification and description, reusable learning objects (LOs), and benefits of the applying ontology in describing the learning materials for a better and more efficient learning system.


2020 ◽  
Vol 34 (04) ◽  
pp. 4618-4625
Author(s):  
Jian Li ◽  
Yong Liu ◽  
Weiping Wang

The generalization performance of kernel methods is largely determined by the kernel, but spectral representations of stationary kernels are both input-independent and output-independent, which limits their applications on complicated tasks. In this paper, we propose an efficient learning framework that incorporates the process of finding suitable kernels and model training. Using non-stationary spectral kernels and backpropagation w.r.t. the objective, we obtain favorable spectral representations that depends on both inputs and outputs. Further, based on Rademacher complexity, we derive data-dependent generalization error bounds, where we investigate the effect of those factors and introduce regularization terms to improve the performance. Extensive experimental results validate the effectiveness of the proposed algorithm and coincide with our theoretical findings.


Sign in / Sign up

Export Citation Format

Share Document