• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.294-297
• /
• 2005

Time series are comprehensively appeared and developed in many applications, ranging from science and technology to business and entertainrilent. Similarity search under time warping has attracted much interest between the time series in the large sequence databases. DTW (Dynamic Time Warping) is a robust distance measure and is superior to Euclidean distance for time series, allowing similarity matching although one of the sequences can elastic shift along the time axis. Nevertheless, it is more unfortunate that DTW has a quadratic time. Simultaneously the false dismissals are come forth since DTW distance does not satisfy the triangular inequality. In this paper, we propose an efficient range query algorithmbased on a new similarity search method under time warping. When our range query applies for this method, it can remove the significant non-qualify time series as early as possible before computing the accuracy DTW distance. Hence, it speeds up the calculation time and reduces the number of scanning the time series. Guaranteeing no false dismissals, the lower bounding function is advised that consistently underestimate the DTW distance and satisfy the triangular inequality. Through the experimental result, our range query algorithm outperforms the existing others.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.6
• /
• pp.595-603
• /
• 1992

It has been establisued that the reliability of communication networks is NP hard problem owing to computationally and complexity as the number of componeuts is Increased in large networks. This paper proposed an algorithm for determining upper and lower bounds In the reliability of source-to-terminal in communication networks to solve this problem. The evaluation method follows the next procedures. First, minimal pathset and minimal cut set are serched. Second, it is sorted that the number of components is the same events and the reliability bounds Is evaluated by the section function to extract common variable. The performance of proposed algorithm is also estimate(1 as compared to the reliability of Esary-Proschan, Shogan and Copal.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1402-1413
• /
• 2004

In non-rigid image registration, the Jacobian determinant of the estimated deformation should be positive everywhere since physical deformations are always invertible. We propose a constrained optimization technique at ensures the positiveness of Jacobian determinant for cubic B-spline based deformation. We derived sufficient conditions for positive Jacobian determinant by bounding the differences of consecutive coefficients. The parameter set that satisfies the conditions is convex; it is the intersection of simple half spaces. We solve the optimization problem using a gradient projection method with Dykstra's cyclic projection algorithm. Analytical results, simulations and experimental results with inhale/exhale CT images with comparison to other methods are presented.

• Journal of the Korean Society of Industry Convergence
• /
• v.24 no.5
• /
• pp.547-553
• /
• 2021

Dynamic object recognition is an important task for autonomous vehicles. Since dynamic objects exhibit a higher collision risk than static objects, our own trajectories should be planned to match the future state of moving elements in the scene. Time information such as optical flow can be used to recognize movement. Existing optical flow calculations are based only on camera sensors and are prone to misunderstanding in low light conditions. In this regard, to improve recognition performance in low-light environments, we applied a normalization filter and a correction function for Gamma Value to the input images. The low light quality improvement algorithm can be applied to confirm the more accurate detection of Object's Bounding Box for the vehicle. It was confirmed that there is an important in object recognition through image prepocessing and deep learning using YOLO.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3608-3626
• /
• 2021

The detection of bolts is an important task in high-speed train inspection systems, and it is frequently performed to ensure the safety of trains. The difficulty of the vision-based bolt inspection system lies in small sample defect detection, which makes the end-to-end network ineffective. In this paper, the problem is resolved in two stages, which includes the detection network and cascaded classification networks. For small bolt detection, all bolts including defective bolts and normal bolts are put together for conducting annotation training, a new loss function and a new boundingbox selection based on the smallest axis-aligned convex set are proposed. These allow YOLOv3 network to obtain the accurate position and bounding box of the various bolts. The average precision has been greatly improved on PASCAL VOC, MS COCO and actual data set. After that, the Siamese network is employed for estimating the status of the bolts. Using the convolutional Siamese network, we are able to get strong results on few-shot classification. Extensive experiments and comparisons on actual data set show that the system outperforms state-of-the-art algorithms in bolt inspection.

• Journal of Korea Multimedia Society
• /
• v.24 no.2
• /
• pp.305-311
• /
• 2021

One of the highly reliable object tracking methods is to trace objects by associating objects detected by deep learning. The detected object is represented by a rectangular box. The box has information such as location and size. Since the tracker has motion information of the object in addition to the location and size, knowing additional information about the motion of the detected box can increase the reliability of object tracking. In this paper, we present a new method of reliably estimating the moving direction of the detected object in underground parking lot. First, the frame difference image is binarized for detecting motion energy, change due to the object motion. Then, a cumulative binary image is generated that shows how the motion energy changes over time. Next, the moving direction of the detected box is estimated from the accumulated image. We use a new cost function to accurately estimate the direction of movement of the detected box. The proposed method proves its performance through comparative experiments of the existing methods.

• Smart Structures and Systems
• /
• v.33 no.3
• /
• pp.177-188
• /
• 2024

The fatigue-induced sequential failure of a structure having structural redundancy requires system-level analysis to account for stress redistribution. System reliability-based design optimization (SRBDO) for preventing fatigue-initiated structural failure is numerically costly owing to the inclusion of probabilistic constraints. This study incorporates the Branch-and-Bound method employing system reliability Bounds (termed the B³ method), a failure-path structural system reliability analysis approach, with a metaheuristic optimization algorithm, namely grey wolf optimization (GWO), to obtain the optimal design of structures under fatigue-induced system failure. To further improve the efficiency of this new optimization framework, an additional bounding rule is proposed in the context of SRBDO against fatigue using the B³ method. To demonstrate the proposed method, it is applied to complex problems, a multilayer Daniels system and a three-dimensional tripod jacket structure. The system failure probability of the optimal design is confirmed to be below the target threshold and verified using Monte Carlo simulation. At earlier stages of the optimization, a smaller number of limit-state function evaluation is required, which increases the efficiency. In addition, the proposed method can allocate limited materials throughout the structure optimally so that the optimally-designed structure has a relatively large number of failure paths with similar failure probability.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.4
• /
• pp.330-336
• /
• 2020

An anti-collision system between equipment is essential on a drill floor where multiple moving machines are operated simultaneously. This is to prevent accidents by halting the machines when required, by inspecting possibility of a collision based on the relative position data sent by the equipment. In this paper, we propose a framework for an Anti-Collision System (ACS) by considering expandability of the number of machines and computational speed, to promote development of drilling machines and corresponding ACS software. Each drilling equipment is represented as an object in the software with its own message format, and the message is constructed with serialization/deserialization to manage any additional equipment or data. The data handling process receives the current status of machines from the drilling control network, and relays a collision related message (including bypass signal) back to the machines. A commercial visualization software shows the bounding boxes moving with the equipment and indicates probable collision. It has been determined that the proposed system maintains total execution time below 5ms to process data from the network and relay the information hence, the system has no effect on the machine control systems having 100ms control cycle.

• Journal of the Korea Computer Graphics Society
• /
• v.17 no.3
• /
• pp.1-7
• /
• 2011

Recently, various researches have been proposed to accelerate GPU-based volume ray-casting. However, those researches may cause several problems such as bottleneck of data transmission between CPU and GPU, requirement of additional video memory for hierarchical structure and increase of processing time whenever opacity transfer function changes. In this paper, we propose an efficient GPU-based empty space skipping technique to solve these problems. We store maximum density in a brick of volume dataset on a vertex element. Then we delete vertices regarded as transparent one by opacity transfer function in geometry shader. Remaining vertices are used to generate bounding boxes of non-transparent area that helps the ray to traverse efficiently. Although these vertices are independent on viewing condition they need to be reproduced when opacity transfer function changes. Our technique provides fast generation of opaque vertices for interactive processing since the generation stage of the opaque vertices is running in GPU pipeline. The rendering results of our algorithm are identical to the that of general GPU ray-casting, but the performance can be up to more than 10 times faster.

• Journal of the Korean Society of Radiology
• /
• v.16 no.1
• /
• pp.25-34
• /
• 2022

Brain computed tomography (CT) is useful for brain lesion diagnosis, such as brain hemorrhage, due to non-invasive methodology, 3-dimensional image provision, low radiation dose. However, there has been numerous misdiagnosis owing to a lack of radiologist and heavy workload. Recently, object detection technologies based on artificial intelligence have been developed in order to overcome the limitations of traditional diagnosis. In this study, the applicability of a deep learning-based YOLOv5s model was evaluated for brain hemorrhage detection using brain CT images. Also, the effect of hyperparameters in the trained YOLOv5s model was analyzed. The YOLOv5s model consisted of backbone, neck and output modules. The trained model was able to detect a region of brain hemorrhage and provide the information of the region. The YOLOv5s model was trained with various activation functions, optimizer functions, loss functions and epochs, and the performance of the trained model was evaluated in terms of brain hemorrhage detection accuracy and training time. The results showed that the trained YOLOv5s model is able to provide a bounding box for a region of brain hemorrhage and the accuracy of the corresponding box. The performance of the YOLOv5s model was improved by using the mish activation function, the stochastic gradient descent (SGD) optimizer function and the completed intersection over union (CIoU) loss function. Also, the accuracy and training time of the YOLOv5s model increased with the number of epochs. Therefore, the YOLOv5s model is suitable for brain hemorrhage detection using brain CT images, and the performance of the model can be maximized by using appropriate hyperparameters.