• 한국의상디자인학회지
• /
• 제16권4호
• /
• pp.205-215
• /
• 2014

This study analyzed 'The representation of death' as expressed in the fashion photography posted on Facebook. Currently, there is a growing interest in 'Well-dying'. Also contemporary art and fashion is a trend that expressed what about death more than life. And today, Facebook is one of the current worldwide as a powerful communication. Death representation in contemporary fashion photography, as expressed in its first characteristic is 'Vanitas', and the main material was a skull. The shape of a skeleton of the symbol of death. Vanitas of inner meaning is vain, a mortal life's futility and death for the paradoxical emotion. The second characteristic is 'Phantom of the ruins'. This is like the darkness of death, and the shape represented in that space. And the death representation is depressed, gloomy atmosphere, dead-man and warm-less. Inner meaning is curiosity about the ghosts and the decadence romantic about the afterlife. The last characteristic is 'Grotesque'. This characteristic is the destruction of the body, fear of sadistic, and inhuman shape. This is parable with death that pain and fear of death, dark fantasy, the appearance of a contradiction modern society and cut off humanity. Inner meaning is the dark fear of death and the anger of wrong of the present society. At present, we have to reproduce the death, and what we want is eventually no one can escape 'Attention to death'. In addition, by expressing the solidarity between death and life is to want to get a consolation for the anxiety and afraid reality.

• ETRI Journal
• /
• 제44권2호
• /
• pp.286-299
• /
• 2022

Human activity recognition in real time is a challenging task. Recently, a plethora of studies has been proposed using deep learning architectures. The implementation of these architectures requires the high computing power of the machine and a massive database. However, handcrafted features-based machine learning models need less computing power and very accurate where features are effectively extracted. In this study, we propose a handcrafted model based on three-dimensional sequential skeleton data. The human body skeleton movement over a frame is computed through joint positions in a frame. The joints of these skeletal frames are projected into two-dimensional space, forming a "movement polygon." These polygons are further transformed into a one-dimensional space by computing amplitudes at different angles from the centroid of polygons. The feature vector is formed by the sampling of these amplitudes at different angles. The performance of the algorithm is evaluated using a support vector machine on four public datasets: MSR Action3D, Berkeley MHAD, TST Fall Detection, and NTU-RGB+D, and the highest accuracies achieved on these datasets are 94.13%, 93.34%, 95.7%, and 86.8%, respectively. These accuracies are compared with similar state-of-the-art and show superior performance.

• Journal of Computational Design and Engineering
• /
• 제3권1호
• /
• pp.14-23
• /
• 2016

The problem of fitting B-spline curves to planar point clouds is studied in this paper. A novel method is proposed to deal with the most challenging case where multiple intersecting curves or curves with self-intersection are necessary for shape representation. A method based on Delauney Triangulation of data points is developed to identify connected components which is also capable of removing outliers. A skeleton representation is utilized to represent the topological structure which is further used to create a weighted graph for deciding the merging of curve segments. Different to existing approaches which utilize local shape information near intersections, our method considers shape characteristics of curve segments in a larger scope and is thus capable of giving more satisfactory results. By fitting each group of data points with a B-spline curve, we solve the problems of curve structure reconstruction from point clouds, as well as the vectorization of simple line drawing images by drawing lines reconstruction.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.687-690
• /
• 1988

Algorithms that represent given pattern in the form of an ARG (Attributed relational graph) using not only structural relations but also symbolic or numerical attributes, and then recognize that pattern by graph matching process are presented in this paper. Based on definitions of pattern deformational models, algorithms that can find GPECI(Graph preserved error correcting isomorphism). SGECI(subgraph ECI) and DSECI(Double subgraph ECI) are proposed and comparisons among these algorithms are described. To be useful in performig practical tasks, efficient schemes for extraction of ARG representation fron raw image are needed. In this study, given patterns are restricted within objects having distinct skeleton, and then the information which is necessary for recognition and analysis is successfully extracted.

• 한국CDE학회논문집
• /
• 제15권1호
• /
• pp.33-42
• /
• 2010

In this study, new medial surface calculation methods using Voronoi diagrams are investigated for the point samples extracted on closed surface models. The medial surface is defined by the closure of all points having more than one closest point on the shape boundary. It is a one of essential geometric information in 3D and can be used in many areas such as 3D shape analysis, dimension reduction, freeform shape deformation, image processing, computer vision, FEM analysis, etc. In industrial parts, the idealized solid parts and shell shapes including sharp edges and vertices are frequently used. Other medial surface extraction methods using Voronoi diagram have inherent separation and branch problems, so that they are not appropriate to the sharp edged objects and have difficulties to be applied to industrial parts. In addition, the branched surfaces on sharp edges in shell shapes should be eliminated to obtain representative medial shapes. In order to avoid separation and branch problems, the new approach by analyzing the shapes and specially sampling on surfaces has been developed.

• Imaging Science in Dentistry
• /
• 제36권3호
• /
• pp.123-129
• /
• 2006

The use of computed tomography for dental procedures has increased recently. Cone beam computed tomography (CBCT) systems have been designed for imaging hard tissues of the dentomaxillofacial region. CBCT is capable of providing high resolution in images of high diagnostic quality. This technology allows for 3-dimensional representation of the dentomaxillofacial skeleton with minimal distortion, but at lower equipment cost, simpler image acquisition and lower patient dose. Because this technology produces images with isotropic sub-millimeter spatial resolution, it is ideally suited for dedicated dentomaxillofacial imaging. In this paper, we provide a brief overview of cone beam scanning technology and compare it with the fan beam scanning used in conventional CT and the basic principles of currently available CBCT systems.

• 정보처리학회논문지A
• /
• 제11A권7호
• /
• pp.555-562
• /
• 2004

뇌의 하부 구조인 해마의 전역적 부피 감소와 국부적 형상 변화는 정신의학적 질환에 깊게 관련되어 있다. 해마 구조에 관한 형상 분석 연구는 크게 해마 형상 표현 모델을 구축하고, 이러한 형상 표현으로부터 형상 유사성을 계산하는 과정으로 구성된다. 본 논문에서는 메쉬, 복셀, 골격 데이터를 포함하는 복합적인 옥트리 기반의 형상 표현을 이용하여 해마의 형상을 분석하기 위한 새로운 방법을 제시한다. 우선 해마에 관한 MRI 데이터를 입력으로 받아, 마칭큐브 알고리즘을 사용하여 다해상도 메쉬 모델을 구축한다. 이렇게 구성된 다각형 모델은 깊이맵 기반의 복셀화 방법을 이용하여 중간 단계의 이진 복셀 데이터로 변환된다. 그리고 변환된 복셀 데이터로부터 슬라이스 기반의 골격화 방법에 의하여 해마의 3차원 골격을 추출한다. 그런 후에 옥트리 기반의 다해상도 형상 표현을 얻기위해 해마의 메쉬, 복셀, 골격 데이터를 계층적으로 공간 분할하여 저장하고, 광선 추적 기반의 메쉬 샘플링 방법을 적용하여 샘플 메쉬 데이터를 추출한다. 최종적으로, 형상간 유사성 측정을 위하여 추출된 골격으로부터 방사되는 광선들과 충돌되는 각 샘플 메쉬 쌍에 대하여 $L_2$과 하우스도르프 거리를 계산하고 인터랙티브한 국부적 형상 분석을 지원하기 위하여 마우스 피킹 인터페이스를 채택한다. 이것은 형상의 국부적 변화에 대하여 다양한 해상도에 기반한 형상 분석을 가능하게 한다. 본 논문에서는 실험을 통하여, 제시한 형상 분석 방법이 회전과 스케일 등의 변환에 강인하고, 특히 형상의 국부적 변화 정도를 정확도를 유지하면서 빠르게 평가하는데에 효과적임을 확인하였다. 경로의 수신 신호가 완전 동기 된 수신 신호임을 확인하였다.omonas aeruginosa PA01과 $82\%$로 가장 높은 유사성을 보였고 Pseudomonas arvilla C-1와는 $71\%,$ Pseudomonas putida KT2440과는 $59\%,$ 그리고 Pseudomonas sp. CA10과는 $53\%$의 상동성이 각각 존재하는 것으로 확인하였다.)을 가지고 있음이 확인되었다. 사람에 직접적인 유해성을 가지고 있는 지 확인하기 위해 사람 방광 유래의 T-24세포와 장내 표피 유래의 Caco-2세포에 대한 부착능을 시험하였을 때, 16균주$(42.1\%)$가 T-24방광 세포에, 그리고 17균주$(44.7\%)$가 Caco-2장세포에 대해 강한 부착능을 나타내었다. 특히 11균주$(28.9\%)$는 두 세포 모두에 강한 부착능을 가지고 있었다. Filter mating method를 수행하여 이들 균주들의 독소 생산 유전자와 항생제 내성 유전자가 사람에서 분리된 균주로 전달되는 것을 확인할 수 있었다. 본 실험의 결과는 설사 중상을 나타내는 돼지로부터 분리된 용혈성 E. coli의 독성과 세포 부착능력, 그리고 항생제 내성간의 상호 연관성을 보여주지 않았으나 동물 분리 세균의 항생제 내성과 독소 생산 능력이 유전자 전달을 통해서 뿐만 아니라 세균의 직접 접촉에 의해서도 인체로 전달될 수 있는 것을 보여주는 것이다.다. 본 연구를 토대로 장시간의 체외순환에서는 신장기능을 대표하는 수치들에도

• International Journal of CAD/CAM
• /
• 제6권1호
• /
• pp.105-115
• /
• 2006

Thickness is a commonly used parameter in product design and manufacture. Its intuitive definition as the smallest dimension of a cross-section or the minimum distance between two opposite surfaces is ambiguous for intricate solids, and there is very little reported work in automatic computation of thickness. We present three generic definitions of thickness: interior thickness of points inside an object, exterior thickness for points on the object surface, and radiographic thickness along a view direction. Methods for computing and displaying the respective thickness values are also presented. The internal thickness distribution is obtained by peeling or successive skin removal, eventually revealing the object skeleton (similar to medial axis transformation). Another method involves radiographic scanning along a viewing direction, with minimum, maximum and total thickness options, displayed on the surface of the object. The algorithms have been implemented using an efficient voxel based representation that can handle up to one billion voxels (1000 per axis), coupled with a near-real time display scheme that uses a look-up table based on voxel neighborhood configurations. Three different types of intricate objects: industrial (press cylinder casting), sculpture (Ganesha idol), and medical (pelvic bone) were used for successfully testing the algorithms. The results are found to be useful for early evaluation of manufacturability and other lifecycle considerations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권3호
• /
• pp.1189-1204
• /
• 2018

Detecting and capturing 3D human structures from the intensity-based image sequences is an inherently arguable problem, which attracted attention of several researchers especially in real-time activity recognition (Real-AR). These Real-AR systems have been significantly enhanced by using depth intensity sensors that gives maximum information, in spite of the fact that conventional Real-AR systems are using RGB video sensors. This study proposed a depth-based routine-logging Real-AR system to identify the daily human activity routines and to make these surroundings an intelligent living space. Our real-time routine-logging Real-AR system is categorized into two categories. The data collection with the use of a depth camera, feature extraction based on joint information and training/recognition of each activity. In-addition, the recognition mechanism locates, and pinpoints the learned activities and induces routine-logs. The evaluation applied on the depth datasets (self-annotated and MSRAction3D datasets) demonstrated that proposed system can achieve better recognition rates and robust as compare to state-of-the-art methods. Our Real-AR should be feasibly accessible and permanently used in behavior monitoring applications, humanoid-robot systems and e-medical therapy systems.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2005년도 춘계종합학술대회
• /
• pp.843-847
• /
• 2005

The development of distributed application in the standardized CORBA(Common Object Request Broker Architecture) environments reduces the developing time and maintaining cost of the systems. Because of these advantages, the development of application is being progressed in the several fields using the CORBA environments. The programmers in the CORBA environments usually develop the application programs using the CORBA IDL(Interface Definition Language). The IDL files are compiled by IDL compiler and translated into the stubs and skeleton codes which are mapped onto particular target language. The stubs produced by IDL compilers processes the marshaling a data into message buffer. Before a stub can marshal a data into its message buffer, the stub must ensure that the buffer has at least enough free space to contain the encoded representation of the data. But, the stubs produced by typical IDL compilers check the amount of free buffer space before every atomic data is marshaled, and if necessary, expand the message buffer. These repeated tests are wasteful and incidence of overheads, especially if the marshal buffer space must be continually expanded. Thus, the performance of the application program may be poor. In this paper, we suggest the way that the stub code is maintain the enough free space before marshaling the data into message buffer. This methods were analyzes the overall storage requirements of every message that will be exchanged between client and server. For these analysis, in the Front End of compiler has maintain the information that the storage requirements and alignment constraints for data types. Thus, stub code is optimized and the performance of application program is increased.