We propose a correspondence matching algorithm for multi-view video sequences, which provides reliable performance even when the multiple cameras have significantly different parameters, such as viewing angles and positions. We use an activity vector, which represents the temporal occurrence pattern of moving foreground objects at a pixel position, as an ...

A suitable object model is crucial in guiding an object segmentation method of three-dimensional medical images to avoid difficulties such as complex object structures, inter-subject variability and ambiguous boundaries between organs. The main challenge is to make the model sufficiently complex to represent a wide range of variations effectively, while ...

We propose a fully automatic method for segmenting knee cartilage in 3-D MR images which consists of bone segmentation, bone-cartilage interface (BCI) classification, and cartilage segmentation. For bone segmentation, we propose a modified version of the recently presented branch-and-mincut method, and for classifying the BCI, we propose a voxel classification ...

Under the popular Bayesian approach, a stereo problem can be formulated by defining likelihood and prior. Likelihoods are often associated with unary terms and priors are defined by pair-wise or higher order cliques in Markov random field (MRF). In this paper, we propose to use high order likelihood model in ...

In this paper, we present a new surfel (surface element) based multi-view stereo algorithm that runs entirely on GPU. We utilize the flexibility of surfel-based 3D shape representation and global optimization by graph cuts in the same framework. Unlike previous works, the algorithm is optimized to massive parallel processing on ...

A majority of the existing stereo matching algorithms assume that the corresponding color values are similar to each other. However, it is not so in practice as image color values are often affected by various radiometric factors such as illumination direction, illuminant color, and imaging device changes. For this reason, ...

This paper proposes a new rolled fingerprint construction approach incorporating a state-of-the-art nonrigid image registration method based upon a Markov random field (MRF) energy model. The proposed method finds dense correspondences between images from a rolled fingerprint sequence and warps the entire fingerprint area to synthesize a rolled fingerprint. This ...

Most high dynamic range image (HDRI) algorithms assume stationary scene for registering multiple images which are taken under different exposure settings. In practice, however, there can be some global or local movements between images caused by either camera or object motions. This situation usually causes ghost artifacts which make the ...

In this paper, we propose a new method for solving the Markov random field (MRF) energies with higher-order smoothness priors. The main idea of the proposed method is a graph conversion which decomposes higher-order cliques as hierarchical auxiliary nodes. For a special class of smoothness priors which can be formulated ...

Segmenting semantic objects of interest from video has long been an active research topic, with a wide range of potential applications. In this paper, we present a bilayer video segmentation method robust to abrupt motion and change in appearance for both the foreground and background. Specifically, based on a few ...

This paper deals with feature matching and segmentation of common objects in a pair of images, simultaneously. For the feature matching problem, the matching likelihoods of all feature correspondences are obtained by combining their discriminative power with the spatial coherence constraint that favors their spatial aggregation via object segmentation. At ...

The coding gain that can be achieved by improving the coding order of B frames in the H.264/AVC standard is investigated in this work. We first represent the coding order of B frames and their reference frames with a binary tree. We then formulate a recursive equation to find out ...

In this paper, we propose a new ARG matching scheme based on the nested assignment structure to assess the similarity between two attributed relational graphs (ARGs). ARGs are represented by nodes and edges containing unary attributes and binary relations between nodes, respectively. The nested assignment structure consists of inner and ...

A novel concept of channel division to improve the performance of distributed video coding is proposed in this work. At the decoder, the proposed algorithm partitions each side information frame into multiple regions with different expected distortions. It is shown that the partitioning is equivalent to the division of the ...

An efficient colorization scheme for images and videos based on prioritized source propagation is proposed in this work. A user first scribbles colors on a set of source pixels in an image or the first frame of a movie. The proposed algorithm then propagates those colors to the other non-source ...

In this paper, we consider the colorization problem of gray-scale images in which some color scribbles are initially given. Our proposed method is based on the weighted color blending of the scribbles. Unlike previous works which utilize the shortest distance as the blending weights, we employ a new intrinsic distance ...

In this paper, we propose a fully automatic method to segment bone compartments in magnetic resonance (MR) images of knee joints gathered from a public database for research on knee osteoarthritis (OA), the osteoarthritis initiative (OAI). Considering the fixed scanning parameters which include position and flexion of the knee joint, ...

A signal-to-noise ratio (SNR) and temporal scalable coding algorithm for 3-D mesh sequences using singular value decomposition (SVD) is proposed in this work. The proposed algorithm employs SVD to represent a mesh sequence with a small number of basis vectors, and encodes those basis vectors with a bit plane coder. ...

In this paper, we propose an efficient method for finding consistent correspondences between two sets of features Our matching algorithm augments the discriminative power of each correspondence with the spatial consistency directly estimated from a graph that captures the interactions of all correspondences by using Random Walks with Restart (RWR), ...

In this work, we propose a robust image watermarking algorithm using local Zernike moments, which are computed over circular patches around feature points. The proposed algorithm locally computes Zernike moments and modifies them to embed watermarks, achieving robustness against cropping and local geometric attacks. Moreover, to deal with scaling attacks, ...