• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5419-5435
• /
• 2017

The construction of panoramic images on smartphones and low-powered devices is a challenging task. In this paper, we propose a new approach for smoothly stitching images on mobile phones in the presence of moving objects in the scene. Our main contributions include handling moving object problems, reducing processing time, and generating rectangular panoramic images. First, unique and robust feature points are extracted using fast ORB method and a feature matching technique is applied to match the extracted feature points. After obtaining good matched feature points, we employ the non-deterministic RANSAC algorithm to discard wrong matches, and the hommography transformation matrix parameters are estimated with the algorithm. Afterward, we determine precise overlap regions of neighboring images and calculate their absolute differences. Then, thresholding operation and noise removal filtering are applied to create a mask of possible moving object regions. Sequentially, an optimal seam is estimated using dynamic programming algorithm, and a combination of linear blending with the mask information is applied to avoid seam transition and ghosting artifacts. Finally, image-cropping operation is utilized to obtain a rectangular boundary image from the stitched image. Experiments demonstrate that our method is able to produce panoramic images quickly despite the existence of moving objects.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.11 no.3
• /
• pp.136-150
• /
• 2008

Many studies have been carried out for automatic extraction of building by LiDAR data or airphoto. Combining the benefits of 3D location information data and shape information data of image can improve the accuracy. So, in this research building recognition algorithm based on contour was used to improve accuracy of building recognition by LiDAR data and elaborate building boundary recognition by airphoto. Building recognition algorithm based on contour can generate building boundary and roof structure information. Also it shows better accuracy of building detection than the existing recognition methods based on TIN or NDSM. Out of creating buffers in regular size on the building boundary which is presumed by contour, this research limits the boundary area of airphoto and elaborate building boundary to fit into edge of airphoto by double active contour. From the result of this research, 3D building boundary will be able to be detected by optimal matching on the constant range of extracted boundary in the future.

• Journal of KIISE:Software and Applications
• /
• v.30 no.10
• /
• pp.973-982
• /
• 2003

This paper presents an efficient method for automatically detecting objects in a given image. The GHT is a robust template matching algorithm for automatic object detection in order to find objects of various shapes. Many different templates are applied by the GHT in order to find objects of various shapes and size. Every boundary detected by the GHT scan be used as an initial outline for more precise contour-finding techniques. The main weakness of the GHT is the excessive time and memory requirements. In order to overcome this drawback, the proposed algorithm uses a multiresolution search by scaling down the original image to half-sized and quarter-sized images. Using the information from the first iterative GHT on a quarter-sized image, the range of nuclear sizes is determined to limit the parameter space of the half-sized image. After the second iterative GHT on the half-sized image, nuclei are detected by the fine search and segmented with edge information which helps determine the exact boundary. The experimental results show that this method gives reduction in computation time and memory usage without loss of accuracy.

• Smart Media Journal
• /
• v.2 no.4
• /
• pp.27-33
• /
• 2013

Multi-view video system provides both realistic 3D feelings and free-view navigation. But it is hard to transmit too huge data, so we send only two or three view images and generate intermediate view image using depth information. In this paper, we propose high quality multi-view image generation method from stereoscopic images. Since the stereo matching method does not provide accurate disparity values for all the pixels, especially at the occlusion area, we propose an occlusion handling method using the background pixels at first. We also apply a joint bilateral filtering to enhance the disparity map at the object boundary since it can affect the quality of synthesized images significantly. Finally, we can generate virtual view images at intermediate view positions using confidence map to reduce bad pixel and hole's error. Experimental results show the proposed method performs better than the conventional method.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.904-907
• /
• 2002

In this paper, we describe an algorithm to automatically generate an intermediate scene using the bidirectional disparity morphing from the parallel stereopair. To compute the disparity between two reference images, we use the 2-step fast block matching algorithm that restricts the searching range and accelerates the speed of the computation of the disparity. We also define three occluding patterns so as to smooth the computed disparities, especially for occluded regions. They are derived from the peculiar properties of the disparity map. The smoothed disparity maps present that the false disparities are well corrected and the boundary between foreground and background becomes sharper. We discuss the advantages of this algorithm compared to the commonly used schemes and we show some experimental results with real data.

• Convergence Security Journal
• /
• v.13 no.3
• /
• pp.9-15
• /
• 2013

Calculating of matching cost is an important for efficient stereo matching. To investigate the performance of matching process, the concepts of the existing methods are introduced. Also we analyze the performance and merits of them. The simplest matching costs assume constant intensities at matching image locations. We consider matching cost functions which can be distinguished between pixel-based and window-based approaches. The Pixel-based approach includes absolute differences (AD) and sampling-intensitive absolute differences (BT). The window-based approach includes the sum of the absolute differences, the sum of squared differences, the normalized cross-correlation, zero-mean normalized cross-correlation, census transform, and the absolute differences census transform (AD-Census). We evaluate matching cost functions in terms of accuracy and time complexity. In terms of the accuracy, AD-Census method shows the lowest matching error ratio (the best solution). The ZNCC method shows the lowest matching error ratio in non-occlusion and all evaluation part. But it performs high matching error ratio at the discontinuities evaluation part due to blurring effect in the boundary. The pixel-based AD method shows a low complexity in terms of time complexity.

• Journal of Internet Computing and Services
• /
• v.12 no.6
• /
• pp.117-128
• /
• 2011

In this paper, we present a novel approach for contents-based medication image retrieval from a medication image database using the shape classification and color information of the medication. One major problem in developing a contents-based drug image retrieval system is there are too many similar images in shape and color and it makes difficult to identify any specific medication by a single feature of the drug image. To resolve such difficulty in identifying images, we propose a hybrid approach to retrieve a medication image based on shape and color features of the medication. In the first phase of the proposed method we classify the medications by shape of the images. In the second phase, we identify them by color matching between a query image and preclassified images in the first phase. For the shape classification, the shape signature, which is unique shape descriptor of the medication, is extracted from the boundary of the medication. Once images are classified by the shape signature, Hue and Saturation(HS) color model is used to retrieve a most similarly matched medication image from the classified database images with the query image. The proposed system is designed and developed especially for specific population- seniors to browse medication images by using visual information of the medication in a feasible fashion. The experiment shows the proposed automatic image retrieval system is reliable and convenient to identify the medication images.

• The KIPS Transactions:PartB
• /
• v.14B no.4
• /
• pp.263-272
• /
• 2007

This paper proposes a skeleton-based hierarchical shape description scheme, called a skeleton tree, for accurate shape-based image retrieval. A skeleton tree represents an object shape as a hierarchical tree where high-level nodes describe parts of coarse trunk regions and low-level nodes describe fine details of boundary regions. Each node refines the shape of its parent node. Most of the noise disturbances are limited to bottom level nodes and the boundary noise is reduced by decreasing weights on the bottom levels. The similarity of two skeleton trees is computed by considering the best match of a skeleton tree to a sub-tree of another skeleton tree. The proposed method uses a hybrid similarity measure by employing both Fourier descriptors and moment invariants in computing the similarity of two skeleton trees. Several experimental results are presented demonstrating the validity of the skeleton tree scheme for the shape description and indexing.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.16 no.5
• /
• pp.134-140
• /
• 2017

Shape-from-shading (SFS) or stereo vision algorithms can be utilized to measure the shape of an object with imaging techniques for effective sensing in non-contact measurements. SFS algorithms could reconstruct the 3D information from a 2D image data, offering relatively comprehensive information. Meanwhile, a stereo vision algorithm needs several feature points or lines to extract 3D information from two 2D images. However, to measure the size of an object with a freeform surface, the two algorithms need some additional information, such as boundary conditions and grids, respectively. In this study, a stereo vision scheme using the depth information obtained by shape-from-shading as patterns was proposed to measure the size of an object with a freeform surface. The feasibility of the scheme was proved with an experiment where the images of an object were acquired by a CCD camera at two positions, then processed by SFS, and finally by stereo matching. The experimental results revealed that the proposed scheme could recognize the size and shape of freeform surface fairly well.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.3
• /
• pp.357-362
• /
• 2005

Iris recognition system is the one of the most reliable biometries recognition system. An algorithm is proposed to determine the localized iris from the iris image received from iris input camera in client. For the first step, the algorithm determines the center of pupil. For the second step, the algorithm determines the outer boundary of the iris and the pupillary boundary. The localized iris area is transformed into polar coordinates. After performing three times Wavelet transformation, normalization was done using a sigmoid function. The converting binary process performs normalized value of pixel from 0 to 255 to be binary value, and then the converting binary process is compared pairs of two adjacent pixels. The binary code of the iris is transmitted to the server by the network. In the server, the comparing process compares the binary value of presented iris to the reference value in the database. The process of recognition or rejection is dependent on the value of Hamming Distance. After matching the binary value of presented iris with the database stored in the server, the result is transmitted to the client.