• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.1998-2009
• /
• 1998

An effective algorithm for tracking rigid or non-rigid moving object(s) which segments local moving parts from image sequence in the presence of backgraound motion by camera movenment, predicts the direction of it, and tracks the object is proposed. It requires no camera calibration and no knowledge of the installed position of camera. In order to segment the moving object, feature points configuring the shape of moving object are firstly selected, feature flow field composed of motion vectors of the feature points is computed, and moving object(s) is (are) segmented by clustering the feature flow field in the multi-dimensional feature space. Also, we propose IRMAS, an efficient algorithm that finds the convex hull in order to cinstruct the shape of moving object(s) from clustered feature points. And, for the purpose of robjst tracking the objects whose movement characteristics bring about the abrupt change of moving trajectory, an improved order adaptive lattice structured linear predictor is used.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.7
• /
• pp.1-7
• /
• 2021

In this paper, we propose a feature selection technique for multi-label classification. Many existing feature selection techniques have selected features by calculating the relation between features and labels such as a mutual information scale. However, since the mutual information measure requires a joint probability, it is difficult to calculate the joint probability from an actual premise feature set. Therefore, it has the disadvantage that only a few features can be calculated and only local optimization is possible. Away from this regional optimization problem, we propose a feature selection technique that constructs a low-rank space in the entire given feature space and selects features with sparsity. To this end, we designed a regression-based objective function using Nuclear norm, and proposed an algorithm of gradient descent method to solve the optimization problem of this objective function. Based on the results of multi-label classification experiments on four data and three multi-label classification performance, the proposed methodology showed better performance than the existing feature selection technique. In addition, it was showed by experimental results that the performance change is insensitive even to the parameter value change of the proposed objective function.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.174-179
• /
• 2003

Through the simultaneous localization and map building (SLAM) technique, a robot can create maps about its unknown environment while it continuously localizes its position. Grid maps and feature maps have been widely used for SLAM together with application of probability methods and POMDP (partially observed Markov decision process). But this approach based on grid maps suffers from enormous computational burden. Topological maps, however, have drawn more attention these days because they are compact, provide natural interfaces, and are easily applicable to path planning in comparison with grid maps. Some topological SLAM techniques like GVG (generalized Voronoi diagram) were introduced, but it enables the robot to decide only whether the current position is part of GVG branch or not in the GVG algorithm. In this paper, therefore, to overcome these problems, we present a method for updating a global topological map from the local topological maps. These local topological maps are created through a labeled Voronoi diagram algorithm from the local grid map built based on the sensor information at the current robot position. And the nodes of a local topological map can be utilized as the features of the environment because it is robust in light of visibility problem. The geometric information of the feature is applied to the extended Kalman filter and the SLAM in the indoor environment is accomplished. A series of simulations have been conducted using a two-wheeled mobile robot equipped with a laser scanner. It is shown that the proposed scheme can be applied relatively well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.1
• /
• pp.1-9
• /
• 2013

This paper propose a human action recognition method that uses bag-of-features (BoF) based on CS-LBP (center-symmetric local binary pattern) and a spatial pyramid in addition to the random forest classifier. To construct the BoF, an image divided into dense regular grids and extract from each patch. A code word which is a visual vocabulary, is formed by k-means clustering of a random subset of patches. For enhanced action discrimination, local BoF histogram from three subdivided levels of a spatial pyramid is estimated, and a weighted BoF histogram is generated by concatenating the local histograms. For action classification, a random forest, which is an ensemble of decision trees, is built to model the distribution of each action class. The random forest combined with the weighted BoF histogram is successfully applied to Standford Action 40 including various human action images, and its classification performance is better than that of other methods. Furthermore, the proposed method allows action recognition to be performed in near real-time.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.6 no.2
• /
• pp.61-67
• /
• 2006

We fabricate local damascene FinFET cell array in sub-60nm feature sized DRAM. The local damascene structure can remove passing-gate-effects in FinFET cell array. p+ boron in-situ doped polysilicon is chosen for the gate material, and we obtain a uniform distribution of threshold voltages at around 0.7V. Sub-threshold swing of 75mV/d and extrapolated off-state leakage current of 0.03fA are obtained, which are much suppressed values against those of recessed channel array transistors. We also obtain a few times higher on-state current. Based on the improved on- and off-state current characteristics, we expect that the FinFET cell array could be a new mainstream structure in sub-60nm DRAM devices, satisfying high density, low power, and high-speed device requirements.

• Journal of the Korea Computer Graphics Society
• /
• v.14 no.4
• /
• pp.19-25
• /
• 2008

In this paper, we present new cel shading technique using local light that increases local contrast for apparent shape depiction. To convey detail and overall shape, we employ virtual local light to represent cubic effect and local shape. Moreover, we control increase of local contrast using curvature as complexity and curvature as importance to adapt depicted local shape to feature of each area. Our technique depicts shape well wherever global light is.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.9
• /
• pp.1167-1174
• /
• 1999

In this paper, we present a new technique for the local decomposition of convex structuring elements for morphological image processing. Local decomposition of a structuring element consists of local structuring elements, in which each structuring element consists of a subset of origin pixel and its eight neighbors. Generally, local decomposition of a structuring element reduces the amount of computation required for morphological operations with the structuring element. A unique feature of our approach is the use of linear integer programming technique to determine optimal local decomposition that guarantees the minimal amount of computation. We defined a digital convex polygon, which, in turn, is defined as a convex structuring element, and formulated the necessary and sufficient conditions to decompose a digital convex polygon into a set of basis digital convex polygons. We used a set of linear equations to represent the relationships between the edges and the positions of the original convex polygon, and those of the basis convex polygons. Further. a cost function was used represent the total processing time required for computation of dilation/erosion with the structuring elements in a decomposition. Then integer linear programming was used to seek an optimal local decomposition, that satisfies the linear equations and simultaneously minimize the cost function.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4502-4518
• /
• 2015

Fisher linear discriminant analysis (LDA) is one of the most popular projection techniques for feature extraction and has been widely applied in face recognition. However, it cannot be used when encountering the single sample per person problem (SSPP) because the intra-class variations cannot be evaluated. In this paper, we propose a novel method called local similarity based linear discriminant analysis (LS_LDA) to solve this problem. Motivated by the "divide-conquer" strategy, we first divide the face into local blocks, and classify each local block, and then integrate all the classification results to make final decision. To make LDA feasible for SSPP problem, we further divide each block into overlapped patches and assume that these patches are from the same class. To improve the robustness of LS_LDA to outliers, we further propose local similarity based median discriminant analysis (LS_MDA), which uses class median vector to estimate the class population mean in LDA modeling. Experimental results on three popular databases show that our methods not only generalize well SSPP problem but also have strong robustness to expression, illumination, occlusion and time variation.

• Journal of the HCI Society of Korea
• /
• v.2 no.2
• /
• pp.35-43
• /
• 2007

This paper presents a system for image matching and recognition based on image feature detection and description techniques from artificial satellite photographs. We propose some kind of parameters from the varied environmental elements happen by image handling process. The essential point of this experiment is analyzes that affects match rate and recognition accuracy when to change of state of each parameter. The proposed system is basically inspired by Lowe's SIFT(Scale-Invariant Transform Feature) algorithm. The descriptors extracted from local affine invariant regions are saved into database, which are defined by k-means performed on the 128-dimensional descriptor vectors on an artificial satellite photographs from Google earth. And then, a label is attached to each cluster of the feature database and acts as guidance for an appeared building's information in the scene from camera. This experiment shows the various parameters and compares the affected results by changing parameters for the process of image matching and recognition. Finally, the implementation and the experimental results for several requests are shown.

• Journal of the HCI Society of Korea
• /
• v.1 no.2
• /
• pp.27-33
• /
• 2006

This paper presents a new approach to translation and rotation invariant feature extraction for image texture retrieval. For the rotation invariant feature extraction, we invent angular projection along angular frequency in Polar coordinate system. The translation and rotation invariant feature vector for representing texture images is constructed by the averaged magnitude and the standard deviations of the magnitude of the Fourier transform spectrum obtained by the proposed angular projection. In order to easily implement the angular projection, the Radon transform is employed to obtain the Fourier transform spectrum of images in the Polar coordinate system. Then, angular projection is applied to extract the feature vector. We present our experimental results to show the robustness against the image rotation and the discriminatory capability for different texture images using MPEG-7 data set. Our Experiment result shows that the proposed rotation and translation invariant feature vector is effective in retrieval performance for the texture images with homogeneity, isotropy and local directionality.