• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.05a
• /
• pp.322-322
• /
• 2004

최근 기계가공은 제품생산의 리드타임(lead time)의 단축 및 가공시간 단축을 통하여 비용을 절감하고 생산성을 극대화하는데 초점이 맞춰지고 있다. 고속가공(HSM： high-speed machining)은 별도의 연마 공정 없이 그 자체로 고품위, 고정도의 가공물을 생성하여 공정을 축소시키며, 가공시간을 단축시켜 생산성을 향상시킬 수 있다. 이러한 고속가공에 있어서 가공특성은 공작기계의 특성, 공구 및 가공조건뿐만 아니라 제품 형상 등의 다양한 요인에 의해 결정되어진다.(중략)

• Journal of Korea Spatial Information System Society
• /
• v.9 no.2
• /
• pp.1-11
• /
• 2007

Recently, with the development of collecting methods of spatial data, the spatial data is produced, circulated, and used in various fields of industry and research. To manage the mass spatial data efficiently, the researches on extension of the existing commercial DBMS, such as ESRI's ArcSDE or Oracle's Oracle Spatial, is making progress actively. However, the usage of the extension of the commercial DBMS Incurs an additional expense and causes an interoperability problem due to differences in spatial data types and spatial operators. Therefore, in this paper, we developed an OpenGIS Spatial Interface for Oracle, which supports a standard interface by fellowing the "Simple Features Specification for SQL" proposed by OGC(Open Geospatial Consortium). Since the OpenGIS Spatial Interface provides all spatial data types and spatial operators proposed in "Simple Features Specification for SQL", users can manage mass spatial data of Oracle efficiently by using the standard interface without additional expense. In addition, we proved that the OpenGIS Spatial Interface is superior to the Oracle Spatial in the response time through the performance evaluation.

• The Journal of the Korea Contents Association
• /
• v.11 no.2
• /
• pp.31-39
• /
• 2011

The facial recognition algorithms using Gabor wavelet based face graph produce very good performance while they have some weakness such as a large amount of computation and an irregular result depend on initial location. We proposed a fully automatic facial recognition algorithm using a Gabor feature based geometric deformable face graph matching. The initial location and size of a face graph can be selected using Adaboost detection results for speed-up. To find the best face graph with the face model graph by updating the size and location of the graph, the geometric transformable parameters are defined. The best parameters for an optimal face graph are derived using an optimization technique. The simulation results show that the proposed algorithm can produce very good performance with recognition rate 96.7% and recognition speed 0.26 sec for FERET database.

• Journal of Korea Multimedia Society
• /
• v.10 no.3
• /
• pp.391-400
• /
• 2007

According to the recent advances in multimedia computing, storage and searching technology have made large volume of music contents become prevalent. Also there has been increasing needs for the study on efficient categorization and searching technique for music contents management. In this paper, a new classifying method using the local information of music content and music tone feature is proposed. While the conventional classifying algorithms are based on entire information of music content, the algorithm proposed in this paper focuses on only the specific local information, which can drastically reduce the computing time without losing classifying accuracy. In order to improve the classifying accuracy, it uses a new classification feature based on music tone. The proposed method has been implemented as a part of MuSE (Music Search/Classification Engine) which was installed on various systems including commercial PDAs and PCs.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.3
• /
• pp.316-322
• /
• 2014

A movie recommendation system is proposed to learn a preference model of a viewer by using multimodal features of a video content and their evoked implicit responses of the viewer in synchronized manner. In this system, facial expression, body posture, and physiological signals are measured to estimate the affective states of the viewer, in accordance with the stimuli consisting of low-level and affective features from video, audio, and text streams. Experimental results show that it is possible to predict arousal response, which is measured by electrodermal activity, of a viewer from auditory and text features in a video stimuli, for estimating interestingness on the video.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11a
• /
• pp.245-248
• /
• 2003

볼륨데이터에서 관심대상의 특징을 추출하기 위해서 3D레이블링을 3차원 세포영상의 분석에 적합한 레이블링 방법인 SIL(slice Information base labeling)을 제안하였다. SIL은 각 슬라이스 정보를 이용하여 레이블링을 수행하므로 영상의 특징에 안는 레이블링으로의 확장이 유용하고 메모리 효율이 높다. 몇 개의 실험 영상으로 다른 방법과 비교한 결과 성능면에서도 우수 결과를 얻었다. 또한 레이블링을 통해서 얻어진 피쳐값으로 세포 영상을 분석하였으며, 콘포컬 현미경 영상을 이용하였을때 실험영상에서 결과를 추출하는데 걸린 시간은 SIL방법이 기존 방법보다 2배 가량 빨랐다. 다양한 3차원 에이블링 방법 중 적용되는 영상에 따라 각기 다른 결과를 얻었지만,3차원 세포영상의 분석에는 SIL 방법이 우수하다는 결론을 얻었다.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.83-88
• /
• 2002

Large sets of conceptual schema have been constructed for database design. In recent times, the need of analytic aid for schema reuse is increasing. In this paper, it is presented analysis technique of conceptual schema, and experimented schema analysis for extraction of reference schema. It is desirable for integration of related schema to have been applied in case of similarity value above 0.6. Reference schema which is created through the analysis technique enable to describe concepts of them and can be the way of schema reuse. And a feature analysis can be effective measure to set details of analytic data which is necessary for extraction of reference schema.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.1
• /
• pp.43-51
• /
• 1999

Producing the relevant information (features) from the CAD models of CAM, called feature recognition or extraction, is the essential stage for the integration of CAD and CAM. Most feature recognition methods, however, have problems in the recognition of intersecting features because they do not handle the intersection geometry properly. In this paper, we propose a machining feature recognition algorithm, which has a solid model consisting of orthogonal primitives as input. The algorithm calculates candidate features and constitutes the Intersection Geometry Matrix which is necessary to represent the spatial relation of candidate features. Finally, it recognizes machining features from the proposed candidate features dividing and growing systems using half space and Boolean operation. The algorithm has the following characteristics: Though the geometry of part is complex due to the intersections of design primitives, it can recognize the necessary machining features. In addition, it creates the Maximal Feature Volumes independent of the machining sequences at the feature recognition stage so that it can easily accommodate the change of decision criteria of machining orders.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.593-596
• /
• 1999

In this paper, we propose an image retrieval system using the MBCM(Modified Borda Count method) in CME(Combining Multiple Experts). It combines color-, shape- and texture-based retrieval sub-systems. CME method can complementarily combine results of each retrieval system, which uses different features. There are some problems when the Borda count method in pattern recognition is applied to image retrieval. Thus, we propose a modified Borda count method to solve these problems. In the experiment, our method reduces false positive errors and produces better results than that of each retrieval module that uses only one feature.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.4
• /
• pp.295-311
• /
• 1999

An increasing attention is paid to STEP-NC, the next generation CNC controller interfacing STEP-compatible data. In this paper, we first propose an Architecture for the STEP-NC (called FBCC: Feature Baled CNC Controller) accepting feature code compatible with STEP-data, and executing NC motion feature by feature while monitoring the execution status. The main thrust of the paper has been to develop an automatic on-line tool path generation and modification scheme for milling operation. The tool path it generated iota each feature by decomposing into a finite number of primitive features. The key function in the new scheme is haw to accommodate unexpected execution results. In our scheme, the too1 path plinker is designed to have a tracing capability iota the tool path execution so that a new path can be generated from the point where the operation is stopped. An illustrative example is included to show the capability of the developed algorithm.