• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2730-2747
• /
• 2016

Due to the limitation of the bandwidth resource and capture resolution of depth cameras, low resolution depth maps should be up-sampled to high resolution so that they can correspond to their texture images. In this paper, a novel depth map up-sampling algorithm is proposed by exploiting the fractal internal self-referential feature. Fractal parameters which are extracted from a depth map, describe the internal self-referential feature of the depth map, do not introduce inherent scale and just retain the relational information of the depth map, i.e., fractal transforms provide a resolution-independent description for depth maps and could up-sample depth maps to an arbitrary high resolution. Then, an enhancement method is also proposed to further improve the performance of the up-sampled depth map. The experimental results demonstrate that better quality of synthesized views is achieved both on objective and subjective performance. Most important of all, arbitrary resolution depth maps can be obtained with the aid of the proposed scheme.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.9
• /
• pp.84-101
• /
• 1997

Inferring and recognizing 3D objects form a 2D occuluded image has been an important research area of computer vision. The octree model, a hierarchical volume description of 3D objects, may be utilized to generate projected images from arbitrary viewing directions, thereby providing an efficient means of the data base for 3D object recognition. We present a fast algorithm of finding the 4 pairs of feature points to estimate the viewing direction. The method is based on matching the object contour to the reference occuluded shapes of 49 viewing directions. The initially best matched viewing direction is calibrated by searching for the 4 pairs of feature points between the input image and the image projected along the estimated viewing direction. Then the input shape is recognized by matching to the projectd shape. The computational complexity of the proposed method is shown to be O(n$^{2}$) in the worst case, and that of the simple combinatorial method is O(m$^{4}$.n$^{4}$) where m and n denote the number of feature points of the 3D model object and the 2D object respectively.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.3
• /
• pp.441-458
• /
• 1996

Many researches on feature recognition have been performed up to now, but the general solution for recognizing arbitrary features has not been developed. The most popular research area in feature recognition is automatic extraction of 2.5 dimensional features, because they are frequently used in manufacturing field. In this paper, a faster and more convenient 2.5 dimensional feature recognition algorithm is proposed using a new strategy which is quite different from the existing ones. The proposed algorithm takes process planning into consideration. The algorithm is implemented in C++. By applying the algorithm to practical complicate examples, we verify that the algorithm is working very well.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.16 no.6
• /
• pp.323-330
• /
• 2021

Visual object tracking is a challenging area of study in the field of computer vision due to many difficult problems, including a fast variation of target shape, occlusion, and arbitrary ground truth object designation. In this paper, we focus on the reinforced feature of the dynamic search area to get better performance than conventional discriminative model prediction trackers on the condition when the accuracy deteriorates since low feature discrimination. We propose a reinforced input feature method shown like the spotlight effect on the dynamic search area of the target tracking. This method can be used to improve performances for deep learning based discriminative model prediction tracker, also various types of trackers which are used to infer the center of the target based on the visual object tracking. The proposed method shows the improved tracking performance than the baseline trackers, achieving a relative gain of 38% quantitative improvement from 0.433 to 0.601 F-score at the visual object tracking evaluation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.2
• /
• pp.286-290
• /
• 2008

This paper summarizes the components of an explicit aeroelastic solver developed especially for the simulation of dynamic fracture events occurring during the flight of solid propellant rockets. The numerical method combines an explicit Arbitrary Lagrangian Eulerian (ALE) version of the Cohesive Volumetric Finite Element (CVFE) scheme, used to simulate the spontaneous motion of one or more cracks propagating dynamically through a domain with regressing boundaries, and an explicit unstructured finite volume Euler code to follow the flow field during the failure event. A key feature of the algorithm is the ability to adaptively repair and expand the fluid mesh to handle the large geometrical changes associated with grain deformation and crack motion.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.3
• /
• pp.459-470
• /
• 2013

The discovery of nearest neighbors, without training in advance, has many applications, such as the formation of mosaic images, image matching, image retrieval and image stitching. When the quantity of data is huge and the number of dimensions is high, the efficient identification of a nearest neighbor (NN) is very important. This study proposes a variation of the KD-tree - the arbitrary KD-tree (KDA) - which is constructed without the need to evaluate variances. Multiple KDAs can be constructed efficiently and possess independent tree structures, when the amount of data is large. Upon testing, using extended synthetic databases and real-world SIFT data, this study concludes that the KDA method increases computational efficiency and produces satisfactory accuracy, when solving NN problems.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.35.5-35
• /
• 2001

The purpose of the study is to develop a synthetic method for generating arbitrary number of not the same but similar texture images. The method includes processes to extract basic shape elements from texture images originating in actual objects, to select them to reappear the image features and to arrange them in a image plane. The authors have already proposed the shape-pass type filter bank assuming that the sensual impression mainly depends on minute shapes existing in the texture images. By use of nine basic shape elements, namely black/white-roof, black/white-line, black/white-snake, black/white-pepper, and cliff, natural texture images originating in actual objects have been characterized by feature vectors in a nine dimensional space. To generate arbitrary number of similar texture images, minute shape pieces ...

• Nuclear Engineering and Technology
• /
• v.54 no.6
• /
• pp.2120-2134
• /
• 2022

A hypothetical core destructive accident (HCDA) has received widespread attention as one of the most serious accidents in sodium-cooled fast reactors. This study combined recent advantages in numerical methods to realize realistic modeling of the complex fluid-structure interactions during HCDAs in a full-scale sodium-cooled fast reactor. The multi-material arbitrary Lagrangian-Eulerian method is used to describe the fluid-structure interactions inside the container. Both the structural deformations and plug rises occurring during HCDAs are evaluated. Two levels of expansion energy are considered with two different reactor models. The simulation results show that the container remains intact during an accident with small deformations. The plug on the top of the container rises to an acceptable level after the sealing between the it and its support is destroyed. The methodology established in this study provides a reliable approach for evaluating the safety feature of a container design.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.2
• /
• pp.39-49
• /
• 2000

In this paper, we propose an optimizing feature extraction method for multiclass problems assuming normal distributions. Initially, We start with an arbitrary feature vector Assuming that the feature vector is used for classification, we compute the classification error Then we move the feature vector slightly in the direction so that classification error decreases most rapidly This can be done by taking gradient We propose two search methods, sequential search and global search In the sequential search, an additional feature vector is selected so that it provides the best accuracy along with the already chosen feature vectors In the global search, we are not constrained to use the chosen feature vectors Experimental results show that the proposed algorithm provides a favorable performance.

• Journal of Korea Multimedia Society
• /
• v.5 no.5
• /
• pp.599-607
• /
• 2002

The octree model, a hierarchical volume description of 3D objects, nay be utilized to generate projected images from arbitrary viewing directions, thereby providing an efficient means of the data base for 3D object recognition and other applications. We present 2D projected image and made pseudo gray image of object using octree model and multi level boundary search algorithm. We present algorithm for finding feature points of 2D and 3D image and finding matched points using geometric transformation. The algorithm is made of data base, it will be widely applied to 3D object modeling and efficient feature points application for basic 3D object research.