• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.6
• /
• pp.49-58
• /
• 1993

Extended reduced difference pyramid (ERDP) is proposed for lossless progressive image transmission, which is based on a new transform called rounded-transform(RT). The RT is a nonlinear and reversible transform of integers into integers utilizing two kinds of the rounding operations such as round up and down. The ERDP can be obtained from an N-poing RT or a series of RTs of both. For the performance evaluation, the entropy of the difference images to be transmitted is used as a lower bound transmission rate. Two examples of the ERDP can be easily shown, which is more effective in the entropy than the ordinary RDP.

• Annual Conference of KIPS
• /
• 2019.05a
• /
• pp.398-400
• /
• 2019

Faced with the increasing demand for image recognition on mobile devices, how to run convolutional neural network (CNN) models on mobile devices with limited computing power and limited storage resources encourages people to study efficient model design. In recent years, many effective architectures have been proposed, such as mobilenet_v1, mobilenet_v2 and PeleeNet. However, in the process of feature selection, all these models neglect some information of shallow features, which reduces the capture of shallow feature location and semantics. In this study, we propose an effective framework based on Feature Pyramid Networks to improve the recognition accuracy of deep and shallow images while guaranteeing the recognition speed of PeleeNet structured images. Compared with PeleeNet, the accuracy of structure recognition on CIFA-10 data set increased by 4.0%.

• Smart Structures and Systems
• /
• v.32 no.2
• /
• pp.111-121
• /
• 2023

This study proposes an automated assembly performance evaluation method for prefabricated steel structures (PSSs) using machine learning methods. Assembly component images were segmented using a modified version of the receptive field pyramid. By factorizing channel modulation and the receptive field exploration layers of the convolution pyramid, highly accurate segmentation results were obtained. After completing segmentation, the positions of the bolt holes were calculated using various image processing techniques, such as fuzzy-based edge detection, Hough's line detection, and image perspective transformation. By calculating the distance ratio between bolt holes, the assembly performance of the PSS was estimated using the k-nearest neighbors (kNN) algorithm. The effectiveness of the proposed framework was validated using a 3D PSS printing model and a field test. The results indicated that this approach could recognize assembly components with an intersection over union (IoU) of 95% and evaluate assembly performance with an error of less than 5%.

• Journal of applied mathematics & informatics
• /
• v.42 no.4
• /
• pp.931-943
• /
• 2024

Accurately identifying brain tumors is crucial for medical imaging's precise diagnosis and treatment planning. This study presents a novel approach that uses cutting-edge image processing techniques to automatically segment brain tumors. with the use of the Pyramid Network algorithm. This technique accurately and robustly delineates tumor borders in MRI images. Our strategy incorporates special algorithms that efficiently address problems such as tumor heterogeneity and size and shape fluctuations. An assessment using the RESECT Dataset confirms the validity and reliability of the method and yields promising results in terms of accuracy and computing efficiency. This method has a great deal of promise to help physicians accurately identify tumors and assess the efficacy of treatments, which could lead to higher standards of care in the field of neuro-oncology.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.851-854
• /
• 1998

Recently efficient image coding algorithms using zerotree have been proposed. In these methods, the locations of nonzero wavelet coefficients are encoded with a tree structure, called zerotree, which can exploit the self-similarity of the wavelet pyramid decomposition across different scales. These are very effective, especially in low bit rate image coding. In this paper, two zerotree image coding algorithms, EZW and SPIHT, are briefly introduced, and a new zerotree searching scheme is proposed to emphasize the significance of a wavelet coefficient by its orientations as well as its scale.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.211-214
• /
• 2002

Recently efficient image coding using zerotree have been proposed. In these methods, the locations of nonzero wavelet coefficient are enrolled with a tree structure, called zerotree, which ran exploit the self-similarity of the wavelet pyramid decomposition across different scales. These are very especially in low bit rate image coding. In this paper, two zerotree image rolling algorithm, EZW and SPHIT are briefly introduced, and a new zerotree searching scheme is proposed to emphasize the significance of a wavelet coefficient by its orientation as well as its scale.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.12a
• /
• pp.161-164
• /
• 2000

Recently efficient image coding using zerotree have been proposed. In these methods, the locations of nonzero wavelet coefficient are encoded with a tree structure, called zerotree, which can exploit the self-similarity of the wavelet pyramid decomposition across different scales. These are very especially in low bit rate image coding. In this paper, two zerotree image coding algorithm, EZW and SPHIT are briefly introduced, and a new zerotree searching scheme is proposed to emphasize the significance of a wavelet coefficient by its orientation as well as its scale.

• Journal of KIISE:Software and Applications
• /
• v.34 no.12
• /
• pp.1075-1082
• /
• 2007

In this paper, we propose the method of multiple human action recognition on video clip. For being invariant to the change of speed or size of actions, Spatial-Temporal Pyramid method is applied. Proposed method can minimize the complexity of the procedures owing to select Motion Gradient Histogram (MGH) based on statistical approach for action representation feature. For multiple action detection, Motion Energy Image (MEI) of binary frame difference accumulations is adapted and then we detect each action of which area is represented by MGH. The action MGH should be compared with pre-learning MGH having pyramid method. As a result, recognition can be done by the analyze between action MGH and pre-learning MGH. Ten video clips are used for evaluating the proposed method. We have various experiments such as mono action, multiple action, speed and site scale-changes, comparison with previous method. As a result, we can see that proposed method is simple and efficient to recognize multiple human action with stale variations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.1
• /
• pp.50-56
• /
• 2020

With the rapid development of deep neural network theory and application research, the effect of face detection has been improved. However, due to the complexity of deep neural network calculation and the high complexity of the detection environment, how to detect face quickly and accurately becomes the main problem. This paper is based on the relatively simple model of the MTCNN model, using FDDB (Face Detection Dataset and Benchmark Homepage), LFW (Field Label Face) and FaceScrub public datasets as training samples. At the same time of sorting out and introducing MTCNN(Multi-Task Cascaded Convolutional Neural Network) model, it explores how to improve training speed and Increase performance at the same time. In this paper, the dynamic image pyramid technology is used to replace the traditional image pyramid technology to segment samples, and OHEM (the online hard example mine) function in MTCNN model is deleted in training, so as to improve the training speed.

• Journal of Korean Society for Geospatial Information Science
• /
• v.16 no.2
• /
• pp.49-56
• /
• 2008

Image registration is one of the critical techniques of image mosaic which has many applications such as generating panoramas, video monitoring, image rendering and reconstruction, etc. The fundamental tasks of image registration are point features extraction and tracking which take much computation time. KLT(Kanade-Lucas-Tomasi) feature tracker has proposed for extracting and tracking features through image sequences. The aim of this study is to demonstrate the usage of effective and robust KLT feature detector and tracker for an image registration using the sequence image frames captured by UAV video camera. In result, by using iterative implementation of the KLT tracker, the features extracted from the first frame of image sequences could be successfully tracked through all frames. The process of feature tracking in the various frames with rotation, translation and small scaling could be improved by a careful choice of the process condition and KLT pyramid implementation.