• Title/Summary/Keyword: local energy minimization

Search Result 24, Processing Time 0.025 seconds

Lip Contour Extraction Using Active Shape Model Based on Energy Minimization (에너지 최소화 기반 능동형태 모델을 이용한 입술 윤곽선 추출)

  • Jang, Kyung-Shik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.10
    • /
    • pp.1891-1896
    • /
    • 2006
  • In this paper, we propose an improved Active Shape Model for extracting lip contour. Lip deformation is modeled by a statistically deformable model based Active Shape Model. Because each point is moved independently using local profile information in Active Shape Model, many error may happen. To use a global information, we define an energy function similar to an energy function in Active Contour Model, and points are moved to positions at which the total energy is minimized. The experiments have been performed for many lip images of Tulip 1 database, and show that our method extracts lip shape than a traditional ASM more exactly.

Disparity Estimation using a Region-Dividing Technique and Edge-preserving Regularization (영역 분할 기법과 경계 보존 변이 평활화를 이용한 스테레오 영상의 변이 추정)

  • 김한성;손광훈
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.6
    • /
    • pp.25-32
    • /
    • 2004
  • We propose a hierarchical disparity estimation algorithm with edge-preserving energy-based regularization. Initial disparity vectors are obtained from downsampled stereo images using a feature-based region-dividing disparity estimation technique. Dense disparities are estimated from these initial vectors with shape-adaptive windows in full resolution images. Finally, the vector fields are regularized with the minimization of the energy functional which considers both fidelity and smoothness of the fields. The first two steps provide highly reliable disparity vectors, so that local minimum problem can be avoided in regularization step. The proposed algorithm generates accurate disparity map which is smooth inside objects while preserving its discontinuities in boundaries. Experimental results are presented to illustrate the capabilities of the proposed disparity estimation technique.

A Joint Allocation Algorithm of Computing and Communication Resources Based on Reinforcement Learning in MEC System

  • Liu, Qinghua;Li, Qingping
    • Journal of Information Processing Systems
    • /
    • v.17 no.4
    • /
    • pp.721-736
    • /
    • 2021
  • For the mobile edge computing (MEC) system supporting dense network, a joint allocation algorithm of computing and communication resources based on reinforcement learning is proposed. The energy consumption of task execution is defined as the maximum energy consumption of each user's task execution in the system. Considering the constraints of task unloading, power allocation, transmission rate and calculation resource allocation, the problem of joint task unloading and resource allocation is modeled as a problem of maximum task execution energy consumption minimization. As a mixed integer nonlinear programming problem, it is difficult to be directly solve by traditional optimization methods. This paper uses reinforcement learning algorithm to solve this problem. Then, the Markov decision-making process and the theoretical basis of reinforcement learning are introduced to provide a theoretical basis for the algorithm simulation experiment. Based on the algorithm of reinforcement learning and joint allocation of communication resources, the joint optimization of data task unloading and power control strategy is carried out for each terminal device, and the local computing model and task unloading model are built. The simulation results show that the total task computation cost of the proposed algorithm is 5%-10% less than that of the two comparison algorithms under the same task input. At the same time, the total task computation cost of the proposed algorithm is more than 5% less than that of the two new comparison algorithms.

Detection of Pulmonary Region in Medical Images through Improved Active Control Model

  • Kwon Yong-Jun;Won Chul-Ho;Kim Dong-Hun;Kim Pil-Un;Park Il-Yong;Park Hee-Jun;Lee Jyung-Hyun;Kim Myoung-Nam;Cho Jin-HO
    • Journal of Biomedical Engineering Research
    • /
    • v.26 no.6
    • /
    • pp.357-363
    • /
    • 2005
  • Active contour models have been extensively used to segment, match, and track objects of interest in computer vision and image processing applications, particularly to locate object boundaries. With conventional methods an object boundary can be extracted by controlling the internal energy and external energy based on energy minimization. However, this still leaves a number of problems, such as initialization and poor convergence in concave regions. In particular, a contour is unable to enter a concave region based on the stretching and bending characteristic of the internal energy. Therefore, this study proposes a method that controls the internal energy by moving the local perpendicular bisector point of each control point on the contour, and determines the object boundary by minimizing the energy relative to the external energy. Convergence at a concave region can then be effectively implemented as regards the feature of interest using the internal energy, plus several objects can be detected using a multi-detection method based on the initial contour. The proposed method is compared with other conventional methods through objective validation and subjective consideration. As a result, it is anticipated that the proposed method can be efficiently applied to the detection of the pulmonary parenchyma region in medical images.

A study on the Design Expression of the Boundary surfaces and Environment-friendly characteristics in contemporary Housing (현대 집합주택 내외부 경계 표현방식과 친환경적 특성에 관한 연구)

  • Lee, Dong-Ki
    • Proceeding of Spring/Autumn Annual Conference of KHA
    • /
    • 2009.04a
    • /
    • pp.253-257
    • /
    • 2009
  • Along with emergence of recent issues such as 'minimization of energy consumption' and 'natural environment and human health' amid the flow of requirements for nature-friendly architecture, attempts for boundary, which has a variety of possibilities as the intermediate territory between interior and exterior space of the architecture, have been pursued actively. On the ground of close relationships between urban area and architecture in a modern society, the boundary between interior and exterior is being exhibited in a wide variety of way of expressions, not as a single plane any longer. In line with this, researcher analyzed interior and exterior boundary according to its type targeting modern housing complex in Europe, and also investigated characteristics thereof. And, having provided the results as basic materials in order to seek amenity of local apartment houses and diversification of housing plan as well, the researcher intends to be of a help to bring physical changes in both building and exterior design, and also to give a new meaning in an environment-friendly aspect.

  • PDF

Characteristics of solutions in softening plasticity and path criterion

  • Chen, G.;Baker, G.
    • Structural Engineering and Mechanics
    • /
    • v.16 no.2
    • /
    • pp.141-152
    • /
    • 2003
  • Characteristics of solutions of softening plasticity are discussed in this article. The localized and non-localized solutions are obtained for a three-bar truss and their stability is evaluated with the aid of the second-order work. Beyond the bifurcation point, the single stable loading path splits into several post-bifurcation paths and the second-order work exhibits several competing minima. Among the multiple post-bifurcation equilibrium states, the localized solutions correspond to the minimum points of the second-order work, while the non-localized solutions correspond to the saddles and local maximum points. To determine the real post-bifurcation path, it is proposed that the structure should follow the path corresponding to the absolute minimum point of the second-order work. The proposal is further proved equivalent to Bazant's path criterion derived on a thermodynamics basis.

Memory-Efficient Belief Propagation for Stereo Matching on GPU (GPU 에서의 고속 스테레오 정합을 위한 메모리 효율적인 Belief Propagation)

  • Choi, Young-Kyu;Williem, Williem;Park, In Kyu
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2012.11a
    • /
    • pp.52-53
    • /
    • 2012
  • Belief propagation (BP) is a commonly used global energy minimization algorithm for solving stereo matching problem in 3D reconstruction. However, it requires large memory bandwidth and data size. In this paper, we propose a novel memory-efficient algorithm of BP in stereo matching on the Graphics Processing Units (GPU). The data size and transfer bandwidth are significantly reduced by storing only a part of the whole message. In order to maintain the accuracy of the matching result, the local messages are reconstructed using shared memory available in GPU. Experimental result shows that there is almost an order of reduction in the global memory consumption, and 21 to 46% saving in memory bandwidth when compared to the conventional algorithm. The implementation result on a recent GPU shows that we can obtain 22.8 times speedup in execution time compared to the execution on CPU.

  • PDF

공조 시스템용 DDC의 온라인 최적제어에 관한 연구

  • 안병천
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.13 no.11
    • /
    • pp.1072-1078
    • /
    • 2001
  • The real time optimal control algorithm of the DDC controller for chilled water and supply air temperature set-point of heating, ventilating, air-conditioning and refrigeration systems has been researched for minimization of the total power which is consumed by the chiller, chilled water pump and air handing unit fan. The study has been done by using TRNSYS program in order to analyze the central cooling system in terms of the environmental variables such as indoor cooling lead and wet-bulb temperature. This optimal control alogorithm saves more energy and is suitable for real time on-line control in comparison with conventional method.

  • PDF

A Shaking Snake for Contour Extraction of an Object (물체의 윤곽선 추출을 위한 진동 스네이크)

  • Yoon, Jin-Sung;Kim, Kwan-Jung;Kim, Gye-Young;Paik, Doo-Won
    • The KIPS Transactions:PartB
    • /
    • v.10B no.5
    • /
    • pp.527-534
    • /
    • 2003
  • An active contour model called snake is powerful tool for object contour extraction. But, conventional snakes require exhaustive computing time, sometimes can´t extract complex shape contours due to the properties of energy function, and are also heavily dependent on the position and the shape of an initial snake. To solving these problems, we propose in this paper an improved snake called "shaking snake", based on a greedy algorithm. A shaking snake consist of two steps. According to their appropriateness, we in the first step move each points directly to locations where contours are likely to be located. In the second step, we then align some snake points with a tolerable bound in order to prevent local minima. These processes shake the proposed snake. In the experimental results, we show the process of shaking the proposed shake and comparable performance with a greedy snake. The proposed snake can extract complex shape contours very accurately and run fast, approximately by the factor of five times, than a greedy snake.

Parallel Genetic Algorithm-Tabu Search Using PC Cluster System for Optimal Reconfiguration of Distribution Systems

  • Mun Kyeong-Jun;Lee Hwa-Seok;Park June-Ho
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.2
    • /
    • pp.116-124
    • /
    • 2005
  • This paper presents an application of the parallel Genetic Algorithm-Tabu Search (GA- TS) algorithm, and that is to search for an optimal solution of a reconfiguration in distribution systems. The aim of the reconfiguration of distribution systems is to determine the appropriate switch position to be opened for loss minimization in radial distribution systems, which is a discrete optimization problem. This problem has many constraints and it is very difficult to solve the optimal switch position because of its numerous local minima. This paper develops a parallel GA- TS algorithm for the reconfiguration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solution of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper 10$\%$ of the population to enhance the local searching capabilities. With migration operation, the best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC-cluster system consisting of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based rapid Ethernet. To demonstrate the usefulness of the proposed method, the developed algorithm was tested and is compared to a distribution system in the reference paper From the simulation results, we can find that the proposed algorithm is efficient and robust for the reconfiguration of distribution system in terms of the solution quality, speedup, efficiency, and computation time.