• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.302-320
• /
• 2017

In this paper, an innovative robust feature detection and matching strategy for visual odometry based on stereo image sequence is proposed. First, a sparse multiscale 2D local invariant feature detection and description algorithm AKAZE is adopted to extract the interest points. A robust feature matching strategy is introduced to match AKAZE descriptors. In order to remove the outliers which are mismatched features or on dynamic objects, an improved random sample consensus outlier rejection scheme is presented. Thus the proposed method can be applied to dynamic environment. Then, geometric constraints are incorporated into the motion estimation without time-consuming 3-dimensional scene reconstruction. Last, an iterated sigma point Kalman Filter is adopted to refine the motion results. The presented ego-motion scheme is applied to benchmark datasets and compared with state-of-the-art approaches with data captured on campus in a considerably cluttered environment, where the superiorities are proved.

• Journal of the Korean Society of Industry Convergence
• /
• v.27 no.3
• /
• pp.555-561
• /
• 2024

This paper derives material properties of steel bars that simulate the distribution of stress and strain of prestressed tendons used in Prestressed concrete(PSC) girders and presents an optimal material model. ABAQUS software was used to establish the 3D solid model of the PSC girder and strand wire rope for a PS(Prestressed) tendon. Then the model of steel wire rope was imported into the Isight interface plugin directly through the ABAQUS and the Data Matching. In ABAQUS, the contact pairs were established, the models were meshed, the constraints were applied to solve the finite element model and an axial tension of 0.5m/s was loaded to analyze the stress and deformation distributions in the normal working range of the PS strand wire rope. In Data Matching, classical experimental data is fitted to the optimal material properties through finite element analysis and multi-objective optimization. The results show that the steel bar with optimal material properties presents a similar linear area and stress distribution with the PS tendon.

• Nuclear Engineering and Technology
• /
• v.55 no.11
• /
• pp.4112-4119
• /
• 2023

This study employs the microshear test method to examine the local mechanical properties of narrow-gap welded joints, revealing the mechanical inhomogeneity by evaluating the microshear strength, stress-strain curves, and failure strain. On this basis, the influence of weld joints micromechanical inhomogeneity on the crack tip opening displacement (CTOD) fracture toughness is investigated. From the root weld layer to the cover weld layer, the fracture toughness at the center of the weld seam demonstrates an increasing trend, with the experimental and calculated CTOD values showing a good correspondence. The microproperties of the welded joints significantly impact the load-bearing capacity and fracture toughness. During the deformation process of the "low-matching" microregions, the plastic zone expansion is hindered by the surrounding microregion strength constraints, thus reducing the fracture toughness. In contrast, during the deformation of the "high-matching" microregions, the surrounding microregions absorb some of the loading energy, partially releasing the concentrated stress at the crack tip, which in turn increases the fracture toughness.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.12
• /
• pp.84-92
• /
• 1998

In this paper, we propose the novel cost functions for finding the disparity between the left and the right images in the stereo matching problem. The dynamic programming method is used in solving the stereo matching problem by Cox et al[10]. In the reference[10], only the intensity of the pixels in the epipolar line is used as the cost functions to find the corresponding pixels. We propose the two new cost functions. The information of the slope of the pixel is introduced to the constraints in determining the weights of intensity and direction(the historical information). The pixels with the higher slope are matched mainly by the intensity of pixels. As the slope becomes lower, the matching is performed mainly by the direction. Secondly, the disparity information of the previous epipolar line the pixel is used to find the disparity of the current epipolar line. If the pixel in the left epipolar line, $p-i$ and the pixel in the right epipolar line, $p-j$ satisfy the following conditions, the higher matching probability is given to the pixels, $p-i$ and $p-j$. i) The pixels, $p-i$ and $p-j$ are the pixles on the edges in the left and the right images, respectively. ⅱ) For the pixels $p-k$ and $p-l$ in the previous epipolar line, $p-k$and $p-l$ are matched and are the pixels on the same edge with $p-i$ and $p-j$, respectively. The proposed method compared with the original method[10] finds the better matching results for the test images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.11
• /
• pp.2271-2283
• /
• 2015

In this paper, we propose a method which infers an accurate disparity map for radiometrically varying stereo images. For this end, firstly, we transform the input color images to the log-chromaticity color space from which a linear relationship can be established during constructing a joint pdf between input stereo images. Based on this linear property, we present a new stereo matching cost by combining weighted mutual information and the SIFT (Scale Invariant Feature Transform) descriptor with segment-based plane-fitting constraints to robustly find correspondences for stereo image pairs which undergo radiometric variations. Experimental results show that our method outperforms previous methods and produces accurate disparity maps even for stereo images with severe radiometric differences.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.5
• /
• pp.163-172
• /
• 2014

The Scale Invariant Feature Transform (SIFT) has been widely used in a lot of applications for image feature matching. Such a transform allows us to strong matching ability, stability in rotation, and scaling with the variety of different scales. Recently, it has been made one of the most successful algorithms in the research areas of copy-move forgery detections. Though this transform is capable of identifying copy-move forgery, it does not widely address the possibility that counter-forensics operations may be designed and used to hide the evidence of image tampering. In this paper, we propose a targeted counter-forensics method for impeding SIFT-based copy-move forgery detection by applying a semantically admissible distortion in the processing tool. The proposed method allows the attacker to delude a similarity matching process and conceal the traces left by a modification of SIFT keypoints, while maintaining a high fidelity between the processed images and original ones under the semantic constraints. The efficiency of the proposed method is supported by several experiments on the test images with various parameter settings.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.107-110
• /
• 2015

In this paper, we propose a coalitonal game theoritic approach to the power control problem in resource-constrained wireless sensor networks, where the objective is to enhance power efficiency of individual sensors while providing the QoS requirements. We model this problem as two-sided one-to-one matching game and deploly deferred acceptance procedure that produces a single matching in the core. Furthermore, we show that, by applying the procedure repeatedly, a certain stable state is achieved where no sensor can anticipate improvements in their power efficiency as far as all of them are subject to their own QoS constraints. We evaluate our proposal by comparing them with cluster-based and the local optimal solution obtained by maximizing the total system energy efficiency, where the objective function is non-convex.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.11
• /
• pp.907-912
• /
• 2005

In this paper, we consider the problem of designing sliding surfaces fur a class of dynamic systems with mismatched uncertainties in the state space model. In terms of LMIs, we give necessary and sufficient conditions fir the existence of a linear sliding surface such that the reduced order sliding mode dynamics is asymptotically stable and completely independent of uncertainties. We parameterize all such linear sliding surfaces by using the solution to the given LMI conditions. And, we consider the problem of designing linear sliding surfaces guaranteeing pole placement constraints or $H_2/H_infty$ performances. Finally, we give a design example in order to show the effectiveness of our method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.7
• /
• pp.508-519
• /
• 1991

A new heuristic two-dimensional symbolic layout compaction approach is developed. After conventional one-dimensional compaction steps, all the components on the critical paths that define the height or width of the given layout are found and rearranged to reduce layout size. During this process, constraints in both x and y directions are considered and pitch-matching of ports for hierarchical compaction can be achieved to reduce the amount of the design data. This approach generated the smallest area for several examples we have tried when compared with other published results. The expected run time can be bouned by OT$_1$, where T$_1$ is the run time of a typical one-dimensional compactor.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.2171-2185
• /
• 2020

In order to judge that whether the vehicles in different images which are captured by surveillance cameras represent the same vehicle or not, we proposed a novel vehicle face recognition algorithm based on improved Nonnegative Matrix Factorization (NMF), different from traditional vehicle recognition algorithms, there are fewer effective features in vehicle face image than in whole vehicle image in general, which brings certain difficulty to recognition. The innovations mainly include the following two aspects: 1) we proposed a novel idea that the vehicle type can be determined by a few key regions of the vehicle face such as logo, grille and so on; 2) Through adding weight, sparseness and classification property constraints to the NMF model, we can acquire the effective feature bases that represent the key regions of vehicle face image. Experimental results show that the proposed algorithm not only achieve a high correct recognition rate, but also has a strong robustness to some non-cooperative factors such as illumination variation.