• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.5
• /
• pp.132-140
• /
• 2016

In this paper, we propose boundary-preserving stereo matching method based on adaptive disparity adjustment using confidence region detection. To find the initial disparity map, we compute data cost using the color space (CIE Lab) combined with the gradient space and apply double cost aggregation. We perform left/right consistency checking to sort out the mismatched region. This consistency check typically fails for occluded and mismatched pixels. We mark a pixel in the left disparity map as "inconsistent", if the disparity value of its counterpart pixel differs by a value larger than one pixel. In order to distinguish errors caused by the disparity discontinuity, we first detect the confidence map using the Mean-shift segmentation in the initial disparity map. Using this confidence map, we then adjust the disparity map to reduce the errors in initial disparity map. Experimental results demonstrate that the proposed method produces higher quality disparity maps by successfully preserving disparity discontinuities compared to existing methods.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1381-1394
• /
• 2006

Generation methods of data cube have been studied for many years in data warehouse which supports decision making using stored data. There are two previous studies, one is multi-way array algorithm and the other is H-cubing algorithm which is based on the hyper-tree. The multi-way array algorithm stores all aggregation data in arrays, so if the base data is increased, the size of memory is also grow. The H-cubing algorithm which is based on the hyper-tree stores all tuples in one tree so the construction cost is increased. In this paper, we present an efficient data cube generation method based on hash table using weight mapping table and record hash table. Because the proposed method uses a hash table, the generation cost of data cube is decreased and the memory usage is also decreased. In the performance study, we shows that the proposed method provides faster search operation time and make data cube generation operate more efficiently.

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.188-200
• /
• 2006

Once a continuous query, which is commonly used in sensor networks, is issued, the query is executed many times with a certain interval and the results of those query executions are collected to the base station. Since this comes many communication messages continuously, it is important to reduce communication cost for collecting data to the base station. In sensor networks, in-network processing reduces the number of message transmissions by partially aggregating results of an aggregate query in intermediate nodes, or merging the results in one message, resulting in reduction of communication cost. In this paper, we propose a routing tree for sensor nodes that qualify the given query predicate, called the query specific routing tree(QSRT). The idea of the QSRT is to maximize in-network processing opportunity. A QSRT is created seperately for each query during dissemination of the query. It is constructed in such a way that during the collection of query results partial aggregation and packet merging of intermediate results can be fully utilized. Our experimental results show that our proposed method can reduce message transmissions more than 18% compared to the existing one.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.4
• /
• pp.359-371
• /
• 2001

Project scheduling under resource constraint conditions have contained to many uncertain factors and it is perfonned by human experts. The expert identifies the activities of the project, decides the precedent relationships between these activities, and then construct the schedule using expected activity's duration. At this time, most of the scheduling methods concentrate on one of scheduling factor between activity duration and cost. And the activity duration, which is the most important factor in scheduling, is decided by heuristic of expert. Therefore it may cause uncertainty of activity duration decision and the use of this activity duration may increase the uncertainty of constructed schedule. This paper proposes Fuzzy-MOEH scheduling algorithm, which is the aggregation of the fuzzy number for deciding activity duration and applies the cost function for solving the problems of previous scheduling methods. This paper also analyze the utility and property of Fuzzy-MEOH algorithm through the comparison between Fuzzy-MEOH algorithm and existing MEOH algorithm.

• Korean Institute of Interior Design Journal
• /
• v.20 no.2
• /
• pp.110-119
• /
• 2011

The purpose of this study is to analyze the development and characteristics of Dymaxion housing by R. B. Fuller, who is generally known as a structure engineering, architect and his influences. A document research method was used to analyze and classified of his dymaxion housing projects focused on the late of 1920's. Through this study, the following conclusions have been reached; 1) In order to obtain the productivity and efficiency drawing from the industrialized housing in the early of 1900s, the planning concepts of 'Dymaxion', 'Ehemeralization' and 'Autonomy' were proposed. 2) The planning characteristics of Dymaxion housing projects are classified as three aspects. The first is 'formative aspects' which was focused on the round-shape, transparency and lightweight material such as aluminium for movable and flexible dwelling. The second is 'functional aspects', focused on the mass-production, mobility, flexibility, high-tech and systemizing mechanical equipments for efficiency of household affairs. The third is 'environmental aspects', focused on the energy-saving and environmental control for sustainable dwelling. Dymaxion housing projects of Fuller, an aggregation of high-tech mechanical equipments, had a great impact on the development the concept of mobility and influenced radical and utopian architectural groups' ideas of 1960's. Especially, considering today's high cost of energy and the limited natural resources, Fuller's Dymaxion theory must be re-evaluated.

• Korean Institute of Interior Design Journal
• /
• no.19
• /
• pp.45-52
• /
• 1999

This study is on Buckminster Fuller, who is generally known as a structure engineering architect, and his influences. Fuller's radical and utopian ideas and designs were regarded as 'paper architecture'. But considering today's high cost of energy and the limited natural resources, Fuller's Dymaxion theory must be re-evaluated. Fuller's influences on the contemporary architecture are summarized as follows. 1) His idea of controlling the environment through the use of technology influenced today's 'High-Tech' architects. Architecture is no-longer designed purely by its formal character, but becomes a tool of investigating environmental significance of modern technology. 2) Through systemizing mechanical equipment, Dymaxion House prototype, and aggregation of high-tech mechanical equipments, influenced Archigram & Metabolist's capsule idea. It is expressed as a plug-in module equipment of 'High-Tech' architecture which has flexible interior with mechanical exterior image. 3) Megastructure. The Manhattan dome project gave an influence to many engineer/architects who tried to achieve an ideal artificial environment. This is in connection to 1960's utopian projects. Today's megastructures show new possibilities in urbanism and architecture. Fuller's comprehensive idea of humans living in harmony in the universe shows possibilities not only in structural engineering, but in solving various problems that confront today's architecture.

• The Journal of the Convergence on Culture Technology
• /
• v.2 no.1
• /
• pp.87-91
• /
• 2016

This study is to develop a standard model in order to establish IOT production information system and to analyze the effect. Professional IT industry and SMEs that want to build a production information system can be applied to standard models to build the system more effectively. It provides ease of construction and reliability for IOT production information system with removing irrational elements, product quality and reducing production cost. In addition, it can be applied to standardize management of raw materials supply and demand aggregation processes of production and constructed a system more effectively using standard module.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.193-198
• /
• 2004

In variety of environments for applications, wireless sensor networks have received increasing attention in the recent few years. But, sensor nodes have many limitations including battery power and communication range. These networks require robust wireless communicant protocols that are energy efficient and provide low latency. In this paper, we propose new protocol as is defined SCP. The key idea of SCP is that only one node which is defined as a Super-Cluster Header sends the combined data to the BS. We evaluated the effectiveness of SCP through experiments which have several parameter violations. Simulation results shows that performance of SCP is through better than other legacy protocol within the framework of energy cost, life time of the sensor network and fair distribution of the energy consumption.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.9
• /
• pp.424-430
• /
• 2001

A multi-level optimal power flow(OPF) algorithm has been evolved from a simple two stage optimal Power flow algorithm for constrained power economic dispatch control. In the proposed algorithm, we consider various constraints such as ower balance, generation capacity, transmission line capacity, transmission losses, security equality, and security inequality constraints. The proposed algorithm consists of four stages. At the first stage, we solve the aggregated problem that is the crude classical economic dispatch problem without considering transmission losses. An initial solution is obtained by the aggregation concept in which the solution satisfies the power balance equations and generation capacity constraints. Then, after load flow analysis, the transmission losses of an initial generation setting are matched by the slack bus generator that produces power with the cheapest cost. At the second stage we consider transmission losses. Formulation of the second stage becomes classical economic dispatch problem involving the transmission losses, which are distributed to all generators. Once a feasible solution is obtained from the second stage, transmission capacity and other violations are checked and corrected locally and quickly at the third stage. The fourth stage fine tunes the solution of the third stage to reach a real minimum. The proposed approach speeds up the two stage optimization method to an average gain of 2.99 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.

• Proceedings of the KIEE Conference
• /
• 1998.07c
• /
• pp.926-928
• /
• 1998

A fast optimization algorithm has been evolved from a simple two stage optimal power flow(OPF) algorithm for constrained power economic dispatch. In the proposed algorithm, we consider various constraints such as power balance, generation capacity, transmission line capacity, transmission losses, security equality, and security inequality constraints. The proposed algorithm consists of four stages. At the first stage, we solve the aggregated problem that is the crude classical economic dispatch problem without considering transmission losses. An initial solution is obtained by the aggregation concept in which the solution satisfies the power balance equations and generation capacity constraints. Then, after load flow analysis, the transmission losses of an initial generation setting are matched by the slack bus generator that produces power with the cheapest cost. At the second stage we consider transmission losses. Formulation of the second stage becomes classical economic dispatch problem involving the transmission losses, which are distributed to all generators. Once a feasible solution is obtained from the second stage, transmission capacity and other violations are checked and corrected locally and quickly at the third stage. The fourth stage fine tunes the solution of the third stage to reach a real minimum. The proposed approach speeds up the coupled LP based OPF method to an average gain of 53.13 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.