• 말소리와 음성과학
• /
• 제5권4호
• /
• pp.157-169
• /
• 2013

Using a target detection task, this study compared the processing automaticity of phonemes and features in spoken syllable stimuli to determine the primitive representation in speech perception, phoneme or distinctive feature. For this, we modified the visual search task(Treisman et al., 1992) developed to investigate the processing of visual features(ex. color, shape or their conjunction) for auditory stimuli. In our task, the distinctive features(ex. aspiration or coronal) corresponded to visual primitive features(ex. color and shape), and the phonemes(ex. /$t^h$/) to visual conjunctive features(ex. colored shapes). The automaticity is measured by the set size effect that was the increasing amount of reaction time when the number of distracters increased. Three experiments were conducted. The laryngeal features(experiment 1), the manner features(experiment 2), and the place features(experiment 3) were compared with phonemes. The results showed that the distinctive features are consistently processed faster and automatically than the phonemes. Additionally there were differences in the processing automaticity among the classes of distinctive features. The laryngeal features are the most automatic, the manner features are moderately automatic and the place features are the least automatic. These results are consistent with the previous studies(Bae et al., 2002; Bae, 2010) that showed the perceptual hierarchy of distinctive features.

• 한국학교수학회논문집
• /
• 제16권1호
• /
• pp.201-217
• /
• 2013

본 연구는 '정폭도형'을 소재로 초등 수학영재 프로그램을 개발 적용 하는데 그 목적을 두었다. 이를 위해 정폭도형에 관한 이론을 정리하였다. 다음으로 초등학교 수학 영재 교육 프로그램을 구안하고 예비실험 결과를 토대로 프로그램을 수정 보완하여 최종적으로 프로그램을 구체화하였다. 이 프로그램은 작도와 GSP 프로그램을 접목한 수업 형태로도 개발 가능할 것으로 보이며, 특히 과학 기술 예술적인 면을 연결한 융합교육 프로그램으로 적용 발전시킬 수 있을 것으로 기대된다.

• 한국CDE학회논문집
• /
• 제11권4호
• /
• pp.315-325
• /
• 2006

It is very often necessary to search for similar parts during designing a new product because its parts are often easily designed by modifying existing similar parts. In this way, the design time and cost can be reduced. Thus it would be nice to have an efficient similarity comparison algorithm that can be used anytime in the design process. There have been many approaches to compare shape similarity between two solids. In this paper, two parts represented in B-Rep is compared in two steps: one for overall appearances and the other for detail features. In the first step, geometric information is used in low level of detail for easy and fast pre-classification by the overall appearance. In the second step, feature information is used to compare the detail shape in high level of detail to find more similar design. To realize the idea above, a multi resolution algorithm is proposed so that a given solid is described by an overall appearance in a low resolution and by detail features in high resolution. Using this multi-resolution representation, parts can be compared based on the overall appearance first so that the number of parts to be compared in high resolution is reduced, and then detail features are investigated to retrieve the most similar part. In this way, computational time can be reduced by the fast classification in the first step while reliability can be preserved by detail comparison in the second step.

• 대한산업공학회지
• /
• 제26권4호
• /
• pp.363-375
• /
• 2000

In this paper we propose a content-based image retrieval method that can search large image databases efficiently by color, texture, and shape content. Quantized RGB histograms and the dominant triple (hue, saturation, and value), which are extracted from quantized HSV joint histogram in the local image region, are used for representing global/local color information in the image. Entropy and maximum entry from co-occurrence matrices are used for texture information and edge angle histogram is used for representing shape information. Relevance feedback approach, which has coupled proposed features, is used for obtaining better retrieval accuracy. Simulation results illustrate the above method provides 77.5 percent precision rate without relevance feedback and increased precision rate using relevance feedback for overall queries. We also present a new indexing method that supports fast retrieval in large image databases. Tree structures constructed by k-means algorithm, along with the idea of triangle inequality, eliminate candidate images for similarity calculation between query image and each database image. We find that the proposed method reduces calculation up to average 92.9 percent of the images from direct comparison.

• 대한한의학원전학회지
• /
• 제32권1호
• /
• pp.105-116
• /
• 2019

Objectives : There are many secluded Chinese characters - so called Byeokja (僻字) in ancient classic literature, and Chinese characters that are not registered in Unicode and Variant characters (heterogeneous characters) that cannot be found in the current font sets often appear. In order to register all possible Chinese characters including such characters as units of information exchange, this study attempts to propose a method to encode the morphological information of Chinese characters according to certain rules. Methods : This study suggests the methods to encode the connection between the nodules constituting the Chinese character and the coordinates of the nodules. In addition to that, rules for expressing information about curves, expressions of aspect ratios of characters, rules for minimizing coordinate lines, and rules for expressing aggregation status of character components are added. Results : Through the proposed method, it is possible to generate codes of a certain length by extracting only information expressing the morphological configuration of characters. Conclusions : The method of character encoding proposed in this study can be used to distinguish variant characters with small variations in Byeokja, new Chinese characters and character strokes and to store and search them.

• 한국컴퓨터정보학회논문지
• /
• 제14권10호
• /
• pp.251-258
• /
• 2009

그래프마이닝에서 그래프패턴의 동형판단문제는 지수함수적 계산시간을 요구하기 때문에 그래프마이닝의 전체수행시간에서 동형판단 연산이 차지하는 비율이 매우 높다. 그러므로 그래프마이닝 알고리즘은 그래프동형판단을 최대한 효율적으로 할 필요가 있다. 본 논문은 그래프마이닝에서 빠른 수행시간을 보이는 gaston 알고리즘의 동형판단효율성을 증가시켜 수행시간을 평가해 보았으며, 제시한 방법으로 인해 더욱 향상된 성능을 보인다.

• Steel and Composite Structures
• /
• 제44권5호
• /
• pp.603-617
• /
• 2022

Structural design, in general, is developed through trial and error technique which is guided by standards criteria and based on the intuition and experience of the engineer, a context that leads to structural over-dimensioning, with uneconomic solutions. Aiming to find the optimal design, structural optimization methods have been developed to find a balance between cost, structural safety, and material performance. These methods have become a great opportunity in the steel structural engineering domain since they have as their main purpose is weight minimization, a factor directly correlated to the real cost of the structure. Assuming an objective function of minimum weight with stress and displacement constraints provided by Brazilian standards, the present research proposes the sizing optimization and combined approach of sizing and shape optimization, through a software developed to implement the Simulated Annealing metaheuristic algorithm. Therefore, two steel plane frame layouts, each admitting four typical truss geometries, were proposed in order to expose the difference between the optimal solutions. The assessment of the optimal solutions indicates a notable weight reduction, especially in sizing and shape optimization combination, in which the quantity of design variables is increased along with the search space, improving the efficiency of the optimal solutions achieved.

• 산업경영시스템학회지
• /
• 제46권4호
• /
• pp.101-106
• /
• 2023

With the recent surge in YouTube usage, there has been a proliferation of user-generated videos where individuals evaluate cosmetics. Consequently, many companies are increasingly utilizing evaluation videos for their product marketing and market research. However, a notable drawback is the manual classification of these product review videos incurring significant costs and time. Therefore, this paper proposes a deep learning-based cosmetics search algorithm to automate this task. The algorithm consists of two networks: One for detecting candidates in images using shape features such as circles, rectangles, etc and Another for filtering and categorizing these candidates. The reason for choosing a Two-Stage architecture over One-Stage is that, in videos containing background scenes, it is more robust to first detect cosmetic candidates before classifying them as specific objects. Although Two-Stage structures are generally known to outperform One-Stage structures in terms of model architecture, this study opts for Two-Stage to address issues related to the acquisition of training and validation data that arise when using One-Stage. Acquiring data for the algorithm that detects cosmetic candidates based on shape and the algorithm that classifies candidates into specific objects is cost-effective, ensuring the overall robustness of the algorithm.

• 해양환경안전학회지
• /
• 제28권7호
• /
• pp.1231-1237
• /
• 2022

본 논문에서는 AI 기반 설계 탐색 기법을 활용하여 선박의 주요 치수 최적화를 수행하였다. 설계 탐색 기법은 최적화 프로그램 HEEDS의 SHERPA 알고리즘을 사용하였다. 유동 해석은 상용 CFD 코드인 STAR-CCM+를 사용하였고, 주요 치수 변환은 전처리 과정에서 JAVA Script와 Python을 사용하여 선박의 치수가 자동으로 변환되도록 설정하였다. 대상 선박은 소형 쌍동선형으로 주요 치수 최적화는 한쪽 선형의 길이, 폭, 흘수 그리고 단동선형 간의 간격에 대하여 수행되었다. 최적화 알고리즘에 사용된 목적함수는 총저항이며, 내부 의장 시스템의 크기 등을 고려한 배수 체적의 범위를 제한조건으로 선정하였다. 그 결과 최적 선형의 주요 치수는 기존 선형 대비 ±5% 내에서 변화가 있었고 총저항은 약 11% 개선된 결과를 보였다. 본 연구를 통해 선박의 형상을 직접 변경하지 않더라도 주요 치수 최적화를 통해 선박의 저항 성능이 향상됨을 확인하였고, 다양한 선박의 주요 치수 최적화를 통한 성능 향상에 활용이 될 것으로 기대한다.

• 한국정보과학회논문지:데이타베이스
• /
• 제36권4호
• /
• pp.263-279
• /
• 2009

CBIR(Content-based Image Retrieval) 시스템의 질의 처리에 사용되는 모양 특징은 크게 경계 기반과 영역 기반 등 두 가지로 나눌 수 있다. 경계기반 특징은 간단하지만 영역 기반 특징에 비해 효과적이지 않다. 영역 기반 모양 특징을 사용하는 대부분의 시스템은 먼저 영역을 추출해야 한다. 하지만 기존의 영역 기반 시스템들은 구현이 복잡하고, 특히 정확한 영역 추출이 어려우며 영역 간의 위치적인 관계가 거리 모델(distance model)에 반영되어 있지 않다. 본 논문에서는 Canny 에지 검출과 Hough 변환에 기반하여 목표 내부의 에지를 검출하고, 이와 함께 영역확장을 이용하여 목표 물체 내부의 영역을 정확히 추출할 수 있는 방법을 제안하였다. 또한 영역 간의 인접 관계를 이용한 수정된 IRM(Integrated Region Matching) 기법을 제안하였다. 이는 모양 특징을 이용한 유사성 검색에서 영상 간의 거리 모델로서 사용된다. 그리고 실험을 통해 수정된 IRM 기법과 우리의 영역 추출 기법이 효과적임을 보였다. 실험 결과는 새로운 영역 추출 방법이 기존의 다른 방법보다 훨씬 우수함을 보여준다.