• Title/Summary/Keyword: Matching Value

Search Result 601, Processing Time 0.034 seconds

Identification of Surfaces of a 3-Dimensional Object from Range Data (Range 데이터를 이용한 3-D 물체의 면 인식 방법에 관한 연구)

  • Park, Doo-Yeong
    • The Journal of Engineering Research
    • /
    • v.2 no.1
    • /
    • pp.63-71
    • /
    • 1997
  • In this paper, we describe an approach that determines the identity of surfaces of an object with planar and curved surfaces from range data of the object in the scene. The proposed matching scheme presents that surface correspondence of an object is achieved by simple comparison of values for representing surfaces of the object with model in order to avoid unnecessary matching procedures. We use uniquely assigned Surface Representing Value(SRV) for representing surfaces of the object, which are sums of all weighted view-point independent features. And, the proposed method is simple, quite effective and insensitive to occlusion and noise in sensor data.

  • PDF

An Efficient IP address Lookup Algorithm Using a Priority-Trie (IP 주소 검색을 위한 Priority Trie)

  • Lim, Hye-Sook;Mun, Ju-Hyoung
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.3-4
    • /
    • 2006
  • Fast IP address lookup in routers is essential to achieve packet forwarding in wire-speed. The longest prefix matching for IP address lookup is more complex than exact matching because of its dual dimensions, length and value. By thoroughly studying the current proposals for IP address lookup, we find out that the binary search could be a low-cost solution while providing high performance. Most of the existing binary search algorithms based on trie have simple data structures which can be easily implemented, but they have some problems because of empty internal nodes. The proposed algorithm is based on trie structure, but empty internal nodes are replaced by priority prefixes. The best-matching-prefix search in the proposed algorithm is more efficiently performed since search can be finished earlier when input is matched with a priority prefix. The performance evaluation results show that the constructed priority-trie has very good performance in the lookup speed and the scalability.

  • PDF

Estimation of surface reflectance properties and 3D shape recovery using photometric matching (물체의 면 반사특성 추정과 측광정합을 이용한 3차원 형상복구)

  • 김태은;류석현;송호근;최종수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.7
    • /
    • pp.1633-1641
    • /
    • 1996
  • In this paper we propose a new method for anlayzing the properties of surface reflectance and reconstructing the shape of object using estimated reflectance parameters. We have investigated the hybrid reflectance surface which has specularreflection and diffuse reflection, which can be explained by Torrance-Sparrow model. Sample sphere made on one maerial is used to estimate the reflectance properties by using LMS algorithm. We can make the reference image which consists of surface normal and brightness value using estimated reflectance parameters, and thenarbitrary shape object made of the same material as sample can be reconstructed by matching with reference image. Photometric matching method proposed in this paper is robust because it mateches object image with the reference imageconsidering its neighbor brightness distribution. Also, in this paper plate diffuse illumination is used to remove intensity disparity with simple scheme. It is expected that the proposed algorithm can be applied to 3D recognition, vision inspection system and other fields.

  • PDF

Pattern Partitioning and Decision Method in the Semiconductor Chip Marking Inspection (반도체 부품 마크 미세 결함 검사를 위한 패턴 영역 분할 및 인식 방법)

  • Zhang, Yuting;Lee, Jung-Seob;Joo, Hyo-Nam;Kim, Joon-Seek
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.9
    • /
    • pp.913-917
    • /
    • 2010
  • To inspect the defects of printed markings on the surface of IC package, the OCV (Optical Character Verification) method based on NCC (Normalized Correlation Coefficient) pattern matching is widely used. In order to detect the micro pattern defects appearing on the small portion of the markings, a Partitioned NCC pattern matching method was proposed to overcome the limitation of the NCC pattern matching. In this method, the reference pattern is first partitioned into several blocks and the NCC values are computed and are combined in these small partitioned blocks, rather than just using the NCC value for the whole reference pattern. In this paper, we proposed a method to decide the proper number of partition blocks and a method to inspect and combine the NCC values of each partitioned block to identify the defective markings.

The Color Matching Algorithm in Near Infrared Range for Military Camouflage (IR영역에서의 위장염색을 위한 칼라 매칭 알고리즘 연구)

  • Song Kyung-Hun;Yuk Jong-Il;Ha Hun-Seung;Lee Tae-Sang;You Young-Eun;Lee Si-Woo
    • Textile Coloration and Finishing
    • /
    • v.17 no.4 s.83
    • /
    • pp.7-14
    • /
    • 2005
  • The purpose of this study was to develop the color matching program with the excellent camouflage capacity in the near infrared range($\~$1100nm) including the visible light range for cotton fabrics. It was measured IR spectral reflectance in the range of $380\~1,100nm$ after dyed with vat dyes, and we made database for reflectance with various concentration on vat dyes which have a low reflectance value in the infrared range. The color matching algorithm that could be simulated in both the human visible light and the near infrared range was constructed by numerical analysis method using the database. In this study we also developed the dyeing conditions and dyeing process through the continuous-dyeing experiment with the vat dyes for cotton fabrics.

Broken Detection of the Traffic Sign by using the Location Histogram Matching

  • Yang, Liu;Lee, Suk-Hwan;Kwon, Seong-Geun;Moon, Kwang-Seok;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.3
    • /
    • pp.312-322
    • /
    • 2012
  • The paper presents an approach for recognizing the broken area of the traffic signs. The method is based on the Recognition System for Traffic Signs (RSTS). This paper describes an approach to using the location histogram matching for the broken traffic signs recognition, after the general process of the image detection and image categorization. The recognition proceeds by using the SIFT matching to adjust the acquired image to a standard position, then the histogram bin will be compared preprocessed image with reference image, and finally output the location and percents value of the broken area. And between the processing, some preprocessing like the blurring is added in the paper to improve the performance. And after the reorganization, the program can operate with the GPS for traffic signs maintenance. Experimental results verified that our scheme have a relatively high recognition rate and a good performance in general situation.

A Negotiation Framework for the Cloud Management System using Similarity and Gale Shapely Stable Matching approach

  • Rajavel, Rajkumar;Thangarathinam, Mala
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.6
    • /
    • pp.2050-2077
    • /
    • 2015
  • One of the major issues in emerging cloud management system needs the efficient service level agreement negotiation framework, with an optimal negotiation strategy. Most researchers focus mainly on the atomic service negotiation model, with the assistance of the Agent Controller in the broker part to reduce the total negotiation time, and communication overhead to some extent. This research focuses mainly on composite service negotiation, to further minimize both the total negotiation time and communication overhead through the pre-request optimization of broker strategy. The main objective of this research work is to introduce an Automated Dynamic Service Level Agreement Negotiation Framework (ADSLANF), which consists of an Intelligent Third-party Broker for composite service negotiation between the consumer and the service provider. A broker consists of an Intelligent Third-party Broker Agent, Agent Controller and Additional Agent Controller for managing and controlling its negotiation strategy. The Intelligent third-party broker agent manages the composite service by assigning its atomic services to multiple Agent Controllers. Using the Additional Agent Controllers, the Agent Controllers manage the concurrent negotiation with multiple service providers. In this process, the total negotiation time value is reduced partially. Further, the negotiation strategy is optimized in two stages, viz., Classified Similarity Matching (CSM) approach, and the Truncated Negotiation Group Gale Shapely Stable Matching (TNGGSSM) approach, to minimize the communication overhead.

High-Speed Image Matching Method Using Geometry - Phase Information (기하 위상 정보를 이용한 고속 영상 정합 기법)

  • Chong Min-Yeong;Oh Jae-Yong;Lee Chil-Woo;Bae Ki-Tae
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.9
    • /
    • pp.1195-1207
    • /
    • 2005
  • In this paper, we describe image matching techniques which is automatically retrieving the exact matching area using geometry-phase information. We proposed a Matching Method which is rapidly estimating the correspondent points between adjacent images that included big-rotation and top-bottom movement element. It is a method that reduce computation quantity to be required to find an exact correspondent position using geometry-phase information of extracted points in images and DT map which set the distance value among feature points and other points on the basis of each feature point of a image. The proposed method shows good performance especially in the part to search a exact correspondent position between adjacent images that included big-rotation and top-bottom movement element.

  • PDF

Fast Variable-size Block Matching Algorithm for Motion Estimation Based on Bit-pattern (비트패턴을 기반으로 한 고속의 적응적 가변 블록 움직임 예측 알고리즘)

  • 신동식;안재형
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.4
    • /
    • pp.372-379
    • /
    • 2000
  • In this paper, we propose a fast variable-size block matching algorithm for motion estimation based on bit-pattern. Motion estimation in the proposed algorithm is performed after the representation of image sequence is transformed 8bit pixel values into 1bit ones depending on the mean value of search block, which brings a short searching time by reducing the computational complexity. Moreover, adaptive searching methods according to the motion information of the block make the procedure of motion estimation efficient by eliminating an unnecessary searching of low motion block and deepening a searching procedure in high motion block. Experimental results show that the proposed algorithm provides better performance-0.5dB PSNR improvement-than full search block matching algorithm with a fixed block size.

  • PDF

Automatic Building Reconstruction with Satellite Images and Digital Maps

  • Lee, Dong-Cheon;Yom, Jae-Hong;Shin, Sung-Woong;Oh, Jae-Hong;Park, Ki-Surk
    • ETRI Journal
    • /
    • v.33 no.4
    • /
    • pp.537-546
    • /
    • 2011
  • This paper introduces an automated method for building height recovery through the integration of high-resolution satellite images and digital vector maps. A cross-correlation matching method along the vertical line locus on the Ikonos images was deployed to recover building heights. The rational function models composed of rational polynomial coefficients were utilized to create a stereopair of the epipolar resampled Ikonos images. Building footprints from the digital maps were used for locating the vertical guideline along the building edges. The digital terrain model (DTM) was generated from the contour layer in the digital maps. The terrain height derived from the DTM at each foot of the buildings was used as the starting location for image matching. At a preset incremental value of height along the vertical guidelines derived from vertical line loci, an evaluation process that is based on the cross-correlation matching of the images was carried out to test if the top of the building has reached where maximum correlation occurs. The accuracy of the reconstructed buildings was evaluated by the comparison with manually digitized 3D building data derived from aerial photographs.