• Title/Summary/Keyword: Information input algorithm

Search Result 2,444, Processing Time 0.033 seconds

A Variable Latency Newton-Raphson's Floating Point Number Reciprocal Square Root Computation (가변 시간 뉴톤-랍손 부동소수점 역수 제곱근 계산기)

  • Kim Sung-Gi;Cho Gyeong-Yeon
    • The KIPS Transactions:PartA
    • /
    • v.12A no.5 s.95
    • /
    • pp.413-420
    • /
    • 2005
  • The Newton-Raphson iterative algorithm for finding a floating point reciprocal square mot calculates it by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal square root algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the rediprocal square root of a floating point number F, the algorithm repeats the following operations: '$X_{i+1}=\frac{{X_i}(3-e_r-{FX_i}^2)}{2}$, $i\in{0,1,2,{\ldots}n-1}$' with the initial value is '$X_0=\frac{1}{\sqrt{F}}{\pm}e_0$'. The bits to the right of p fractional bits in intermediate multiplication results are truncated and this truncation error is less than '$e_r=2^{-p}$'. The value of p is 28 for the single precision floating point, and 58 for the double precision floating point. Let '$X_i=\frac{1}{\sqrt{F}}{\pm}e_i$, there is '$X_{i+1}=\frac{1}{\sqrt{F}}-e_{i+1}$, where '$e_{i+1}{<}\frac{3{\sqrt{F}}{{e_i}^2}}{2}{\mp}\frac{{Fe_i}^3}{2}+2e_r$'. If '$|\frac{\sqrt{3-e_r-{FX_i}^2}}{2}-1|<2^{\frac{\sqrt{-p}{2}}}$' is true, '$e_{i+1}<8e_r$' is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to '$\frac{1}{\sqrt{F}}$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications Per an operation is derived from many reciprocal square root tables ($X_0=\frac{1}{\sqrt{F}}{\pm}e_0$) with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

A Variable Latency Newton-Raphson's Floating Point Number Reciprocal Computation (가변 시간 뉴톤-랍손 부동소수점 역수 계산기)

  • Kim Sung-Gi;Cho Gyeong-Yeon
    • The KIPS Transactions:PartA
    • /
    • v.12A no.2 s.92
    • /
    • pp.95-102
    • /
    • 2005
  • The Newton-Raphson iterative algorithm for finding a floating point reciprocal which is widely used for a floating point division, calculates the reciprocal by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the reciprocal of a floating point number F, the algorithm repeats the following operations: '$'X_{i+1}=X=X_i*(2-e_r-F*X_i),\;i\in\{0,\;1,\;2,...n-1\}'$ with the initial value $'X_0=\frac{1}{F}{\pm}e_0'$. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than $'e_r=2^{-p}'$. The value of p is 27 for the single precision floating point, and 57 for the double precision floating point. Let $'X_i=\frac{1}{F}+e_i{'}$, these is $'X_{i+1}=\frac{1}{F}-e_{i+1},\;where\;{'}e_{i+1}, is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to $'\frac{1}{F}{'}$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal tables $(X_0=\frac{1}{F}{\pm}e_0)$ with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal unit. Also, it can be used to construct optimized approximate reciprocal tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia scientific computing, etc.

An Implementation of Dynamic Gesture Recognizer Based on WPS and Data Glove (WPS와 장갑 장치 기반의 동적 제스처 인식기의 구현)

  • Kim, Jung-Hyun;Roh, Yong-Wan;Hong, Kwang-Seok
    • The KIPS Transactions:PartB
    • /
    • v.13B no.5 s.108
    • /
    • pp.561-568
    • /
    • 2006
  • WPS(Wearable Personal Station) for next generation PC can define as a core terminal of 'Ubiquitous Computing' that include information processing and network function and overcome spatial limitation in acquisition of new information. As a way to acquire significant dynamic gesture data of user from haptic devices, traditional gesture recognizer based on desktop-PC using wire communication module has several restrictions such as conditionality on space, complexity between transmission mediums(cable elements), limitation of motion and incommodiousness on use. Accordingly, in this paper, in order to overcome these problems, we implement hand gesture recognition system using fuzzy algorithm and neural network for Post PC(the embedded-ubiquitous environment using blue-tooth module and WPS). Also, we propose most efficient and reasonable hand gesture recognition interface for Post PC through evaluation and analysis of performance about each gesture recognition system. The proposed gesture recognition system consists of three modules: 1) gesture input module that processes motion of dynamic hand to input data 2) Relational Database Management System(hereafter, RDBMS) module to segment significant gestures from input data and 3) 2 each different recognition modulo: fuzzy max-min and neural network recognition module to recognize significant gesture of continuous / dynamic gestures. Experimental result shows the average recognition rate of 98.8% in fuzzy min-nin module and 96.7% in neural network recognition module about significantly dynamic gestures.

Image Contrast Enhancement Technique for Local Dimming Backlight of Small-sized Mobile Display (소형 모바일 디스플레이의 Local Dimming 백라이트를 위한 영상 컨트라스트 향상 기법)

  • Chung, Jin-Young;Yun, Ki-Bang;Kim, Ki-Doo
    • 전자공학회논문지 IE
    • /
    • v.46 no.4
    • /
    • pp.57-65
    • /
    • 2009
  • This paper presents the image contrast enhancement technique suitable for local dimming backlight of small-sized mobile display while achieving the reduction of the power consumption. In addition to the large-sized TFT-LCD, small-sized one has adopted LED for backlight. Since, conventionally, LED was mounted on the side edge of a display panel, global dimming method has been widely used. However, recently, new advanced method of local dimming by placing the LED to the backside of the display panel and it raised the necessity of sub-blocked processing after partitioning the target image. When the sub-blocked image has low brightness, the supply current of a backlight LED is reduced, which gives both enhancement of contrast ratio and power consumption reduction. In this paper, we propose simple and improved image enhancement algorithm suitable for the small-sized mobile display. After partitioning the input image by equal sized blocks and analyzing the pixel information in each block, we realize the primary contrast enhancement by independently processing the sub-blocks using the information such as histogram, mean, and standard deviation values of luminance(Y) component. And then resulting information is transferred to each backlight control unit for local dimming to realize the secondary contrast enhancement as well as reduction of power consumption.

Colorization Algorithm Using Wavelet Packet Transform (웨이블릿 패킷 변환을 이용한 흑백 영상의 칼라화 알고리즘)

  • Ko, Kyung-Woo;Kwon, Oh-Seol;Son, Chang-Hwan;Ha, Yeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.1
    • /
    • pp.1-10
    • /
    • 2008
  • Coloriztion algorithms, which hide color information into gray images and find them to recover color images, have been developed recently. In these methods, it is important to minimize the loss of original information while the color components are embedded and extracted. In this paper, we propose a colorization method using a wavelet packet transform in order to embed color components with minimum loss of original information. In addition, the compensation processing of color saturation in the recovered color images is achieved. In the color-to-gray process, an input RGB image is converted into Y, Cb, and Cr images, and a wavelet packet transform is applied to the Y image. After analyzing the amounts of total energy for each sub-band, color components are embedded into two sub-bands including minimum amount of energy on the Y image. This makes it possible not only to hide color components in the Y image, but to recover the Y image with minimum loss of original information. In the gray-to-color process, the color saturation of the recovered color images is decreased by printing and scanning process. To increase color saturation, the characteristic curve between printer and scanner, which can estimate the change of pixel values before and after printing and scanning process, is used to compensate the pixel values of printed and scanned gray images. In addition, the scaling method of the Cb and Cr components is applied to the gray-to-color process. Through the experiments, it is shown that the proposed method improves both boundary details and color saturation in the recovered color images.

Real-time Hand Region Detection based on Cascade using Depth Information (깊이정보를 이용한 케스케이드 방식의 실시간 손 영역 검출)

  • Joo, Sung Il;Weon, Sun Hee;Choi, Hyung Il
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.10
    • /
    • pp.713-722
    • /
    • 2013
  • This paper proposes a method of using depth information to detect the hand region in real-time based on the cascade method. In order to ensure stable and speedy detection of the hand region even under conditions of lighting changes in the test environment, this study uses only features based on depth information, and proposes a method of detecting the hand region by means of a classifier that uses boosting and cascading methods. First, in order to extract features using only depth information, we calculate the difference between the depth value at the center of the input image and the average of depth value within the segmented block, and to ensure that hand regions of all sizes will be detected, we use the central depth value and the second order linear model to predict the size of the hand region. The cascade method is applied to implement training and recognition by extracting features from the hand region. The classifier proposed in this paper maintains accuracy and enhances speed by composing each stage into a single weak classifier and obtaining the threshold value that satisfies the detection rate while exhibiting the lowest error rate to perform over-fitting training. The trained classifier is used to classify the hand region, and detects the final hand region in the final merger stage. Lastly, to verify performance, we perform quantitative and qualitative comparative analyses with various conventional AdaBoost algorithms to confirm the efficiency of the hand region detection algorithm proposed in this paper.

Improvement of a Product Recommendation Model using Customers' Search Patterns and Product Details

  • Lee, Yunju;Lee, Jaejun;Ahn, Hyunchul
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.1
    • /
    • pp.265-274
    • /
    • 2021
  • In this paper, we propose a novel recommendation model based on Doc2vec using search keywords and product details. Until now, a lot of prior studies on recommender systems have proposed collaborative filtering (CF) as the main algorithm for recommendation, which uses only structured input data such as customers' purchase history or ratings. However, the use of unstructured data like online customer review in CF may lead to better recommendation. Under this background, we propose to use search keyword data and product detail information, which are seldom used in previous studies, for product recommendation. The proposed model makes recommendation by using CF which simultaneously considers ratings, search keywords and detailed information of the products purchased by customers. To extract quantitative patterns from these unstructured data, Doc2vec is applied. As a result of the experiment, the proposed model was found to outperform the conventional recommendation model. In addition, it was confirmed that search keywords and product details had a significant effect on recommendation. This study has academic significance in that it tries to apply the customers' online behavior information to the recommendation system and that it mitigates the cold start problem, which is one of the critical limitations of CF.

A Study on AI Algorithm that can be used to Arts Exhibition : Focusing on the Development and Evaluation of the Chatbot Model (예술 전시에 활용 가능한 AI 알고리즘 연구 : 챗봇 모델 개발 및 평가를 중심으로)

  • Choi, Hak-Hyeon;Yoon, Mi-Ra
    • Journal of Korea Entertainment Industry Association
    • /
    • v.15 no.4
    • /
    • pp.369-381
    • /
    • 2021
  • Artificial Intelligence(AI) technology can be used in arts exhibitions ranging from planning exhibitions, filed progress, and evaluation. AI has been expanded its scope from planning exhibition and guidance services to tools for creating arts. This paper focuses on chatbots that utilize exhibition and AI technology convergence to provide information and services. To study more specifically, I developed a chatbot for exhibition services using the Naver Clova chatbot tool and information from the National Museum of Modern and Contemporary Art(MMCA), Korea. In this study, information was limited to viewing and exhibition rather than all information of the MMCA, and the chatbot was developed which provides a scenario type to get an answering user want to gain through a button and a text question and answer(Q&A) type to directly input a question. As a result of evaluating the chatbot with six items according to ELIZA's chatbot evaluation scale, a score of 4.2 out of 5 was derived by completing the development of a chatbot to be used to deliver viewing and exhibition information. The future research task is to create a perfect chatbot model that can be used in an actual arts exhibition space by connecting the developed chatbot with continuous scenario answers, resolving text Q&A-type answer failures and errors, and expanding additional services.

Joint Precoding Technique for Interference Cancellation in Multiuser MIMO Relay Networks for LTE-Advanced System (LTE-Advanced 시스템의 다중 사용자 MIMO Relay 네트워크에서 간섭 제거를 위한 Joint Precoding 기술)

  • Malik, Saransh;Moon, Sang-Mi;Kim, Bo-Ra;Kim, Cheol-Sung;Hwang, In-Tae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.6
    • /
    • pp.15-26
    • /
    • 2012
  • In this paper, we perform interference cancellation in multiuser MIMO (Multiple Input Multiple Output) relay network with improved Amplify-and-Forward (AF) and Decode-and-Forward (DF) relay protocols. The work of interference cancellation is followed by evolved NodeB (eNB), Relay Node (RN) and User Equipment (UE) to improve the error performance of whole transmission system with the explicit use of relay node. In order to perform interference cancellation, we use Dirty Paper Coding (DPC) and Thomilson Harashima Precoding (THP) allied with detection techniques Zero Forcing (ZF), Minimum Mean Square Error (MMSE), Successive Interference Cancellation (SIC) and Ordered Successive Interference Cancellation (OSIC). These basic techniques are studied and improved in the proposal by using the functions of relay node. The performance is improved by Decode-and-Forward which enhance the cancellation of interference in two layers at the cooperative relay node. The interference cancellation using weighted vectors is performed between eNB and RN. In the final results of the research, we conclude that in contrast with the conventional algorithms, the proposed algorithm shows better performance in lower SNR regime. The simulation results show the considerable improvement in the bit error performance by the proposed scheme in the LTE-Advanced system.

Sensitivity Analysis of Satellite BUV Ozone Profile Retrievals on Meteorological Parameter Errors (기상 입력장 오차에 대한 자외선 오존 프로파일 산출 알고리즘 민감도 분석)

  • Shin, Daegeun;Bak, Juseon;Kim, Jae Hwan
    • Korean Journal of Remote Sensing
    • /
    • v.34 no.3
    • /
    • pp.481-494
    • /
    • 2018
  • The accurate radiative transfer model simulation is essential for an accurate ozone profile retrieval using optimal estimation from backscattered ultraviolet (BUV) measurement. The input parameters of the radiative transfer model are the main factors that determine the model accuracy. In particular, meteorological parameters such as temperature and surface pressure have a direct effect on simulating radiation spectrum as a component for calculating ozone absorption cross section and Rayleigh scattering. Hence, a sensitivity of UV ozone profile retrievals to these parameters has been investigated using radiative transfer model. The surface pressure shows an average error within 100 hPa in the daily / monthly climatological data based on the numerical weather prediction model, and the calculated ozone retrieval error is less than 0.2 DU for each layer. On the other hand, the temperature shows an error of 1-7K depending on the observation station and altitude for the same daily / monthly climatological data, and the calculated ozone retrieval error is about 4 DU for each layer. These results can help to understand the obtained vertical ozone information from satellite. In addition, they are expected to be used effectively in selecting the meteorological input data and establishing the system design direction in the process of applying the algorithm to satellite operation.