• 대한수학회지
• /
• 제54권1호
• /
• pp.215-225
• /
• 2017

In this paper, we study some equivalence relations between continuous frames in a Hilbert space ${\mathcal{H}}$. In particular, we seek two necessary and sufficient conditions under which two continuous frames are near. Moreover, we investigate a distance between continuous frames in order to acquire the closest and nearest tight continuous frame to a given continuous frame. Finally, we implement these results for shearlet and wavelet frames in two examples.

• 한국콘텐츠학회논문지
• /
• 제11권12호
• /
• pp.674-681
• /
• 2011

조선 시대 인쇄물인 삼강행실도는 세계 만화역사에서도 이른 시기인 1434년에 간행되었다. 삼강행실도에는 만화기호인 '만화칸'과 '칸과 칸 사이'가 등장한다. 만화기호인 만화칸의 상징성 못지않게 칸과 칸 사이도 만화기호에서 상징적 의미가 있다. 만화역사의 측면에서 보면 칸이 등장한 후, 칸과 칸 사이가 등장한 그 자체만으로도 의미를 부여할 수 있다. 그 상징적 근거들을 찾아 밝힘으로써 국내 만화역사의 역사적 근거가 다져질 것이다. 삼강행실도에서는 칸과 칸 사이의 형식적인 유형을 크게 두 가지로 나눌 수 있다. 첫 번째는 '구름칸과 구름칸 사이'이며, 두 번째는 '구름칸과 배경칸 사이'이다. 삼강행실도의 두 가지 유형인 칸과 칸 사이는 현대 만화와 비교할 때 모양이나 연출에서 차이를 보이지만 칸과 칸 사이의 의미는 유사하다고 하겠다. 이처럼 본 연구는 삼강행실도의 칸과 칸 사이의 형태를 분석함으로써 국내 만화역사의 타당한 근거를 제시하는 데 의미가 있다. 만화기호 중에서도 칸과 칸 사이에 초점을 맞추어, 삼강행실도의 칸과 칸 사이의 형태를 증명하는 것이 연구의 목적이다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(3)
• /
• pp.137-140
• /
• 2000

In this paper, we propose as new algorithm for the selection of key frames in a given video. For the selected key frames to be well defined, the selected key frames need to spread out on the whole temporal domain of the given video and guaranteed not to be duplicate. For this purpose, we take the first frame of each shot of the video as the candidate key frame to represent the video. To reduce the overall processing time, we eliminate some candidate key frames which are visually indistinct in the histogram difference. The key frames are then selected using a clustering processing based on the singly linked hierarchical tree. To make the selected key frames be distributed evenly on the whole video, the deviation and time difference between the selected key frames are used. The simulation results demonstrate that our method provides the better performance compared with previous methods.

• 대한수학회논문집
• /
• 제23권3호
• /
• pp.453-459
• /
• 2008

We introduce a concept of continuous homomorphisms between Csaszar frames and show that the Cauchy completion in CsFrm gives rise to a coreflection in the category PCsFrm (resp. UCsFrm) consisting of proximal Csaszar frames and uniform continuous homomor-phisms (resp. uniform Csaszar frames and uniform continuous homomor-phisms).

• Earthquakes and Structures
• /
• 제26권4호
• /
• pp.285-297
• /
• 2024

Due to the imbalanced vibration of the adjacent buildings, the pounding phenomenon occurs as a result of an insufficient gap between them. Providing enough gap between adjacent structures is the most efficient approach to preventing the pounding effect. This paper calculated the required separation gaps between adjacent buildings, including two, four, eight, twelve and twenty stories steel moment-resisting frames, and investigated their related influencing parameters such as time periods, damping ratios, and the number of bays. The linear and nonlinear dynamic time-history analyses under real seismic event records were conducted to calculate the required separation gaps by obtaining relative displacement and velocity functions of two adjacent frames. The results showed that the required separation gap increased when the time periods of adjacent frames were not the same. The resulting separation gaps values of linear and nonlinear analyses were similar only for two and four stories frames. In other frames, the resulting separation gap values of linear analyses surpassed the corresponding nonlinear analyses. Although increasing the damping ratios in adjacent frames causes a decrease in the required separation gaps, the number of bays had no significant effect on them.

• Korean Journal of Mathematics
• /
• 제20권1호
• /
• pp.61-75
• /
• 2012

We investigate the properties of various frames and connections on partially ordered sets. In particular, we study the relations between various connections and various frames.

• 한국언어정보학회지:언어와정보
• /
• 제14권1호
• /
• pp.113-144
• /
• 2010

The primary goal of this paper is to find a feasible way to answer the question: Does the similarity in meaning between verbs relate to the similarity in their subcategorization? In order to answer this question in a rather concrete way on the basis of a large set of English verbs, this study made use of various language resources, tools, and statistical methodologies. We first compiled a list of 678 verbs that were selected from the most and second most frequent word lists from the Colins Cobuild English Dictionary, which also appeared in WordNet 3.0. We calculated similarity measures between all the pairs of the words based on the 'jcn' algorithm (Jiang and Conrath, 1997) implemented in the WordNet::Similarity module (Pedersen, Patwardhan, and Michelizzi, 2004). The clustering process followed, first building similarity matrices out of the similarity measure values, next drawing dendrograms on the basis of the matricies, then finally getting 177 meaningful clusters (covering 437 verbs) that passed a certain level set by z-score. The subcategorization frames and their frequency values were taken from the ICE-GB. In order to calculate the Selectional Preference Strength (SPS) of the relationship between a verb and its subcategorizations, we relied on the Kullback-Leibler Divergence model (Resnik, 1996). The SPS values of the verbs in the same cluster were compared with each other, which served to give the statistical values that indicate how much the SPS values overlap between the subcategorization frames of the verbs. Our final analysis shows that the degree of overlap, or the relationship between semantic similarity and the subcategorization frames of the verbs in English, is equally spread out from the 'very strongly related' to the 'very weakly related'. Some semantically similar verbs share a lot in terms of their subcategorization frames, and some others indicate an average degree of strength in the relationship, while the others, though still semantically similar, tend to share little in their subcategorization frames.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송∙미디어공학회 2022년도 하계학술대회
• /
• pp.1249-1252
• /
• 2022

In this paper, we propose a conceptual framework that identifies video frames in motion containing the movement of people and vehicles in traffic videos. The automatic selection of video frames in motion is an important topic in security and surveillance video because the number of videos to be monitored simultaneously is simply too large due to limited human resources. The conventional method to identify the areas in motion is to compute the differences over consecutive video frames, which has been costly because of its high computational complexity. In this paper, we reduced the overall complexity by examining only the keyframes (or I-frames). The basic assumption is that the time period between I-frames is rather shorter (e.g., 1/10 ~ 3 secs) than the usual length of objects in motion in video (i.e., pedestrian walking, automobile passing, etc.). The proposed method estimates the possibility of videos containing motion between I-frames by evaluating the difference of consecutive I-frames with the long-time statistics of the previously decoded I-frames of the same video. The experimental results showed that the proposed method showed more than 80% accuracy in short surveillance videos obtained from different locations while keeping the computational complexity as low as 20 % compared to the HM decoder.

• Journal of applied mathematics & informatics
• /
• 제38권5_6호
• /
• pp.547-557
• /
• 2020

In this paper, we introduce the notions of (dual) residuated frames for a fuzzy logic as an extension of residuated frames for classical relational semantics. We investigate the relations between residuated connections and residuated frames on Alexandrov topologies based on [0, ∞]. Moreover, we study their properties and give their examples.

• 전자공학회논문지CI
• /
• 제40권3호
• /
• pp.137-143
• /
• 2003

Key frame extraction has been recognized as one of tile important research issues in video information retrieval. Although progress has been made in key frame extraction, the existing approaches do not evaluate the importance of extracted frame Quantitatively, and Dey are computationally expensive or ineffective. In this Paper, we introduce a new 미해rithm for key frame extraction using shot coverage and distortion. The algorithm finds significant key frames from candidate key frames. When selecting the candidate frames, the coverage rate to the total frames from each frame is computed by using the difference between the adjacent frames in tile shot. The frames within 10$\%$ from the top are selected as the candidates. Then, by comfuting the distortion rate of the candidates against all frames, pick the frames which arc most representative are selected. The performance of the proposed algorithm has been verified by a statistical test. Experiments show that more than 13-50$\%$ improvement has been obtained by the proposed algorithm compared to the existing methods.