• Title/Summary/Keyword: 초기 탐색점

Search Result 162, Processing Time 0.031 seconds

Tweens' Information Needs and Information Practices on YouTube (초기 청소년들(Tweens)의 정보요구와 유튜브(YouTube)에서의 정보추구행태)

  • Kim, Ji-Hyun;Koo, Joung Hwa
    • Journal of Korean Library and Information Science Society
    • /
    • v.52 no.2
    • /
    • pp.275-301
    • /
    • 2021
  • The purpose of the research is to find out both what information tweens (12~14 years old adolescents) need and how they use YouTube to satisfy with their information needs. In order to achieve the goal, the research collected the data by conducting a survey on tweens (N=130) and analyzed the data with statistical processes. The research found out some significant results: first, tweens frequently use the informaton on YouTube and search for leisure information most often. Second, tweens search for information on YouTube because of ease and convenience on learning information even though they do not trust the information on YouTube. Third, tweens regard that YouTube play the role as a significant information source and searching tool, and use information on YouTube because the information on YouTube are composed of easy-to-understand video format. On the basis of the results, the research suggests and discusses how information organization such as public or school libraries provide information services for youth groups effectively.

The Reliability and Validity Testing of Korean Version of the Pittsburgh Sleep Quality Index (한국어판 피츠버그 수면의 질 지수(PSQI-K) 도구의 신뢰도와 타당도 검증)

  • Shin, Seunghwa;Kim, Su Hyun
    • Journal of Convergence for Information Technology
    • /
    • v.10 no.11
    • /
    • pp.148-155
    • /
    • 2020
  • The purpose of the study was to test the reliability and validity of the Korean version of Pittsburgh Sleep Quality Index (PSQI-K) and to examine the cutoff point of the PSQI-K for screening insomnia among young adults. The subjective quality and patterns of sleep in 64 participants were measured using PSQI-K and Fitbit Charge 3TM. The properties of the instrument were analyzed using Cronbach's alpha coefficient for the internal consistency reliability, factor analysis for the construct validity, and Spearman's rho correlation coefficient for the correlation between the PSQI-K total scores and Fitbit tracker scores. The Cronbach's alpha coefficient of the PSQI-K was 0.69. The Spearman's rho correlation coefficient between the PSQI-K and Fitbit tracker was higher than 0.67. A cutoff point of ≥6.0 had a sensitivity of 0.93 and a specificity of 0.84. In conclusion, the PSQI-K is a reliable and valid instrument to evaluate sleep disturbance in Korean young adults.

Disparity Estimation for Intermediate View Reconstruction of Multi-view Video (다시점 동영상의 중간시점영상 생성을 위한 변이 예측 기법)

  • Choi, Mi-Nam;Yun, Jung-Hwan;Yoo, Ji-Sang
    • Journal of Broadcast Engineering
    • /
    • v.13 no.6
    • /
    • pp.915-929
    • /
    • 2008
  • In this paper, we propose an algorithm for pixel-based disparity estimation with reliability in the multi-view image. The proposed method estimates an initial disparity map using edge information of an image, and the initial disparity map is used for reducing the search range to estimate the disparity efficiently. Furthermore, disparity-mismatch on object boundaries and textureless-regions get reduced by adaptive block size. We generated intermediate-view images to evaluate the estimated disparity. Test results show that the proposed algorithm obtained $0.1{\sim}1.2dB$ enhanced PSNR(peak signal to noise ratio) compared to conventional block-based and pixel-based disparity estimation methods.

The Design of Repeated Motion on Adaptive Block Matching Algorithm in Real-Time Image (실시간 영상에서 반복적인 움직임에 적응한 블록정합 알고리즘 설계)

  • Kim Jang-Hyung;Kang Jin-Suk
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.3
    • /
    • pp.345-354
    • /
    • 2005
  • Since motion estimation and motion compensation methods remove the redundant data to employ the temporal redundancy in images, it plays an important role in digital video compression. Because of its high computational complexity, however, it is difficult to apply to high-resolution applications in real time environments. If we have a priori knowledge about the motion of an image block before the motion estimation, the location of a better starting point for the search of an exact motion vector can be determined to expedite the searching process. In this paper presents the motion detection algorithm that can run robustly about recusive motion. The motion detection compares and analyzes two frames each other, motion of whether happened judge. Through experiments, we show significant improvements in the reduction of the computational time in terms of the number of search steps without much quality degradation in the predicted image.

  • PDF

Radius-Measuring Algorithm for Small Tubes Based on Machine Vision using Fuzzy Searching Method (퍼지탐색을 이용한 머신비전 기반의 소형 튜브 내경측정 알고리즘)

  • Naranbaatar, Erdenesuren;Lee, Sang-Jin;Kim, Hyoung-Seok;Bae, Yong-Hwan;Lee, Byung-Ryong
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.35 no.11
    • /
    • pp.1429-1436
    • /
    • 2011
  • In this paper, a new tube-radius-measuring algorithm has been proposed for effectively measuring the radii of small tubes under severe noise conditions that can also perform well when metal scraps that make it difficult to measure the radius correctly are inside the tube hole. In the algorithm, we adopt a fuzzy searching method that searches for the center of the inner circle by using fuzzy parameters for distance and orientation from the initial search point. The proposed algorithm has been implemented and tested on both synthetic and real-world tube images, and the performance is compared to existing circle-detection algorithms, such as the Hough transform and RANSAC methods, to prove the accuracy and effectiveness of the algorithm. From this comparison, it is concluded that the proposed algorithm has excellent performance in terms of measurement accuracy and computation time.

Real-Time Automatic Target Detection in CCD image (CCD 영상에서의 실시간 자동 표적 탐지 알고리즘)

  • 유정재;선선구;박현욱
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.6
    • /
    • pp.99-108
    • /
    • 2004
  • In this paper, a new fast detection and clutter rejection method is proposed for CCD-image-based Automatic Target Detection System. For defence application, fast computation is a critical point, thus we concentrated on the ability to detect various targets with simple computation. In training stage, 1D template set is generated by regional vertical projection and K-means clustering, and binary tree structure is adopted to reduce the number of template matching in test stage. We also use adaptive skip-width by Correlation-based Adaptive Predictive Search(CAPS) to further improve the detecting speed. In clutter rejection stage, we obtain Fourier Descriptor coefficients from boundary information, which are useful to rejected clutters.

A Study on the Optimization of the Digital Media Service Menu Structure based on the Differentiations of User Experience with special reference to Eye Tracking Test (사용자경험 차이를 고려한 TV(디지털미디어) 서비스 초기메뉴의 구조 최적화 연구 - 시선추적 실험을 중심으로)

  • Lee, Sang-Ho
    • Journal of Digital Contents Society
    • /
    • v.11 no.4
    • /
    • pp.445-452
    • /
    • 2010
  • This paper deals with the exploratory study & experimentation for foundation & theoretical base of menu structuring & design improvement of digital media (IPTV, Digital cable TV) service players. Digital media service providers had been offered many cases of menu structure since their service launched. Researcher set a research topic which verification of eye tracking velocity when media user feels with perceived ease of design and the familiarity. Researcher arrives at a conclusion through as stated above experiment that vertical type of menu and horizontal type of menu are differentiated from the contents characteristics. Research conclusions & implications are strong theoretical base with digital media service players when they planning and designing their service structuring.

Research on Teaching Method for the Properties of Arithmetic Based on Analysis of Elementary School Mathematics Textbooks (교과서 분석에 기초한 연산법칙의 지도 방안 탐색)

  • Chang, Hyewon
    • Journal of Elementary Mathematics Education in Korea
    • /
    • v.21 no.1
    • /
    • pp.1-22
    • /
    • 2017
  • The properties of arithmetic are considered as essential to understand the principles of calculation and develop effective strategies for calculation in the elementary school level, thanks to agreement on early algebra. Therefore elementary students' misunderstanding of the properties of arithmetic might cause learning difficulties as well as misconcepts in their following learning processes. This study aims to provide elementary teachers a part of pedagogical content knowledge about the properties of arithmetic and to induce some didactical implications for teaching the properties of arithmetic in the elementary school level. To do this, elementary school mathematics textbooks since the period of the first curriculum were analyzed. These results from analysis show which properties of arithmetic have been taught, when they were taught, and how they were taught. Based on them, some didactical implications were suggested for desirable teaching of the properties of arithmetic.

  • PDF

A Practical Approximation Method for TSP (외판원문제(TSP)를 위한 실용적인 근사해법)

  • Paek, Gwan-Ho
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • pp.768-772
    • /
    • 2005
  • TSP(Traveling Salesman Problem) has been a nagging NP-complete problem to test almost every algorithmic idea in combinatorial optimization in vain. The main bottleneck is how to get the integer results {0,1} and to avoid sub-tours. We suggest simple and practical method in two steps. Firstly for every node, an initial Hamiltonian cycle us produced on the nearest neighbour concept. The node with nearest distance is to be inserted to form a increased feasible cycle. Secondly we improve the initial solution by exchanging 2 cuts of the grand tours. We got practical results within 1 from the optimum in 30 minutes for up to 200 nodes problems. TSP of real world type might be tackled practically in our formulation.

  • PDF

Building Boundary Reconstruction from Airborne Lidar Data by Adaptive Convex Hull Algorithm (적응적 컨벡스헐 알고리즘을 이용한 항공라이다 데이터의 건물 경계 재구성)

  • Lee, Jeong-Ho;Kim, Yong-Il
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.3
    • /
    • pp.305-312
    • /
    • 2012
  • This paper aims at improving the accuracy and computational efficiency in reconstructing building boundaries from airborne Lidar points. We proposed an adaptive convex hull algorithm, which is a modified version of local convex hull algorithm in three ways. The candidate points for boundary are first selected to improve efficiency depending on their local density. Second, a searching-space is adjusted adaptively, based on raw data structure, to extract boundary points more robustly. Third, distance between two points and their IDs are utilized in detecting the seed points of inner boundary to distinguish between inner yards and inner holes due to errors or occlusions. The practicability of the approach were evaluated on two urban areas where various buildings exist. The proposed method showed less shape-dissimilarity(8.5%) and proved to be two times more efficient than the other method.