• Title/Summary/Keyword: Shot Clustering

Search Result 31, Processing Time 0.024 seconds

Prompt engineering to improve the performance of teaching and learning materials Recommendation of Generative Artificial Intelligence

  • Soo-Hwan Lee;Ki-Sang Song
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.8
    • /
    • pp.195-204
    • /
    • 2023
  • In this study, prompt engineering that improves prompts was explored to improve the performance of teaching and learning materials recommendations using generative artificial intelligence such as GPT and Stable Diffusion. Picture materials were used as the types of teaching and learning materials. To explore the impact of the prompt composition, a Zero-Shot prompt, a prompt containing learning target grade information, a prompt containing learning goals, and a prompt containing both learning target grades and learning goals were designed to collect responses. The collected responses were embedded using Sentence Transformers, dimensionalized to t-SNE, and visualized, and then the relationship between prompts and responses was explored. In addition, each response was clustered using the k-means clustering algorithm, then the adjacent value of the widest cluster was selected as a representative value, imaged using Stable Diffusion, and evaluated by 30 elementary school teachers according to the criteria for evaluating teaching and learning materials. Thirty teachers judged that three of the four picture materials recommended were of educational value, and two of them could be used for actual classes. The prompt that recommended the most valuable picture material appeared as a prompt containing both the target grade and the learning goal.

Classification of C.elegans Behavioral Phenotypes Using Shape Information (형태적 특징 정보를 이용한 C.Elegans의 개체 분류)

  • Jeon, Mi-Ra;Nah, Won;Hong, Seung-Bum;Baek, Joong-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7C
    • /
    • pp.712-718
    • /
    • 2003
  • C.elegans are often used to study of function of gene, but it is difficult for human observation to distinguish the mutants of C.elegans. To solve this problem, the system, which can classify the mutant types automatically using the computer vision, is now studying. Tn previous work[1], we described the preprocessing method for automated-classification system. In this paper, we introduce shape features, which can be extracted from an acquisition image. We divide the feature into two categories, which are related to size and posture of the worm, and each feature is described mathematically We validate the shape information experimentally. And we use hierarchical clustering algorithm for classification. It reveals that 4 mutants of the worm, which are used in experiment, can be classified with over 90% of success rate.

Video Story Segmentation using Nearest Neighbor Clustering Method (Nearest Neighbor 클러스터링 방법을 이용한 비디오 스토리 분할)

  • 이해만;최영우;정규식
    • Proceedings of the IEEK Conference
    • /
    • 2000.09a
    • /
    • pp.101-104
    • /
    • 2000
  • 비디오 데이터의 효율적인 검색, 요약 등에 활용하기 위해서 대용량의 비디오 데이터를 프레임(Frame), 샷(Shot),스토리(Story)의 계층적인 구조로 표현하는 방법들이 요구되고 있으며, 이에 따라 비디오를 샷, 스토리 단위로 분할하는 연구들이 수행되고 있다. 본 논문은 비디오가 샷 단위로 분할되어 있다고 가정한 후, 인접한 샷들을 결합하여 의미 있는 최소 단위인 스토리를 분할하는 방법을 제안한다. 제안하는 방법은 각 샷에서 추출된 대표 프레임들을 비교하기 위한 CCV(Color Coherence Vector) 영상 특징을 추출한다. CCV 특징의 시각적인 유사도의 초기임계값과 일정한 시간 안에 반복되는 프레임들을 찾기 위한 시간적인 유사도의 시간 임계값을 설정하여NN(Nearest Neighbor) 클러스터링 방법을 이용하여 클러스터링을 한다. 클러스터링된 정보와 같은 장면이 한번이상 반복되는 스토리의 특성을 이용해 비디오를 스토리로 분할한다. 영화 비디오 데이터를 이용한 실험을 통해 제안하는 방법의 유효성을 검증하였다.

  • PDF

An Improved key Frame Selection Algorithm Based on Histogram Difference Between Frames (프레임간 히스토그램 차이를 이용한 개선된 대표프레임 추출 알고리즘)

  • 정지현;전승철;박성한
    • Proceedings of the IEEK Conference
    • /
    • 2000.11c
    • /
    • 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.

  • PDF

인위적 데이터를 이용한 군집분석 프로그램간의 비교에 대한 연구 - A Research-In-Progress Paper -

  • 김성호;백승익;최종연
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2000.11a
    • /
    • pp.349-357
    • /
    • 2000
  • 인터넷 비즈니스나 전자상거래와 연관되어 고객관계관리 (Customer Relationship Management: CRM)가 널리 확산됨으로 해서 군집분석에 대한 관심이 한층 높아졌고, 다양한 군집분석 프로그램이 시장에 소개되어 지고 있다. 그러나, 군집분석 프로그램들은 다른 데이터 분석 기법과는 달리 그들의 정확성을 측정하기가 매우 힘들다. 본 논문에서는 이미 알려져 있는 군집구조를 지닌 인위적 데이터를 사용하여 반복적 군집분석 프로그램 (Convergent Cluster Analysis: CCA)과 보다 전통적인 단순군집 프로그램 (One-Shot Clustering Program: Howard-Harris 프로그램), 그리고 데이터 마이닝 기법 중의 하나인 데모그래픽 군집분실 프로그램의 정확성을 비교하기 위한 현재 진행 중인 연구의 방법론을 제시하는데 그 주요 목적을 두고 있다.

  • PDF

An Efficient Video Clip Matching Algorithm Using the Cauchy Function (커쉬함수를 이용한 효율적인 비디오 클립 정합 알고리즘)

  • Kim Sang-Hyul
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.5 no.4
    • /
    • pp.294-300
    • /
    • 2004
  • According to the development of digital media technologies various algorithms for video clip matching have been proposed to match the video sequences efficiently. A large number of video search methods have focused on frame-wise query, whereas a relatively few algorithms have been presented for video clip matching or video shot matching. In this paper, we propose an efficient algorithm to index the video sequences and to retrieve the sequences for video clip query. To improve the accuracy and performance of video sequence matching, we employ the Cauchy function as a similarity measure between histograms of consecutive frames, which yields a high performance compared with conventional measures. The key frames extracted from segmented video shots can be used not only for video shot clustering but also for video sequence matching or browsing, where the key frame is defined by the frame that is significantly different from the previous frames. Experimental results with color video sequences show that the proposed method yields the high matching performance and accuracy with a low computational load compared with conventional algorithms.

  • PDF

An Efficient Video Sequence Matching Algorithm (효율적인 비디오 시퀀스 정합 알고리즘)

  • 김상현;박래홍
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.5
    • /
    • pp.45-52
    • /
    • 2004
  • According tothe development of digital media technologies various algorithms for video sequence matching have been proposed to match the video sequences efficiently. A large number of video sequence matching methods have focused on frame-wise query, whereas a relatively few algorithms have been presented for video sequence matching or video shot matching. In this paper, we propose an efficientalgorithm to index the video sequences and to retrieve the sequences for video sequence query. To improve the accuracy and performance of video sequence matching, we employ the Cauchy function as a similarity measure between histograms of consecutive frames, which yields a high performance compared with conventional measures. The key frames extracted from segmented video shots can be used not only for video shot clustering but also for video sequence matching or browsing, where the key frame is defined by the frame that is significantly different from the previous fames. Several key frame extraction algorithms have been proposed, in which similar methods used for shot boundary detection were employed with proper similarity measures. In this paper, we propose the efficient algorithm to extract key frames using the cumulative Cauchy function measure and. compare its performance with that of conventional algorithms. Video sequence matching can be performed by evaluating the similarity between data sets of key frames. To improve the matching efficiency with the set of extracted key frames we employ the Cauchy function and the modified Hausdorff distance. Experimental results with several color video sequences show that the proposed method yields the high matching performance and accuracy with a low computational load compared with conventional algorithms.

AKARI OBSERVATION OF THE FLUCTUATION OF THE NEAR-INFRARED BACKGROUND

  • Matsumoto, T.;Seo, H.J.;Jeong, W.S.;Lee, H.M.;Matsuura, S.;Matsuhara, H.;Oyabu, S.;Pyo, J.;Wada, T.
    • Publications of The Korean Astronomical Society
    • /
    • v.27 no.4
    • /
    • pp.363-365
    • /
    • 2012
  • We report a search for fluctuations of the sky brightness toward the North Ecliptic Pole with AKARI, at 2.4, 3.2, and $4.1{\mu}m$. The stacked images with a diameter of 10 arcminutes of the AKARI-Monitor Field show a spatial structure on the scale of a few hundred arcseconds. A power spectrum analysis shows that there is a significant excess fluctuation at angular scales larger than 100 arcseconds that cannot be explained by zodiacal light, diffuse Galactic light, shot noise of faint galaxies, or clustering of low-redshift galaxies. These findings indicate that the detected fluctuation could be attributed to the first stars of the universe, i.e., Population III stars.

Prediction of Sunspot Number Time Series using the Parallel-Structure Fuzzy Systems (병렬구조 퍼지시스템을 이용한 태양흑점 시계열 데이터의 예측)

  • Kim Min-Soo;Chung Chan-Soo
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.54 no.6
    • /
    • pp.390-395
    • /
    • 2005
  • Sunspots are dark areas that grow and decay on the lowest level of the sun that is visible from the Earth. Shot-term predictions of solar activity are essential to help plan missions and to design satellites that will survive for their useful lifetimes. This paper presents a parallel-structure fuzzy system(PSFS) for prediction of sunspot number time series. The PSFS consists of a multiple number of component fuzzy systems connected in parallel. Each component fuzzy system in the PSFS predicts future data independently based on its past time series data with different embedding dimension and time delay. An embedding dimension determines the number of inputs of each component fuzzy system and a time delay decides the interval of inputs of the time series. According to the embedding dimension and the time delay, the component fuzzy system takes various input-output pairs. The PSFS determines the final predicted value as an average of all the outputs of the component fuzzy systems in order to reduce error accumulation effect.

In vivo Imaging Flow Cytometer (세포 이미징 기능을 겸비한 생체 유세포 분석기)

  • Lee, Ho
    • Journal of the Korean Society of Visualization
    • /
    • v.5 no.1
    • /
    • pp.9-11
    • /
    • 2007
  • We introduce an in vivo imaging flow cytometer, which provides fluorescence images simultaneously with quantitative information on the cell population of interest in a live animal. As fluorescent cells pass through the slit of light focused across a blood vessel, the excited fluorescence is confocally detected. This cell signal triggers a strobe beam and a high sensitivity CCD camera that captures a snap-shot image of the cell as it moves down-stream from the slit. We demonstrate that the majority of signal peaks detected in the in vivo flow cytometer arise from individual cells. The instrument's capability to image circulating T cells and measure their speed in the blood vessel in real time in vivo is demonstrated. The cell signal irradiance variation, clustering percentage, and potential applications in biology and medicine are discussed.