• Computational Structural Engineering
• /
• v.8 no.4
• /
• pp.99-106
• /
• 1995

The General conceptual constitution of structural optimization is formulated and the algorithm using the gradient projection method and design sensitivity analysis is discussed. Examples of minimum-weight design for six-story steel plane frame are taken to illustrate the applicability of this algorithm. The advantages of this algorithm such as marginal cost and design sensitivity analysis as well as system analysis are explained.

• Journal of Korean Society of Transportation
• /
• v.18 no.5
• /
• pp.99-107
• /
• 2000

Path-based assignment(PBA) is valuable to dynamic traffic control and routing in integrated ITS framework. As one of widely studied PBA a1gorithms, Gradient Projection(GP) a1gorithm typically fields rapid convergence to a neighborhood of an optimal solution. But once it comes near a solution, it tends to slow down. To overcome this problem, we develop more efficient path-based assignment algorithm by combining Conjugate Gradient method with GP algorithm. It determines more accurate moving direction near a solution in order to gain a significant advantage in speed of convergence. Also this algorithm is applied to the Sioux-Falls network and verified its efficiency. Then we demonstrate that this type of method is very useful in improving speed of convergence in the case of user equilibrium problem.

• Journal of Korean Society of Transportation
• /
• v.18 no.6
• /
• pp.77-88
• /
• 2000

이용자의 경로선택 형태를 모사하는 통행배정모형 결과의 정확도는 교통계획에 상당한 영향을 미친다. 이용자의 경로선택 결정과정에서 가장 중요한 판단기준은 통행시간과 통행요금이다. 그런데 통행요금은 이용자의 경로 거리에 따라 다양한 방식으로 부과되므로, 링크를 분석단위로 하는 기존의 통행배정모형은 현실적인 통행요금 반영이 힘들었고 또한 수요예측 결과를 이용한 다양한 분석에서 제약을 받아 왔다. 본 연구는 이러한 배경에서 경로교통량을 도출할 수 있는 경로기반 통행배정모형을 구축하였고, 또한 경로거리에 따라 결정되는 현실적인 통행요금을 반영할 수 있는 알고리즘을 개발하였다. 경로기반 배정모형에서는 GP(Gradient Projection) 알고리즘을 이용하였고, 계산상의 효율성 제고를 위해 K-최단경로 알고리즘 중 MPS(Minimal Path Search) 알고리즘을 이용하였다. 개발된 배정모형은 현실적인 통행요금을 반영할 수 있으므로 통행배정 결과의 정밀도를 향상시켰을 뿐만 아니라 기존 배정모형에 비해 최적해로의 수렴속도도 개선되는 것으로 나타났다. 본 논문의 배정모형은 경로교통량이 도출되고 통행요금을 반영할 수 있으므로, 통행요금과 통행거리 관계에 따른 목적함수의 규명과 그에 따른 효과척도를 계량화할 수 있다. 따라서 본 모형은 통행배정에서 실재상황을 보다 현실여건에 맞도록 규명할 수 있고, 기존의 제한적인 효과분석의 문제점을 해결할 수 있으므로 그 활용범위가 넓다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1402-1413
• /
• 2004

In non-rigid image registration, the Jacobian determinant of the estimated deformation should be positive everywhere since physical deformations are always invertible. We propose a constrained optimization technique at ensures the positiveness of Jacobian determinant for cubic B-spline based deformation. We derived sufficient conditions for positive Jacobian determinant by bounding the differences of consecutive coefficients. The parameter set that satisfies the conditions is convex; it is the intersection of simple half spaces. We solve the optimization problem using a gradient projection method with Dykstra's cyclic projection algorithm. Analytical results, simulations and experimental results with inhale/exhale CT images with comparison to other methods are presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.66-74
• /
• 1994

Gradient projection (GP) technique is applied for solving the optical routing problem (ORP) in high speed packet switched networks. The ORP minimizing average network packet loss probability is non-convex due to packet losses at intermediate switching nodes and its routing solution cannot be directly sought by the GP algorithm. Thus the non-convex ORP is transformed into a convex problem called the reduced-ORP (R-ORP) for which the GP algorithm can be used to obtain a routing solution. Through simulations, the routing solution of the R-ORP is shown to be a good approximation to that of the original ORP. Theoretical upper bound of difference between two (ORP and R-ORP) routing solutions is also derived.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.4
• /
• pp.414-418
• /
• 2016

In this paper, a hardware architecture of low area gradient magnitude calculator is proposed. For the hardware complexity reduction, the characteristic of orthogonal projection vector and hardware resource sharing technique are applied. The proposed hardware architecture can be implemented without degradation of the gradient magnitude data quality since the proposed hardware is implemented with original algorithm. The FPGA implementation result shows the 15% of logic elements and 38% embedded multiplier savings compared with previous work using Altera Cyclone VI (EP4CE115F29C7N) FPGA and Quartus II v15.0 environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.2
• /
• pp.254-265
• /
• 1994

For solving the optimal routing problem (ORP) in large data networks, and algorithm called the hierarchical aggregation/disaggregation and decomposition/composition gradient project (HAD-GP) algorithm os proposed. As a preliminary work, we improve the performance of the original iterative aggregation/disaggregation GP (IAD-GP) algorithm introduced in [7]. THe A/D concept used in the original IAD-GP algorithm and its modified version naturally fits the hierarchical structure of large data networks and we would expect speed-up in convengence. The proposed HAD-GP algorithm adds a D/C step into the modified IAD-GP algorithm. The HAD-GP algorithm also makes use of the hierarchical-structure topology of large data networks and achieves significant improvement in convergence speed, especially under a distributed environment. The speed-up effects are demonstrated by the numerical implementations comparing the HAD-GP algorithm with the (original and modified) IAD-GP and the ordinary GP (ORD-GP) algorithm.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.2
• /
• pp.141-146
• /
• 2017

In this paper, a gradient magnitude hardware architecture based on hardware folding design method is proposed for low power image feature extraction. For the hardware complexity reduction, the projection vector chracteristic of gradient magnitude is applied. The proposed hardware architecture can be implemented with the small degradation of the gradient magnitude data quality. The FPGA implementation result shows the 41% of logic elements and 62% embedded multiplier savings compared with previous work using Altera Cyclone VI (EP4CE115F29C7N) FPGA and Quartus II v16.0 environment.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.7
• /
• pp.640-645
• /
• 2009

CMA (Constant Modulus Algorithm) is one of the famous algorithms in blind channel equalization. Generally, CMA converges slowly and the speed of convergence is dependent on a step-size in the CMA procedure. Many researches have tried to speed up the convergence speed by applying a variable step-size to CMA. In this paper, we propose a new CMA algorithm with improved convergence performance. The improvement comes from an orthogonal projection of an average error gradient. We show the improvement in simulation results.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.488-491
• /
• 2003

본 논문에서는 실시간 CCD 카메라 입력 영상으로부터 다중 컬러 정보를 이용하여 얼굴 영역을 검출 및 추적하고 기울어진 얼굴을 보정하는 알고리즘을 제안하였다. 제안한 알고리즘은 먼저 획득된 RGB 영상에서 YCbCr컬러 모델과 YIQ컬러 모델로 변환한 후 Cr성분과 I성분을 추출하여 얼굴 피부색을 검출, 얼굴 영역 추출에 사용하였다. 또한 추출된 얼굴 후보 영역에서 수평, 수직 투영(Projection)정보로부터 최종 얼굴 영역으로 검출한 다음 검출된 얼굴 중심 좌표와 이전에 검출된 얼굴 중심 좌표 값을 유클리드언 거리로 얼굴을 추적하였으며 검출된 얼굴로부터 레이블링(Labeling)기법으로 눈 특징자를 검출, 눈의 기울기 각도를 보정함으로써 얼굴 기울기를 보정하였다. 제안한 얼굴 추적 및 기울기 보정 알고리즘을 사용하여 실험한 결과 다중 색상 정보를 사용함으로써 주위환경 변화에 강인하게 실시간 얼굴 영역 김출 및 추적이 가능하였고, 기울어진 얼굴 영상을 자동 보정함으로써 인식에 용이하였다.