An unsupervised Learning Network for face identification and subsequent localization

2012 ◽  
Author(s):  
Goutam Sarker
Keyword(s):  
Unsupervised Learning ◽  
Face Identification ◽  
Learning Network

Unsupervised Deep Learning Network with Self-Attention Mechanism for Non-Rigid Registration of 3D Brain MR Images

2021 ◽  
Vol 11 (3) ◽  
pp. 736-751
Author(s):  
Donggeon Oh ◽  
Bohyoung Kim ◽  
Jeongjin Lee ◽  
Yeong-Gil Shin
Keyword(s):  
Deep Learning ◽  
Medical Imaging ◽  
Unsupervised Learning ◽  
High Accuracy ◽  
Magnetic Resonance Images ◽  
Attention Mechanism ◽  
Learning Networks ◽  
Rigid Registration ◽  
Learning Network ◽  
The Brain

In non-rigid registration for medical imaging analysis, computation is complicated, and the high accuracy and robustness needed for registration are difficult to obtain. Recently, many studies have been conducted for nonrigid registration via unsupervised learning networks. This study proposes a method to improve the performance of this unsupervised learning network approach, through the use of a self-attention mechanism. In this paper, the self-attention mechanism is combined with deep learning networks to identify information of higher importance, among large amounts of data, and thereby solve specific tasks. Furthermore, the proposed method extracts both local and non-local information so that the network can create feature vectors with more information. As a result, the limitation of the existing network is addressed: alignment based solely on the entire silhouette of the brain is mitigated in favor of a network which also learns to perform registration of the parts of the brain that have internal structural characteristics. To the best of our knowledge, this is the first such utilization of the attention mechanism in this unsupervised learning network for non-rigid registration. The proposed attention network performs registration that takes into account the overall characteristics of the data, thus yielding more accurate matching results than those of the existing methods. In particular, matching is achieved with especially high accuracy in the gray matter and cortical ventricle areas, since these areas contain many of the structural features of the brain. The experiment was performed on 3D magnetic resonance images of the brains of 50 people. The measured average dice similarity coefficient after registration was 70.40%, which is an improvement of 17.48% compared to that before registration. This improvement indicates that application of the attention block can further improve the performance by an additional 8.5%, as relative to that without attention block. Ultimately, through implementation of non-rigid registration via the attention block method, the internal structure and overall shape of the brain can be addressed, without additional data input. Additionally, attention blocks have the advantage of being able to easily connect to existing networks without a significant computational overhead. Furthermore, by producing an attention map, the area of the brain around which registration was more performed can be visualized. This approach can be used for non-rigid registration with various types of medical imaging data.

ALGORITHMS FOR IMAGE PRE-PROCESSING IN THE FACE IDENTIFICATION SYSTEM IN THE VIDEO STREAM

2019 ◽  
Vol 4 (91) ◽  
pp. 21-29 ◽  
Author(s):  
Yaroslav Trofimenko ◽  
Lyudmila Vinogradova ◽  
Evgeniy Ershov
Keyword(s):  
Video Stream ◽  
Face Identification ◽  
Identification System ◽  
The Face

Classification of Observations through Combination of the Dimension Reduction and the Cluster Analysis

2017 ◽  
Vol 7 (8) ◽  
pp. 30
Author(s):  
Hyeuk Kim
Keyword(s):  
Machine Learning ◽  
Principal Component Analysis ◽  
Cluster Analysis ◽  
Unsupervised Learning ◽  
Principal Component ◽  
Component Analysis ◽  
Baseball Players ◽  
Partitioning Around Medoids ◽  
Different Characteristics

Unsupervised learning in machine learning divides data into several groups. The observations in the same group have similar characteristics and the observations in the different groups have the different characteristics. In the paper, we classify data by partitioning around medoids which have some advantages over the k-means clustering. We apply it to baseball players in Korea Baseball League. We also apply the principal component analysis to data and draw the graph using two components for axis. We interpret the meaning of the clustering graphically through the procedure. The combination of the partitioning around medoids and the principal component analysis can be used to any other data and the approach makes us to figure out the characteristics easily.

Sign in / Sign up

Export Citation Format

Share Document