• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.135-143
• /
• 2012

This paper suggests the optimal blood distribution center algorithm that satisfies the minimum total transportation cost and within the allowable distribution time $T^*$. Zhang and Yang proposes shifting the location of each point that has less than the average distance of two maximum distance points from each point. But they cannot decide the correct facility location because they miscompute the shortest distance. This algorithm computes the shortest distance $l_{ij}$ from one area to another areas. Then we select the $v_i$ area to thecandidate distribution center location such that $_{max}l_{ij}{\leq}L^*$ and the $v_i$ such that $l_{ij}-L^*$ area that locates in ($v_i,v_k$) and ($v_j,v_l$) from $P_{ij}=v_i,v_k,{\cdots},v_l,v_j$ path and satisfies the $_{max}l_{ij}{\leq}L^*$ condition. Finally, we decide the candidate distribution area that has minimum transportation cost to optimal distribution area.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4C
• /
• pp.321-329
• /
• 2008

H.264/AVC video coding standard enables a considerably higher improvement in coding efficiency compared with previous standards such as MPEG-2, H.263 and MPEG-4. To achieve this, for each macro-block in H.264/AVC, Rate-Distortion Optimization (RDO) technique is employed to select the best motion vector, reference frame, and macro-block mode. As a result, computational complexity is increased significantly whereas RDO achieve higher improvement. This paper presents fast intra mode selection algorithm based on constraints of frequency characteristics which are derived from intra coding modes of H.264/AVC. First of all, we observe the features of each intra mode through the frequency analysis of image. And then proposed Frequency Error Costs (FECs) are calculated to select the best mode which has minimum cost. Computational complexity is considerably reduced because rate-distortion costs only calculate the candidate modes which are set of best mode and its neighbouring two modes. Experimental results show that proposed algorithm reduces the complexity dramatically maintaining the rate-distortion performance compared with H.264/AVC reference software.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.4
• /
• pp.13-24
• /
• 2017

This paper presents a sequentially combined method of determining location conditions, the number of unmanned parcel service box and their optimal locations. First of all, block, accessibility and main public facilities are considered as location conditions and then set-covering model and p-median model are adopted for deciding the number of unmanned parcel service box and optimal locations, respectively. A case study for a region composed of small housings and multiplex housings in Ansan is conducted to prove the validation and application of the proposed method. The result indicates that 2 unmanned parcel service boxes are necessary in specific public places. The research contributes to resonable choice of unmanned parcel service boxes, crime reduction relevant to delivery man impersonation and economic benefit due to parcel service industry growth.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.1 s.307
• /
• pp.53-66
• /
• 2006

This paper proposes the combined image retrieval system that gives the same relevance as exhaustive search method while its performance can be considerably improved. This system is combined with two different retrieval methods and each gives the same results that full exhaustive search method does. Both of them are two-stage method. One uses condensation of feature vectors, and the other uses binary-tree clustering. These two methods extract the candidate images that always include correct answers at the first stage, and then filter out the incorrect images at the second stage. Inasmuch as these methods use equal algorithm, they can get the same result as full exhaustive search. The first method condenses the dimension of feature vectors, and it uses these condensed feature vectors to compute similarity of query and images in database. It can be found that there is an optimal condensation ratio which minimizes the overall retrieval time. The optimal ratio is applied to first stage of this method. Binary-tree clustering method, searching with recursive 2-means clustering, classifies each cluster dynamically with the same radius. For preserving relevance, its range of query has to be compensated at first stage. After candidate clusters were selected, final results are retrieved by computing similarities again at second stage. The proposed method is combined with above two methods. Because they are not dependent on each other, combined retrieval system can make a remarkable progress in performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.4
• /
• pp.1-8
• /
• 2010

In this paper, we propose a new gain optimization technique for Sigma-Delta A/D converters. In the proposed scheme, multiple gain set candidates showing maximum SNR in the modulator block are selected, and then multiple gain set candidates are investigated for minimum MSE in decimation block. Through CIC decimation filter simulation, it is shown that second SNR ranking candidate in modulation block is the best gain set.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.1
• /
• pp.69-72
• /
• 2004

Compared to the barcode which is being widely employed to store information on products, the color code may find more various applications because of its favorable appearance and larger possible number of combinations. However, the color values read in practice may suffer from distortions from environments and devices. In this paper, we propose efficient ways to reduce the effect of such distortions and to detect color codes. for which we apply the Right Hand on Wall (RHOW) algorithm originated from the area of the maze search. The color codes used in this paper have high values of Hue and Saturation components and have a circular shape. We first preprocessed the images to detect candidate areas of color codes, and then applied the RHOW algorithm to determine optimal coordinates of rectangles enclosing the areas. As a result, we could obtain accurate coordinates of color codes by using the RHOW algorithm.

• Journal of the Korean Society for Marine Environment & Energy
• /
• v.12 no.3
• /
• pp.124-132
• /
• 2009

The optimal type and discharging position of ocean outfall of wastewater have been determined by hydrodynamic modeling, near-field dilution modeling, and far-field dispersion modeling. Tide and tidal currents have been simulated by a finite element hydrodynamic model showing good agreements with field observations. Based on the hydrodynamic simulation results candidates of ocean outfall position were preliminary determined. Submerged single port and submerged multi-port diffuser were selected as discharging system alternatives and finally designed by considering tide, tidal currents and water depth. Initial dilution of wastewater discharged from the designed ports has been estimated by CORMIX system. A 2-dimensional random-walk dispersion model has been employed to simulate far-field dispersion of discharged wastewater.

• The Journal of the Korea Contents Association
• /
• v.18 no.2
• /
• pp.231-239
• /
• 2018

In this paper, we propose a vanishing point detection method using multiple initial vanishing points. Vanishing points are important geometric information that is used for reconstructing 3D structures. Three vanishing points are detected for indoor scenes. In the previous work, it could be inaccurate to detect only one initial vanishing point, because initial vanishing point getting most highest sum of voting could be deferent from the best initial vanishing point. Therefore the method which sets multiple initial vanishing point and detects a best vanishing point from them gives us preparation for the prior case. Also in this paper, we propose a adjusting vanishing point method by postprocessing of detected vanishing points. We could detect more accurate vanishing point by using postprocessing. Experimental results show that the accuracy of the vanishing point detection is about 1~2% higher than that of the existing method through the proposed method and the performance is improved accordingly.

• Annual Conference on Human and Language Technology
• /
• 2018.10a
• /
• pp.316-320
• /
• 2018

복합명사는 둘 이상의 말이 결합된 명사를 말하며 문장에서 하나의 단어로 간주된다, 그러나 맞춤법 및 띄어쓰기 검사나 정보검색의 색인어 추출, 기계번역의 미등록어 추정 등의 분야에서는 복합명사를 구성하는 개별 단어를 확인할 필요가 있다. 이 과정을 복합명사 분해라고 한다. 복합명사를 분해하는 방법으로 크게 규칙 기반 방법, 통계 기반 방법 등이 있으며 본 논문에서는 규칙을 기반으로 최소한의 통계 정보를 이용하는 방법을 제안한다. 본 논문은 4개의 분해 규칙을 적용하여 분해 후보를 생성하고 분해 후보들 중에 우선순위를 정하여 최적 후보를 선택하는 방법을 제안한다. 기본 단어(명사)로 트라이(trie)를 구축하고 구축된 트라이를 이용하여 양방향 최장일치를 적용하고 음절 쌍의 통계정보를 이용해서 모호성을 제거한다. 성능을 평가하기 위해 70,000여 개의 명사 사전과 음절 쌍 통계정보를 구축하였고, 이를 바탕으로 복합명사를 분해하였으며, 분해 정확도는 단어 구성비를 반영하면 96.63%이다. 제안된 복합명사 분해 방법은 최소한의 데이터를 이용하여 복합명사 분해를 수행하였으며 트라이 자료구조를 사용해서 사전의 크기를 줄이고 사전의 검색 속도를 개선하였다. 그 결과로 임베디드 시스템과 같은 소형 기기의 환경에 적합한 복합명사 분해 시스템을 구현할 수 있었다.

• Journal of Digital Contents Society
• /
• v.3 no.2
• /
• pp.221-233
• /
• 2002

In this paper, we present integer programming models and algorithms for the Capacitated Facility Location-Allocation Problem (CFLP). The models and algorithms can be used for the design of logistics networks and for the location of telecommunication facilities. We are given a set of candidate facility installation sites, one type of facility for each candidate site with its capacity and installation cost, a set of customers with their demand requirement, and flow cost for one unit of demand flow from each customer to each candidate site. (CFLP) is to determine the number of facilities for each candidate site and the set of customers which are connected to each site with minimum cost, while satisfying the demand requirement of each customer and constraints imposed on the allocation of customers to facilities. We present two integer programming models for (CFLP), and devise a branch-and-cut algorithm and a branch-and-price algorithm for the problem.