• Title/Summary/Keyword: D-Optimal 방법

Search Result 569, Processing Time 0.025 seconds

Estimation of optimal position of a mobile robot using object recognition and hybrid thinning method (3차원 물체인식과 하이브리드 세선화 기법을 이용한 이동로봇의 최적위치 추정)

  • Lee, Woo-Jin;Yun, Sang-Seok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.6
    • /
    • pp.785-791
    • /
    • 2021
  • In this paper, we propose a methodology for estimating the optimal traversable destination from the location-based information of the object recognized by the mobile robot to perform the object delivery service. The location estimation process is to apply the generalized Voronoi graph to the grid map to create an initial topology map composed of nodes and links, recognize objects and extract location data using RGB-D sensors, and collect the shape and distance information of obstacles. Then, by applying the hybrid approach that combines the center of gravity and thinning method, the optimal moving position for the service robot to perform the task of grabbing is estimated. And then, the optimal node information for the robot's work destination is updated by comparing the geometric distance between the estimated position and the existing node according to the node update rule.

Image Coding using Conditional Entropy Constrained Vector Quantization (조건부 엔트로피 제한 벡터 양자화를 이용한 영상 부호화)

  • Lee, Seung-Jun;Seo, Yong-Chang;Lee, Choong-Woong
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.11
    • /
    • pp.88-96
    • /
    • 1994
  • This paper proposes a new vector quantization scheme which exploits high correlations among indexes in vector quantization. An optimal vector quantizer in the rate-distortion sense can be obtained, if it is designed so that the average distortion can be minimized under the constraint of the conditional entropy of indes, which is usually much smaller than the entropy of index due to the high correlations among indexes of neighboring vectors. The oprimization process is very similar to that in ECVQ(entropy-constrained vector quanization) except that in the proposed scheme the Viterbi algorithm is introduced to find the optimal index sequence. Simulations show that at the same bitrate the proposed method provides higher PSNR by 1.0~3.0 dB than the conventional ECVQ when applied to image coding.

  • PDF

Simulation Analysis to Optimize the Management of Military Maintenance Facility (군 정비시설 운용 최적화를 위한 시뮬레이션 분석 연구)

  • Kim, Kyung-Rok;Rhee, Jong-Moon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.5
    • /
    • pp.2724-2731
    • /
    • 2014
  • As the future national defense plan of government focus on advanced weapon system, military maintenance facility becomes more important. However, military maintenance facility has been managed by director's experience and simple mathematical calculation until now. Thus, the optimization for the management of military maintenance facility is suggested by more scientistic and logical methods in this study. The study follows the procedure below. First, simulation is designed according to the analysis of military maintenance facility. Second, independent variable and dependent variable are defined for optimization. Independent Variable includes the number of maintenance machine, transportation machine, worker in the details of military maintenance facility operation, and dependent variable involves total maintenance time affected by independent variable. Third, warmup analysis is performed to get warmup period, based on the simulation model. Fourth, the optimal combination is computed with evolution strategy, meta-heuristic, to enhance military maintenance management. By the optimal combination, the management of military maintenance facility can gain the biggest effect against the limited cost. In the future, the multipurpose study, to analyze the military maintenance facility covering various weapon system equipments, will be performed.

A Path Generation Method Considering the Work Behavior of Operators for an Intelligent Excavator (운전자의 작업행태를 고려한 지능형 굴삭기의 이동경로 생성 방법)

  • Kim, Sung-Keun;Koo, Bonsang
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.30 no.4D
    • /
    • pp.433-442
    • /
    • 2010
  • Recent decrease in the availability of experienced skilled labor and a corresponding lack of new entrants has required the need for automating many of the construction equipment used in the construction industry. In particular, excavators are widely used throughout earthwork operations and automating its tasks enables work to be performed with higher productivity and safety. This paper introduces an optimal path generation method which is one of the core technologies required to make "Intelligent" excavators a reality. The method divides a given earthwork area into unit cells, identifies networks created by linking these cells, and identifies the optimal path an excavator should follow to minimize its total transportation costs. In addition, the method also accounts for drainage direction and path continuity to ensure that the generated path considers site specific conditions.

Adaptive rate control for video communication (동영상 통신을 위한 적응 비트율 제어)

  • 김학수;정연식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.9A
    • /
    • pp.1383-1391
    • /
    • 1999
  • This paper presents a rate control method that minimizes global distortion under given target bit rates for video communication. This method makes the quality of reconstructed images better than that of the conventional ones based on R-D model at the same bit rates. Given a set of quantizers, a sequence of macroblocks to be quantized selects the optimal quantizer for each macroblock so that the total cost measure is minimized and the finite buffer is never in overflow. To solve this problem we provide a heuristic algorithm based on Lagrangian optimization using an operational rate-distortion framework and a quantization method follows H.263recommendation.

  • PDF

An Improved Split Algorithm for Indexing of Moving Object Trajectories (이동 객체 궤적의 색인을 위한 개선된 분할 알고리즘)

  • Jeon, Hyun-Jun;Park, Ju-Hyun;Park, Hee-Suk;Cho, Woo-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.16D no.2
    • /
    • pp.161-168
    • /
    • 2009
  • Recently, use of various position base servicesthat collect position information for moving object and utilize in real life is increasing by the development of wireless network technology. Accordingly, new index structures are required to efficiently retrieve the consecutive positions of moving objects. This paper addresses an improved trajectory split algorithm for the purpose of efficiently supporting spatio-temporal range queries using index structures that use Minimum Bounding Rectangles(MBR) as trajectory approximations. We consider volume of Extended Minimum Bounding Rectangles (EMBR) to be determined by average size of range queries. Also, Use a priority queue to speed up our process. This algorithm gives in general sub-optimal solutions with respect to search space. Our improved trajectory split algorithm is going to derive minimizing volume of EMBRs better than previously proposed split algorithm.

CNN Based 2D and 2.5D Face Recognition For Home Security System (홈보안 시스템을 위한 CNN 기반 2D와 2.5D 얼굴 인식)

  • MaYing, MaYing;Kim, Kang-Chul
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.6
    • /
    • pp.1207-1214
    • /
    • 2019
  • Technologies of the 4th industrial revolution have been unknowingly seeping into our lives. Many IoT based home security systems are using the convolutional neural network(CNN) as good biometrics to recognize a face and protect home and family from intruders since CNN has demonstrated its excellent ability in image recognition. In this paper, three layouts of CNN for 2D and 2.5D image of small dataset with various input image size and filter size are explored. The simulation results show that the layout of CNN with 50*50 input size of 2.5D image, 2 convolution and max pooling layer, and 3*3 filter size for small dataset of 2.5D image is optimal for a home security system with recognition accuracy of 0.966. In addition, the longest CPU time consumption for one input image is 0.057S. The proposed layout of CNN for a face recognition is suitable to control the actuators in the home security system because a home security system requires good face recognition and short recognition time.

Optimal Location Allocation of CCTV Using 3D Simulation (3차원 시뮬레이션을 활용한 CCTV 최적입지선정)

  • PARK, Jeong-Woo;LEE, Seong-Ho
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.19 no.4
    • /
    • pp.92-105
    • /
    • 2016
  • This study aims to establish a simulation method for CCTV (Closed Circuit Television) sight area. The simulation incorporates variables for computing CCTV sight area including CCTV specifications and installation. Currently CCTV is used for traffic, crime prevention and fire prevention by local governments. However, new locations are selected by administrator decision rather than analysis of the optimal location. In order to determine optimum location, a method to CCTV compute range is needed, which incorporates specifications according to CCTV purpose. For this purpose, limitations of previous research methods must be recognized and the simulation method must supplement these limitations. Here in this study, we derived CCTV sight area variables for realistic analysis to complement the limitations of previous studies. A total of eight elements were derived from image device sensors and installation: wide angle, height, angle, setting height, setting angle, and others. This research implemented a 3D simulation technique that can be applied to the derived factors and automate them using ArcObject and Visual C#. This simulation method can calculate sight range in accordance with CCTV specifications. Furthermore, when installing additional CCTVs, it can derive optimal allocation position. The results of this study will provide rational choices for specification selection and CCTV location by interagency collaborative projects.

Rendering States Changing Costs Reducing Technique for Real-time 3D Graphics (실시간 3D 그래픽을 위한 렌더링 상태 변경 비용 감소 기법)

  • Kim, Seok-Hyun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.8
    • /
    • pp.1843-1849
    • /
    • 2009
  • In real-time 3D Graphics, pipeline optimization is one of techniques enhancing rendering performance. Pipeline optimization is kind of buffer reordering problem, but it is NP-hard. Therefore techniques that is approximating optimal solution and suitable for real-time 3D graphics are needed. This paper analyze pattern of rendering states changing costs for real-time 3D graphics, and based on this, the algorithm that brings rendering states into line by changing costs is proposed. The proposed technique shows good performance enhancement when costs of some rendering states are much higher than others. Proposed technique shows 2.5 to 4 times better performance than non-ordering algorithm and becomes more faster when rendering costs of a state gets higher.

Photometry Data Compression for Three-dimensional Mesh Models Using Connectivity and Geometry Information (연결성 정보와 기하학 정보를 이용한 삼차원 메쉬 모델의 광학성 정보 압축 방법)

  • Yoon, Young-Suk;Ho, Yo-Sung
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.3
    • /
    • pp.160-174
    • /
    • 2008
  • In this paper, we propose new coding techniques for photometry data of three-dimensional(3-D) mesh models. We make a good use of geometry and connectivity information to improve coding efficiency of color, normal vector, and texture data. First of all, we determine the coding order of photometry data exploiting connectivity information. Then, we exploit the obtained geometry information of neighboring vortices through the previous process to predict the photometry data. For color coding, the predicted color of the current vertex is computed by a weighted sum of colors for adjacent vortices considering geometrical characteristics between the current vortex and the adjacent vortices at the geometry predictor. For normal vector coding, the normal vector of the current vertex is equal to one of the optimal plane produced by the optimal plane generator with distance equalizer owing to the property of an isosceles triangle. For texture coding, our proposed method removes discontinuity in the texture coordinates and reallocates texture image segments according to the coding order. Simulation results show that the proposed compression schemes provide improved performance over previous works for various 3-D mesh models.