• Title/Summary/Keyword: 후보지

Search Result 1,357, Processing Time 0.031 seconds

Fast Motion Estimation Algorithm via Optimal Candidate for Each Step (단계별 최적후보를 통한 고속 움직임 예측 알고리즘)

  • Kim, Jong-Nam;Moon, Kwang-Seok
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.18 no.2
    • /
    • pp.62-67
    • /
    • 2017
  • In this paper, we propose a fast motion estimation algorithm which is important in performance of video encoding. Even though so many fast algorithms for motion estimation have been published due to tremendous computational amount of full search algorithm, efforts for reducing computations of motion estimation still remain. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality the same as that of the full search. The proposed algorithm does not calculate block matching error for each candidate directly to find motion vectors but divides the calculation procedure into several steps and calculates partial sum of block errors for candidates with high priority. By doing that, we can find the minimum error point early and get the enhancement of calculation speed by reducing unnecessary computations. The proposed algorithm uses smaller computations than conventional fast search algorithms with the same prediction quality as the full search algorithm.

  • PDF

Mobile Phone Camera Based Scene Text Detection Using Edge and Color Quantization (에지 및 컬러 양자화를 이용한 모바일 폰 카메라 기반장면 텍스트 검출)

  • Park, Jong-Cheon;Lee, Keun-Wang
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.3
    • /
    • pp.847-852
    • /
    • 2010
  • Text in natural images has a various and important feature of image. Therefore, to detect text and extraction of text, recognizing it is a studied as an important research area. Lately, many applications of various fields is being developed based on mobile phone camera technology. Detecting edge component form gray-scale image and detect an boundary of text regions by local standard deviation and get an connected components using Euclidean distance of RGB color space. Labeling the detected edges and connected component and get bounding boxes each regions. Candidate of text achieved with heuristic rule of text. Detected candidate text regions was merged for generation for one candidate text region, then text region detected with verifying candidate text region using ectilarity characterization of adjacency and ectilarity between candidate text regions. Experctental results, We improved text region detection rate using completentary of edge and color connected component.

A machine learning model for the derivation of major molecular descriptor using candidate drug information of diabetes treatment (당뇨병 치료제 후보약물 정보를 이용한 기계 학습 모델과 주요 분자표현자 도출)

  • Namgoong, Youn;Kim, Chang Ouk;Lee, Chang Joon
    • Journal of the Korea Convergence Society
    • /
    • v.10 no.3
    • /
    • pp.23-30
    • /
    • 2019
  • The purpose of this study is to find out the structure of the substance that affects antidiabetic using the candidate drug information for diabetes treatment. A quantitative structure activity relationship model based on machine learning method was constructed and major molecular descriptors were determined for each experimental data variables from coefficient values using a partial least squares algorithm. The results of the analysis of the molecular access system fingerprint data reflecting the candidate drug structure information were higher than those of the in vitro data analysis in terms of goodness-of-fit, and the major molecular expression factors affecting the antidiabetic effect were also variously derived. If the proposed method is applied to the new drug development environment, it is possible to reduce the cost for conducting candidate screening experiment and to shorten the search time for new drug development.

Fast Motion Estimation Algorithm Using Early Detection of Optimal Candidates with Priority and a Threshold (우선순위와 문턱치를 가지고 최적 후보 조기 검출을 사용하는 고속 움직임 예측 알고리즘)

  • Kim, Jong-Nam
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.21 no.2
    • /
    • pp.55-60
    • /
    • 2020
  • In this paper, we propose a fast block matching algorithm of motion estimation using early detection of optimal candidate with high priority and a threshold. Even though so many fast algorithms for motion estimation have been published to reduce computational reduction full search algorithm, still so many works to improve performance of motion estimation are being reported. The proposed algorithm calculates block matching error for each candidate with high priority from previous partial matching error. The proposed algorithm can be applied additionally to most of conventional fast block matching algorithms for more speed up. By doing that, we can find the minimum error point early and get speed up by reducing unnecessary computations of impossible candidates. The proposed algorithm uses smaller computation than conventional fast full search algorithms with the same prediction quality as the full search algorithm. Experimental results shows that the proposed algorithm reduces 30~70% compared with the computation of the PDE and full search algorithms without any degradation of prediction quality and further reduces it with other fast lossy algorithms.

Edge Detection using Cost Minimization Method (비용 최소화 방법을 이용한 모서리 감지)

  • Lee, Dong-Woo;Lee, Seong-Hoon
    • Journal of Internet of Things and Convergence
    • /
    • v.8 no.1
    • /
    • pp.59-64
    • /
    • 2022
  • Existing edge discovery techniques only found edges of defined shapes based on precise definitions of edges. Therefore, there are many limitations in finding edges for images of complex and diverse shapes that exist in the real world. A method for solving these problems and discovering various types of edges is a cost minimization method. In this method, the cost function and cost factor are defined and used. This cost function calculates the cost of the candidate edge model generated according to the candidate edge generation strategy. If a satisfactory result is obtained, the corresponding candidate edge model becomes the edge for the image. In this study, a new candidate edge generation strategy was proposed to discover edges for images of more diverse shapes in order to improve the disadvantage of only finding edges of a defined shape, which is a problem of the cost minimization method. In addition, the contents of improvement were confirmed through a simple simulation that reflected these points.

Character Region Detection in Natural Image Using Edge and Connected Component by Morphological Reconstruction (에지 및 형태학적 재구성에 의한 연결요소를 이용한 자연영상의 문자영역 검출)

  • Gwon, Gyo-Hyeon;Park, Jong-Cheon;Jun, Byoung-Min
    • Journal of Korea Entertainment Industry Association
    • /
    • v.5 no.1
    • /
    • pp.127-133
    • /
    • 2011
  • Characters in natural image are an important information with various context. Previous work of character region detection algorithms is not detect of character region in case of image complexity and the surrounding lighting, similar background to character, so this paper propose an method of character region detection in natural image using edge and connected component by morphological reconstructions. Firstly, we detect edge using Canny-edge detector and connected component with local min/max value by morphological reconstructed-operation in gray-scale image, and labeling each of detected connected component elements. lastly, detected candidate of text regions was merged for generation for one candidate text region, Final text region detected by checking the similarity and adjacency of neighbor of text candidate individual character. As the results of experiments, proposed algorithm improved the correctness of character regions detection using edge and connected components.

Small Target Detection using Morphology and Gaussian Distance Function in Infrared Images (적외선 영상에서 모폴로지와 가우시안 거리함수를 이용한 소형표적 검출)

  • Park, Jun-Jae;Ahn, Sang-Ho;Kim, Jong-Ho;Kim, Sang-Kyoon
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.17 no.4
    • /
    • pp.61-70
    • /
    • 2012
  • We propose a method that finds candidate targets based on morphology and detects a small target from them using modified gaussian distance function. The existing small target detection methods use predictive filters or morphology. The methods using predictive filters take long to approach least errors. The methods using morphology are weak at clutters and need to consider size of a small target when selecting size of structure elements. We propose a robust method for small target detection to complete the existing methods. First, the proposed method deletes clutters using a median filter. Next, it does closing and opening operation using various size of structure elements, and figures target candidate pixels with subtraction operation between the results of closing and opening operation. It detects an exact small target using a gaussian distance function from the candidates target areas. The proposed method is less sensitive to clutters, and shows a detection rate of 98%.

A Study on Optimal Site Selection for Automatic Mountain Meteorology Observation System (AMOS): the Case of Honam and Jeju Areas (최적의 산악기상관측망 적정위치 선정 연구 - 호남·제주 권역을 대상으로)

  • Yoon, Sukhee;Won, Myoungsoo;Jang, Keunchang
    • Korean Journal of Agricultural and Forest Meteorology
    • /
    • v.18 no.4
    • /
    • pp.208-220
    • /
    • 2016
  • Automatic Mountain Meteorology Observation System (AMOS) is an important ingredient for several climatological and forest disaster prediction studies. In this study, we select the optimal sites for AMOS in the mountain areas of Honam and Jeju in order to prevent forest disasters such as forest fires and landslides. So, this study used spatial dataset such as national forest map, forest roads, hiking trails and 30m DEM(Digital Elevation Model) as well as forest risk map(forest fire and landslide), national AWS information to extract optimal site selection of AMOS. Technical methods for optimal site selection of the AMOS was the firstly used multifractal model, IDW interpolation, spatial redundancy for 2.5km AWS buffering analysis, and 200m buffering analysis by using ArcGIS. Secondly, optimal sites selected by spatial analysis were estimated site accessibility, observatory environment of solar power and wireless communication through field survey. The threshold score for the final selection of the sites have to be higher than 70 points in the field assessment. In the result, a total of 159 polygons in national forest map were extracted by the spatial analysis and a total of 64 secondary candidate sites were selected for the ridge and the top of the area using Google Earth. Finally, a total of 26 optimal sites were selected by quantitative assessment based on field survey. Our selection criteria will serve for the establishment of the AMOS network for the best observations of weather conditions in the national forests. The effective observation network may enhance the mountain weather observations, which leads to accurate prediction of forest disasters.

Studies on the Physico-chemical Properties of Vitrified Forms of the Low- and Intermediate-level Radioactive Waste (${\cdot}$저준위 방사성폐기물 유리고화체의 물리${\cdot}$화학적 특성 연구)

  • Kim, Cheon-Woo;Park, Byoung-Chul;Kim, Hyang-Mi;Kim, Tae-Wook;Choi, Kwan-Sik;Park, Jong-Kil;Shin, Sang-Woon;Song, Myung-Jae
    • Journal of the Korean Ceramic Society
    • /
    • v.38 no.9
    • /
    • pp.839-845
    • /
    • 2001
  • In order to vitrify the Ion-Exchange Resin(IER), Dry Active Waste(DAW), and borate concentrate generated from the commercial nuclear facilities, the glass formulation study based on the their compositions was performed. Two glasses named as RG-1 and DG-1 were formulated as the candidate glasses for the vitrification of hte IER and DAW, respectively. A glass named as MG-1 was also formulated as a candidate glass for the vitrification of the mixed wastes containing the IER, DAW, and borate concentrate. The process parameters, product qualities, and economics were evaluated for the candidate glasses and confirmed experimentally for the some properties. The glass viscosity and electrical conductivity as the process parameters were in the desired ranges. the product qualities such as glass density, chemical durability, phase stability, etc. were satisfactory. In case of vitrifying the wastes using our developed glass formulation study, the volume reduction factors for the IER, DAW and mixed wastes were evaluated as 21, 89 and 75, respectively.

  • PDF

A Problematic Bubble Detection Algorithm for Conformal Coated PCB Using Convolutional Neural Networks (합성곱 신경망을 이용한 컨포멀 코팅 PCB에 발생한 문제성 기포 검출 알고리즘)

  • Lee, Dong Hee;Cho, SungRyung;Jung, Kyeong-Hoon;Kang, Dong Wook
    • Journal of Broadcast Engineering
    • /
    • v.26 no.4
    • /
    • pp.409-418
    • /
    • 2021
  • Conformal coating is a technology that protects PCB(Printed Circuit Board) and minimizes PCB failures. Since the defects in the coating are linked to failure of the PCB, the coating surface is examined for air bubbles to satisfy the successful conditions of the conformal coating. In this paper, we propose an algorithm for detecting problematic bubbles in high-risk groups by applying image signal processing. The algorithm consists of finding candidates for problematic bubbles and verifying candidates. Bubbles do not appear in visible light images, but can be visually distinguished from UV(Ultra Violet) light sources. In particular the center of the problematic bubble is dark in brightness and the border is high in brightness. In the paper, these brightness characteristics are called valley and mountain features, and the areas where both characteristics appear at the same time are candidates for problematic bubbles. However, it is necessary to verify candidates because there may be candidates who are not bubbles. In the candidate verification phase, we used convolutional neural network models, and ResNet performed best compared to other models. The algorithms presented in this paper showed the performance of precision 0.805, recall 0.763, and f1-score 0.767, and these results show sufficient potential for bubble test automation.