1-11hit |
An-shui YU Kenji HARA Kohei INOUE Kiichi URAHAMA
In this paper, we propose a method for enhancing the visibility of omnidirectional spherical images by enlarging the foreground and compressing the background without provoking a sense of visual incompatibility by using a simplified spring model.
Kohei INOUE Kenji HARA Kiichi URAHAMA
Recently, hue-preserving color image enhancement methods have been proposed by several researchers. However, the theoretical comparison of the performance of their methods has not been conducted yet. In this paper, we propose a hue-preserving saturation maximization method, and show a relationship of the saturation of enhanced colors by related methods. We also demonstrate the correctness of the relationship experimentally.
We propose a method for halftoning grayscale images by drawing weighted centroidal Voronoi tessellations (WCVTs) with black lines on white image planes. Based on the fact that CVT approaches a uniform hexagonal lattice asymptotically, we derive a relationship of darkness between input grayscale images and the corresponding halftone images. Then the derived relationship is used for adjusting the contrast of the halftone images. Experimental results show that the generated halftone images can reproduce the original tone in the input images faithfully.
Computation of scale space images requires numerical integration of partial differential equations, which demands large computational costs especially in nonlinear cases. In this paper, we present a computational scheme for nonlinear scale spaces based on iterated filtering of original images. This scheme is found to be a special case of numerical integration with a particularly adapted integration steplength. We show the stability of the iteration with local windows and that with global ones and analyze the deformation of edge waveforms in the filtering. Computational costs are evaluated experimentally for both local and global windows and finally we apply the nonlinear multi-scale smoothing to contrast enhancement of images.
Takayuki HATTORI Kohei INOUE Kenji HARA
We propose a generalization of the rolling guidance filter (RGF) to a similarity-based clustering (SBC) algorithm which can handle general vector data. The proposed RGF-based SBC algorithm makes the similarities between data clearer than the original similarity values computed from the original data. On the basis of the similarity values, we assign cluster labels to data by an SBC algorithm. Experimental results show that the proposed algorithm achieves better clustering result than the result by the naive application of the SBC algorithm to the original similarity values. Additionally, we study the convergence of a unimodal vector dataset to its mean vector.
Kohei INOUE Kenji HARA Kiichi URAHAMA
Linear discriminant analysis (LDA) is one of the well-known schemes for feature extraction and dimensionality reduction of labeled data. Recently, two-dimensional LDA (2DLDA) for matrices such as images has been reformulated into symmetric 2DLDA (S2DLDA), which is solved by an iterative algorithm. In this paper, we propose a non-iterative S2DLDA and experimentally show that the proposed method achieves comparable classification accuracy with the conventional S2DLDA, while the proposed method is computationally more efficient than the conventional S2DLDA.
In this paper, we propose a method for selecting n-mode singular vectors in higher-order singular value decomposition. We select the minimum number of n-mode singular vectors, when the upper bound of a least-squares cost function is thresholded. The reduced n-ranks of all modes of a given tensor are determined automatically and the tensor is represented with the minimum number of dimensions. We apply the selection method to simultaneous low rank approximation of matrices. Experimental results show the effectiveness of the n-mode singular vector selection method.
Hengjun YU Kohei INOUE Kenji HARA Kiichi URAHAMA
In this paper, we propose a method for color error diffusion based on the Neugebauer model for color halftone printing. The Neugebauer model expresses an arbitrary color as a trilinear interpolation of basic colors. The proposed method quantizes the color of each pixel to a basic color which minimizes an accumulated quantization error, and the quantization error is diffused to the ratios of basic colors in subsequent pixels. Experimental results show that the proposed method outperforms conventional color error diffusion methods including separable method in terms of eye model-based mean squared error.
A method is presented for selecting items asked for new users to input their preference rates on those items in recommendation systems based on the collaborative filtering. Optimal item selection is formulated by an integer programming problem and we solve it by using a kind of the Hopfield-network-like scheme for interior point methods.
Feedback of class memberships is incorporated into multimodal pattern classifiers and their unsupervised learning algorithm is presented. Classification decision at low levels is revised by the feedback information which also enables the reconstruction of patterns at low levels. The effects of the feedback are examined for the McGurk effect by using a simple model.
Weiwei DU Kohei INOUE Kiichi URAHAMA
We extend a graph spectral method for extracting clusters from graphs representing pairwise similarity between data to hypergraph data with hyperedges denoting higher order similarity between data. Our method is robust to noisy outlier data and the number of clusters can be easily determined. The unsupervised method extracts clusters sequentially in the order of the majority of clusters. We derive from the unsupervised algorithm a semi-supervised one which can extract any cluster irrespective of its majority. The performance of those methods is exemplified with synthetic toy data and real image data.