• Title/Summary/Keyword: 유클리디안 거리 모델

Search Result 19, Processing Time 0.029 seconds

Efficient GPU Framework for Adaptive and Continuous Signed Distance Field Construction, and Its Applications

  • Kim, Jong-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.3
    • /
    • pp.63-69
    • /
    • 2022
  • In this paper, we propose a new GPU-based framework for quickly calculating adaptive and continuous SDF(Signed distance fields), and examine cases related to rendering/collision processing using them. The quadtree constructed from the triangle mesh is transferred to the GPU memory, and the Euclidean distance to the triangle is processed in parallel for each thread by using it to find the shortest continuous distance without discontinuity in the adaptive grid space. In this process, it is shown through experiments that the cut-off view of the adaptive distance field, the distance value inquiry at a specific location, real-time raytracing, and collision handling can be performed quickly and efficiently. Using the proposed method, the adaptive sign distance field can be calculated quickly in about 1 second even on a high polygon mesh, so it is a method that can be fully utilized not only for rigid bodies but also for deformable bodies. It shows the stability of the algorithm through various experimental results whether it can accurately sample and represent distance values in various models.

A Fuzzy Neural Network Model Solving the Underutilization Problem (Underutilization 문제를 해결한 퍼지 신경회로망 모델)

  • 김용수;함창현;백용선
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.4
    • /
    • pp.354-358
    • /
    • 2001
  • This paper presents a fuzzy neural network model which solves the underutilization problem. This fuzzy neural network has both stability and flexibility because it uses the control structure similar to AHT(Adaptive Resonance Theory)-l neural network. And this fuzzy nenral network does not need to initialize weights and is less sensitive to noise than ART-l neural network is. The learning rule of this fuzzy neural network is the modified and fuzzified version of Kohonen learning rule and is based on the fuzzification of leaky competitive leaming and the fuzzification of conditional probability. The similarity measure of vigilance test, which is performed after selecting a winner among output neurons, is the relative distance. This relative distance considers Euclidean distance and the relative location between a datum and the prototypes of clusters. To compare the performance of the proposed fuzzy neural network with that of Kohonen Self-Organizing Feature Map the IRIS data and Gaussian-distributed data are used.

  • PDF

Face region detection algorithm of natural-image (자연 영상에서 얼굴영역 검출 알고리즘)

  • Lee, Joo-shin
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.7 no.1
    • /
    • pp.55-60
    • /
    • 2014
  • In this paper, we proposed a method for face region extraction by skin-color hue, saturation and facial feature extraction in natural images. The proposed algorithm is composed of lighting correction and face detection process. In the lighting correction step, performing correction function for a lighting change. The face detection process extracts the area of skin color by calculating Euclidian distances to the input images using as characteristic vectors color and chroma in 20 skin color sample images. Eye detection using C element in the CMY color model and mouth detection using Q element in the YIQ color model for extracted candidate areas. Face area detected based on human face knowledge for extracted candidate areas. When an experiment was conducted with 10 natural images of face as input images, the method showed a face detection rate of 100%.

Algorithm of Face Region Detection in the TV Color Background Image (TV컬러 배경영상에서 얼굴영역 검출 알고리즘)

  • Lee, Joo-Shin
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.4
    • /
    • pp.672-679
    • /
    • 2011
  • In this paper, detection algorithm of face region based on skin color of in the TV images is proposed. In the first, reference image is set to the sampled skin color, and then the extracted of face region is candidated using the Euclidean distance between the pixels of TV image. The eye image is detected by using the mean value and standard deviation of the component forming color difference between Y and C through the conversion of RGB color into CMY color model. Detecting the lips image is calculated by utilizing Q component through the conversion of RGB color model into YIQ color space. The detection of the face region is extracted using basis of knowledge by doing logical calculation of the eye image and lips image. To testify the proposed method, some experiments are performed using front color image down loaded from TV color image. Experimental results showed that face region can be detected in both case of the irrespective location & size of the human face.

K-Anonymity using Hierarchical Structure in Indoor Space (실내공간에서 계층 구조를 이용한 K-익명화)

  • Kim, Joon-Seok;Li, Ki-Joune
    • Spatial Information Research
    • /
    • v.20 no.4
    • /
    • pp.93-101
    • /
    • 2012
  • Due to complexity of indoor space, the demand of Location Based Services (LBS) in indoor space is increasing as well as outdoor. However, it includes privacy problems of exposing personal location. Location K-anonymity technology is a method to solve the privacy problems with cloaking their locations by Anonymized Spatial Region(ASR). It guarantees K users within a region containing the location of a given user. However previous researches have dealt the problems based on Euclidean distance in outdoor space, and cannot be applied in indoor space where there are constraints of movement such as walls. For this reason, we propose in this paper a K-anonymity for cloaking indoor location in consideration of structures and representation of indoor space. The basic concept of our approach is to introduce a hierarchical structure as ASR for including K-1 users for cloaking their locations. We also proposed a cost model by K and attributes of hierarchical structure to analyze the performance of the method.

Managing the Reverse Extrapolation Model of Radar Threats Based Upon an Incremental Machine Learning Technique (점진적 기계학습 기반의 레이더 위협체 역추정 모델 생성 및 갱신)

  • Kim, Chulpyo;Noh, Sanguk
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.13 no.4
    • /
    • pp.29-39
    • /
    • 2017
  • Various electronic warfare situations drive the need to develop an integrated electronic warfare simulator that can perform electronic warfare modeling and simulation on radar threats. In this paper, we analyze the components of a simulation system to reversely model the radar threats that emit electromagnetic signals based on the parameters of the electronic information, and propose a method to gradually maintain the reverse extrapolation model of RF threats. In the experiment, we will evaluate the effectiveness of the incremental model update and also assess the integration method of reverse extrapolation models. The individual model of RF threats are constructed by using decision tree, naive Bayesian classifier, artificial neural network, and clustering algorithms through Euclidean distance and cosine similarity measurement, respectively. Experimental results show that the accuracy of reverse extrapolation models improves, while the size of the threat sample increases. In addition, we use voting, weighted voting, and the Dempster-Shafer algorithm to integrate the results of the five different models of RF threats. As a result, the final decision of reverse extrapolation through the Dempster-Shafer algorithm shows the best performance in its accuracy.

3D Model Retrieval Using Sliced Shape Image (단면 형상 영상을 이용한 3차원 모델 검색)

  • Park, Yu-Sin;Seo, Yung-Ho;Yun, Yong-In;Kwon, Jun-Sik;Choi, Jong-Soo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.6
    • /
    • pp.27-37
    • /
    • 2008
  • Applications of 3D data increase with advancement of multimedia technique and contents, and it is necessary to manage and to retrieve for 3D data efficiently. In this paper, we propose a new method using the sliced shape which extracts efficiently a feature description for shape-based retrieval of 3D models. Since the feature descriptor of 3D model should be invariant to translation, rotation and scale for its model, normalization of models requires for 3D model retrieval system. This paper uses principal component analysis(PCA) method in order to normalize all the models. The proposed algorithm finds a direction of each axis by the PCA and creates orthogonal n planes in each axis. These planes are orthogonalized with each axis, and are used to extract sliced shape image. Sliced shape image is the 2D plane created by intersecting at between 3D model and these planes. The proposed feature descriptor is a distribution of Euclidean distances from center point of sliced shape image to its outline. A performed evaluation is used for average of the normalize modified retrieval rank(ANMRR) with a standard evaluation from MPEG-7. In our experimental results, we demonstrate that the proposed method is an efficient 3D model retrieval.

Neutral point model of HVS for the Illuminant-adaptive White Balance Control of Displays (조명 적응 디스플레이 화이트 밸런스 조정을 위한 시각의 순응 화이트 모델)

  • Chae, Seok-Min;Lee, Sung-Hak;Lee, Myoung-Hwa;Sohng, Kyu-Ik
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.5
    • /
    • pp.674-683
    • /
    • 2010
  • For the purpose of color reproduction under standard viewing conditions, recently, color display devices have developed for the colorimetric color reproduction. However the real viewing condition of color display devices is quite different from that. Therefore, it is very important for reproduced colors viewed under real conditions to match the color appearance under standard situations. There are various models that can be used to reproduce corresponding colors considering the chromatic adaptation of the human visual system. However neutral point or chromatic adaptation for the luminance level is not enough. In this paper, we propose a model that find adapting white points for the variations of the luminance levels under the same illuminant. This model is modeled by the proportion of Euclidian distance for luminance level. It is the adapting white function of the sigmoid type for surround luminance level. In the model, the optimal coefficients are obtained from the Hunt's experimental result. It is applied in the chromatic adaptation model using the neutral point of the various viewing conditions. And the neutral point can be used as the theoretical standard which determines the reference white of the color display devices.

Color-related Query Processing for Intelligent E-Commerce Search (지능형 검색엔진을 위한 색상 질의 처리 방안)

  • Hong, Jung A;Koo, Kyo Jung;Cha, Ji Won;Seo, Ah Jeong;Yeo, Un Yeong;Kim, Jong Woo
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.1
    • /
    • pp.109-125
    • /
    • 2019
  • As interest on intelligent search engines increases, various studies have been conducted to extract and utilize the features related to products intelligencely. In particular, when users search for goods in e-commerce search engines, the 'color' of a product is an important feature that describes the product. Therefore, it is necessary to deal with the synonyms of color terms in order to produce accurate results to user's color-related queries. Previous studies have suggested dictionary-based approach to process synonyms for color features. However, the dictionary-based approach has a limitation that it cannot handle unregistered color-related terms in user queries. In order to overcome the limitation of the conventional methods, this research proposes a model which extracts RGB values from an internet search engine in real time, and outputs similar color names based on designated color information. At first, a color term dictionary was constructed which includes color names and R, G, B values of each color from Korean color standard digital palette program and the Wikipedia color list for the basic color search. The dictionary has been made more robust by adding 138 color names converted from English color names to foreign words in Korean, and with corresponding RGB values. Therefore, the fininal color dictionary includes a total of 671 color names and corresponding RGB values. The method proposed in this research starts by searching for a specific color which a user searched for. Then, the presence of the searched color in the built-in color dictionary is checked. If there exists the color in the dictionary, the RGB values of the color in the dictioanry are used as reference values of the retrieved color. If the searched color does not exist in the dictionary, the top-5 Google image search results of the searched color are crawled and average RGB values are extracted in certain middle area of each image. To extract the RGB values in images, a variety of different ways was attempted since there are limits to simply obtain the average of the RGB values of the center area of images. As a result, clustering RGB values in image's certain area and making average value of the cluster with the highest density as the reference values showed the best performance. Based on the reference RGB values of the searched color, the RGB values of all the colors in the color dictionary constructed aforetime are compared. Then a color list is created with colors within the range of ${\pm}50$ for each R value, G value, and B value. Finally, using the Euclidean distance between the above results and the reference RGB values of the searched color, the color with the highest similarity from up to five colors becomes the final outcome. In order to evaluate the usefulness of the proposed method, we performed an experiment. In the experiment, 300 color names and corresponding color RGB values by the questionnaires were obtained. They are used to compare the RGB values obtained from four different methods including the proposed method. The average euclidean distance of CIE-Lab using our method was about 13.85, which showed a relatively low distance compared to 3088 for the case using synonym dictionary only and 30.38 for the case using the dictionary with Korean synonym website WordNet. The case which didn't use clustering method of the proposed method showed 13.88 of average euclidean distance, which implies the DBSCAN clustering of the proposed method can reduce the Euclidean distance. This research suggests a new color synonym processing method based on RGB values that combines the dictionary method with the real time synonym processing method for new color names. This method enables to get rid of the limit of the dictionary-based approach which is a conventional synonym processing method. This research can contribute to improve the intelligence of e-commerce search systems especially on the color searching feature.