• 제목/요약/키워드: Adjacency

검색결과 233건 처리시간 0.029초

AN EQUIVALENT PROPERTY OF A NORMAL ADJACENCY OF A DIGITAL PRODUCT

  • Han, Sang-Eon
    • 호남수학학술지
    • /
    • 제36권1호
    • /
    • pp.199-215
    • /
    • 2014
  • Owing to the development of the notion of normal adjacency of a digital product [9], product properties of digital topological properties were studied efficiently. To equivalently represent a normal adjacency of a digital product, the present paper proposes an S-compatible adjacency of a digital product. This approach can be helpful to understand a normal adjacency of a digital product. Finally, using an S-compatible adjacency of a digital product, we can study product properties of digital topological properties, which improves the presentations of the normal adjacency of a digital product in [9] and [5, 6].

COMPARISON AMONG SEVERAL ADJACENCY PROPERTIES FOR A DIGITAL PRODUCT

  • Han, Sang-Eon
    • 호남수학학술지
    • /
    • 제37권1호
    • /
    • pp.135-147
    • /
    • 2015
  • Owing to the notion of a normal adjacency for a digital product in [8], the study of product properties of digital topological properties has been substantially done. To explain a normal adjacency of a digital product more efficiently, the recent paper [22] proposed an S-compatible adjacency of a digital product. Using an S-compatible adjacency of a digital product, we also study product properties of digital topological properties, which improves the presentations of a normal adjacency of a digital product in [8]. Besides, the paper [16] studied the product property of two digital covering maps in terms of the $L_S$- and the $L_C$-property of a digital product which plays an important role in studying digital covering and digital homotopy theory. Further, by using HS- and HC-properties of digital products, the paper [18] studied multiplicative properties of a digital fundamental group. The present paper compares among several kinds of adjacency relations for digital products and proposes their own merits and further, deals with the problem: consider a Cartesian product of two simple closed $k_i$-curves with $l_i$ elements in $Z^{n_i}$, $i{\in}\{1,2\}$ denoted by $SC^{n_1,l_1}_{k_1}{\times}SC^{n_2,l_2}_{k_2}$. Since a normal adjacency for this product and the $L_C$-property are different from each other, the present paper address the problem: for the digital product does it have both a normal k-adjacency of $Z^{n_1+n_2}$ and another adjacency satisfying the $L_C$-property? This research plays an important role in studying product properties of digital topological properties.

EXTENDED DIRECTION OF ADJACENCY TABLE을 이용한 다출력 스위칭 회로의 최소화 (Minimization of Multiple Switching Circuit by using Direction of Adjacency Table)

  • 김원준;김민환;황희융
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1985년도 하계학술회의논문집
    • /
    • pp.249-253
    • /
    • 1985
  • 본 논문은 후술할 다출력 스위칭 회로의 최소성 기준(Criteria of Minimality)에 의한 최소의 다출력 스위칭 회로를 설계하는 데 목적을 두고 있다. 이에는 단일 출력 스위칭 함수에 적용된 바 있는 Direction of Adjacency Table 방법이 다소 변경되어 다출력 스위칭 회로에 적용되었다. 이르 위하여 기존의 Direction of Adjacency Table을 다출력 함수의 최소화에 적합하도록 변경한 Extended Direction of Adjacency Table이 구성된다.

  • PDF

PRODUCT PROPERTIES OF DIGITAL COVERING MAPS

  • HAN SANG EON
    • Journal of applied mathematics & informatics
    • /
    • 제17권1_2_3호
    • /
    • pp.537-545
    • /
    • 2005
  • The aim of this paper is to solve the open problem on product properties of digital covering maps raised from [5]. Namely, let us consider the digital images $X_1 {\subset}Z^{n_{0}}$ with $k_0-adjacency$, $Y_1{\subset}Z^{n_{1}}$ with $k_3-adjacency$, $X_2{\subset}Z^{n_{2}}$ with $k_2-adjacency$ and $Y_2{\subset}Z^{n_{3}}$ with $k_3-adjacency$. Then the reasonable $k_4-adjacency$ of the product image $X_1{\times}X_2$ is determined by the $k_0-$ and $k_2-adjacency$ and the suitable k_5-adjacency$ is assumed on $Y_1{\times}Y_2$ via the $k_1-$ and $k_3-adjacency$ [3] such that each of the projection maps is a digitally continuous map, e.g., $p_1\;:\;X_1{\times}X_2{\rightarrow}X_1$ is a digitally ($k_4,\;k_1$)-continuous map and so on. Let us assume $h_1\;:\;X_1{\rightarrow}Y_1$ to be a digital $(k_0, k_1)$-covering map and $h_2\;:\;X_2{\rightarrow}Y_2$ to be a digital $(k_2,\;k_3)$-covering map. Then we show that the product map $h_1{\times}h_2\;:\;X_1{\times}X_2{\rightarrow}Y_1{\times}Y_2$ need not be a digital $(k_4,k_5)$-covering map.

DIRECTED STRONGLY REGULAR GRAPHS AND THEIR CODES

  • Alahmadi, Adel;Alkenani, Ahmad;Kim, Jon-Lark;Shi, Minjia;Sole, Patrick
    • 대한수학회보
    • /
    • 제54권2호
    • /
    • pp.497-505
    • /
    • 2017
  • The rank over a finite field of the adjacency matrix of a directed strongly regular graph is studied, with some applications to the construction of linear codes. Three techniques are used: code orthogonality, adjacency matrix determinant, and adjacency matrix spectrum.

DCT를 통한 UWV 콘텐츠의 2D 인접도 행렬 생성 (2D Adjacency Matrix Generation using DCT for UWV Contents)

  • 이소율;김규헌
    • 방송공학회논문지
    • /
    • 제22권3호
    • /
    • pp.366-374
    • /
    • 2017
  • TV나 디지털 사이니지와 같은 화면표시장치들이 점점 커져감에 따라, 미디어의 종류가 UHD, 파노라마, 퍼즐형 미디어와 같은 광각의 미디어로 변하고 있다. 특히, 파노라마 및 퍼즐형 미디어는 스티칭을 통해 복수개의 카메라로 촬영된 비디오 클립을 합성한 형태로 구성된다. 그러나, 스티칭 과정의 처리 시간이 오래 걸리기 때문에 실시간 서비스에는 적용하기 어려운 문제가 있다. 따라서 본 논문에서는 스티칠 처리 시간을 감소하기 위한 방법으로, 영상간의 공간적 연관관계를 알려주는 2D Adjacency Matrix를 생성하는 것을 제안한다. Discrete Cosine Transform (DCT)를 사용하여, 비디오 소스의 각 프레임을 공간 영역에서 주파수 영역으로 변환 시킨다. 앞서 언급한 DCT 계수를 기반으로 효과적으로 이미지들의 공간적 연관관계를 알려주는 2D Adjacency Matrix를 생성한다. 본 논문에서는 각각의 비디오 클립들로부터 파노라마 영상과, 퍼즐형 미디어를 생성하기 위해 DCT를 이용한 2D Adjacency matrix 생성 방법을 제안한다.

REMARKS ON DIGITAL PRODUCTS WITH NORMAL ADJACENCY RELATIONS

  • Han, Sang-Eon;Lee, Sik
    • 호남수학학술지
    • /
    • 제35권3호
    • /
    • pp.515-524
    • /
    • 2013
  • To study product properties of digital spaces, we strongly need to formulate meaningful adjacency relations on digital products. Thus the paper [7] firstly developed a normal adjacency relation on a digital product which can play an important role in studying the multiplicative property of a digital fundamental group, and product properties of digital coverings and digitally continuous maps. The present paper mainly surveys the normal adjacency relation on a digital product, improves the assertion of Boxer and Karaca in the paper [4] and restates Theorem 6.4 of the paper [19].

초등예비교사가 생각하는 좋은 과학수업의 특징: 대응쌍을 중심으로 (Characteristics of Good Science Teachings regarded by Preservice Elementary School Teachers: In Terms of Adjacency Pairs)

  • 이정아
    • 한국초등과학교육학회지:초등과학교육
    • /
    • 제32권1호
    • /
    • pp.1-9
    • /
    • 2013
  • This study aimed to analyze the characteristics of good science teachings regarded by preservice elementary school teachers. It also aimed to suggest a direction of peer teaching practice to help preservice teachers' professional development. Adjacency pairs were adopted to analyze the characteristics of good science teachings. The results showed that pre-service elementary teachers were accustomed to adjacency pairs. Almost of their discourse were organized by adjacency pairs. 'Question-Answer' and 'Request-Accept' were mainly used in science classes by pre-service elementary teachers. Based on the findings, the study suggested science teacher educators to provide chances to analyze exemplary science teachers' science class or chances to analyze their science teachings in terms of competence of science classroom discourse.

2D Adjacency Matrix Generation using DCT for UWV contents

  • Li, Xiaorui;Lee, Euisang;Kang, Dongjin;Kim, Kyuheon
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송∙미디어공학회 2016년도 추계학술대회
    • /
    • pp.39-42
    • /
    • 2016
  • Since a display device such as TV or signage is getting larger, the types of media is getting changed into wider view one such as UHD, panoramic and jigsaw-like media. Especially, panoramic and jigsaw-like media is realized by stitching video clips, which are captured by different camera or devices. In order to stich those video clips, it is required to find out 2D Adjacency Matrix, which tells spatial relationships among those video clips. Discrete Cosine Transform (DCT), which is used as a compression transform method, can convert the each frame of video source from the spatial domain (2D) into frequency domain. Based on the aforementioned compressed features, 2D adjacency Matrix of images could be found that we can efficiently make the spatial map of the images by using DCT. This paper proposes a new method of generating 2D adjacency matrix by using DCT for producing a panoramic and jigsaw-like media through various individual video clips.

  • PDF

울트라 와이드 뷰잉 서비스를 위한 공간 유사도 맵 생성 및 울트라 와이드 뷰잉 콘텐츠 저장 방법 (Generation of Spatial Adjacency Map and Contents File Format for Ultra Wide Viewing Service)

  • 이의상;강동진;김규헌
    • 방송공학회논문지
    • /
    • 제22권4호
    • /
    • pp.473-483
    • /
    • 2017
  • 최근 들어, 3D 서비스, UHD 비디오, 가상현실(Virtual Reality, VR) 등의 다양한 서비스에 대한 공급 및 수요가 증가하고, 이러한 시장의 동향에 따라, 고품질 및 대화면의 콘텐츠에 대한 수요도 함께 증가하고 있다. UWV 서비스는 기존 파노라마보다 넓은 시야각을 이용하여 사용자들에게 생동감 있는 경험을 제공하고 해당 이벤트에 대한 이해도를 증진하는 서비스이며, 본 논문에서는 UWV 서비스를 제공하기 위한 공간 유사도 맵 생성 방법 및 UWV 파일 저장 포맷 기술을 제안한다. 공간 유사도 맵은 영상의 유사도를 측정하고, 측정된 유사도를 기반으로 하여 영상의 위치 정보를 생성하고 기록한 것으로, 이를 이용하여 영상의 정합 시간을 단축해, 대화면 콘텐츠의 생성시간을 단축시킬 수 있다. UWV 파일 포맷은 ISOBMFF를 기반으로 한 공간 유사도 맵 및 대화면을 구성하는 각 콘텐츠를 함께 처리할 수 있는 파일 포맷이며, 랜덤 액세스를 지원한다. 본 논문에서는 공간 유사도 맵 및 UWV 파일 포맷 검증하기 위해 UWV 플레이어를 설계하였고, 실험을 통한 결과를 보였다.