• Proceedings of the Korea Concrete Institute Conference
• /
• 2000.10a
• /
• pp.253-258
• /
• 2000

Recently, the area of design optimization, especially structural optimization, has been and to be a continuous active area of research. And the design optimizations of port facilities have been achieved by many other civil engineers. But the design optimization of port facilities were limited to the design optimization of the breasting dolphin. This paper invested the design optimization of mooring pier and the foundations of mooring pier was suggested considering the convenience of repair and reinforcement work. The mooring pier devised with prestressed precast concrete panel and rigid frame welded wide flange beam to steel pipe pile. To accomplish the design optimization of mooring pier, the Augmented Lagrangian Multiplier Method(ALM) of ADS(Garret N. Vanderplaats) optimization routine, BFGS method as optimizer and Golden Section Method as one dimensional search were utilized. As a result, thirty percent of material cost for construction was reduced by design optimization. The tensile stress of concrete panel and bottom flage was critical constraints under service load. So, using high strength concrete and steel will be economical. And lots of initial values must be invested to accomplish the design optimization in design procedures.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.6
• /
• pp.740-747
• /
• 2012

An Active Electronically Scanned Array(AESA) radar required necessarily as the Fire Control Radar(FCR) of recent fighters has ununiform detection range with regard to scan angle due to scan loss. Although the compensation method of scan loss in an AESA radar with variable dwell time is investigated, the effectiveness of the method in a fighter FCR with multi-function such as search, track, and missile guidance within limited resources should be considered systematically. In this paper, uniform search performance of an AESA radar using variable dwell time with regard to scan angle is derived. We assumed the search load of 50 % for case without changing dwell time in fixed frame time and showed the fighter FCR requirement for multi-function is not satisfied because the search load for the uniform search performance should be increased by about 100 %. On the other hand, in case of increasing the frame time for the uniform search performance and search load of 50 %, degradation of the search performance is shown by 86.7 % compared with the former. Based on these analyses, the effective beam operation strategy on an airborne AESA radar with uniform search performance in whole scan area is described with consideration of frame time, search load and performance as a whole.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.112-115
• /
• 2009

PI code searching method of RDS(Radio Data System) are unique method of maintain desired channel on moving machine like vehicle. Efficient and fast PI code search method are researching on the all of RDS related systems for both find more better channel before Original channel signal go to bad and find desired good signal quickly when get out of Weak signal Area. But Embedded system has limited environment like memory size, so It is very difficult to apply many well known PI code searching method. This thesis suggests simple and effective method of searching PI code, considering a Embedded System Environment.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.65-74
• /
• 2021

Digital image processing and retrieving have increasingly become very popular on the Internet and getting more attention from various multimedia fields. That results in additional privacy requirements placed on efficient image matching techniques in various applications. Hence, several searching methods have been developed when confidential images are used in image matching between pairs of security agencies, most of these search methods either limited by its cost or precision. This study proposes a secure and efficient method that preserves image privacy and confidentially between two communicating parties. To retrieve an image, feature vector is extracted from the given query image, and then the similarities with the stored database images features vector are calculated to retrieve the matched images based on an indexing scheme and matching strategy. We used a secure content-based image retrieval features detector algorithm called Speeded-Up Robust Features (SURF) algorithm over public cloud to extract the features and the Honey Encryption algorithm. The purpose of using the encrypted images database is to provide an accurate searching through encrypted documents without needing decryption. Progress in this area helps protect the privacy of sensitive data stored on the cloud. The experimental results (conducted on a well-known image-set) show that the performance of the proposed methodology achieved a noticeable enhancement level in terms of precision, recall, F-Measure, and execution time.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 1998.06a
• /
• pp.521-525
• /
• 1998

In this paper, we propose a fast algorithm for fractal image coding to shorten long time to take on fractal image encoding. For its performance evaluation, the algorithm compares with other traditional fractal coding methods. In the traditional fractal image coding methods, an original image is contracted by a factor in order to make an image to be matched. Then, the whole area of the contracted image is searched in order to find contractive transformation point of the original image corresponding to the contacted image. It needs a lot of searching time on encoding and remains limitation in the improvement of compression ratio. However, the proposed algorithm not only considerably reduces encoding tin e by using scaling method and limited search area method but also improves compression ratio by using bit-plane. When comparing the proposed algorithm with Jacquin's method, the proposed algorithm provides much shorter encoding time and better compression ratio with a little degradation of the decoded image quality than Jacquin's method.

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.311-315
• /
• 1987

In this paper an efficient algorithm to estimate the volume and surface area and the reconstruction algorithm for 3-dimensional graphics are presented. The graph theory is used to estimate the optimal quantitative factors. To improve the computing efficiency, the algorithm to get proper contour points is performed by applying several tolerances. The search and the given arc cost is limited according to the change of curvature of the cross-sectional contour. For mathematical model, these algorithms for volume estimation based on polyhedral approximation are applied to the selected optimal surface. The results show that the values of the volume and surface area for tolerances 1.0005, 1.001 and 1.002 approximate to values for tolerances 1.000 resulting in small errors. The reconstructed three-dimensional images are sparse and consist of larger triangular tiles between two cross sections as tolerance is increasing.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.591-595
• /
• 2010

In this paper, a method that dynamically adapts the traffic flow of automated guided vehicles (AGVs) used in automated container terminals to the changing operational condition is presented. In a container terminal, the AGVs are vulnerable to traffic congestion because a large number of AGVs operate in a limited area. In addition, dynamically changing operational condition requires the traffic flow of AGVs to be continuously adjusted to keep up with the change. The proposed method utilizes a genetic algorithm to optimize the traffic flow. Exploiting the dynamic nature of the problem an approach that reuses the results of the previous search is tried to speed up the convergence of the genetic algorithm. The results of simulation experiments show the efficiency of the proposed method.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1317-1328
• /
• 1996

In this paper, we propose a fast image coding algorithm to shorten long time to take on fractal image encoding. For its Performance evaluation, the algorithm compares with other traditional fractal coding methods. In the traditional fractal image coding methods, an original image is contracted by a factor in order to make the corresponding image to be compared with. Them, the whole area of the contracted image is searched in order to find the fixed point of contractive transformation of the orignal image corresponding to the contracted image. It needs a lot of searching time on encoding However, the proposed algorithm considerable reduces encoding time by using scaling method and limited search area method. On comparison of the proposed algorithm with Joaquin's method, the proposed algorithm is at least 180 times as fast as that of Jacquin's method on encoding time with a little degradation of the decoded image quality and a little increase of the compression rate. There-for, it is found that the proposed algorithm largely improves the performance in the aspect of encoding time when compared with other fractal image coding methods.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.2
• /
• pp.55-62
• /
• 2019

The stereo geometry establishment based on the precise sensor modeling is prerequisite for accurate stereo data processing. Ground control points are generally required for the accurate sensor modeling though it is not possible over the area where the accessibility is limited or reference data is not available. For the areas, the relative orientation should be carried out to improve the geometric consistency between the stereo data though it does not improve the absolute positional accuracy. The relative orientation requires conjugate points that are well distributed over the entire image region. Therefore the automatic conjugate point extraction is required because the manual operation is labor-intensive. In this study, we applied the method consisting of the key point extraction, the search space minimization based on the epipolar line, and the rigorous outlier detection based on the RPCs (Rational Polynomial Coefficients) bias compensation modeling. We tested different parameters of window sizes for Kompsat-2 across track stereo data and analyzed the RPCs precision after the bias compensation for the cases whether the epipolar line information is used or not. The experimental results showed that matching outliers were inevitable for the different matching parameterization but they were successfully detected and removed with the rigorous method for sub-pixel level of stereo RPCs precision.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.1
• /
• pp.114-122
• /
• 2011

In this paper, we have identified the system instability factors in a bistatic radar system using pulse chasing and considered their effects on the bistatic receiver's MTI(Moving Target Indication) improvement performance. The pulse chasing is a method to efficiently scan a restricted search area within the limited transmitter power and time in a bistatic radar and to track a series of transmitted pulses using the receiver beam which has ideally matched to the pulse propagation rate. In this paper, we have discussed the interrelationship between the pulse chasing and time and frequency/phase synchronization and described the effects of the identified system instability factors on two kinds of MTI filter configuration, single delay-line and double delay-line, in the bistatic radar. And also, we have confirmed that the overall system improvement is restricted by a lower improvement factor among identified them, and discussed the allowable tolerance of the time and frequency/phase synchronization in the bistatic system.