• 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.

• The Journal of the Korea Contents Association
• /
• v.13 no.11
• /
• pp.523-532
• /
• 2013

Since conventional methods for the reconstruction of 3D objects used a number of cameras or pictures, they required specific hardwares or they were sensitive to the photography environment with a lot of processing time. In this paper, we propose a 3D object reconstruction method using one photograph based on structured light in ubiquitous environments. We use color pattern of the conventional method for structured light. In this paper, we propose a novel pipeline consisting of various image processing techniques for line pattern extraction and matching, which are very important for the performance of the object reconstruction. And we propose the optimal cost function for the pattern matching. Using our method, it is possible to reconstruct a 3D object with efficient computation and easy setting in ubiquitous or mobile environments, for example, a smartphone with a subminiature projector like Galaxy Beam.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.8
• /
• pp.1444-1451
• /
• 2016

This paper proposes a Tabu search algorithm to minimize the required energy to send data between a source and a destination using the cooperative communication in wireless ad hoc networks. As the number of nodes in wireless ad hoc networks increases, the amount of calculation for establishing the path between nodes would be too much increased. To obtain the optimal cooperative path within a reasonable computation time, we propose a new Tabu search algorithm for a high-density wireless network. In order to make a search more efficient, we propose some efficient neighborhoods generating operations of the Tabu search algorithm. We evaluate those performances through some experiments in terms of the minimum energy required to send data between a source and a destination as well as the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms other existing algorithms.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.549-557
• /
• 2000

Distributed Memory Machine(DMM) is necessary for the effective computation of the data which is complicated and very large. Task scheduling is a method that reduces the communication time among tasks to reduce the total execution time of application program and is very important for the improvement of DMM. Task Duplicated based Scheduling(TDS) method improves execution time by reducing communication time of tasks. It uses clustering method which schedules tasks of the large communication time on the same processor. But there is a problem that cannot optimize communication time between task sending data and task receiving data. Hence, this paper proposes a new method which solves the above problem in TDS. Modified Task Duplicated based Scheduling(MTDS) method which can approximately optimize the communication time between task sending data and task receiving data by checking the optimal condition, resulted in the minimization of task execution time by reducing the communication time among tasks. Also system modeling shows that task execution time of MTDS is about 70% faster than that of TDS in the best case and the same as the result of TDS in the worst case. It proves that MTDS method is better than TDS method.

• Journal of Korean Society for Geospatial Information Science
• /
• v.15 no.1 s.39
• /
• pp.47-53
• /
• 2007

Astronomic surveying has been regarded as an important method for absolute positioning of geodetic datum in each countries under the local geodetic reference system. The purposes of this study are to determine astrogeodetic geoidal heights referred to Bessel ellipsoid and to determine deflection of the vertical and geoidal heights referred to GRS80 of World Geodetic System by astronomic surveying data which have been surveyed after 1970 in Korea. The results show that $\xi$ component of the deflection of the vertical distribute from -5.725" to 8.005" and $\eta$ component distribute from -14.917" to 6.2" and astrogeodrtic geoidal heights distribute from 23 m to 27 m in the study area. Also, we could see that GRS80 was more optimal ellipsoid than Bessel 1841 ellipsoid to Korea through comparing both astrogeotic geoidal heights referred to GRS80 and Bessel 1841 ellipsoid.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4A
• /
• pp.364-370
• /
• 2002

In this paper, we propose a VLSI array architecture for high speed processing of FBMA. First of all, the sequential FBMA is transformed into a single assignment code by using the index space expansion, and then the dependance graph is obtained from it. The two dimensional VLSI array is derived by projecting the dependance graph along the optimal direction. Since the candidate blocks in the search range are overlapped with columns as well as rows, the processing elements of the VLSI array are designed to reuse the overlapped data. As the results, the number of data inputs is reduced so that the processing performance is improved. The proposed VLSI array has (N$^2$+1)${\times}$(2p+1) processing elements and (N+2p) input ports where N is the block size and p is the maximum search range. The computation time of the rat reference block is (N$^2$+2(p+1)N+6p), and the block pipeline period is (3N+4p-1).

• Steel and Composite Structures
• /
• v.34 no.4
• /
• pp.467-485
• /
• 2020

Genetic Algorithm (GA) is a meta-heuristic algorithm which is capable of providing robust solutions for optimal design of structural components, particularly those one needs considering many design requirements. Hence, it has been successfully used by engineers in the typology optimization of structural members. As a novel approach, this study employs GA in order for conducting a case study with high constraints on the optimum mechanical properties of reinforced concrete (RC) beams under different load combinations. Accordingly, unified optimum sections through a computer program are adopted to solve the continuous beams problem. Genetic Algorithms proved in finding the optimum resolution smoothly and flawlessly particularly in case of handling many complicated constraints like a continuous beam subjected to different loads as moments shear - torsion regarding the curbs of design codes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5476-5496
• /
• 2016

Energy efficiency of resource-constrained wireless sensor networks is critical in applications such as real-time monitoring/surveillance. To improve the energy efficiency and reduce the energy consumption, the time series data can be compressed before transmission. However, most of the compression algorithms for time series data were developed only for single variate scenarios, while in practice there are often multiple sensor nodes in one application and the collected data is actually multivariate time series. In this paper, we propose to compress the time series data by the Lasso (least absolute shrinkage and selection operator) approximation. We show that, our approach can be naturally extended for compressing the multivariate time series data. Our extension is novel since it constructs an optimal projection of the original multivariates where the best energy efficiency can be realized. The two algorithms are named by ULasso (Univariate Lasso) and MLasso (Multivariate Lasso), for which we also provide practical guidance for parameter selection. Finally, empirically evaluation is implemented with several publicly available real-world data sets from different application domains. We quantify the algorithm performance by measuring the approximation error, compression ratio, and computation complexity. The results show that ULasso and MLasso are superior to or at least equivalent to compression performance of LTC and PLAMlis. Particularly, MLasso can significantly reduce the smooth multivariate time series data, without breaking the major trends and important changes of the sensor network system.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.4
• /
• pp.2338-2343
• /
• 2015

An analytical model was developed in this study and then implemented into a tool for automation of FEA (Finite Element Analysis) of a spindle system for natural frequencies and modes in the universal FEA software, ANSYS. VBA of EXCEL was used for the implementation. It allowed graphic user interfaces (GUIs) to be developed for a user to interact with the tool and, in addition, an EXCEL spreadsheet to be used for data arrangement. A code was developed in the language of ANSYS to generate the geometric model of the spindle system, sequentially to construct the analytical model based on the information in the GUIs, and finally to perform computation for the FEA. Its automation of the model generation and analysis can help to identify a near optimal design of the spindle system under design in minimum time and efforts.

• International Journal of Aeronautical and Space Sciences
• /
• v.14 no.4
• /
• pp.297-309
• /
• 2013

Design optimization is a mathematical process to find an optimal solution through the use of formal optimization algorithms. Design plays a vital role in the engineering field; therefore, using design tools in education and research is becoming more and more important. Recently, numerical design optimization in fluid mechanics, which uses computational fluid dynamics (CFD), has numerous applications in the engineering field, because of the rapid development of high-performance computing resources. However, it is difficult to find design optimization software and contents for educational purposes in aerospace engineering. In the present study, we have developed an aerodynamic design framework specifically for an airfoil, based on the EDucation-research Integration through Simulation On the Net (EDISON) portal. The airfoil design framework is composed of three subparts: a geometry kernel, CFD flow analysis, and an optimization algorithm. Through a seamless interface among the subparts, an iterative design process is conducted. In addition, the CFD flow analysis and the design framework are provided through a web-based portal system, while the computation is taken care of by a supercomputing facility. In addition to the software development, educational contents are developed for lectures associated with design optimization in aerospace and mechanical engineering education programs. The software and content developed in this study is expected to be used as a tool for e-learning material, for education and research in universities.