• Journal of the Korea Computer Industry Society
• /
• v.9 no.4
• /
• pp.149-156
• /
• 2008

There is the temporal correlation of a animation sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose the scene change detection algorithm for block matching using the temporal correlation of the animation sequence and the center-biased property of motion vectors. The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(sum of absolute difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate point on each search region. Simulation results show that the proposed algorithm has better detection performance, such as recall rate, then the existing method. The algorithm has the advantage of speed, simplicity and accuracy. In addition, it requires less amount of storage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.487-495
• /
• 2007

When error occurs during the network transmission of the image, the quality of the restored image is very serious. Therefore to maintain the received image quality, the error concealment technique is necessary. This paper presents an efficient spatial error concealment method using adaptive edge-oriented interpolation. It deals with errors on slice level. The proposed method uses boundary matching method having 2-step processes. We divide error block into external and internal region, adaptively restore each region. Because this method use overall as well as local edge characteristics, it preserves edge continuity and texture feature. The proposed technique reduces the complexity and provide better reconstruction quality for damaged images than the previous methods.

• Journal of Information Processing Systems
• /
• v.16 no.3
• /
• pp.663-676
• /
• 2020

Plant leaf classification is a significant application of image processing techniques in modern agriculture. In this paper, a multi-granular angle description method is proposed for plant leaf classification and retrieval. The proposed method can describe leaf information from coarse to fine using multi-granular angle features. In the proposed method, each leaf contour is partitioned first with equal arc length under different granularities. And then three kinds of angle features are derived under each granular partition of leaf contour: angle value, angle histogram, and angular ternary pattern. These multi-granular angle features can capture both local and globe information of the leaf contour, and make a comprehensive description. In leaf matching stage, the simple city block metric is used to compute the dissimilarity of each pair of leaf under different granularities. And the matching scores at different granularities are fused based on quotient space theory to obtain the final leaf similarity measurement. Plant leaf classification and retrieval experiments are conducted on two challenging leaf image databases: Swedish leaf database and Flavia leaf database. The experimental results and the comparison with state-of-the-art methods indicate that proposed method has promising classification and retrieval performance.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.87-97
• /
• 2004

In this paper, we propose an algorithm for interlaced-to-progressive conversion by the weighted summation of the information collected from spatial do-interlacing method, in which the weighted edge based line average is applied, and the temporal method in which the motion compensation is employed by using hi-directional BMA (block matching algorithm). We employed time-recursive and motion adaptive processing as motion detection is involved. Also, a median filter is used to deal with limitation of the linear summation in which only an intermediate of values being involved is determined. The main goal of the approach is to overcome the shortcomings of each of the do-interlacing techniques without significant increment of the computational complexity, and the proposed method is apt to implement in hardware for real-time processing.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.35-38
• /
• 2000

The method of Content-based Triangular Mesh Image representation in moving pictures makes better performance in prediction error ratio and visual efficiency than that of classical block matching. Specially if background and objects can be separated from image, the objects are designed by Irregular mesh. In this case this irregular mesh design has an advantage of increasing video coding efficiency. This paper presents the techniques of mesh generation, motion estimation using these mesh, uses image warping transform such as Affine transform for image reconstruction, and evaluates the content based mesh design through computer simulation.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.46-48
• /
• 2004

This paper presents a simple method of rotational and translational motion estimation for digital image stabilization. The scheme first computes the rotation center by taking least squares of selected local velocity vectors, and the rotational angle is found from special subset of motion vectors. And then translational motion can be estimated by the relation among movement of rotation center, rotation angle and translation movement. To show the effectiveness of our approach, the synthetic images are evaluated, resulting in better performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.9B
• /
• pp.1299-1307
• /
• 2001

고정된 패턴을 사용하는 기존의 고속 블록기반 움직임 추정법에서는 국소 최소해로 고립될 가능성이 있을 뿐만 아니라, 여러 움직임이 공존하는 움직임 경계에서 정확한 움직임의 추정이 어렵다는 문제점을 가지고 있다. 이러한 문제점을 극복하기 위하여 본 논문에서는 탐색점의 수를 줄이는 동시에 국소 최소해로의 고립을 피하기 위하여 탐색 후보영역을 적용한 다중 국소 탐색법(multiple local search method : MLSM)을 제안한다. 또한, 블록 내의 움직임 영역별 정합오차의 최소편차를 고려하는 새로운 정합함수를 제안함으로써 움직임 경계에서 움직임 벡터추정의 부정확성과 움직임 보상영상에서의 화질저하문제를 개선하고자 한다. 실험결과, 제안한 방법은 기존의 방법에 비해 움직임 경계에서의 추정에서 우수한 결과를 보였으며, PSNR에 대해서도 전역탐색법과 유사한 결과를 얻을 수 있었고, 움직임 보상결과, 움직임 경계부근에서의 향상된 화질을 얻을 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.793-795
• /
• 2005

본 논문에서는 자동결함검출 방법으로 돌출 함몰, 점 등과 같은 작은 결항들을 검출하기 위해 모폴로지의 닫힘, 열림 방법을 이용하는 템플레이트 검사 방법을 사용하였고, 얼룩, 스크래치와 같은 큰 결함을 검출하기 위해 영상에서 격자와 같은 일정한 블록을 형성하여 각 블록을 비교하여 결함을 찾는 블록매칭 방법을 사용하였다. 또한 이 알고리즘을 적용한 결과 결함 검출에 좋은 성능이 있음을 보여준다. 제안된 알고리즘은 자체 개발한 장비에서 실제 BLU의 영상을 얻어 테스트를 하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.3165-3177
• /
• 1999

With the recent outstanding advance in computer software and hardware, a number of researches to enhance the manufacturing speed and the process accuracy has been undertaken in many fields of textile industry. Frequently issued problems of automatic recognition of textile wrinkles in a grey scale image are as follows. First, changes in grey level intensity of wrinkles are so minute. Second, as both colors and patterns in a grey scale image appear in grey level intensity, it is difficult to sort out the wrinkle information only. Third, it is also difficult to distinguish grey level intensity changed by wrinkles from those by uneven illumination. This paper suggests a method of automatic recognition of textile wrinkles that can solve above problems concerned with wrinkles, which can be raised in a manufacturing process as one of errors. In this paper, we first make the outline of wrinkles distinctly, apply the block matching algorithm used in motion estimation, and then estimate block locations of target images corresponding to blocks of standard images with the assumption that wrinkles are kind of textile distortions caused by directional forces. We plot a "wrinkle map" considering distances between wrinkles as depths of wrinkles. But because mismatch can occur by different illumination intensity and changes in tensions and directions of the force, there are also undesirable patterns in the map. Post processing is needed to filter them out and get wrinkles information only. We use average grey level intensity of wrinkle map to recognize wrinkles. When it comes to textile with colors and patterns, previous researches on wrinkles in grey scale image hasn't been successful. But we make it possible by considering wrinkles as distortion.istortion.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.6_1
• /
• pp.483-491
• /
• 2013

By a development of car navigation systems and mobile or positioning technology, it increases interest in location based services, especially pedestrian navigation systems. Updating of digital maps is important because digital maps are mass data and required to short updating cycle. In this paper, we proposed change detection for different network data-sets based on areal feature matching. Prior to change detection, we defined type of updating between different network data-sets. Next, we transformed road lines into areal features(block) that are surrounded by them and calculated a shape similarity between blocks in different data-sets. Blocks that a shape similarity is more than 0.6 are selected candidate block pairs. Secondly, we detected changed-block pairs by bipartite graph clustering or properties of a concave polygon according to types of updating, and calculated Fr$\acute{e}$chet distance between segments within the block or forming it. At this time, road segments of KAIS map that Fr$\acute{e}$chet distance is more than 50 are extracted as updating road features. As a result of accuracy evaluation, a value of detection rate appears high at 0.965. We could thus identify that a proposed method is able to apply to change detection between different network data-sets.