• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1320-1323
• /
• 1996

This paper describes an interpolation method for a parametric surface. A parametric surface is approximated to triangular mesh surfaces and then the basic paths are achieved. As the generated path is a series of linear segments, this algorithm can be easily adapted to general NC controllers. The generated paths have minimal transfer length and are gouge-free within the approximation tolerance. The problems, induced when the paths are represented by linear segments, are overcome without making any path deviation by this algorithm. This algorithm saves machining time by eliminating overdetermined tool paths and keeping the desired average feedrate, which improve productivity and lead to lower production costs.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.49 no.2
• /
• pp.153-160
• /
• 2013

Control allocation is an important part of a system. It implements the function that map the desired command forces from the controller into the commands of the different actuators. In this paper, the authors present an approach for solving constrained control allocation problem in vessel system by using multi-parametric quadratic programming (mp-QP) algorithm. The goal of mp-QP algorithm applied in this study is to compute a solution to minimize a quadratic performance index subject to linear equality and inequality constraints. The solution can be pre-computed off-line in the explicit form of a piecewise linear (PWL) function of the generalized forces and constrains. The efficiency of mp-QP approach is evaluated through a dynamic positioning simulation for a vessel by using four tugboats with constraints about limited pushing forces and found to work well.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.49 no.2
• /
• pp.1-16
• /
• 2021

The act of design in landscape architecture consists of a concept within a designer's mind, technical representations, and finally, a process of construction. In the 4th Industrial Revolution, the design process is facing many changes due to the rapid development of computer technology and the IT ecosystem. Computer technology was initially developed for simple functions, such as mathematical calculation and graphic representation. However, after the spread of Personal Computers, starting with IBM and Macintosh, programming languages and hardware rapidly developed, algorithms and applications became specialized, and the purpose of using computers became very diverse. This study diagnoses issues concerning the functions and roles that new design methods, such as computational design, parametric design, and algorithmic design, can play in landscape architecture based on changes in the digital society. The study focused on the design methodology using parametric technology, which has recently received the most attention. First, the basis for discussion was developed by examining the main concepts and characteristics of parametric design in modern landscape architecture. Prior research on the use of parametric design in landscape architecture was analyzed, as were the case studies conducted by landscape design firms. As a result, it was confirmed that parametric design has not been sufficiently discussed in terms of the number and diversity of studies compared to other techniques investigated by landscape design firms. Finally, based on the discussion, the study examined specific cases and future possibilities of the parametric design in landscape architecture.

• East Asian mathematical journal
• /
• v.24 no.2
• /
• pp.177-186
• /
• 2008

In this paper, we introduce and study a new class of system of parametric general quasivariational-like inequalities. Using $\eta$-subdifferential and $\eta$-proximal mappings of proper functionals in Hilbert spaces, we prove the equivalence between the system of parametric general quasivariational-like inequalities and a xed point problem and construct two iterative algorithms. A few existence and uniqueness results as well as the sensitivity analysis of solutions are also established for the system of parametric general quasivariational-like inequalities, and some convergence results of iterative sequence generated by the algorithms are proved. Our results extend a few known results in the literature.

• Advances in Computational Design
• /
• v.3 no.1
• /
• pp.35-47
• /
• 2018

Design of settlement space is a complicated process while reasonable spatial layout bears great significance on the development and resource allocation of a settlement. The study proposes a weighted L-system generation algorithm based on CA (Cellular Automation) model which tags the spatial attributes of cells through changes in their state during the evolution of CA and thus identifies the spatial growth mode of a settlement. The entrance area of the Caidian Botanical and Animal Garden is used a case study for the model. A design method is proposed which starts from the internal logics of spatial generation, explores possibility of spatial rules and realizes the quantitative analysis and dynamic control of the design process. Taking a top-down approach, the design method takes into account the site information, studies the spatial generation mechanism of settlements and further presents a engine for the generation of multiple layout proposals based on different rules. A optimal solution is acquired using GA (Genetic Algorithm) which generates a settlement spatial layout carrying site information and dynamically linked to the surround environment. The study aims to propose a design method to optimize the spatial layout of the complex settlement system based on parametric generation.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.2
• /
• pp.41-51
• /
• 2014

This paper describes a method to estimate the noise power using the minimum statistics approach, which was originally proposed for audio processing. The proposed minimum statistics-based method separates a noisy image into multiple frequency bands using the three-level discrete wavelet transform. By assuming that the output of the high-pass filter contains both signal detail and noise, the proposed algorithm extracts the region of pure noise from the high frequency band using an appropriate threshold. The region of pure noise, which is free from the signal detail part and the DC component, is well suited for minimum statistics condition, where the noise power can be extracted easily. The proposed algorithm reduces the computational load significantly through the use of a simple processing architecture without iteration with an estimation accuracy greater than 90% for strong noise at 0 to 40dB SNR of the input image. Furthermore, the well restored image can be obtained using the estimated noise power information in parametric image restoration algorithms, such as the classical parametric Wiener or ForWaRD image restoration filters. The experimental results show that the proposed algorithm can estimate the noise power accurately, and is particularly suitable for fast, low-cost image restoration or enhancement applications.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.2 s.308
• /
• pp.1-11
• /
• 2006

In this paper, we propose the novel video retrieval algorithm using non-parametric based motion classification in the shot-based video indexing structure. The proposed system firstly gets the key frame and motion information from each shot segmented by scene change detection method, and then extracts visual features and non-parametric based motion information from them. Finally, we construct real-time retrieval system supporting similarity comparison of these spatio-temporal features. After the normalized motion vector fields is created from MPEG compressed stream, the extraction of non-parametric based motion feature is effectively achieved by discretizing each normalized motion vectors into various angle bins, and considering a mean, a variance, and a direction of these bins. We use the edge-based spatial descriptor to extract the visual feature in key frames. Experimental evidence shows that our algorithm outperforms other video retrieval methods for image indexing and retrieval. To index the feature vectors, we use R*-tree structures.

• The Journal of the Korea Contents Association
• /
• v.10 no.12
• /
• pp.34-42
• /
• 2010

The DOA(direction of arrival), which is based on parametric and nonparametric estimation algorithm, and adaptive beamforming algorithm for mobile communication environments are researched and analyzed. In parametric estimation algorithm, eigenvalues of the signal component and the noise component are obtained from correlation matrix of received signal by array antenna and power spectrum of the received signal is discriminated from them. Otherwise, in nonparametric estimation algorithm, we minimize a regularized objective function for finding a estimate of the signal energy as a function of angle, using nonquadratic norm which leads to supper resolution and noise suppression. And then, DOA is estimated by the signal and noise spatial steering vector, and adaptive beam-forming pattern is improved by weight vectors obtained from the spatial vector. Therefore, the improved directional estimation algorithm with regularizing sparsity constraints offers super-resolution and noise suppression compared to other algorithms.

• Journal of Mechanical Science and Technology
• /
• v.20 no.12
• /
• pp.2034-2042
• /
• 2006

In this study, a complete 3D surface reconstruction method is proposed based on the concept that the vertices, of surface model can be completely matched to the unstructured point cloud. In order to generate the initial mesh model from the point cloud, the mesh subdivision of bounding box and shrink-wrapping algorithm are introduced. The control mesh model for well representing the topology of point cloud is derived from the initial mesh model by using the mesh simplification technique based on the original QEM algorithm, and the parametric surface model for approximately representing the geometry of point cloud is derived by applying the local subdivision surface fitting scheme on the control mesh model. And, to reconstruct the complete matching surface model, the insertion of isolated points on the parametric surface model and the mesh optimization are carried out. Especially, the fast 3D surface reconstruction is realized by introducing the voxel-based nearest-point search algorithm, and the simulation results reveal the availability of the proposed surface reconstruction method.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.896-899
• /
• 1996

A new algorithm for planning a collision free path is developed based on linear parametric curve. A collision-free path is viewed as a connected space curve in which the path consists of two straight curve connecting start to target point. A single intermediate connection point is considered in this paper and is used to manipulate the shape of path by organizing the control point in polar coordinate (.theta.,.rho.). The algorithm checks interference with obstacles, defined as GM (Geometry Mapping), and maps obstacles in Euclidean Space into images in CPS (Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The clear area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidean Space. Any points from the clear area of CPS is a candidate for a collision-free path. A simulation of GM for number of cases are carried out and results are presented including mapped images of GM and performances of algorithm.