• Title/Summary/Keyword: Markov random field

Search Result 97, Processing Time 0.031 seconds

Detection of Road Features Using MRF in Radar Images (MRF를 이용한 레이더 영상에서 도로검출)

  • 김순백;정래형;김두영
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2000.08a
    • /
    • pp.221-224
    • /
    • 2000
  • We propose an algorithm for almost unsupervised detection of linear structures, in particular, axes in road network and river, as seen in synthetics aperture radar (SAR) images. The first is local step and used to extract linear features from the speckle radar image, which are treated as road segment candidates. We present two local line detectors as well as a method for fusing information from these detectors. The second is global step, we identify the real roads among the segment candidates by defining a Markov random field (MRF) on a set of segments, which introduces contextual knowledge about the shape of road objects.

  • PDF

GMRF-Based Ground Segmentation in 3D Voxel Map (3D 복셀맵에서의 GMRF 기반 지면 분리)

  • Song, Wei;Cho, Seongjae;Cho, Kyungeun;Um, Kyhyun;Won, Cheesun;Sim, Sungdae
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.495-496
    • /
    • 2012
  • 원격 환경에서 작동하는 원격 로봇을 조종하기 위해서는 조종사가 빠르게 계획을 세워야 한다. 이를 위해 GPS, 자이로스코프, 비디오 카메라, 3D 센서 등에서 획득한 2D 및 3D 데이터셋으로 복셀 맵을 구성한다. 지형 모델의 각 복셀은 이웃하는 복셀에 큰 영향을 받는다. 그러므로 깁스-마르코프 랜덤 필드 모델(GMRF, Gibbs-Markov Random Field) 을 사용하여 복셀맵에서 이동 가능한 영역을 탐색하는 방법을 제안한다.

Stereo Correspondence Using Graphs Cuts Kernel (그래프 컷 커널을 이용한 스테레오 대응)

  • Lee, Yong-Hwan;Kim, Youngseop
    • Journal of the Semiconductor & Display Technology
    • /
    • v.16 no.2
    • /
    • pp.70-74
    • /
    • 2017
  • Given two stereo images of a scene, it is possible to recover a 3D understanding of the scene. This is the primary way that the human visual system estimates depth. This process is useful in applications like robotics, where depth sensors may be expensive but a pair of cameras is relatively cheap. In this work, we combined our interests to implement a graph cut algorithm for stereo correspondence, and performed evaluation against a baseline algorithm using normalized cross correlation across a variety of metrics. Experimental trials revealed that the proposed descriptor exhibited a significant improvement, compared to the other existing methods.

  • PDF

Focal Liver Mass Detection and Analysis in Ultrasound Images (초음파 영상에서 간 질환 병변 추출 및 분석 기법)

  • Lee, Seung-Kang;Park, Eun-Bi;Kim, Ho-Joon;Hwang, Byung-Gap
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.11a
    • /
    • pp.1386-1389
    • /
    • 2013
  • 조영증강 초음파 동영상은 측정 부위의 혈류의 형태와 특성 정보를 포함하지만, 이를 육안으로 판별하는 것은 매우 어려운 일이다. 이에 본 연구에서는 초음파 영상으로부터 간 질환과 연관한 병변을 추출하고 그 특성을 분석하기 위한 기반 기술로서 영상 처리 및 분석 기법을 제안한다. 마이크로버블(microbubble) 형태의 노이즈와 빠른 속도로 변화하는 각 프레임의 영상으로부터 근사화된 원형 또는 타원 형태로 나타나는 병변을 추출하기 위하여 허프 변환(Hough transform)을 이용한 병변 추출 기법을 제시하며, 추출한 병변의 특성을 분석하기 위하여 TIC(time intensity curve)의 특성과 조영 효과의 전이 시간(transit time) 등의 정보를 영상의 형태로 가시화하는 방법과 MRF(Markov random field) 모델을 이용한 영상개선 기법을 소개한다. 제안된 이론은 실제 간 질환 진단 초음파 영상에 적용하여 그 유용성을 평가한다.

Variational Bayesian inference for binary image restoration using Ising model

  • Jang, Moonsoo;Chung, Younshik
    • Communications for Statistical Applications and Methods
    • /
    • v.29 no.1
    • /
    • pp.27-40
    • /
    • 2022
  • In this paper, the focus on the removal noise in the binary image based on the variational Bayesian method with the Ising model. The observation and the latent variable are the degraded image and the original image, respectively. The posterior distribution is built using the Markov random field and the Ising model. Estimating the posterior distribution is the same as reconstructing a degraded image. MCMC and variational Bayesian inference are two methods for estimating the posterior distribution. However, for the sake of computing efficiency, we adapt the variational technique. When the image is restored, the iterative method is used to solve the recursive problem. Since there are three model parameters in this paper, restoration is implemented using the VECM algorithm to find appropriate parameters in the current state. Finally, the restoration results are shown which have maximum peak signal-to-noise ratio (PSNR) and evidence lower bound (ELBO).

An MRF-Based Texture Segmentation Using Genetic Algorithm (유전자 알고리즘을 이용한 MRF기반의 Texture분할)

  • Lee, Kyung-Mi;Kim, Sang-Kyoon;Kim, Hang-Joon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.10
    • /
    • pp.2713-2724
    • /
    • 1998
  • This paper proposes a new method for the parameter estimation in Markov Random Field(MRF) model of textured color images. The MRF models allow an image region to bel described using a finite number of parameters that characterize spatial interactionsl within and between bands of al color image. An important problem is estimation of the parameters since the randorn field model-based textured color image is the mostly parametric images of natural scenes to verify the validit of the proposed method proves that the method is not affected by the size of the image and shows well-segmented images.

  • PDF

Joint Segmentation of Multi-View Images by Region Correspondence (영역 대응을 이용한 다시점 영상 집합의 통합 영역화)

  • Lee, Soo-Chahn;Kwon, Dong-Jin;Yun, Il-Dong;Lee, Sang-Uk
    • Journal of Broadcast Engineering
    • /
    • v.13 no.5
    • /
    • pp.685-695
    • /
    • 2008
  • This paper presents a method to segment the object of interest from a set of multi-view images with minimal user interaction. Specifically, after the user segments an initial image, we first estimate the transformations between foreground and background of the segmented image and the neighboring image, respectively. From these transformations, we obtain regions in the neighboring image that respectively correspond to the foreground and the background of the segmented image. We are then able to segment the neighboring image based on these regions, and iterate this process to segment the whole image set. Transformation of foregrounds are estimated by feature-based registration with free-form deformation, while transformation of backgrounds are estimated by homography constrained to affine transformation. Here, both are based on correspondence point pairs. Segmentation is done by estimating pixel color distributions and defining a shape prior based on the obtained foreground and background regions and applying them to a Markov random field (MRF) energy minimization framework for image segmentation. Experimental results demonstrate the effectiveness of the proposed method.

A Fast Algorithm of the Belief Propagation Stereo Method (신뢰전파 스테레오 기법의 고속 알고리즘)

  • Choi, Young-Seok;Kang, Hyun-Soo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.5
    • /
    • pp.1-8
    • /
    • 2008
  • The belief propagation method that has been studied recently yields good performance in disparity extraction. The method in which a target function is modeled as an energy function based on Markov random field(MRF), solves the stereo matching problem by finding the disparity to minimize the energy function. MRF models provide robust and unified framework for vision problem such as stereo and image restoration. the belief propagation method produces quite correct results, but it has difficulty in real time implementation because of higher computational complexity than other stereo methods. To relieve this problem, in this paper, we propose a fast algorithm of the belief propagation method. Energy function consists of a data term and a smoothness tern. The data term usually corresponds to the difference in brightness between correspondences, and smoothness term indicates the continuity of adjacent pixels. Smoothness information is created from messages, which are assigned using four different message arrays for the pixel positions adjacent in four directions. The processing time for four message arrays dominates 80 percent of the whole program execution time. In the proposed method, we propose an algorithm that dramatically reduces the processing time require in message calculation, since the message.; are not produced in four arrays but in a single array. Tn the last step of disparity extraction process, the messages are called in the single integrated array and this algorithm requires 1/4 computational complexity of the conventional method. Our method is evaluated by comparing the disparity error rates of our method and the conventional method. Experimental results show that the proposed method remarkably reduces the execution time while it rarely increases disparity error.

Spatial Analyses and Modeling of Landsacpe Dynamics (지표면 변화 탐색 및 예측 시스템을 위한 공간 모형)

  • 정명희;윤의중
    • Spatial Information Research
    • /
    • v.11 no.3
    • /
    • pp.227-240
    • /
    • 2003
  • The primary focus of this study is to provide a general methodology which can be utilized to understand and analyze environmental issues such as long term ecosystem dynamics and land use/cover change by development of 2D dynamic landscape models and model-based simulation. Change processes in land cover and ecosystem function can be understood in terms of the spatial and temporal distribution of land cover resources. In development of a system to understand major processes of change and obtain predictive information, first of all, spatial heterogeneity is to be taken into account because landscape spatial pattern affects on land cover change and interaction between different land cover types. Therefore, the relationship between pattern and processes is to be included in the research. Landscape modeling requires different approach depending on the definition, assumption, and rules employed for mechanism behind the processes such as spatial event process, land degradation, deforestration, desertification, and change in an urban environment. The rule-based models are described in the paper for land cover change by natural fires. Finally, a case study is presented as an example using spatial modeling and simulation to study and synthesize patterns and processes at different scales ranging from fine-scale to global scale.

  • PDF

Fusion of multiple images based on convexity of pixel value (픽셀 값의 컨벡스 성질을 이용한 다노출 영상의 융합 기법)

  • An, Jae-Hyun;Kuk, Jung-Gap;Lee, Sang-Heon;Cho, Nam-Ik
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2010.07a
    • /
    • pp.408-410
    • /
    • 2010
  • 본 논문에서는 새로운 척도에 기반한 다노출 영상 융합 방법을 제안한다. 제안하는 방법에서는 각 노출정도에 따른 픽셀값의 그래프가 컨벡스 형태를 갖는다는 성질과 대조 값의 차이를 고려한 MRF (Markov Random Field) 기반의 에너지 함수를 설계하고 그 에너지 함수를 그래프컷 (Graph cut) 으로 풀어 각 노출치 영상에 대한 가중치 맵 (weight map)을 형성한다. 그리고 가중치 맵을 곱한 각 영상을 더함으로써 융합된 영상을 얻는다. 제안한 컨벡스 성질을 기반으로 한 척도는 특정 컬러 성분이 다른 컬러 성분보다 먼저 과노출 상태에 도달 한 경우의 영역을 가중치 계산에서 제외할 수 있기 때문에 기존의 가중치 기반의 방법보다 정확한 가중치 맵을 형성할 수 있게 한다. 실험 결과 제안하는 방법은 기존의 다노출 영상 융합에 비해 보다 넓은 영역에서 원 영상의 정보를 더 잘 표현하는 것을 확인하였다.

  • PDF