linear embedding
Recently Published Documents


TOTAL DOCUMENTS

477
(FIVE YEARS 72)

H-INDEX

32
(FIVE YEARS 3)

Author(s):  
Jing Wang ◽  
Jinglin Zhou ◽  
Xiaolu Chen

AbstractQuality variables are measured much less frequently and usually with a significant time delay by comparison with the measurement of process variables. Monitoring process variables and their associated quality variables is essential undertaking as it can lead to potential hazards that may cause system shutdowns and thus possibly huge economic losses. Maximum correlation was extracted between quality variables and process variables by partial least squares analysis (PLS) (Kruger et al. 2001; Song et al. 2004; Li et al. 2010; Hu et al. 2013; Zhang et al. 2015).


Author(s):  
R. Jisha Raj ◽  
Smitha Dharan ◽  
T. T. Sunil

Cultural dances are practiced all over the world. The study of various gestures of the performer using computer vision techniques can help in better understanding of these dance forms and for annotation purposes. Bharatanatyam is a classical dance that originated in South India. Bharatanatyam performer uses hand gestures (mudras), facial expressions and body movements to communicate to the audience the intended meaning. According to Natyashastra, a classical text on Indian dance, there are 28 Asamyukta Hastas (single-hand gestures) and 23 Samyukta Hastas (Double-hand gestures) in Bharatanatyam. Open datasets on Bharatanatyam dance gestures are not presently available. An exhaustive open dataset comprising of various mudras in Bharatanatyam was created. The dataset consists of 15[Formula: see text]396 distinct single-hand mudra images and 13[Formula: see text]035 distinct double-hand mudra images. In this paper, we explore the dataset using various multidimensional visualization techniques. PCA, Kernel PCA, Local Linear Embedding, Multidimensional Scaling, Isomap, t-SNE and PCA–t-SNE combination are being investigated. The best visualization for exploration of the dataset is obtained using PCA–t-SNE combination.


Author(s):  
Talayeh Ghodsizad ◽  
Hamid Behnam ◽  
Emad Fatemizadeh ◽  
Taraneh Faghihi Langroudi ◽  
Fariba Bayat

Purpose: Multimodal Cardiac Image (MCI) registration is one of the evolving fields in the diagnostic methods of Cardiovascular Diseases (CVDs). Since the heart has nonlinear and dynamic behavior, Temporal Registration (TR) is the fundamental step for the spatial registration and fusion of MCIs to integrate the heart's anatomical and functional information into a single and more informative display. Therefore, in this study, a TR framework is proposed to align MCIs in the same cardiac phase. Materials and Methods: A manifold learning-based method is proposed for the TR of MCIs. The Euclidean distance among consecutive samples lying on the Locally Linear Embedding (LLE) of MCIs is computed. By considering cardiac volume pattern concepts from distance plots of LLEs, six cardiac phases (end-diastole, rapid-ejection, end-systole, rapid-filling, reduced-filling, and atrial-contraction) are temporally registered. Results: The validation of the proposed method proceeds by collecting the data of Computed Tomography Coronary Angiography (CTCA) and Transthoracic Echocardiography (TTE) from ten patients in four acquisition views. The Correlation Coefficient (CC) between the frame number resulted from the proposed method and manually selected by an expert is analyzed. Results show that the average CC between two resulted frame numbers is about 0.82±0.08 for six cardiac phases. Moreover, the maximum Mean Absolute Error (MAE) value of two slice extraction methods is about 0.17 for four acquisition views. Conclusion: By extracting the intrinsic parameters of MCIs, and finding the relationship among them in a lower-dimensional space, a fast, fully automatic, and user-independent framework for TR of MCIs is presented. The proposed method is more accurate compared to Electrocardiogram (ECG) signal labeling or time-series processing methods which can be helpful in different MCI fusion methods.


2021 ◽  
Vol 128 ◽  
pp. 110784
Author(s):  
José-Víctor Alfaro-Santafé ◽  
Javier Alfaro-Santafé ◽  
Carla Lanuza-Cerzócimo ◽  
Antonio Gómez-Bernal ◽  
Aitor Pérez-Morcillo ◽  
...  

2021 ◽  
pp. 108299
Author(s):  
Jianyu Miao ◽  
Tiejun Yang ◽  
Lijun Sun ◽  
Xuan Fei ◽  
Lingfeng Niu ◽  
...  

2021 ◽  
pp. 1-11
Author(s):  
Guo Niu ◽  
Zhengming Ma

Locally Linear Embedding (LLE) is honored as the first algorithm of manifold learning. Generally speaking, the relation between a data and its nearest neighbors is nonlinear and LLE only extracts its linear part. Therefore, local nonlinear embedding is an important direction of improvement to LLE. However, any attempt in this direction may lead to a significant increase in computational complexity. In this paper, a novel algorithm called local quasi-linear embedding (LQLE) is proposed. In our LQLE, each high-dimensional data vector is first expanded by using Kronecker product. The expanded vector contains not only the components of the original vector, but also the polynomials of its components. Then, each expanded vector of high dimensional data is linearly approximated with the expanded vectors of its nearest neighbors. In this way, the proposed LQLE achieves a certain degree of local nonlinearity and learns the data dimensionality reduction results under the principle of keeping local nonlinearity unchanged. More importantly, LQLE does not increase computation complexity by only replacing the data vectors with their Kronecker product expansions in the original LLE program. Experimental results between our proposed methods and four comparison algorithms on various datasets demonstrate the well performance of the proposed methods.


Sign in / Sign up

Export Citation Format

Share Document