• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.898-902
• /
• 2012

A descriptor which is suitable for motion analysis by using the motion features of moving objects from the real time image sequence is proposed. To segment moving objects from the background, the background learning is performed. We extract motion trajectories of individual objects by using the sequence of the $1^{st}$ order moment of moving objects. The center points of each object are managed by linked list. The descriptor includes the $1^{st}$ order coordinates of moving object belong to neighbor of the per-defined position in grid pattern, the start frame number which a moving object appeared in the scene and the end frame number which it disappeared. A video retrieval by the proposed descriptor combining global and local feature is more effective than conventional methods which adopt a single feature among global and local features.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9C
• /
• pp.555-563
• /
• 2011

In this paper, we propose an object based 2D image to 3D conversion algorithm by using motion estimation, color labeling and non-local mean filtering methods. In the proposed algorithm, we first extract the motion vector of each object by estimating the motion between frames and then segment a given image frame with color labeling method. Then, combining the results of motion estimation and color labeling, we extract object regions and assign an exact depth value to each object to generate the right image. While generating the right image, occlusion regions occur but they are effectively recovered by using non-local mean filter. Through the experimental results, it is shown that the proposed algorithm performs much better than conventional conversion scheme by removing the eye fatigue effectively.

• Journal of Information Processing Systems
• /
• v.14 no.5
• /
• pp.1176-1194
• /
• 2018

The object classification using the images' contents is a big challenge in computer vision. The superpixels' information can be used to detect and classify objects in an image based on locations. In this paper, we proposed a methodology to detect and classify the image's pixels' locations using enhanced bag of words (BOW). It calculates the initial positions of each segment of an image using superpixels and then ranks it according to the region score. Further, this information is used to extract local and global features using a hybrid approach of Scale Invariant Feature Transform (SIFT) and GIST, respectively. To enhance the classification accuracy, the feature fusion technique is applied to combine local and global features vectors through weight parameter. The support vector machine classifier is a supervised algorithm is used for classification in order to analyze the proposed methodology. The Pascal Visual Object Classes Challenge 2007 (VOC2007) dataset is used in the experiment to test the results. The proposed approach gave the results in high-quality class for independent objects' locations with a mean average best overlap (MABO) of 0.833 at 1,500 locations resulting in a better detection rate. The results are compared with previous approaches and it is proved that it gave the better classification results for the non-rigid classes.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.8
• /
• pp.309-314
• /
• 2015

One of typical methods for extracting facial features from face images may be snake. Although snake is simple and fast, performance is very much affected by the initial contour and the shape of object to be extracted. In this paper, the enhanced snake is proposed to extract better facial features from 6 lip and mouth images as snake point is added to the midpoint of snake segment. It is shown that RSD of the proposed method is about 2.8% to 5.8% less than that of Greedy snake about 6 test face images. Since lesser RSD is especially obtained for contours with highly concavity, the contour is more accurately extracted.

• Journal of Advanced Navigation Technology
• /
• v.16 no.3
• /
• pp.455-462
• /
• 2012

The loss due to caching replacement in the wireless mobile proxy caching structure has a significant effect on streaming QoS. This paper proposes a similarity-based caching loss minimization (SCLM) for minimizing the loss caused by the caching replacement. The proposed scheme divides object segments, and then it performs the similarity relation about them. Segments that perform the similarity relation generates similarity relation tree (SRT). The similarity is an important metric for deciding a relevance feedback, and segments that satisfy these requirements in the cache block for caching replacement. Simulation results show that the proposed scheme has better performance than the existing prefix caching scheme, segment-based caching scheme, and bi-directional proxy scheme in terms of QoS, average delayed startup ratio, cache throughput, and cache response ratio.

• Journal of the Institute of Convergence Signal Processing
• /
• v.17 no.2
• /
• pp.67-70
• /
• 2016

This paper discusses a graphic user interface(GUI) for the concealed target segmentation. The human subject hiding a metal gun is captured by the passive millimeter wave(MMW) imaging system. The imaging system operates on the regime of 8 mm wavelength. The MMW image is analyzed by the multi-level segmentation to segment and identify a concealed weapon under clothing. The histogram of the passive MMW image is modeled with the Gaussian mixture distribution. LBG vector quantization(VQ) and expectation and maximization(EM) algorithms are sequentially applied to segment the body and the object area. In the experiment, the GUI is implemented by the MFC(Microsoft Foundation Class) and the OpenCV(Computer Vision) libraries and tested in real-time showing the efficiency of the system.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.61-70
• /
• 2023

Image segmentation is a very crucial step in effective digital image processing. In the past decade, several research contributions were given related to this field. However, a general segmentation algorithm suitable for various applications is still challenging. Among several image segmentation approaches, graph-based approach has gained popularity due to its basic ability which reflects global image properties. This paper proposes a methodology to partition the image with its pixel, region and texture along with its intensity. To make segmentation faster in large images, it is processed in parallel among several CPUs. A way to achieve this is to split images into tiles that are independently processed. However, regions overlapping the tile border are split or lost when the minimum size requirements of the segmentation algorithm are not met. Here the contributions are made to segment the image on the basis of its pixel using min-cut/max-flow algorithm along with edge-based segmentation of the image. To segment on the basis of the region using a homogenous optimum cut algorithm with boundary segmentation. On the basis of texture, the object type using spectral partitioning technique is identified which also minimizes the graph cut value.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.10
• /
• pp.150-161
• /
• 2013

This paper presents a new system which produces high resolution 3D contents by capturing multiview images of an object using multiple cameras, and estimating geometric and texture information of the object from the captured images. Even though a variety of multiview image-based 3D reconstruction systems have been proposed, it was difficult to generate high resolution 3D contents because multiview image-based 3D reconstruction requires a large amount of memory and computation. In order to reduce computational complexity and memory size for 3D reconstruction, the proposed system predetermines the regions in input images where an object can exist to extract object boundaries fast. And for fast computation of a visual hull, the system represents silhouettes and 3D-2D projection/back-projection relations by chain codes and 1D homographies, respectively. The geometric data of the reconstructed object is compactly represented by a 3D segment-based data format which is called DoCube, and the 3D object is finally reconstructed after 3D mesh generation and texture mapping are performed. Experimental results show that the proposed system produces 3D object contents of $800{\times}800{\times}800$ resolution with a rate of 2.2 seconds per frame.

• Journal of Digital Convergence
• /
• v.14 no.2
• /
• pp.183-190
• /
• 2016

This paper proposes algorithm to reduce the computing time in a neural network that reduces transmission of data for tracking mobile objects in surveillance networks in terms of detection and communication load. Object Detection can be defined as follows : Given image sequence, which can forom a digitalized image, the goal of object detection is to determine whether or not there is any object in the image, and if present, returns its location, direction, size, and so on. But object in an given image is considerably difficult because location, size, light conditions, obstacle and so on change the overall appearance of objects, thereby making it difficult to detect them rapidly and exactly. Therefore, this paper proposes fast and exact object detection which overcomes some restrictions by using neural network. Proposed system can be object detection irrelevant to obstacle, background and pose rapidly. And neural network calculation time is decreased by reducing input vector size of neural network. Principle Component Analysis can reduce the dimension of data. In the video input in real time from a CCTV was experimented and in case of color segment, the result shows different success rate depending on camera settings. Experimental results show proposed method attains 30% higher recognition performance than the conventional method.

• The KIPS Transactions:PartB
• /
• v.11B no.7 s.96
• /
• pp.769-778
• /
• 2004

Object segmentation is a challenging Problem when the background is cluttered and the objects are overlapped one another. Recent develop-ment using snake algorithms proposed to segment objects from a 2-D Image presents a higher possibilityfor getting better contours. However, the performance of those snake algorithms degrades rapidly when the background is cluttered and objects are overlapped one another, Moreover, the initial snake point placement is another difficulty to be resolved. Here, we propose a novel snake algorithm for object segmentation using disparity information taken from a set of stereo images. By applying our newly designed snake energy function defined in the disparity space, our algorithmeffectively circumvents the limitations found in the previous methods. The performance of the proposed algorithm has been verified by computer simulation using various stereo image sets. The experiment results have exhibited a better performance over the well-known snake algorithm in terms of segmentation accuracy.