• Journal of the Korean housing association
• /
• v.21 no.4
• /
• pp.99-109
• /
• 2010

The purpose of this study is to provide basic data needed for planning apartment community spaces in order to vitalize rental apartments. Indoor community spaces of 12 rental apartments in Seoul and Kyunggi were examined. The results are as follows. First, the layout types of indoor community spaces in rental apartment complexes were found out to be mostly the building type planned in the piloties of the apartment, or the singular type placed in a singular building. Depending on the layout type, the spaces were mostly concentrated at the outskirt of the complex or the in-between space of the main building, thus lowering their recognition. Thereby, they were not satisfactory for utilization of the spaces and association of residents. Second, Indoor community space legal establishment standard and square measure did not reflect resident's feature except elderly spaces, and there was problem in activation of space. Third, as for the spatial planning of indoor community space, although each space was categorized by the users' age, the furniture and appliance planning considering users was not satisfactory. The area calculation by the type of space did not reflect the users' characteristics, thus causing problems in using the facilities. Fourth, as for the management and programs of the indoor community space, spaces were managed after categorized by the major user classes such as children, seniors, and adolescents. Depending on eagerness of program managers of each apartment complex, the level of program management varied. The survey results showed that, in most cases, almost no programs were used or merely basic management and programs were being provided.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1250-1256
• /
• 2004

The movement of continuously changing positions should be stored and indexed for querying current and past positions. A simple extension of the original R-tree to add time as another dimension, called 3D R-tree, does not handle current position queries and does not address the problem of low space utilization due to high overlap of index nodes. In this paper, 1 propose the dynamic splitting policy for improving the 3D R-tree in order to improve space utilization of split nodes. 1 also extend the original 3D R-tree by introducing a new tagged index structure for being able to query the current and past positions of moving objects. 1 found out that my extension of the original R-tree, called the tagged dynamic 3DR-tree, outperforms both the 3D R-tree and 75-tree when querying current and past position.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.4
• /
• pp.875-885
• /
• 2010

CBR (Case-Based Reasoning) is a technique to infer the relationships between existing data and case data, and the method to calculate similarity and Euclidean distance is mostly frequently being used. However, since those methods compare all the existing and case data, it also has a demerit that it takes much time for data search and filtering. Therefore, to solve this problem, various researches have been conducted. This paper suggests the method of SE(Speed Euclidean-distance) calculation that utilizes the patterns discovered in the existing process of computing similarity and Euclidean distance. Because SE calculation applies the patterns and weight found during inputting new cases and enables fast data extraction and short operation time, it can enhance computing speed for temporal or spatial restrictions and eliminate unnecessary computing operation. Through this experiment, it has been found that the proposed method improves performance in various computer environments or processing rate more efficiently than the existing method that extracts data using similarity or Euclidean method does.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2946-2952
• /
• 2014

Among the Example based Super Resolution(SR) techniques, Neighbor embedding(NE) has been inspired by manifold learning method, particularly locally linear embedding. However, the poor generalization of NE decreases the performance of such algorithm. The sizes of local training sets are always too small to improve the performance of NE. We propose the Learning Sparse-Neighbor Image Representation baesd on SVR having an excellent generalization ability to solve this problem. Given a low resolution image, we first use bicubic interpolation to synthesize its high resolution version. We extract the patches from this synthesized image and determine whether each patch corresponds to regions with high or low spatial frequencies. After the weight of each patch is obtained by our method, we used to learn separate SVR models. Finally, we update the pixel values using the previously learned SVRs. Through experimental results, we quantitatively and qualitatively confirm the improved results of the proposed algorithm when comparing with conventional interpolation methods and NE.

• Korean Institute of Interior Design Journal
• /
• v.26 no.6
• /
• pp.155-162
• /
• 2017

Recently, space branding has been used as a branding method for many companies because space communication is a way of utilizing space in a wide range of ways. However, generally speaking, communication only focuses on goods and information about brands and does not focus on consumer's stories. The purpose of this study is to present the communication of " Back to Harakenya " in concept of Harakeya as a solution to this problem and confirm its effectiveness through examples. We selected on the range of " cosmetics brand ", " food and beverage brand ", " brand brand " and " fashion brand " which can used as a direct experience as a marketing method, which is a good condition for communication. Based on that, Harakenya selected cases as spaces with the concept of "Back to Harakenya". Previously, Harakenya's concept of "Back to Harakenya" and his designs appears three features. First, it transforms into various being secondly, it generates active imagination and it contains at least as many things as possible. This resulted in the effect that people remember the image with a clear image. Based on this study, We investigated to draw a result of effects through how the design expression is made in the spaces of Space Branding and how the "Back to Harakenya" communication is taking place in the space. Through these studies, the design and communication method of Harakenya's "Back to Harakenya" concept helps us to remember the brand clearly and furthermore, we confirmed that the brand value can be improved.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.145-147
• /
• 2018

As mobile devices increase use, users are forced to recognize and navigate their own location and virtual space within a given small display. Unlike trains and buses, this study aims to select a space inside a subway train that is difficult to transfer location information to and suggest an interface to reduce cognitive differences to users. First, observe the actual environment and then derive the empirical factors. Second, by using Metapo which is an act of understanding or experiencing specific targets that are not familiar with familiar objects, the interface is designed according to the UX principle after converting the experience element into metapo. Finally, usability will be assessed through user experience evaluation and problem elicited and supplemented in future studies. This study expects the use of spatial interfaces to be increased and applied as a variety of services by using metaphors through experience elements to help users easily recognize their location within the mobile interface.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.691-700
• /
• 1995

Most fractal image codings using fractal concept require long encoding time because a large amount of computation is needed to find an optimal affine transformation point. Such a problem can be solved by designing a block classifier fitted to characteristics of image blocks. In general, it is possible to predict more precise and various types of blocks in frequency domain than in spatial domain. In this paper, we propose a block classifier to predict the block type using characteristics of DCT(Discrete Cosine Transform). This classifier has merits to enhance the quality of decoded images as well as to reduce the encoding time meeting fractal features. AC coefficient values in frequency domain make it possible to predict various types of blocks. As the results, the number of comparisons between a range block and the correspoding domain blocks to reach an optimal affine transformation point can be reduced. Specially, signs of DCT coefficients help to find the optimal affine transformation point with only two isometric transformations by eliminating unnecessary isometric transformations among eight isometric transformations used in traditional fractal codings.

• The KIPS Transactions:PartB
• /
• v.15B no.6
• /
• pp.553-560
• /
• 2008

The amount of image data used in medical institution is increasing rapidly with great development of medical technology. Therefore, an automation method that use image processing description, rather than manual macrography of doctors, is required for the analysis large medical data. Specially, medical image registration, which is the process of finding the spatial transform that maps points from one image to the corresponding points in another image, and 3D analysis and visualization skills for a series of 2D images are essential technologies. However, a high establishment cost raise a budget problem, and hence small scaled hospitals hesitate importing these medical visualizing system. In this paper, we propose a visualization system which allows user to manage datasets and manipulates medical images registration using an open source graphics tool - VTK(Visualization Tool Kit). The propose of our research is to get more accurate 3D diagnosis system in less expensive price, compared to existing systems.

• Journal of the Society of Naval Architects of Korea
• /
• v.50 no.1
• /
• pp.41-48
• /
• 2013

Several fatigue damages have recently been reported which cannot be resolved in the context of the existing fatigue design procedure, and they are suspected to be the cracks induced by the low cycle fatigue mechanism. To tackle the problem, a series of material tests together with fatigue tests have been carried out, and elasto-plastic notch strain analysis using nonlinear kinematic hardening model has been performed. The cyclic stress-strain curves are obtained and the nonlinear kinematic hardening model was calibrated based on the obtained material data. Also, the fatigue test with non-load-carrying cruciform fillet welded joint has been performed in low cycle fatigue regime. Then, the notch strain analyses have been carried out to find the precise elasto-plastic behavior of the material at the notch root of the cruciform joint. The variation of the material property from the base metal via HAZ up to the weld metal was taken into account using spatial variation of the material property. Then the detail elasto-plastic behavior of the welded joint subjected to the repeated cyclic loading has been investigated further through the comparison with the prediction with Neuber's rule. The calibration of the nonlinear kinematic hardening model and nonlinear notch strain analyses have been performed using the commercial FE program ABAQUS.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.885-888
• /
• 2000

Among the previous searching methods, there are the typical methods such as full search and three-step search, etc. Block motion estimation using exhaustive search is too computationally intensive. To apply in practice, recently proposed fast algorithms have been focused on reducing the computational complexity by limiting the number of searching points. According to the reduction of searching points, the quality performance is aggravated in those algorithms. In this paper, We present a fast and efficient search algorithm for block motion estimation that produces better quality performance and less computational time compared with a three-step search (TSS). Previously the proposed Two Step Search Algorithm (TWSS) by Fang-Hsuan Cheng and San-Nan sun is based on the ideas of dithering pattern for pixel decimation using a part of a block pixels for BMA (Block Matching Algorithm) and multi-candidate to compensate quality performance with several locations. This method has good quality performance at slow moving images, but has bad quality performance at fast moving images. To resolve this problem, the proposed algorithm in this paper considers spatial and temporal correlation using neighbor and previous blocks to improve quality performance. This performance uses neighbor motion vectors and previous motion vectors in addition, thus it needs more searching points. To compensate this weakness, the proposed algorithm uses statistical character of dithering matrix. The proposed algorithm is superior to TWSS in quality performance and has similar computational complexity