• Title/Summary/Keyword: 코사인비

Search Result 83, Processing Time 0.027 seconds

Development of a Clustering Model for Automatic Knowledge Classification (지식 분류의 자동화를 위한 클러스터링 모형 연구)

  • 정영미;이재윤
    • Journal of the Korean Society for information Management
    • /
    • v.18 no.2
    • /
    • pp.203-230
    • /
    • 2001
  • The purpose of this study is to develop a document clustering model for automatic classification of knowledge. Two test collections of newspaper article texts and journal article abstracts are built for the clustering experiment. Various feature reduction criteria as well as term weighting methods are applied to the term sets of the test collections, and cosine and Jaccard coefficients are used as similarity measures. The performances of complete linkage and K-means clustering algorithms are compared using different feature selection methods and various term weights. It was found that complete linkage clustering outperforms K-means algorithm and feature reduction up to almost 10% of the total feature sets does not lower the performance of document clustering to any significant extent.

  • PDF

Performance analysis of multi-carrier CDMA system using an orthogonal pair of quadrature filter banks (직교 쌍 필터 뱅크 기반 다중 반송파 CDMA 시스템의 성능분석)

  • 이재철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.9B
    • /
    • pp.1570-1578
    • /
    • 2000
  • A quadrature pair of filter banks that are composed of a pair of cosine and sine modulated filter banks is applied to MC-CDMA data transmultiplexing in the view point of mitigating inter-channel interferences. Exploiting superior capabilities of wavelet properties in composing the filter banks the proposed scheme is capable of compromising inter-channel interference problems better than the conventional DFT-based MC-CDMA due to superior subchannelization effects. To verify the behavior of our proposed MC-CDMA system based on the quadrature filter banks the reverse-link bit error rates with respect to signal-to-noise ratio under Rayleigth fading and additive white Gaussian noise channel environments are computed. The results show an improved system performance over the conventional MC-CDMA in the view point of minimizing interference effects.

  • PDF

User Similarity-based Path Prediction Method (사용자 유사도 기반 경로 예측 기법)

  • Nam, Sumin;Lee, Sukhoon
    • The Journal of Korean Institute of Information Technology
    • /
    • v.17 no.12
    • /
    • pp.29-38
    • /
    • 2019
  • A path prediction method using lifelog requires a large amount of training data for accurate path prediction, and the path prediction performance is degraded when the training data is insufficient. The lack of training data can be solved using data of other users having similar user movement patterns. Therefore, this paper proposes a path prediction algorithm based on user similarity. The proposed algorithm learns the path in a triple grid pattern and measures the similarity between users using the cosine similarity technique. Then, it predicts the path with applying measured similarity to the learned model. For the evaluation, we measure and compare the path prediction accuracy of proposed method with the existing algorithms. As a result, the proposed method has 66.6% accuracy, and it is evaluated that its accuracy is 1.8% higher than other methods.

Detecting Hidden Messages Using CUSUM Steganalysis based on SPRT (SPRT를 기반으로 하는 누적합 스테간 분석을 이용한 은닉메시지 감지기법)

  • Ji, Seon-Su
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.15 no.3
    • /
    • pp.51-57
    • /
    • 2010
  • Steganography techniques can be used to hide data within digital images with little or no visible change in the perceived appearance of the image. I propose a steganalysis to detecting hidden message in sequential steganography. This paper presents adjusted technique for detecting abrupt jumps in the statistics of the stego signal during steganalysis. The repeated statistical test based on CUSUM-SPRT runs constantly until it reaches decision. In this paper, I deal with a new and improved statistic $g_t$ by computing $S^{t^*}_j$.

Personalized Exercise Routine Recommendation System for Individuals with Intellectual Disabilities (지적 장애인을 위한 개인화 운동 루틴 추천 시스템)

  • Jimin Lee;Dayeong So;Yerim Jeon;Eunjin (Jinny) Jo;Jihoon Moon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.05a
    • /
    • pp.366-367
    • /
    • 2023
  • 지적 장애인은 제한된 활동 환경 범위의 제약으로 인해 자기 신체 구조에 맞는 운동법을 접할 기회가 적고, 각자의 건강 상태와 신체 구조에 따라 운동할 때 세심한 요구가 필요하다. 본 논문은 지적 장애인을 대상으로 비만 관리에 대한 필요성 인지 및 신체 활동량을 늘리기 위한 개인 맞춤형 운동 루틴 추천 시스템을 제안하였다. 제안한 시스템을 구성하기 위해 먼저 대한장애인체육회에서 제공하는 건강 상태, 신체 정보, 장애 유형 및 등급 등의 데이터를 분석하였다. 또한, 웹 사이트에서 장애인의 입력 정보가 들어오면 TF-IDF 벡터를 산출하고, 다른 사용자와의 코사인 유사성을 분석해 운동 루틴을 제안하였다. 본 연구에서 제안한 추천 시스템을 통해 지적 장애인을 대상으로 맞춤형 건강관리에 대한 인식 향상 및 건강권 보장, 운동 효율 증진 등을 기대할 수 있다.

Color-Texture Image Watermarking Algorithm Based on Texture Analysis (텍스처 분석 기반 칼라 텍스처 이미지 워터마킹 알고리즘)

  • Kang, Myeongsu;Nguyen, Truc Kim Thi;Nguyen, Dinh Van;Kim, Cheol-Hong;Kim, Jong-Myon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.4
    • /
    • pp.35-43
    • /
    • 2013
  • As texture images have become prevalent throughout a variety of industrial applications, copyright protection of these images has become important issues. For this reason, this paper proposes a color-texture image watermarking algorithm utilizing texture properties inherent in the image. The proposed algorithm selects suitable blocks to embed a watermark using the energy and homogeneity properties of the grey level co-occurrence matrices as inputs for the fuzzy c-means clustering algorithm. To embed the watermark, we first perform a discrete wavelet transform (DWT) on the selected blocks and choose one of DWT subbands. Then, we embed the watermark into discrete cosine transformed blocks with a gain factor. In this study, we also explore the effects of the DWT subbands and gain factors with respect to the imperceptibility and robustness against various watermarking attacks. Experimental results show that the proposed algorithm achieves higher peak signal-to-noise ratio values (47.66 dB to 48.04 dB) and lower M-SVD values (8.84 to 15.6) when we embedded a watermark into the HH band with a gain factor of 42, which means the proposed algorithm is good enough in terms of imperceptibility. In addition, the proposed algorithm guarantees robustness against various image processing attacks, such as noise addition, filtering, cropping, and JPEG compression yielding higher normalized correlation values (0.7193 to 1).

Seismic Performance Evaluation of the Underground Utility Tunnel by Response Displacement Method and Response History Analysis (응답변위법과 응답이력해석법을 이용한 지중 공동구의 내진성능 평가)

  • Kwon, Ki-Yong;Lee, Jin-Sun;Kim, Yong-Kyu;Youn, Jun-Ung;Jeong, Soon-Yong
    • Journal of the Korean Geotechnical Society
    • /
    • v.36 no.11
    • /
    • pp.119-133
    • /
    • 2020
  • Underground utility tunnel, the most representative cut and cover structure, is subjected to seismic force by displacement of the surrounding soil. In 2020, Korea Infrastructure Safety Corporation has published "Seismic Performance Evaluation Guideline for Existing Utility Tunnel." This paper introduces two seismic evaluation methods, RDM (Response Displacement Method) and RHA (Response History Analysis) adopted in the guide and compares the methods for an example of an existing utility tunnel. The test tunnel had been constructed in 1988 and seismic design was not considered. RDM is performed by single and double cosine methods based on the velocity response spectrum at the base rock. RHA is performed by finite difference analysis that is able to consider nonlinear behavior of soil and structure together in two-dimensional plane strain condition. The utility tunnel shows elastic behavior for RDM, but shows plastic hinge for RHA under the collapse prevention level earthquake.

The Technique of Blocking Artifacts Reduction Method Based on Spatially Adaptive Image Restoration (공간 적응적 영상복원을 이용한 블록화 현상 제거 기법)

  • Kim, Tae-Keun;Woo, Hun-Bae;Paik, Joon-Ki
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.12
    • /
    • pp.46-54
    • /
    • 1998
  • In this paper we propose a fast adaptive image restoration filter using DCT-based block classification for reducing block artifacts in compressed images. In order to efficiently reduce block artifacts, edge direction of each block is classified by using the DCT coefficients, and the constrained least square (CLS) on the observation that the quantization operation in a series of coding process is a nonlinear and many-to-one mapping operator. And then we propose an approximated version of constrained optimization technique as a restoration process for removing the nonlinear and space-varying degradation operator. For real-time implementation, the proposed restoration filter can be realized in the form of a truncated FIR filter, which is suitable for postprocessing reconstructed images in HDTV, DVD, or video conference systems.

  • PDF

Performance Comparison of DCT Algorithm Implementations Based on Hardware Architecture (프로세서 구조에 따른 DCT 알고리즘의 구현 성능 비교)

  • Lee Jae-Seong;Pack Young-Cheol;Youn Dae-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.6C
    • /
    • pp.637-644
    • /
    • 2006
  • This paper presents performance and implementation comparisons of standard and fast DCT algorithms that are commonly used for subband filter bank in MPEG audio coders. The comparison is made according to the architectural difference of the implementation hardware. Fast DCT algorithms are known to have much less computational complexity than the standard method that involves computing a vector dot product of cosine coefficient. But, due to structural irregularity, fast DCT algorithms require extra cycles to generate the addresses for operands and to realign interim data. When algorithms are implemented using DSP processors that provide special operations such as single-cycle MAC (multiply-accumulate), zero-overhead nested loop, the standard algorithm is more advantageous than the fast algorithms. Also, in case of the finite-precision processing, the error performance of the standard method is far superior to that of the fast algorithms. In this paper, truncation errors and algorithmic suitability are analyzed and implementation results are provided to support the analysis.

New Intra Coding Scheme for High-definition Video Coding (고화질 비디오 부호화를 위한 새로운 화면내 부호화 방법)

  • Heo, Jin;Ho, Yo-Sung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.5
    • /
    • pp.72-78
    • /
    • 2008
  • Although the H.264 video coding scheme is popular, it is not efficient for high-definition (HD) video coding because the size of its macroblock is relatively small for the HD video resolution. In this paper, we propose a new intra coding scheme based on the enlarged macroblock size. For the luminance component, intra $4{\times}4$ prediction and intra $16{\times}16$ prediction in H.264 are scaled into intra $8{\times}8$ prediction and intra $32{\times}32$ prediction, respectively. For the chrominance components, intra $8{\times}8$ prediction is extended to intra $16{\times}16$ prediction. Along with the $8{\times}8$ basic coding block size, an $8{\times}8$ integer discrete cosine transform (DCT) is used. Experimental results show that the proposed algorithm improves coding efficiency of the intra coding for HD video: PSNR gain by 0.23dB and bit-rate reduction by 5.32% on average.