• Title/Summary/Keyword: geodesic distance

Search Result 30, Processing Time 0.024 seconds

Social Network Comparison of Netflix, Disney+, and OCN on Twitter Using NodeXL

  • Lee, Soochang;Song, Keuntae;Bae, Woojin;Choi, Joohyung
    • International Journal of Advanced Culture Technology
    • /
    • v.10 no.1
    • /
    • pp.47-54
    • /
    • 2022
  • We analyze and compare the structure of the networks of Netflix, Disney+, and OCN, which are forerunners in OTT market, on Twitter. This study employs NodeXL pro as a visualization software package for social network analysis. As a result of the comparison with values of Vertices, Connected Components, Average Geodesic Distance, Average Betweenness Centrality, and Average Closeness Centrality. Netflix has comparative advantages at Vertices, Connected Components, and Average Closeness Centrality, OCN at Average Geodesic Distance, and Disney+ at Average Betweenness Centrality. Netflix has a more appropriate social network for influencer marketing than Disney+ and OCN. Based on the analysis results, the purpose of this study is to explain the structural differences in the social networks of Netflix, Disney+, and OCN in terms of influencer marketing.

A Social Network Analysis of a Virtual Community of Practice

  • JO, Il-Hyun
    • Educational Technology International
    • /
    • v.9 no.2
    • /
    • pp.39-56
    • /
    • 2008
  • This paper investigates the relationship between the structural characteristics of a virtual CoP and the measures of social network analysis. Several implications were developed by the results of the study First, the study, based on reviews of both the CoP and SNA literature, identified specific structural measures of SNA; connectedness, geodesic distance, and density. Second, the formal CoP investigated in this study showed greater development that the classic, informal CoP in terms of the structural dimension of a CoP. The results show that those measures of social network analysis provide an illuminating way to better understand the structural properties of CoP's. Implications of the study with some suggestions for future research are provided.

MEAN DISTANCE OF BROWNIAN MOTION ON A RIEMANNIAN MANIFOLD

  • Kim, Yoon-Tae;Park, Hyun-Suk
    • Proceedings of the Korean Statistical Society Conference
    • /
    • 2002.05a
    • /
    • pp.45-48
    • /
    • 2002
  • Consider the mean distance of Brownian motion on Riemannian manifolds. We obtain the first three terms of the asymptotic expansion of the mean distance by means of Stochastic Differential Equation(SDE) for Brownian motion on Riemannian manifold. This method proves to be much simpler for further expansion than the methods developed by Liao and Zheng(1995). Our expansion gives the same characterizations as the mean exit time from a small geodesic ball with regard to Euclidean space and the rank 1 symmetric spaces.

  • PDF

Global Feature Extraction and Recognition from Matrices of Gabor Feature Faces

  • Odoyo, Wilfred O.;Cho, Beom-Joon
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.2
    • /
    • pp.207-211
    • /
    • 2011
  • This paper presents a method for facial feature representation and recognition from the Covariance Matrices of the Gabor-filtered images. Gabor filters are a very powerful tool for processing images that respond to different local orientations and wave numbers around points of interest, especially on the local features on the face. This is a very unique attribute needed to extract special features around the facial components like eyebrows, eyes, mouth and nose. The Covariance matrices computed on Gabor filtered faces are adopted as the feature representation for face recognition. Geodesic distance measure is used as a matching measure and is preferred for its global consistency over other methods. Geodesic measure takes into consideration the position of the data points in addition to the geometric structure of given face images. The proposed method is invariant and robust under rotation, pose, or boundary distortion. Tests run on random images and also on publicly available JAFFE and FRAV3D face recognition databases provide impressively high percentage of recognition.

RELATIVE ISOPERIMETRIC INEQUALITY FOR MINIMAL SUBMANIFOLDS IN SPACE FORMS

  • Seo, Keomkyo
    • Korean Journal of Mathematics
    • /
    • v.18 no.2
    • /
    • pp.195-200
    • /
    • 2010
  • Let C be a closed convex set in ${\mathbb{S}}^m$ or ${\mathbb{H}}^m$. Assume that ${\Sigma}$ is an n-dimensional compact minimal submanifold outside C such that ${\Sigma}$ is orthogonal to ${\partial}C$ along ${\partial}{\Sigma}{\cap}{\partial}C$ and ${\partial}{\Sigma}$ lies on a geodesic sphere centered at a fixed point $p{\in}{\partial}{\Sigma}{\cap}{\partial}C$ and that r is the distance in ${\mathbb{S}}^m$ or ${\mathbb{H}}^m$ from p. We make use of a modified volume $M_p({\Sigma})$ of ${\Sigma}$ and obtain a sharp relative isoperimetric inequality $$\frac{1}{2}n^n{\omega}_nM_p({\Sigma})^{n-1}{\leq}Vol({\partial}{\Sigma}{\sim}{\partial}C)^n$$, where ${\omega}_n$ is the volume of a unit ball in ${\mathbb{R}}^n$ Equality holds if and only if ${\Sigma}$ is a totally geodesic half ball centered at p.

Retrieval of Non-rigid 3D Models Based on Approximated Topological Structure and Local Volume

  • Hong, Yiyu;Kim, Jongweon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.8
    • /
    • pp.3950-3964
    • /
    • 2017
  • With the increasing popularity of 3D technology such as 3D printing, 3D modeling, etc., there is a growing need to search for similar models on the internet. Matching non-rigid shapes has become an active research field in computer graphics. In this paper, we present an efficient and effective non-rigid model retrieval method based on topological structure and local volume. The integral geodesic distances are first calculated for each vertex on a mesh to construct the topological structure. Next, each node on the topological structure is assigned a local volume that is calculated using the shape diameter function (SDF). Finally, we utilize the Hungarian algorithm to measure similarity between two non-rigid models. Experimental results on the latest benchmark (SHREC' 15 Non-rigid 3D Shape Retrieval) demonstrate that our method works well compared to the state-of-the-art.

A Novel Method for Moving Object Tracking using Covariance Matrix and Riemannian Metric (공분산 행렬과 리만 측도를 이용한 이동물체 추적 방법)

  • Lee, Geum-Boon;Cho, Beom-Joon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.2
    • /
    • pp.364-370
    • /
    • 2011
  • This paper propose a novel method for tracking moving object based on covariance matrix and Riemannian Manifolds. With image backgrounds continuously changed, we use the covariance matrices to extract features for tracking nonrigid object undergoing transformation and deformation. The covariance matrix can make fusion of different types of features and has its small dimension, therefore we enable to handle the spatial and statistical properties as well as the component correlation. The proposed method can estimate the position of the moving object by employing the covariance matrix of object region as a feature vector and comparing the candidate regions. Rimannian Geometry is efficiently adapted to object deformation and change of shape and improve the accuracy by using geodesic distance to predict the estimated position with the minimum distance. The experimental results have shown that the proposed method correctly tracked the moving object.

Performance evaluation of vessel extraction algorithm applied to Aortic root segmentation in CT Angiography (CT Angiography 영상에서 대동맥 추출을 위한 혈관 분할 알고리즘 성능 평가)

  • Kim, Tae-Hyong;Hwang, Young-sang;Shin, Ki-Young
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.9 no.2
    • /
    • pp.196-204
    • /
    • 2016
  • World Health Organization reported that heart-related diseases such as coronary artery stenoses show the highest occurrence rate which may cause heart attack. Using Computed Tomography angiography images will allow radiologists to detect and have intervention by creating 3D roadmapping of the vessels. However, it is often complex and difficult do reconstruct 3D vessel which causes very large amount of time and previous researches were studied to segment vessels more accurate automatically. Therefore, in this paper, Region Competition, Geodesic Active Contour (GAC), Multi-atlas based segmentation and Active Shape Model algorithms were applied to segment aortic root from CTA images and the results were analyzed by using mean Hausdorff distance, volume to volume measure, computational time, user-interaction and coronary ostium detection rate. As a result, Extracted 3D aortic model using GAC showed the highest accuracy but also showed highest user-interaction results. Therefore, it is important to improve automatic segmentation algorithm in future

ACMs-based Human Shape Extraction and Tracking System for Human Identification (개인 인증을 위한 활성 윤곽선 모델 기반의 사람 외형 추출 및 추적 시스템)

  • Park, Se-Hyun;Kwon, Kyung-Su;Kim, Eun-Yi;Kim, Hang-Joon
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.12 no.5
    • /
    • pp.39-46
    • /
    • 2007
  • Research on human identification in ubiquitous environment has recently attracted a lot of attention. As one of those research, gait recognition is an efficient method of human identification using physical features of a walking person at a distance. In this paper, we present a human shape extraction and tracking for gait recognition using geodesic active contour models(GACMs) combined with mean shift algorithm The active contour models (ACMs) are very effective to deal with the non-rigid object because of its elastic property. However, they have the limitation that their performance is mainly dependent on the initial curve. To overcome this problem, we combine the mean shift algorithm with the traditional GACMs. The main idea is very simple. Before evolving using level set method, the initial curve in each frame is re-localized near the human region and is resized enough to include the targe region. This mechanism allows for reducing the number of iterations and for handling the large object motion. The proposed system is composed of human region detection and human shape tracking modules. In the human region detection module, the silhouette of a walking person is extracted by background subtraction and morphologic operation. Then human shape are correctly obtained by the GACMs with mean shift algorithm. In experimental results, the proposed method show that it is extracted and tracked efficiently accurate shape for gait recognition.

  • PDF

Image saliency detection based on geodesic-like and boundary contrast maps

  • Guo, Yingchun;Liu, Yi;Ma, Runxin
    • ETRI Journal
    • /
    • v.41 no.6
    • /
    • pp.797-810
    • /
    • 2019
  • Image saliency detection is the basis of perceptual image processing, which is significant to subsequent image processing methods. Most saliency detection methods can detect only a single object with a high-contrast background, but they have no effect on the extraction of a salient object from images with complex low-contrast backgrounds. With the prior knowledge, this paper proposes a method for detecting salient objects by combining the boundary contrast map and the geodesics-like maps. This method can highlight the foreground uniformly and extract the salient objects efficiently in images with low-contrast backgrounds. The classical receiver operating characteristics (ROC) curve, which compares the salient map with the ground truth map, does not reflect the human perception. An ROC curve with distance (distance receiver operating characteristic, DROC) is proposed in this paper, which takes the ROC curve closer to the human subjective perception. Experiments on three benchmark datasets and three low-contrast image datasets, with four evaluation methods including DROC, show that on comparing the eight state-of-the-art approaches, the proposed approach performs well.