• 한국정보처리학회논문지
• /
• 제6권10호
• /
• pp.2809-2815
• /
• 1999

Level set, and active contour(snakes) models are extensively used for image segmentation or shape extraction in computer vision. Snakes utilize the energy minimization concepts, and level set is based on the curve evolution in order to extract contours from image data. In general, these two models have their own drawbacks. For instance, snake acts pooly unless it is placed close to the wanted shape boundary, and it has difficult problem when image has multiple objects to be extracted. But, level set method is free of initial curve position problem, and has ability to handle topology of multiple objects. Nevertheless, level set method requires much more calculation time compared to snake model. In this paper, we use good points of two described models and also apply multi resolution algorithm in order to speed up the process without decreasing the performance of the shape extraction.

• Nonlinear Functional Analysis and Applications
• /
• 제26권2호
• /
• pp.411-432
• /
• 2021

In this paper, an inertial Halpern-type forward backward iterative algorithm for approximating solution of a monotone inclusion problem whose solution is also a fixed point of some nonlinear mapping is introduced and studied. Strong convergence theorem is established in a real Hilbert space. Furthermore, our theorem is applied to variational inequality problems, convex minimization problems and image restoration problems. Finally, numerical illustrations are presented to support the main theorem and its applications.

• 디지털융복합연구
• /
• 제11권12호
• /
• pp.345-352
• /
• 2013

본 논문에서는 GPU(Graphics Processing Unit)에서 데이터를 처리할 수 있게 하여 단일 영상에서 효율적으로 깊이를 추정하는 방법을 제안한다. 단일 영상은 카메라의 투영 과정에 의해 깊이 정보가 소실되게 되며 영상에서 소실된 깊이를 추정하기 위해서 단안 단서를 이용한다. 제안하는 깊이 추정 알고리즘은 좀 더 신뢰성 있는 깊이를 추정하고자 여러 단안 단서를 이용하며 에너지 최소화를 통해 단안 단서들을 결합한다. 그러나 여러 단안 단서들을 고려해야하기 때문에 처리해야 할 데이터가 많은 단점이 존재한다. 따라서 GPGPU(General Purpose Graphics Processing Unit)를 통해 데이터를 병렬적으로 처리하게 하여 효율적으로 깊이를 추정하는 방법을 제안한다. 객관적인 효율성을 검증하기 위해 PSNR(Peak Signal to Noise Ratio)을 통해 실험하였으며 GPGPU을 이용함으로써 알고리즘의 수행시간을 평균 61.22% 감소시켰다.

• 전기학회논문지
• /
• 제64권10호
• /
• pp.1508-1516
• /
• 2015

This paper proposes the optimal operation of ESS (Energy Storage System) in the substation of urban railway in an economical point of view. Since the load patterns of urban railway have different characteristics with the general power demand pattern, the characteristics motivate us to develop the optimal operation algorithm for ESS under Korean electricity billing system. We also introduce two different ESS operation strategies for peak load shaving and electricity consumption charge minimization respectively, and formulate each scheme. Historical data from Namgwangju substation are used for economical comparison of the strategies. The results show that the proposed algorithm is the most cost-effective ESS operation scheme among the strategies and reduces around 5 percent of electric charges compared to the charge without ESS operation.

• Journal of Communications and Networks
• /
• 제18권2호
• /
• pp.173-181
• /
• 2016

In this paper, we address a new robust optimization problem in a multiuser multiple-input single-output broadcasting system with simultaneous wireless information and power transmission, where a multi-antenna base station (BS) sends energy and information simultaneously to multiple users equipped with a single antenna. Assuming that perfect channel-state information (CSI) for all channels is not available at the BS, the uncertainty of the CSI is modeled by an Euclidean ball-shaped uncertainty set. To optimally design transmit beamforming weights and receive power splitting, an average total transmit power minimization problem is investigated subject to the individual harvested power constraint and the received signal-to-interference-plus-noise ratio constraint at each user. Due to the channel uncertainty, the original problem becomes a homogeneous quadratically constrained quadratic problem, which is NP-hard. The original design problem is reformulated to a relaxed semidefinite program, and then two different approaches based on convex programming are proposed, which can be solved efficiently by the interior point algorithm. Numerical results are provided to validate the robustness of the proposed algorithms.

• 대한전자공학회논문지SP
• /
• 제44권5호
• /
• pp.54-63
• /
• 2007

본 논문은 영상 완성(image completion)을 위해 계층적으로 적용되는 새로운 에너지 최적화 방식을 제안한다. 영상 완성의 목적은 영상의 특정 영역이 지워진 상태에서, 그 지워진 부분을 나머지 부분과 시각적으로 어울리도록 완성시키는 기법을 말한다. 본 논문에서는 전역적 특징의 탐지, 주변 환경 변화에 대한 유연성, 계산비용의 감소, 영상 인페인팅과 같은 관련기법들로의 확장성 문제들을 다룰 수 있도록 마르코프 랜덤 필드(Markov Random Field)로 모델링 된 예제 기반 방식(exampler-based mehtod) 접근법을 택한다. 그리고 MRF에서의 에너지 최적화를 위해 BP 알고리즘(Belief Propagation Algorithm)의 변형인 우선순위 BP 알고리즘(Priority-Belief Propagation Algorithm)을 적용하였다. 본 논문에서 제안한 계층적 우선순위 BP 알고리즘(Hierarchical Priority-Belief Propagation Algorithm)은 MRF의 정점의 수를 줄이고 메시지를 계층적으로 전파한다. 이렇게 계층적 우선순위 BP 알고리즘을 영상 완성에 적용하여 여러 영상들에서 바람직한 결과를 얻었다.

• Journal of Electrical Engineering and Technology
• /
• 제9권2호
• /
• pp.433-440
• /
• 2014

In this study, a method for the low-carbon active distribution system (ADS) planning is proposed. It takes into account the impacts of both network capacity and demand correlation to the renewable energy accommodation, and incorporates demand response (DR) as an available resource in the ADS planning. The problem is formulated as a mixed integer nonlinear programming model, whereby the optimal allocation of renewable energy sources and the design of DR contract (i.e. payment incentives and default penalties) are determined simultaneously, in order to achieve the minimization of total cost and $CO_2$ emissions subjected to the system constraints. The uncertainties that involved are also considered by using the scenario synthesis method with the improved Taguchi's orthogonal array testing for reducing information redundancy. A novel cuckoo search (CS) is applied for the planning optimization. The case study results confirm the effectiveness and superiority of the proposed method.

• 대한의용생체공학회:의공학회지
• /
• 제32권3호
• /
• pp.237-244
• /
• 2011

In this paper, a feature-based registration technique is proposed for pre-contrast and post-contrast lung CT images. It utilizes three dimensional(3-D) features with their descriptors and estimates feature correspondences by nearest neighborhood matching in the feature space. We design a transformation model between the input image pairs using a free form deformation(FFD) which is based on B-splines. Registration is achieved by minimizing an energy function incorporating the smoothness of FFD and the correspondence information through a non-linear gradient conjugate method. To deal with outliers in feature matching, our energy model integrates a robust estimator which discards outliers effectively by iteratively reducing a radius of confidence in the minimization process. Performance evaluation was carried out in terms of accuracy and efficiency using seven pairs of lung CT images of clinical practice. For a quantitative assessment, a radiologist specialized in thorax manually placed landmarks on each CT image pair. In comparative evaluation to a conventional feature-based registration method, our algorithm showed improved performances in both accuracy and efficiency.

• 한국컴퓨터정보학회논문지
• /
• 제3권1호
• /
• pp.81-94
• /
• 1998

영상에서 관심있는 물체의 윤곽선을 추출하기 위해서 Kass등은 Snakes라고 불리우는 능동적 윤곽선 모델(active contour model)을 제안하였다. Snakes 모델은 내부 에너지,영상 에너지, 외부 에너지라는 에너지 함수를 사용하여 물체의 윤곽선을 정의하는 모델로 이 에너지 함수를 최소화함으로써 물체의 윤곽선을 찾을 수 있다 이 모델은 속도가 느리며초기화에 민감하다. 이 문제를 개선하기 위해 Gunn은 두 개의 초기화를 이용하여 정확한 윤곽선을 추출하고 초기화에 덜 민감하도록 하였다. 이 방법은 기존의 다른 방법에 비해 정확한 윤곽선을 추출할 수 있었으나, 속도면 에서는 상당히 효율적이지 못하고 잡음에 민감하였다. 본 논문에서는 이 문제를 해결하기 위하여 snakes을 이루는 각 윤곽점에 8$\times$8크기의 윈도우를 적용하여 윈도우내의 화소에 대해서만 에너지 최소화 알고리즘을 적용하였다.본 논문에서 제안한 방법은 원 영상과 컵 영상의 윤곽선 추출에 적용하였다. 제안한 방법을사용하여 얼굴을 추적하므로써 가상현실등에 응용되고 물체의 움직임 추적에도 응용될 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권6호
• /
• pp.2546-2566
• /
• 2016

This paper investigates an efficient transmission scheme for the remote wireless sensors to receive information which is rarely discussed in the integrated remote wireless sensor and multibeam satellite networks (IWSMSNs). The networks can be employed to exchange sensing information for emergency scenario, ocean scenario, and so on, which are isolated from available terrestrial networks. As the efficient transmission link is important to the IWSMSNs, we propose a hybrid full frequency (HFF) precoding by taking advantage of frequency reuse and multiple-input multiple-output (MIMO) precoding. Considering energy efficiency and sinks fairness are crucial to transmission link, thus the HFF precoding problems are formulated as transmit power minimization (TPM) and max-min fair (MMF) received signal to interference plus noise ratio (SINR) problems, which can be transformed to indefinite quadratic optimization programs. Then this paper presents a semi-definite programming (SDP) algorithm to solve the problems for the IWSMSNs. The promising potential of HFF for the real IWSMSNs is demonstrated through simulations.