• Journal of Korean Society for Geospatial Information Science
• /
• v.17 no.3
• /
• pp.81-87
• /
• 2009

This study aims to evaluate how efficiently time-worn building could be managed by using GPS-based video-logging systems. The digitally georeferencing video data taken by a hand-hold GPS-based video-logging system allows quick retrieval and effective management for the complicate and various superannuated building in urban area. The results of the study are as follows. Georeferencing data are possible to trace observed positions by using GPS linked with video and to provide building crack information anytime that could be used to inspect and analyze the safety hazard diagnosis of buildings. Building crack information were measured by the proposed method that is merged with feature tracking and image mosaic of sequenced images. From the study, it reveals that the georeferencing video technique provides more realistic and reliable information in safety diagnosis and it can also be used as the essential and modern tool in urban building management.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.1060-1065
• /
• 2016

Recently, there is an emerging need for parallel UHD video processing, and the usage of computing systems that have an asymmetric processor such as ARM big.LITTLE is actively increasing. Thus, a new parallel UHD video processing method that is optimized for the asymmetric multicore systems is needed. This paper proposes a novel HEVC tile partitioning method for parallel processing by analyzing the computational power of asymmetric multicores. The proposed method analyzes (1) the computing power of asymmetric multicores and (2) the regression model of computational complexity per video resolution. Finally, the model (3) determines the optimal HEVC tile resolution for each core and partitions/allocates the tiles to suitable cores. The proposed method minimizes the gap in the decoding time between the fastest CPU core and the slowest CPU core. Experimental results with the 4K UHD official test sequences show average 20% improvement in the decoding speedup on the ARM asymmetric multicore system.

• Journal of Korean Society for Geospatial Information Science
• /
• v.18 no.4
• /
• pp.11-20
• /
• 2010

In situation that carbon dioxide emissions are being increased as urbanization, urban green space is being promoted as an alternative to find solution for these problems. In urban areas, trees have the ability to reduce carbon dioxide as well as to be aesthetic effect. In this study, we proposed the methodology which uses only LIDAR data in order to extract these trees information effectively. To improve the operational efficiency according to the extraction of trees, the proposed methodology was carried out using multiple data processing such as point, polygon and raster. Because the existing NDSM(Normalized Digital Surface Model) contains both the building and tree information, it has the problems of high complexity of data processing for extracting trees. Therefore, in order to improve these problems, this study used modified NDSM which was removed estimate regions of building. To evaluate the performance of the proposed methodology, three different zones which coexist buildings and trees within urban areas were selected and the accuracy of extracted trees was compared with the image taken by digital camera.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7C
• /
• pp.716-725
• /
• 2005

In this paper, we propose a new approach for the reduction of the dynamic false contours, which detects and compensates false contour artifacts adaptively. First, we develop a simple but effective method to select the pixels that are likely to cause the motion artifacts, based on the distribution of pixel values. Then, we merge the selected pixels into several regions using tree structure. Next, we reduce number of gray levels within the regions slightly to reduce the false contours. Note that reducing number of gray levels yield the distortion, thus it is applied only to the selected regions, instead of the whole picture. Intensive simulations on real moving image show that the proposed algorithm alleviates the dynamic false contours effectively with tolerable computational complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.959-970
• /
• 1994

In this thesis, a printed score is read by using handy scanner and the recognition process is excuted in parallel, finally, on Mesh-Connected Computer. What is read is classified into certain patterns and is recognized, based on knowledge. The preprocessing steps are minimized and simple operations are used in the algorithm proposed in this thesis. The score symbols on a printed score can be recognized irrespective of their sizes but their diversity males it difficult to recognize them all, so it is programmed so as to recognize some symbols that is used necessarily and frequently. The recognized result is transformed into the MIDI standard file format. It is required to use a parallel processing system with multiprocessors because the high speed image processing is required. A digitized two-dimensional image is appropriate in processing on the SIMD Mesh-Connected Computer(MCC). Therefore, we explain this architecture and present parallel algorithm using SIMD MCC with n processors that achieves time complexity0(n).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.10
• /
• pp.2080-2089
• /
• 2015

In 3D video compression, a disparity vector (DV) pointing a corresponding block position in an adjacent view is a key coding tool to exploit statistical correlation in multi-view videos. In this paper, neighboring block-based disparity vector (NBDV) is shown with detail algorithm descriptions and coding performance analysis. The proposed method derives a DV from disparity motion vector information, obtained from spatially and temporally neighboring blocks, and provides a significant coding gain about 20% BD-rate saving in a texture-video-first-coding scheme. The proposed DV derivation method is adopted into the recent 3D video coding standards such as 3D-AVC and 3D-HEVC as the state-of-the-art DV derivation method.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.173-182
• /
• 2005

In this paper, we propose a landmark recognition method which is irrelevant to the camera viewpoint on the navigation for localization. Features in previous research is variable to camera viewpoint, therefore due to the wealth of information, extraction of visual landmarks for positioning is not an easy task. The proposed method in this paper, has the three following stages; first, extraction of features, second, learning and recognition, third, matching. In the feature extraction stage, we set the interest areas of the image. where we extract the corner points. And then, we extract features more accurate and resistant to noise through statistical analysis of a small eigenvalue. In learning and recognition stage, we form robust feature models by testing whether the feature model consisted of five corner points is an invariant feature irrelevant to viewpoint. In the matching stage, we reduce time complexity and find correspondence accurately by matching method using similarity evaluation function and Graham search method. In the experiments, we compare and analyse the proposed method with existing methods by using various indoor images to demonstrate the superiority of the proposed methods.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.2
• /
• pp.141-146
• /
• 2017

In this paper, a gradient magnitude hardware architecture based on hardware folding design method is proposed for low power image feature extraction. For the hardware complexity reduction, the projection vector chracteristic of gradient magnitude is applied. The proposed hardware architecture can be implemented with the small degradation of the gradient magnitude data quality. The FPGA implementation result shows the 41% of logic elements and 62% embedded multiplier savings compared with previous work using Altera Cyclone VI (EP4CE115F29C7N) FPGA and Quartus II v16.0 environment.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.3
• /
• pp.206-211
• /
• 2020

It is Face recognition is a very important process in image monitoring and it is a form of biometric technology. The recognition process involves many variables and is highly complex, so the software development has only begun recently with the development of hardware. Face detection technology using the CCTV is a process that precedes face analysis, and it is a technique that detects where the face is in the image. Research in face detection and recognition has been difficult because the human face reacts sensitively to different environmental conditions, such as lighting, color of skin, direction, angle and facial expression. The utility and importance of face recognition technology is coming into the limelight over time, but many aspects are being overlooked in the facial area detection technology that must precede face recognition. The system in this paper can detect tilted faces that cannot be detected by the AdaBoost detector and It could also be used to detect other objects.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2003.11a
• /
• pp.61-64
• /
• 2003

무손실 이미지 압축은 (Lossless Image Compression)은 손실이미지 압축(Lossy Image Compression)에 비해, 압축률(compression ratio)은 떨어지지만, 반면 원이미지와 복원이미지가 완전히 일치하므로, 원인이미지의 품질을 그대로 유지학 수 있다. 따라서, 이미지의 품질(Quality)과 압축효율(compression ratio)은 서로 상반된 관계에 있으며, 지금도 좀 더 놀은 압축효과를 얻으려는 여러 무손실 압축 방법이 발표되고 있다. 무손실 이미지 압축은 이미지의 정확성과 정밀성이 요구되는, 의료영양분야에서 가장 널리 쓰이고 있으며, 그밖에, 원본이미지를 기본으로 다른 이미지프로세싱이 필요한 경우, 압축 복원을 반복적으로 수행할 필요가 있을 때, 기타 사진 예술분야, 원격 영상 등 정밀성이 요구되는 분양에서 쓰이고 있다. [7]. 무손실 이미지 압축의 가장 대표적인 CALIC[3]과 JPEG_LS[2]를 들 수 있다. CALIC은 비교적 높은 압축률을 나타내지만, 3-PASS의 과정을 거치는 복잡도가 지적되고 있다. 반면 JPEG-LS는 압축률은 CALIC에 미치지 못하지만 빠른 코딩/디코딩 속도를 보인다. 본 논문에서는 여거 가지의 예측 모드를 두어, 블록단위별로 주변 CONTEXT에 따라, 최상의 예측 모드를 판단하여, 이를 적용, 픽셀의 여러 값을 최소화하였다. 그 후 적응산술 부호기(Adaptive arithmetc coder)를 이용하여, 인코딩을 하였다. 이때 최대 에러값은 64를 넘지 않게 했으며, 또한 8*8블록별로 에러의 최대값을 측정하여 그 값을 $0\~7$까지의 8개의 대표값으로 양자화하는 방법을 통하여 그에 따라 8개의 보호화 심볼 모델중 알맞은 모델에 적용하였다. 이를 통해, 그 소화값의 확률 구간을 대폭 넓힘으로써, 에러 이미지가 가지고 있는 엔트로피에 좀 근접하게 코딩을 할 수 있게 되었다. 이 방법은 실제로 Arithmetic Coder를 이용하는 다른 압축 방법에 그리고 적용할 수 있다. 실험 결과 압축효율은 JPEG-LS보다 약 $5\%$의 압축 성능 개선이 있었으며, CALIC과는 대등한 압축률을 보이며, 부호화/복호화 속도는 CALIC보다 우수한 것으로 나타났다.