• Journal of the Korean Society for Railway
• /
• v.2 no.3
• /
• pp.46-53
• /
• 1999

In this paper, made was a study on a mesh generation method based on the pollution error. This method is designed for the control of the pollution error in any patch of elements of interest. It is a well-known fact that the pollution error estimates are much more than the local one. When the pollution error is significant, nothing can be said about the reliability of any estimator based on local computations in the patch. Reliable a posteriori error estimation is possible by controlling the pollution error in the patch through proper design of the mesh outside the patch. This design is possible by equally distributing the pollution error indicators over the mesh outside the patch. The mesh generated from the conventional feedback pollution-adaptive mesh generation algorithm needs many iterations. Therefore, the solution time is significant. But the remeshing scheme in the proposed method was used here. It was shown that the pollution-adaptive mesh improves the E.I., simply denoted as Effectivity Index, on the patch of interest, and the pollution error reduces less than the local error.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2001.10a
• /
• pp.34-42
• /
• 2001

In this paper, we study on a modified mesh generation method based on the pollution error estimate. This method is designed for the control of the pollution error in any patch of elements of interest. It is a well-known fact that the pollution error estimates are much more than the local one. Reliable a posteriori error estimation is possible by controlling the pollution error in the patch through proper design of the mesh outside the patch. This design is possible by equally distributing the pollution error indicators over the mesh outside the patch. The conventional feedback pollution-adaptive mesh generation algorithm needs many iterations. Therefore, the solution time is significant. But we use the remeshing scheme in the proposed method. We will also show that the pollution error reduces less than the local error.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.8
• /
• pp.854-861
• /
• 2007

In this paper, a compact L-shaped shorted pin patch to be used at local oscillator port in radar detector is proposed. Shorted pin patch operates as short-open cavity while conventional patch operates as open-open cavity. Shorted pins are L-shaped to obtain quarter wave length and three-quarter wave length resonance for the fundamental(X-band) and $2^{nd}(3^{rd})$(K- and Ka-band) mode resonance frequency, respectively. Thus, the proposed patch can be compact. It is also possible to operate at triple band(X-, K-, Ka-band) with small return loss in radar detector, It is expected that shorted pin patch could improve radar detector sensitivity.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.4
• /
• pp.671-684
• /
• 2001

Several design problems of composite structures are studied via a global optimizer based on attraction regions. MSC/NASTRAN is adopted for static and eigenvalue analysis. The method of modified feasible direction in DOT is used for local optimization. Through the review of global optimization algorithms, the triangular patch algorithm is selected because the algorithm is known to be efficient, robust and powerful for general nonlinear optimization problems. For general applicability, various mechanical properties are considered as design objectives; strain energy, eigenvalue, weight, displacement, and buckling load. In all cases considered, the triangular patch algorithm results in a lot of optimum points and useful design patterns, that are not easy by local algorithms or conventional global algorithms can be determined.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.08a
• /
• pp.333-336
• /
• 2000

In this paper, a profile management system consisting of global and local range finders is presented for the automat ion of material pile handling. A global range finder detects range data of the front part of the piles of material and a profile map is obtained from a 3D profile detection algorithm. A local range finder attached on the side of the arm of the reclaimer detects range data with the handling function dynamically, and a local profile patch is acquired from the range data A yard profile map manager constructs a map by using the 3D profile of the global range finder and revises the map by replacing it with the local profile patch obtained Iron the local range finder. The developed vision system was applied to a simulator and the results of test show that it is appropriate to use for automating the material handling.

• Journal of Information Processing Systems
• /
• v.12 no.3
• /
• pp.468-488
• /
• 2016

The paper proposes a novel framework for 3D face verification using dimensionality reduction based on highly distinctive local features in the presence of illumination and expression variations. The histograms of efficient local descriptors are used to represent distinctively the facial images. For this purpose, different local descriptors are evaluated, Local Binary Patterns (LBP), Three-Patch Local Binary Patterns (TPLBP), Four-Patch Local Binary Patterns (FPLBP), Binarized Statistical Image Features (BSIF) and Local Phase Quantization (LPQ). Furthermore, experiments on the combinations of the four local descriptors at feature level using simply histograms concatenation are provided. The performance of the proposed approach is evaluated with different dimensionality reduction algorithms: Principal Component Analysis (PCA), Orthogonal Locality Preserving Projection (OLPP) and the combined PCA+EFM (Enhanced Fisher linear discriminate Model). Finally, multi-class Support Vector Machine (SVM) is used as a classifier to carry out the verification between imposters and customers. The proposed method has been tested on CASIA-3D face database and the experimental results show that our method achieves a high verification performance.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.1 s.173
• /
• pp.240-249
• /
• 2000

An improved global optimization algorithm is developed by extending the domain elimination method. The concept of triangular patch consists of two or more trajectories of local minimizations is introduced to widen the attraction region of the domain elimination method. Using the an-]c between each of three vertices of the patch and a design point, we measure the proximity, between the design point and the patch. With the Gram-Schimidt orthonormalization, this method can be extended to general n-dimensional problems. We code the original domain elimination algorithm and a patch-based algorithm. Then we compare the performance of two algorithms. Through the well-known example problems. the algorithm using patch is shown to be superior to the original domain elimination algorithm in view of computational efficiency.

• Journal of Computing Science and Engineering
• /
• v.9 no.3
• /
• pp.134-141
• /
• 2015

In on-demand multimedia streaming systems, streaming techniques are usually combined with proxy caching to obtain better performance. The patch streaming technique has no start-up latency inherent to it, but requires extra bandwidth to deliver the media data in patch streams. This paper proposes a proxy caching technique which aims at reducing the bandwidth cost of the patch streaming technique. The proposed approach determines media prefixes with high patching cost and caches the appropriate media prefix at the proxy/local server. Herein the scheme is evaluated using a synthetically generated media access workload and its performance is compared with that of the popularity and prefix-aware interval caching scheme (the prefix part) and with that of patch streaming with no caching. The bandwidth saving, hit ratio and concurrent number of clients are used to compare the performance, and the proposed scheme is found to perform better for different caching capacities of the proxy server.

• Journal of IKEEE
• /
• v.20 no.2
• /
• pp.136-142
• /
• 2016

This paper presents a non-local means (NLM) denoising algorithm based on a new weighting function using a mixed norm. The fidelity of the difference between an anchor patch and the reference patch in the NLM denoising depends on noise level and local activity. This paper introduces a new weighting function based on a mixed norm type of which the order is determined by noise level and local activity of an anchor patch, so that the performance of the NLM denoising can be enhanced. Experimental results demonstrate the objective and subjective capability of the proposed algorithm. In addition, it was verified that the proposed algorithm can be used to improve the performance of the other $l_2$ norm based non-local means denoising algorithms

• Proceedings of the Korean Society For Composite Materials Conference
• /
• 2000.04a
• /
• pp.89-92
• /
• 2000

In this paper, an effective procedure is presented for the local recovery of displacements and stresses in multilayered composite panels, which incorporate the local refinement using mesh superposition. The mesh superposition method is used to refine the global coarse mesh by superimposing refined mesh to the localized zone of interest without transition zones. The finite element model used is a solid element based on the Hellinger-Reissner variational principle. The a posteriori computation of the through-the-thickness distributions of displacements and stresses is achieved using a predictor-corrector procedure. The procedure utilizes the superconvergent stresses and nodal displacements of the finite element patch. The element patch is generated by locally superimposing a refined local mesh to the coarse global mesh.