• 한국HCI학회:학술대회논문집
• /
• 2008.02b
• /
• pp.298-303
• /
• 2008

Watching a program on IPTV among the numerous choices from the internet requires a burden of searching and browsing for a favorite one. This paper introduces a new concept called Mosaic Map and presents how it provides preview information of image map links to other programs. In Mosaic Map the pixels in the still image are used both as shading the background and as thumbnails which can link up with other programs. This kind of contextualized preview of choices can help IPTV users to associate the image with related programs without making visual saccades between watching IPTV and browsing many choices. The experiments showed that the Mosaic Map reduces the time to complete search and browsing, comparing to the legacy menu and web search.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.223-230
• /
• 2003

Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R＊-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R＊-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R＊-tree combines SOM and R＊-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R＊-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R＊-tree with that of an SOM and an R＊-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R＊-tree outperforms both the SOM and R＊-tree due to the reduction of the number of nodes required to build R＊-tree and retrieval time cost.

• Spatial Information Research
• /
• v.2 no.2
• /
• pp.197-205
• /
• 1994

In this paper, we present a vectorization algorithm for finding a vector image from a raster image of the land registered map which is used as the base map for various applications, and an automatic region creation algorithm for generating every re¬gion automatically from the vector image. We describe an ARM (automatic geographical entity recognition and modeling software) which carries out the recognition and process¬ing of geographical entities automatically using those algorithms.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.8
• /
• pp.1238-1246
• /
• 1989

In this paper, a texture synthesis technique based on the NCAR(non-causal auto-regressive) model and the pyramid structure is proposed. In order to estimate the NCAR model parameters accurately from a noisy texture, the MAP(maximum a posteriori) estimation technique is also employed. In our approach, since the input texture is decomposed into the Laplacian oyramid planes first and then the NCAR model is applied to each plane, we are able to obtain a good synthesized texture even if the texture exhibits some non-random local structure or non-homogenity. The usrfulness of the proposed method is demonstrated with seveal real textures in the Brodatz album. Finally, the 2-dimensional MAP estimation technique can be used to the image restoration for noisy images as well as a texture image synthesis.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.317-318
• /
• 2006

There are lot of noises and errors in depth map image which is gotten by using a stereo camera. These errors are caused by mismatching of the corresponding points which occur in texture-less region of input images of stereo camera or occlusions. In this paper, we use a method which is able to get rid of the noises through post processing and reduce the errors of disparity values which are caused by the mismatching in the texture-less region of input images through the correlation between the depth map images and the input images. Then we propose a novel method which segments the object by using the improved disparity map images and projections.

• Journal of Information Processing Systems
• /
• v.13 no.3
• /
• pp.448-463
• /
• 2017

Multimedia is a ubiquitous and indispensable part of our daily life and learning such as audio, image, and video. Objective and subjective quality evaluations play an important role in various multimedia applications. Blind image quality assessment (BIQA) is used to indicate the perceptual quality of a distorted image, while its reference image is not considered and used. Blur is one of the common image distortions. In this paper, we propose a novel BIQA index for Gaussian blur distortion based on the fact that images with different blur degree will have different changes through the same blur. We describe this discrimination from three aspects: color, edge, and structure. For color, we adopt color histogram; for edge, we use edge intensity map, and saliency map is used as the weighting function to be consistent with human visual system (HVS); for structure, we use structure tensor and structural similarity (SSIM) index. Numerous experiments based on four benchmark databases show that our proposed index is highly consistent with the subjective quality assessment.

• 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.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.21 no.1
• /
• pp.45-51
• /
• 2003

Stereo bird's-eyes-view was prepared for 3-dimensional view of various forms of Jecheon city, and 3-dimensional simulation was applied to it so as to show it in moving pictures in spatial. In manufacturing stereo bird's-eyes-view, perspective technology was used in image-making technology, and the basic material images are prepared as fellows: used EOC Images from Arirang-1 satellite, created DEM whose error was optionally geometric corrected after drawn from the contour line of the map on a scale of l/5,000 manufactured by national geography institute as a national standard map, and classified road lines which were manufactured as a road layer vector file of a map on a scale of l/l,000 and then overlay it over the three dimensional image of target area. Especially for the connectivity with address system to be used in new address, an arterial road map on a scale of l/l,000 that had been manufactured to grant new address was used in maximum in road network structure data of city area in this study.

• Journal of Digital Convergence
• /
• v.14 no.12
• /
• pp.231-236
• /
• 2016

Currently, a traffic monitoring service using a surveillance camera is provided through internet. In general, if the user points a certain location on a map, then this service shows the real-time image of the camera where it is mounted. In this paper, we proposed the intuitive surveillance monitoring system which displays a real-time camera image on the map by warping with bird's-eye view and with the top of image as the north. In order to robustly estimate the road plane using camera image, we used the motion vectors which can be detected to changes in brightness. We applied a re-adjustment process to have the same directivity with a map and presented a user-friendly interface that can be displayed on the map. In the experiment, the proposed method was presented as the result of warping image that the user can easily perceive like a map.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.228-237
• /
• 2007

displacement mapping enables us to add realistic details to polygonal meshes without changing geometry. We present a real-time artifacts-free inverse displacement mapping method. In each pixel, we construct a ray and trace the ray through the displacement map to find an intersection. To skip empty regions safely, we traverse the image pyramid of displacement map in top-down order. Furthermore, when the displacement map is enlarged, intersection with bilinear interpolated displacement map can be found. When the displacement map is at distance, our method supports mipmap-like prefiltering to enhance image quality and speed. Experimental results show that our method can produce correct images even at grazing view angles. Rendering speed of a test scene is over hundreds of frames per second and the influence of resolution of displacement map to rendering speed is little. Our method is simple enough to be added to existing virtual reality systems easily.