• Kyungpook Mathematical Journal
• /
• v.60 no.4
• /
• pp.781-795
• /
• 2020

In this paper, we obtain an analytical solution for an unsolved definite integral RC (m, n) from a 1915 paper of Srinivasa Ramanujan. We obtain our solution using the hypergeometric approach and an infinite series decomposition identity. Also, we give some generalizations of Ramanujan's integral RC (m, n) defined in terms of the ordinary hypergeometric function 2F3 with suitable convergence conditions. Moreover as applications of our result we obtain nine new infinite summation formulas associated with the hypergeometric functions 0F1, 1F2 and 2F3.

• Journal of Broadcast Engineering
• /
• v.27 no.7
• /
• pp.1011-1020
• /
• 2022

Recent high-performance panoptic segmentation models are based on transformer architectures. However, transformer-based panoptic segmentation methods are basically slower than convolution-based methods, since the attention mechanism in the transformer requires quadratic complexity w.r.t. image resolution. Also, sine and cosine computation for positional embedding in the transformer also yields a bottleneck for computation time. To address these problems, we adopt three modules to speed up the inference runtime of the transformer-based panoptic segmentation. First, we perform channel-level reduction using depth-wise separable convolution for inputs of the transformer decoder. Second, we replace sine and cosine-based positional encoding with convolution operations, called conv-embedding. We also apply a separable self-attention to the transformer encoder to lower quadratic complexity to linear one for numbers of image pixels. As result, the proposed model achieves 44% faster frame per second than baseline on ADE20K panoptic validation dataset, when we use all three modules.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.663-677
• /
• 2023

As the paradigm of future vehicles changes, the interest in automotive semiconductor, which plays a key role in realizing this, is increasing. Automotive semiconductors are the technology with very high entry barriers that require a lot of effort and time because it must secure technology readiness level and also consider safety and reliability. In this technology field, it is very important to develop new businesses and create opportunities through technology trend analysis. However, systematic analysis and application of automotive semiconductor technology trends are currently lacking. In this paper, U.S. registered patent documents related to automotive semiconductor were collected and investigated based on the patent's IPC. The main technology of automotive semiconductor was analyzed through topic modeling, and the technology path such as emerging technology was investigated through cosine similarity. We identified that those emerging technologies such as driving control for vehicle and AI service appeared. We observed that as time passed, both convergence and independence of automotive semiconductor technology proceeded simultaneously.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1169-1172
• /
• 2010

대부분의 홍채인식 시스템의 전반부를 살펴보면 카메라를 통한 이미지를 획득 후 전처리 과정에서 동공의 경계를 잡는 과정이 수행된다. 카메라를 통한 이미지 획득 시 초점이 좋은 이미지와 나쁜 이미지가 같이 획득이 된다. 초점이 나쁜 이미지는 동공의 경계를 잡는 과정에 있어서 좋은 이미지보다 시간이 오래 걸리기 마련이다. 이에 본 논문에서는 영상획득 후 동공의 경계를 잡는 과정 전에 DCT(Discrete Cosine Transform)를 이용한 선명도 측정하는 방법을 제안한다. 카메라를 통한 영상을 획득한 후 초점이 좋은 영상과 나쁜 영상을 구분하게 되고 초점이 좋은 영상만을 선택하여 다음 과정인 동공의 경계를 잡는 작업을 수행하게 된다. 제안하는 방법은 DCT를 이용한 이미지의 선별 작업에 시간이 소비 되지만 나쁜 영상을 이용하여 동공의 경계를 잡느라 걸리는 시간을 줄일 수 있는 장점을 기대할 수 있다. 우선적으로 수학적 분석을 통하여 23%의 속도 절감을 통한 성능 개선의 가능성을 보였고, 실제 구현을 통하여 속도 향상이 기대된다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.3
• /
• pp.340-344
• /
• 1986

This paper shows that we can design a vector-coordinate rotation processor and obtain the approximate evaluations of sine and cosine based upon the use of residue number systems. The algorithm results in the considerable improvement of the computation speed when compared to CORDIC algorithm. The results from computer simulation show that the mean error of sine and cosine is 0.0025 and the mean error of coordinate rotation arithmatic is 0.65. Also, the proposed processor has the efficiency for the design and fabrication of integrated circuit, because it consists of the array of idecntially structured look-up tables.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• fall
• /
• pp.37-40
• /
• 2021

비디오 압축 시 변환(transform)은 예측을 통해 만들어진 공간 영역에서의 잔차신호를 주파수 영역으로 변환함으로써 낮은 주파수 대역으로 에너지를 이동시켜 비디오 압축에서 중요한 역할을 수행한다. VVC(Versatile Video Coding)에서는 DCT-II(Discrete Cosine Transform-II), DST-VII(Discrete Sine Transform-VII), DCTVIII(Discrete Cosine Transform-VIII)를 이용하여 잔차신호 변환을 수행한다. 본 논문에서는 DCT-II, DST-VII, DCT-VIII 가 모두 선형 변환(linear transform)이라는 점에서 착안하여 변환의 선형성을 이용하여 계산량을 감소시키는 역변환을 제안한다. 실험결과 변환 수행 시 약 12.7%의 시간이 감소되는 것을 확인하였다.

• Journal of Software Assessment and Valuation
• /
• v.12 no.2
• /
• pp.1-8
• /
• 2016

In this paper, we study abstracting and identifying license file from a package to prevent unintentional intellectual property infringement because of lost/modified/confliction of license information when redistributing open source software. To invest character of the license files, we analyzed 322 licenses by n-gram and TF-IDF methods, and abstract license files from the packages. We identified license information with a similarity of the registered licenses by cosine measurement.

• Coupled systems mechanics
• /
• v.12 no.6
• /
• pp.539-555
• /
• 2023

Although some prediction models have successfully developed for ultra-high performance concrete (UHPC), they do not provide insights and explicit relations between all constituents and its consistency, and compressive strength. In the present study, based on the experimental results, several mathematical models have been evaluated to predict the consistency and the 28-day compressive strength of UHPC. The models used were Linear, Logarithmic, Inverse, Power, Compound, Quadratic, Cubic, Mixed, Sinusoidal and Cosine equations. The applicability and accuracy of these models were investigated using experimental data, which were collected from literature. The comparisons between the models and the experimental results confirm that the majority of models give acceptable prediction with a high accuracy and trivial error rates, except Linear, Mixed, Sinusoidal and Cosine equations. The assessment of the models using numerical methods revealed that the Quadratic and Inverse equations based models provide the highest predictability of the compressive strength at 28 days and consistency, respectively. Hence, they can be used as a reliable tool in mixture design of the UHPC.

• Journal of Information Processing Systems
• /
• v.20 no.2
• /
• pp.185-199
• /
• 2024

In this paper, an improved automated spectral clustering (IASC) algorithm is proposed to address the limitations of the traditional spectral clustering (TSC) algorithm, particularly its inability to automatically determine the number of clusters. Firstly, a cluster number evaluation factor based on the optimal clustering principle is proposed. By iterating through different k values, the value corresponding to the largest evaluation factor was selected as the first-rank number of clusters. Secondly, the IASC algorithm adopts a density-sensitive distance to measure the similarity between the sample points. This rendered a high similarity to the data distributed in the same high-density area. Thirdly, to improve clustering accuracy, the IASC algorithm uses the cosine angle classification method instead of K-means to classify the eigenvectors. Six algorithms-K-means, fuzzy C-means, TSC, EIGENGAP, DBSCAN, and density peak-were compared with the proposed algorithm on six datasets. The results show that the IASC algorithm not only automatically determines the number of clusters but also obtains better clustering accuracy on both synthetic and UCI datasets.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.25-34
• /
• 2004

The ability to perform the same operations in the transform domain as in the spatial domain is important for efficient image transmission through a channel. We perform image resizing, which includes magnifying and reducing the size, in the discrete cosine transform(DCT) domain and the effects of the transform domain approach are analyzed in the corresponding spatial domain. Based on this analysis, the two resizing algorithms are proposed. The first one further compresses the images encoded by the compression standard by reducing the size before compression, and the other reduces the loss of information while maintaining the conventional compression rate. Because of its compatibility with standard codec, these algorithms can be easily embedded in JPEG and MPEG codecs, which are widely used for the purpose of image storage and transmission. Experimental results show a reduction of about half the bit size with similar image quality and about a 2- or 3-dB quality improvements in the similar compression rate.