• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.805-807
• /
• 2005

본 논문에서는 동적 계획법(dynamic programming)과 이미지 세그먼트(segment)를 이용한 새로운 스테레오 정합(stereo matching)기법을 제안한다. 일반적으로 동적 계획법(dynamic programming)은 빠르면서도 비교적 정확하고, 조밀(dense)한 disparity map을 얻을 수 있다. 그러나 경계(boundary)근처의 폐색지역(occlusion region)이나, 텍스쳐가 적은 모호한 영역에서는 잘못된 결과를 유도할 수 있다. 본 논문에서는 이러한 문제점들을 해결하기 위해 먼저 이미지를 아주 작은 영역으로 분할(over-segmentation)하고, 이런 작은 영역들이 비슷한 disparity를 가질 것이라고 가정한다. 다음으로 동적 계획법(dynamic programming)을 통해 정합을 수행한다. 여기서 계산비용(cost)은 기존의 정합윈도우 안에서 세그먼트 영역을 적용한 새로운 비용함수를 사용하며, 이 새로운 비용함수를 통해 정확도를 높인다. 마지막으로 동적 계획법을 통하여 얻어진 조밀한 disparity map을 세그먼트 영역들의 시각특성(visibility)과 유사도(similarity)를 이용하여 에러를 찾아내고, 세그먼트 정합을 통해 수정함으로 정확한 disparity map을 찾아낸다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.4
• /
• pp.1293-1316
• /
• 2021

Using directional antennas in wireless Ad hoc networks has many superiorities, including reducing interference, extending transmission range, and increasing space division multiplexing. However, directional transmission introduces two problems: deafness and directional hidden terminals problems. We observe that these problems result in saturation throughput disparity among the competing flows in directional CSMA/CA based Ad hoc networks and bring challenges for modeling the saturation throughput of the flows. In this article, we concentrate on how to model and analyze the saturation throughput disparity of different flows in directional CSMA/CA based Ad hoc networks. We first divide the collisions occurring in the transmission process into directional instantaneous collisions and directional persistent collisions. Then we propose a four-dimensional Markov chain to analyze the transmission state for a specific node. Our model has three different kinds of processes, namely back-off process, transmission process and freezing process. Each process contains a certain amount of continuous time slots which is defined as the basic time unit of the directional CSMA/CA protocols and the time length of each slot is fixed. We characterize the collision probabilities of the node by the one-step transition probability matrix in our Markov chain model. Accordingly, we can finally deduce the saturation throughput for each directional data stream and evaluate saturation throughput disparity for a given network topology. Finally, we verify the accuracy of our model by comparing the deviation of analytical results and simulation results.

• Communications for Statistical Applications and Methods
• /
• v.12 no.1
• /
• pp.149-167
• /
• 2005

The minimum disparity estimators introduced by Lindsay and Basu (1994) are studied empirically. An extensive simulation in this paper provides a location estimate of the small sample and supplies empirical evidence of the estimator performance for the univariate contaminated normal model. Empirical results show that the minimum generalized negative exponential disparity estimator (MGNEDE) obtains high efficiency for small sample sizes and dominates the maximum likelihood estimator (MLE) and the minimum blended weight Hellinger distance estimator (MBWHDE) with respect to efficiency at the contaminated model.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.1203-1204
• /
• 2008

In this paper, a new stereo object tracking system using the disparity motion vector is proposed. In the proposed method, the time-sequential disparity motion vector can be estimated from the disparity vectors which are extracted from the sequence of the stereo input image pair and then using these disparity motion vectors, the area where the target object is located and its location coordinate are detected from the input stereo image. Basing on this location data of the target object, the pan/tilt embedded in the stereo camera system can be controlled and as a result, 3D tracking of the target object can be possible.

• Communications for Statistical Applications and Methods
• /
• v.10 no.1
• /
• pp.135-144
• /
• 2003

This work is concerned with comparison of the recently developed disparity measures for the partial association model in three dimensional categorical data. Data are generated by using simulation on each term in the log-linear model equation based on the partial association model, which is a proposed method in this paper. This alternative Monte Carlo methods are explored to study the behavior of disparity measures such as the power divergence statistic I(λ), the Pearson chi-square statistic X$^2$, the likelihood ratio statistic G$^2$, the blended weight chi-square statistic BWCS(λ), the blended weight Hellinger distance statistic BWHD(λ), and the negative exponential disparity statistic NED(λ) for moderate sample sizes. We find that the power divergence statistic I(2/3) and the blended weight Hellinger distance family BWHD(1/9) are the best tests with respect to size and power.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.2
• /
• pp.273-278
• /
• 2009

The determination of the associated weights in the theory of ordered weighted averaging (OWA) operators is one of the important issue. Recently, Wang and Parkan [Information Sciences 175 (2005) 20-29] proposed a minimax disparity approach for obtaining OWA operator weights and the approach is based on the solution of a linear program (LP) model for a given degree of orness. Recently, Liu [International Journal of Approximate Reasoning, accepted] showed that the minimum variance OWA problem of Fuller and Majlender [Fuzzy Sets and Systems 136 (2003) 203-215] and the minimax disparity OWA problem of Wang and Parkan always produce the same weight vector using the dual theory of linear programming. In this paper, we give an improved proof of the minimax disparity problem of Wang and Parkan while Liu's method is rather complicated. Our method gives the exact optimum solution of OWA operator weights for all levels of orness, $0\leq\alpha\leq1$, whose values are piecewise linear and continuous functions of $\alpha$.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1098-1101
• /
• 2004

The ordinary stereo image of an object consists of data of left and right views. Therefore, the left and right image pairs have to be transmitted simultaneously in order to display 3-dimentional video at the remote site. However, due to the twice data in comparing with a monoscopic image of the same object, it needs to be compressed for fast transmission and resource saving. Hence, it needs an effective coding algorithm for compressing stereo image. It was found previously that compressing left and right frames independently will achieve the compression ratio lower than compressing by utilizing the spatial redundancy between both frames. Therefore, in this paper, we study the stereo image compression technique based on the multiresolution wavelet transform using varied disparity-block size for estimation and compensation. The size of disparity-block in the stereo pair subbands are scaling on a coarse-to-fine wavelet coefficients strategy. Finally, the reference left image and residual right image after disparity estimation and compensation are coded by using SPIHT coding. The considered method demonstrates good performance in both PSNR measures and visual quality for stereo image.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.5
• /
• pp.255-265
• /
• 2013

3DTV is expected to be a promising next-generation broadcasting service. On the other hand, the visual discomfort/fatigue problems caused by viewing 3D videos have become an important issue. This paper proposes a perceptual quality assessment metric for a stereoscopic video (SV-PQAM). To model the SV-PQAM, this paper presents the following features: temporal variance, disparity variation in intra-frames, disparity variation in inter-frames and disparity distribution of frame boundary areas, which affect the human perception of depth and visual discomfort for stereoscopic views. The four features were combined into the SV-PQAM, which then becomes a no-reference stereoscopic video quality perception model, as an objective quality assessment metric. The proposed SV-PQAM does not require a depth map but instead uses the disparity information by a simple estimation. The model parameters were estimated based on linear regression from the mean score opinion values obtained from the subjective perception quality assessments. The experimental results showed that the proposed SV-PQAM exhibits high consistency with subjective perception quality assessment results in terms of the Pearson correlation coefficient value of 0.808, and the prediction performance exhibited good consistency with a zero outlier ratio value.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.57-60
• /
• 2002

본 논문에서는 능동윤곽모델(active contour model)의 잘 알려져 있는 스네이크(snake) 알고리즘을 스테레오영상에 적용하여 좌 우 영상의 disparity 정보를 이용 객체의 경계선을 찾는 알고리즘을 제안한다. 스네이크는 객체의 경계를 얻기 위해 에지정보를 사용하는데 실제 이미지에서 객체의 경계가 아닌 인접한 주위의 강한 애지(edge)에 대해서도 영향을 받게 되는 문제가 있다. 이러한 문제를 해결하기 위해 스테레오영상의 disparity 정보를 이용하여 이를 개선하고 disparity 측정에 사용되는 블록매칭(block matching)방법을 스네이크 알고리즘에 적용시켰다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1A
• /
• pp.57-63
• /
• 2012

In this paper, we propose a real-time view interpolation method using virtual viewpoint disparity estimation and convergence check. For the real-time process, we estimate a disparity map at the virtual viewpoint from stereo images using the belief propagation method. This method needs only one disparity map, compared to the conventional methods that need two disparity maps. In the view synthesis part, we warp pixels from the reference images to the virtual viewpoint image using the disparity map at the virtual viewpoint. For real-time acceleration, we utilize a high speed GPU parallel programming, called CUDA. As a result, we can interpolate virtual viewpoint images in real-time.