• Title/Summary/Keyword: Voxel Matching

Search Result 21, Processing Time 0.036 seconds

Visual Positioning System based on Voxel Labeling using Object Simultaneous Localization And Mapping

  • Jung, Tae-Won;Kim, In-Seon;Jung, Kye-Dong
    • International Journal of Advanced Culture Technology
    • /
    • v.9 no.4
    • /
    • pp.302-306
    • /
    • 2021
  • Indoor localization is one of the basic elements of Location-Based Service, such as indoor navigation, location-based precision marketing, spatial recognition of robotics, augmented reality, and mixed reality. We propose a Voxel Labeling-based visual positioning system using object simultaneous localization and mapping (SLAM). Our method is a method of determining a location through single image 3D cuboid object detection and object SLAM for indoor navigation, then mapping to create an indoor map, addressing it with voxels, and matching with a defined space. First, high-quality cuboids are created from sampling 2D bounding boxes and vanishing points for single image object detection. And after jointly optimizing the poses of cameras, objects, and points, it is a Visual Positioning System (VPS) through matching with the pose information of the object in the voxel database. Our method provided the spatial information needed to the user with improved location accuracy and direction estimation.

Yarn Segmentation from 3-D Voxel Data for Analysis of Textile Fabric Structure

  • Shinohara, Toshihiro;Takayama, Jun-ya;Ohyama, Shinji;Kobayashi, Akira
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.877-881
    • /
    • 2005
  • In this paper, a novel method for analyzing a textile fabric structure is proposed to segment each yarn of the textile fabric from voxel data made out of its X-ray computed tomography (CT) images. In order to segment the each yarn, directions of fibers, of which yarn consists, are firstly estimated by correlating the voxel with a fiber model. Second, each fiber is reconstructed by clustering the voxel of the fiber using the estimated fiber direction as a similarity. Then, each yarn is reconstructed by clustering the reconstructed fibers using a distance which is newly defined as a dissimilarity. Consequently, each yarn of the textile fabric is segmented from the voxel data. The effectiveness of the proposed method is confirmed by experimentally applying the method to voxel data of a sample plain woven fabric, which is made of polyester two folded yarn. The each two folded yarn is correctly segmented by the proposed method.

  • PDF

Completion of Occluded Objects in a Video Sequence using Spatio-Temporal Matching (시공간 정합을 이용한 비디오 시퀀스에서의 가려진 객체의 복원)

  • Heo, Mi-Kyoung;Moon, Jae-Kyoung;Park, Soon-Yong
    • The KIPS Transactions:PartB
    • /
    • v.14B no.5
    • /
    • pp.351-360
    • /
    • 2007
  • Video Completion refers to a computer vision technique which restores damaged images by filling missing pixels with suitable color in a video sequence. We propose a new video completion technique to fill in image holes which are caused by removing an unnecessary object in a video sequence, where two objects cross each other in the presence of camera motion. We remove the closer object from a camera which results in image holes. Then these holes are filled by color information of some others frames. First of all, spatio-temporal volumes of occluding and occluded objects are created according to the centroid of the objects. Secondly, a temporal search technique by voxel matching separates and removes the occluding object. Finally. these holes are filled by using spatial search technique. Seams on the boundary of completed pixels we removed by a simple blending technique. Experimental results using real video sequences show that the proposed technique produces new completed videos.

Completion of Occluded Moving Object in a Video Sequence (비디오 영상에서 가려짐이 있는 이동 물체의 복원)

  • Heo, Mi-Kyoung;Park, Soon-Yong
    • 한국HCI학회:학술대회논문집
    • /
    • 2007.02a
    • /
    • pp.281-286
    • /
    • 2007
  • 비디오 복원(video completion)은 비디오 영상에서 색상값에 대한 정보가 없는 픽셀에 적절한 색을 채워 영상을 복원하는 기술이다. 본 논문에서는 움직이는 두 물체가 교차하는 입력영상으로부터 하나의 물체를 제거함으로 발생하는 홀(hole)을 채우는 비디오 복원 기술을 제안한다. 입력 영상에서의 두 물체 중 카메라와 가까운 물체를 제거함으로써 영상의 홀이 발생하게 되고, 이 홀을 다른 프레임들의 정보를 이용하여 채움으로써 가려진 물체를 복원한다. 모든 프레임에 대해 각 물체의 중심을 추정하여 물체의 중심을 기준으로 시-공간 볼륨(spatio-temporal volume)을 생성하고, 복셀 매칭(voxel matching)을 통한 시간적 탐색을 수행한 후 두 물체를 분리한다. 가리는 물체 영역으로 판단 된 부분을 삭제하고 공간적 탐색 방법을 이용하여 홀을 채워 가려짐이 있는 물체를 복원하는 과정을 소개한다. 실험 결과를 통해 제안한 기술이 비교적 자연스러운 결과를 얻을 수 있다는 것을 보여준다.

  • PDF

Complete 3D Surface Reconstruction from an Unstructured Point Cloud of Arbitrary Shape by Using a Bounding Voxel Model (경계 복셀 모델을 이용한 임의 형상의 비조직화된 점군으로부터의 3 차원 완전 형상 복원)

  • Li Rixie;Kim Seok-Il
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.30 no.8 s.251
    • /
    • pp.906-915
    • /
    • 2006
  • This study concerns an advanced 3D surface reconstruction method that the vertices of surface model can be completely matched to the unstructured point cloud measured from arbitrary complex shapes. The concept of bounding voxel model is introduced to generate the mesh model well-representing the geometrical and topological characteristics of point cloud. In the reconstruction processes, the application of various methodologies such as shrink-wrapping, mesh simplification, local subdivision surface fitting, insertion of is isolated points, mesh optimization and so on, are required. Especially, the effectiveness, rapidity and reliability of the proposed surface reconstruction method are demonstrated by the simulation results for the geometrically and topologically complex shapes like dragon and human mouth.

Effectual Method FOR 3D Rebuilding From Diverse Images

  • Leung, Carlos Wai Yin;Hons, B.E.
    • 한국정보컨버전스학회:학술대회논문집
    • /
    • 2008.06a
    • /
    • pp.145-150
    • /
    • 2008
  • This thesis explores the problem of reconstructing a three-dimensional(3D) scene given a set of images or image sequences of the scene. It describes efficient methods for the 3D reconstruction of static and dynamic scenes from stereo images, stereo image sequences, and images captured from multiple viewpoints. Novel methods for image-based and volumetric modelling approaches to 3D reconstruction are presented, with an emphasis on the development of efficient algorithm which produce high quality and accurate reconstructions. For image-based 3D reconstruction a novel energy minimisation scheme, Iterated Dynamic Programming, is presented for the efficient computation of strong local minima of discontinuity preserving energyy functions. Coupled with a novel morphological decomposition method and subregioning schemes for the efficient computation of a narrowband matching cost volume. the minimisation framework is applied to solve problems in stereo matching, stereo-temporal reconstruction, motion estimation, 2D image registration and 3D image registration. This thesis establishes Iterated Dynamic Programming as an efficient and effective energy minimisation scheme suitable for computer vision problems which involve finding correspondences across images. For 3D reconstruction from multiple view images with arbitrary camera placement, a novel volumetric modelling technique, Embedded Voxel Colouring, is presented that efficiently embeds all reconstructions of a 3D scene into a single output in a single scan of the volumetric space under exact visibility. An adaptive thresholding framework is also introduced for the computation of the optimal set of thresholds to obtain high quality 3D reconstructions. This thesis establishes the Embedded Voxel Colouring framework as a fast, efficient and effective method for 3D reconstruction from multiple view images.

  • PDF

Co-registration of Multiple Postmortem Brain Slices to Corresponding MRIs Using Voxel Similarity Measures and Slice-to-Volume Transformation

  • Kim Tae-Seong
    • Journal of Biomedical Engineering Research
    • /
    • v.26 no.4
    • /
    • pp.231-241
    • /
    • 2005
  • New methods to register multiple hemispheric slices of the postmortem brain to anatomically corresponding in-vivo MRI slices within a 3D volumetric MRI are presented. Gel-embedding and fiducial markers are used to reduce geometrical distortions in the postmortem brain volume. The registration algorithm relies on a recursive extraction of warped MRI slices from the reference MRI volume using a modified non-linear polynomial transformation until matching slices are found. Eight different voxel similarity measures are tested to get the best co-registration cost and the results show that combination of two different similarity measures shows the best performance. After validating the implementation and approach through simulation studies, the presented methods are applied to real data. The results demonstrate the feasibility and practicability of the presented co­registration methods, thus providing a means of MR signal analysis and histological examination of tissue lesions via co­registered images of postmortem brain slices and their corresponding MRI sections. With this approach, it is possible to investigate the pathology of a disease through both routinely acquired MRls and postmortem brain slices, thus improving the understanding of the pathological substrates and their progression.

Complete 3D Surface Reconstruction from Unstructured Point Cloud

  • Kim, Seok-Il;Li, Rixie
    • Journal of Mechanical Science and Technology
    • /
    • v.20 no.12
    • /
    • pp.2034-2042
    • /
    • 2006
  • In this study, a complete 3D surface reconstruction method is proposed based on the concept that the vertices, of surface model can be completely matched to the unstructured point cloud. In order to generate the initial mesh model from the point cloud, the mesh subdivision of bounding box and shrink-wrapping algorithm are introduced. The control mesh model for well representing the topology of point cloud is derived from the initial mesh model by using the mesh simplification technique based on the original QEM algorithm, and the parametric surface model for approximately representing the geometry of point cloud is derived by applying the local subdivision surface fitting scheme on the control mesh model. And, to reconstruct the complete matching surface model, the insertion of isolated points on the parametric surface model and the mesh optimization are carried out. Especially, the fast 3D surface reconstruction is realized by introducing the voxel-based nearest-point search algorithm, and the simulation results reveal the availability of the proposed surface reconstruction method.

A 3D TEXTURE SYNTHESIS APPROACH

  • Su, Ya-Lin;Chang, Chin-Chen;Shih, Zen-Chung
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.28-31
    • /
    • 2009
  • In this paper, a new approach for solid texture synthesis from input volume data is presented. In the pre-process, feature vectors and a similarity set were constructed for input volume data. The feature vectors were used to construct neighboring vectors for more accurate neighborhood matching. The similarity set which recorded 3 candidates for each voxel helped more effective neighborhood matching. In the synthesis process, the pyramid synthesis method was used to synthesize solid textures from coarse to fine level. The results of the proposed approach were satisfactory.

  • PDF

The Geometric Modeling for 3D Information of X-ray Inspection (스테레오 X-선 검색장치를 이용한 3차원 정보 가시화에 관한 연구)

  • Hwang, Young-Gwan;Lee, Seung-Min;Park, Jong-Won
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.63 no.1
    • /
    • pp.145-149
    • /
    • 2014
  • In this study, using X-ray cargo container scanning device and to differentiate the concept of three-dimensional information extraction applied for X-ray scanning device as an ingredient in the rotation of the X-Ray Linear Pushbroom Stereo System by introducing the geometric How to model was introduced. Three-dimensional information obtained through the matching of a single voxel space filled with a random vector operations for each voxel in the three dimensional shape reconstruction algorithm using the definition, and in time, the time required for each step were analyzed. Using OpenCV in each step by applying parallelization techniques approximately 1.8 times improvement in the processing time of the check, but do not meet the target within one minute levels. The other hand, X-ray images by the primary process to convert the point View the results of real-time stereo through a three-dimensional could feel the comfort level.