• Title/Summary/Keyword: Stereo image

Search Result 1,066, Processing Time 0.024 seconds

The Study of the Geometric Structure Optimization for the Stereo X-ray Inspection System Using the Calibration (Calibration을 통한 스테레오 X-ray 검색장치의 기하구조 최적화 연구)

  • Hwang, Young-Gwan;Lee, Nam-Ho;Lee, Seung-Min;Park, Jong-Won
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.9
    • /
    • pp.3422-3427
    • /
    • 2010
  • In this paper, we presents a sensor calibration technique using stereo X-ray images to provide efficient inspection of fast moving cargo objects. Stereo X-ray scanned images are acquired from a specially designed equipment which consists of a X-ray source, dual-linear array detector, and a conveyor system. Dual detector is installed so that rectified stereo X-ray images of objects are acquired. Using the stereo X-ray images, we carry out a sensor calibration to find the correspondences between the images and reconstruct 3-D shapes of real objects. Using the Image acquired from the stereo detectors with varying distances, we calculated the GCP(ground control point)of the image. And we figure out the error by comparing calculated GCP and GCP of the real object. The experimental results show the proposed technique can enhance the accuracy of stereo matching and give more efficient visualization for cargo inspection image.

Hierarchical Stereo Matching with Color Information (영상의 컬러 정보를 이용한 계층적 스테레오 정합)

  • Kim, Tae-June;Yoo, Ji-Sang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.3C
    • /
    • pp.279-287
    • /
    • 2009
  • In this paper, a hierarchical stereo matching with color information is proposed. To generate an initial disparity map, feature based stereo matching is carried out and to generate a final disparity map, hierarchical stereo matching is carried out. The boundary (edge) region is obtained by segmenting a given image into R, G, B and White components. From the obtained boundary, disparity is extracted. The initial disparity map is generated when the extracted disparity is spread to the surrounding regions by evaluating autocorrelation from each color region. The initial disparity map is used as an initial value for generating the final disparity map. The final disparity map is generated from each color region by changing the size of a block and the search range. 4 test images that are provided by Middlebury stereo vision are used to evaluate the performance of the proposed algorithm objectively. The experiment results show better performance compared to the Graph-cuts and Dynamic Programming methods. In the final disparity map, about 11% of the disparities for the entire image were inaccurate. It was verified that the boundary for the non-contiguous point was clear in the disparity map.

Multi-view Synthesis Algorithm for the Better Efficiency of Codec (부복호화기 효율을 고려한 다시점 영상 합성 기법)

  • Choi, In-kyu;Cheong, Won-sik;Lee, Gwangsoon;Yoo, Jisang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.2
    • /
    • pp.375-384
    • /
    • 2016
  • In this paper, when stereo image, satellite view and corresponding depth maps were used as the input data, we propose a new method that convert these data to data format suitable for compressing, and then by using these format, intermediate view is synthesized. In the transmitter depth maps are merged to a global depth map and satellite view are converted to residual image corresponding hole region as out of frame area and occlusion region. And these images subsampled to reduce a mount of data and stereo image of main view are encoded by HEVC codec and transmitted. In the receiver intermediate views between stereo image and between stereo image and bit-rate are synthesized using decoded global depth map, residual images and stereo image. Through experiments, we confirm good quality of intermediate views synthesized by proposed format subjectively and objectively in comparison to intermediate views synthesized by MVD format versus total bit-rate.

A Study on Stereo Image (Stereopsis) (스테레오 이미지에 관한 연구)

  • 홍석일
    • Archives of design research
    • /
    • v.12 no.3
    • /
    • pp.191-200
    • /
    • 1999
  • The purpose of this study is to analyze traditional stereo images (stereopsis), and study electronic methods to create stereo images using computer graphics technology on visualization of computer. Computer system can process image data and show results on its display. In the early days of computer era, most scientific research data was printed on paper as a procession of digits. These days, the visualization of computer graphics has a precise and realistic quality in its imaging technology. Some technological advances have been developed to not only display 2-dimensional geometry but also 3-dimensional stereo images to simulate virtual reality. In this study, [ have discussed the history of stereopsis, principles of stereo images and technological developments. Also I analyzed the components of stereo images, optical and electronic methods and visual systems which are used in computer graphics technology. I developed my own theories on possibilities for new methods of 3-dimensional stereo images.

  • PDF

Conjugate Point Extraction for High-Resolution Stereo Satellite Images Orientation

  • Oh, Jae Hong;Lee, Chang No
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.37 no.2
    • /
    • pp.55-62
    • /
    • 2019
  • The stereo geometry establishment based on the precise sensor modeling is prerequisite for accurate stereo data processing. Ground control points are generally required for the accurate sensor modeling though it is not possible over the area where the accessibility is limited or reference data is not available. For the areas, the relative orientation should be carried out to improve the geometric consistency between the stereo data though it does not improve the absolute positional accuracy. The relative orientation requires conjugate points that are well distributed over the entire image region. Therefore the automatic conjugate point extraction is required because the manual operation is labor-intensive. In this study, we applied the method consisting of the key point extraction, the search space minimization based on the epipolar line, and the rigorous outlier detection based on the RPCs (Rational Polynomial Coefficients) bias compensation modeling. We tested different parameters of window sizes for Kompsat-2 across track stereo data and analyzed the RPCs precision after the bias compensation for the cases whether the epipolar line information is used or not. The experimental results showed that matching outliers were inevitable for the different matching parameterization but they were successfully detected and removed with the rigorous method for sub-pixel level of stereo RPCs precision.

Research on Robustness of 2D DWT-Based Watermarking in Intermediate Viewpoint by 3D Warping

  • Park, Scott;Choi, Hyun-Jun;Yang, Won-Jae;Kim, Dong-Wook;Seo, Young-Ho
    • Journal of information and communication convergence engineering
    • /
    • v.12 no.3
    • /
    • pp.173-180
    • /
    • 2014
  • This paper investigates the robustness of watermarking techniques for stereo or multi-view images generated from texture and depth images. A three-dimensional (3D) warping technique is applied to texture and depth images to generate stereo or multi-view images for a 3D display. By using the 3D warping technique, in this paper, we developed watermarking techniques and evaluated the robustness of these techniques that can extract watermarks from texture images even when the viewpoints are moved. A depth image is used to generate a stereo image with the largest viewpoint difference to the left and right. The overlapping region in the stereo image that does not disappear after warping is then obtained, and DWT is applied to this region to embed a watermark in the LL sub-band. The proposed watermarking techniques were found to yield bit error rates of about 3%-16% when they were applied to stereo images generated from texture and depth images. Furthermore, the results showed that the copyright could be seen when the extracted watermark was visually confirmed.

Refinements of Multi-sensor based 3D Reconstruction using a Multi-sensor Fusion Disparity Map (다중센서 융합 상이 지도를 통한 다중센서 기반 3차원 복원 결과 개선)

  • Kim, Si-Jong;An, Kwang-Ho;Sung, Chang-Hun;Chung, Myung-Jin
    • The Journal of Korea Robotics Society
    • /
    • v.4 no.4
    • /
    • pp.298-304
    • /
    • 2009
  • This paper describes an algorithm that improves 3D reconstruction result using a multi-sensor fusion disparity map. We can project LRF (Laser Range Finder) 3D points onto image pixel coordinatesusing extrinsic calibration matrixes of a camera-LRF (${\Phi}$, ${\Delta}$) and a camera calibration matrix (K). The LRF disparity map can be generated by interpolating projected LRF points. In the stereo reconstruction, we can compensate invalid points caused by repeated pattern and textureless region using the LRF disparity map. The result disparity map of compensation process is the multi-sensor fusion disparity map. We can refine the multi-sensor 3D reconstruction based on stereo vision and LRF using the multi-sensor fusion disparity map. The refinement algorithm of multi-sensor based 3D reconstruction is specified in four subsections dealing with virtual LRF stereo image generation, LRF disparity map generation, multi-sensor fusion disparity map generation, and 3D reconstruction process. It has been tested by synchronized stereo image pair and LRF 3D scan data.

  • PDF

High Speed Self-Adaptive Algorithms for Implementation in a 3-D Vision Sensor (3-D 비젼센서를 위한 고속 자동선택 알고리즘)

  • Miche, Pierre;Bensrhair, Abdelaziz;Lee, Sang-Goog
    • Journal of Sensor Science and Technology
    • /
    • v.6 no.2
    • /
    • pp.123-130
    • /
    • 1997
  • In this paper, we present an original stereo vision system which comprises two process: 1. An image segmentation algorithm based on new concept called declivity and using automatic thresholds. 2. A new stereo matching algorithm based on an optimal path search. This path is obtained by dynamic programming method which uses the threshold values calculated during the segmentation process. At present, a complete depth map of indoor scene only needs about 3 s on a Sun workstation IPX, and this time will be reduced to a few tenth of second on a specialised architecture based on several DSPs which is currently under consideration.

  • PDF

Local Stereo Matching Method based on Improved Matching Cost and Disparity Map Adjustment (개선된 정합 비용 및 시차 지도 재생성 기반 지역적 스테레오 정합 기법)

  • Kang, Hyun Ryun;Yun, In Yong;Kim, Joong Kyu
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.5
    • /
    • pp.65-73
    • /
    • 2017
  • In this paper, we propose a stereo matching method to improve the image quality at the hole and the disparity discontinuity regions. The stereo matching method extracts disparity map finding corresponding points between stereo image pair. However conventional stereo matching methods have a problem about the tradeoff between accuracy and precision with respect to the length of the baseline of the stereo image pair. In addition, there are hole and disparity discontinuity regions which are caused by textureless regions and occlusion regions of the stereo image pair. The proposed method extracts initial disparity map improved at disparity discontinuity and miss-matched regions using modified AD-Census-Gradient method and adaptive weighted cost aggregation. And then we conduct the disparity map refinement to improve at miss-matched regions, while also improving the accuracy of the image. Experimental results demonstrate that the proposed method produces high-quality disparity maps by successfully improving miss-matching regions and accuracy while maintaining matching performance compared to existing methods which produce disparity maps with high matching performance. And the matching performance is increased about 3.22(%) compared to latest stereo matching methods in case of test images which have high error ratio.

Post Processing to Reduce Wrong Matches in Stereo Matching

  • Park, Hee-Ju;Lee, Suk-Bae
    • Korean Journal of Geomatics
    • /
    • v.1 no.1
    • /
    • pp.43-49
    • /
    • 2001
  • Although many kinds of stereo matching method have been developed in the field of computer vision and photogrammetry, wrong matches are not easy to avoid. This paper presents a new method to reduce wrong matches after matching, and experimental results are reported. The main idea is to analyze the histogram of the image attribute differences between each pair of image patches matched. Typical image attributes of image patch are the mean and the standard deviation of gray value for each image patch, but there could be other kinds of image attributes. Another idea is to check relative position among potential matches. This paper proposes to use Gaussian blunder filter to detect the suspicious pair of candidate match in relative position among neighboring candidate matches. If the suspicious candidate matches in image attribute difference or relative position are suppressed, then many wrong matches are removed, but minimizing the suppression of good matches. The proposed method is easy to implement, and also has potential to be applied as post processing after image matching for many kinds of matching methods such as area based matching, feature matching, relaxation matching, dynamic programming, and multi-channel image matching. Results show that the proposed method produces fewer wrong matches than before.

  • PDF