• Journal of Computing Science and Engineering
• /
• 제11권3호
• /
• pp.79-91
• /
• 2017

In this paper, the abdominal-deformation measurement scheme is conducted on a shape-flexible mannequin using the DIC technique in a stereo-vision system. Firstly, during the integer-pixel displacement search, a novel fractal dimension based on an adaptive-ellipse subset area is developed to track an integer pixel between the reference and deformed images. Secondly, at the subpixel registration, a new mutual-learning adaptive particle swarm optimization (MLADPSO) algorithm is employed to locate the subpixel precisely. Dynamic adjustments of the particle flight velocities that are according to the deformation extent of each interest point are utilized for enhancing the accuracy of the subpixel registration. A test is performed on the abdominal-deformation measurement of the shape-flexible mannequin. The experiment results indicate that under the guarantee of its measurement accuracy without the cause of any loss, the time-consumption of the proposed scheme is significantly more efficient than that of the conventional method, particularly in the case of a large number of interest points.

• Management Science and Financial Engineering
• /
• 제19권2호
• /
• pp.19-29
• /
• 2013

Refuse collection network design, one of major decision problems in reverse logistics, is the problem of locating collection points and allocating refuses at demand points to the opened collection points. As an extension of the previous models, we consider capacity and maximum allowable distance constraints at each collection point. In particular, the maximum allowable distance constraint is additionally considered to avoid the impractical solutions in which collection points are located too closely. Also, the additional distance constraint represents the physical distance limit between collection and demand points. The objective is to minimize the sum of fixed costs to open collection points and variable costs to transport refuses from demand to collection points. After formulating the problem as an integer programming model, we suggest an optimal branch and bound algorithm that generates all feasible solutions by a simultaneous location and allocation method and curtails the dominated ones using the lower bounds developed using the relaxation technique. Also, due to the limited applications of the optimal algorithm, we suggest two heuristics. To test the performances of the algorithms, computational experiments were done on a number of test instances, and the results are reported.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.639-642
• /
• 2005

Motion Estimation(ME) is an important part of video compression, because it requires a large amount of computation. Half-pixel and quarter-pixel motion estimation allows high video compression rates but it also has high computation complexity. In this paper we suggest a new and efficient motion estimation algorithm for half-pixel and quarter-pixel motion estimation using SAD values. In the method, an integer-pixel motion vector is found and then only three neighboring points of the integer-pixel motion vector is evaluated to find the half-pixel motion vector. The quarter-pixel motion vector is also found by using a similar method. Experimental results of our method shows 20% reduction in computation time, when compared with those of a conventional method, while producing same quality motion vectors.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.172-174
• /
• 2004

This paper proposes an integerized approach to solve PCA(Principal Component Analysis) feature extract procedure mainly used for the face recognition. A simple conversion to integer values has the risk to reduce the precision compared to that of the floating points operations. We integerize the PC variables by normalizing with the maximum of them, and show the efficiency of the proposed scheme by comparing the results to those of the float/double precisions. The integerized scheme is expected to be an efficient way for the real-time implementation of PCA's recognition stage, because integer operator is more desirable than floating point ones. Further research is to find a way to implement face detection and to measure the distances from the stored PCs for the full real-time face recognition.

• 정보처리학회논문지B
• /
• 제12B권2호
• /
• pp.131-136
• /
• 2005

동영상 데이터를 실시간으로 전송하기 위해서는 데이터의 압축이 필수적인데, 이때 움직임 추정 기법을 사용하여 동영상내에 존재하는 중복된 데이터를 제거함으로써 데이터를 압축한다. 일반적으로, 움직임 추정 기법은 정 화소 움직임 벡터 추정과 반 화소 움직임 벡터 추정으로 이루어져 있는데, 블록 정합 기법을 사용하는 정 화소 움직임 벡터 추정을 위하여 많은 기법들이 제안되어 정 화소 움직임 추정에 소요되는 계산량을 줄였지만, 반 화소 보간과 블록 정합 기법을 사용하는 반 화소 움직임 벡터 추정을 위해서 그렇지 않다. 본 논문에서는 많은 계산량을 필요로 하는 반 화소 움직임 추정을 위한 기법을 제안하였는데, 제안된 기법은 정 화소와 반 화소 사이에 존재하는 움직임 벡터들의 상관성을 이용하였다. 실험을 통하여, 제안된 기법과 일반적으로 반 화소 움직임 추정에 사용되는 기법을 비교하였을 경우, 제안된 기법은 움직임 보상 예측된 화질면에 있어서 약 $0.07\~0.69(dB)$정도 저하되었지만, 탄 화소 움직임 벡터 추정의 속도면에 있어서 약 $2.5\~80$배 이상 높은 성능 향상을 보였다.

• 방송공학회논문지
• /
• 제19권5호
• /
• pp.699-712
• /
• 2014

본 논문은 High Efficiency Video Coding (HEVC) GPU 기반 정수화소(integer-pel) 움직임 추정(Motion Estimation)을 고속화하기 위한 적응적인 탐색영역 결정 방법을 제안한다. 적응적인 탐색영역은 Motion Vector Difference (MVD)를 이용하여 결정한다. 먼저, 입력 영상의 MVD를 분석하여 입력 영상을 두 모델로 분류한다. 이후 분류된 각 모델의 MVD 특성에 따라 적응적인 탐색영역을 결정한다. 제안하는 알고리즘을 GPU 기반 정수화소 움직임 추정에 적용하기 위해 움직임 추정의 시작점은 이전 프레임의 Motion Vector (MV)로 결정한다. 위 과정은 CPU에서 이뤄지며, CPU는 움직임 추정의 시작점과 적응적인 탐색영역을 GPU에 전송한다. 이후 GPU는 정수화소 움직임 추정을 병렬로 수행한다. 제안하는 알고리즘은 참조 모델 대비 1.1%의 BD-rate 상승과 전체 부호화 시간의 37.9% 감소 및 951.2배 빠른 정수화소 움직임 추정 수행 시간을 얻는다. 또한, 적응적인 탐색영역이 적용되지 않은 단순 병렬화 알고리즘 대비 57.5%의 정수화소 움직임 추정 시간 감소와 0.6% BD-rate 상승을 얻는다.

• 호남수학학술지
• /
• 제41권3호
• /
• pp.569-579
• /
• 2019

Cusp (parabolic) points in the extended modular group ${\bar{\Gamma}}$ are basically the images of infinity under the group elements. This implies that the cusp points of ${\bar{\Gamma}}$ are just rational numbers and the set of cusp points is $Q_{\infty}=Q{\cup}\{{\infty}\}$.The Farey graph F is the graph whose set of vertices is $Q_{\infty}$ and whose edges join each pair of Farey neighbours. Each rational number x has an integer continued fraction expansion (ICF) $x=[b_1,{\cdots},b_n]$. We get a path from ${\infty}$ to x in F as $<{\infty},C_1,{\cdots},C_n>$ for each ICF. In this study, we investigate relationships between Fibonacci numbers, Farey graph, extended modular group and ICF. Also, we give a computer program that computes the geodesics, block forms and matrix represantations.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2021년도 제64차 하계학술대회논문집 29권2호
• /
• pp.223-224
• /
• 2021

Recently, k-farthest neighbor (kFN) queries have not as much attention as k-nearest neighbor (kNN) queries. Therefore, this study considers moving k-farthest neighbor (MkFN) queries for spatial network databases. Given a positive integer k, a moving query point q, and a set of data points P, MkFN queries can constantly retrieve k data points that are farthest from the query point q. The challenge with processing MkFN queries in spatial networks is to avoid unnecessary or superfluous distance calculations between the query and associated data points. This study proposes a batch processing algorithm, called MOFA, to enable efficient processing of MkFN queries in spatial networks. MOFA aims to avoid dispensable distance computations based on the clustering of both query and data points. Moreover, a time complexity analysis is presented to clarify the effect of the clustering method on the query processing time. Extensive experiments using real-world roadmaps demonstrated the efficiency and scalability of the MOFA when compared with a conventional solution.

• 대한수학회지
• /
• 제33권4호
• /
• pp.801-811
• /
• 1996

Let $Z^d$ denote the set of all d-tuples of integers$(d \geq 1, a positive integer)$. The points in $Z^d$ will be denoted by $\underline{m},\underline{n}$, etc., or sometime, when necessary, more explicitly by $(m_1, m_2, \cdots, m_d)$, $(n_1, n_2, \cdots, n_d)$ etc. $Z^d$ is partially ordered by stipulating $\underline{m} \underline{<}\underline{n} iff m_i \leq n_i$ for each i, $1 \leq i \leq d$.

• 경영과학
• /
• 제12권2호
• /
• pp.63-75
• /
• 1995

The uncapacitated facility location problem considered here is to determine facility location sites, minimizing the total cost of establishing facilities and serving customer demand points which require primary and back-up services. To solve this problem effectively, we propose two things in this study. First, we propose an idea of Benders' decomposition approach as a solution method of the problem. Second, we implement the problem on GAMS. Using GAMS (general Algebraic Modeling System) can utilize an mixed-integer programming solver such as ZOOM/XMP and provide a completely general automated implementation with a proposed solution method.