• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.157-162
• /
• 2011

In this paper, we propose enhanced methods of path finding based on an abstract graph with extension of search space to improve the quality of path. The proposed methods that are called simple buffering method, velocity constrained method and distance constrained method are to extract buffering-cells for using search space with valid-cells. The simple buffering method is to extract adjacent cells of valid-cells as buffering-cells. velocity constrained method and distance constrained method are based on simple buffering method, these eliminate buffering-cells through each of threshold. In experiment, proposed methods can improve the quality of path. The proposed methods are applicable to develop various kinds of telematics application, such as path finding and logistics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.223-229
• /
• 2005

In this paper, we proposed an extended edge-based line averaging method for deinterlacing with restricted search range. Conversion from interlaced signal to non-interlaced signal is one of important issues. Conventional deinterlacing algorithms usually utilize edge-based line average algorithm(ELA) within pixel-by-pixel approach. However, it is very sensitive to noise and variation of intensity. To reduce the sensitivity, the proposed method adopts a block-by-block approach and provides reliable direction of edge. Simulation results show that it provides a better performance than other pixel-by-pixel ELA-based methods.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.2
• /
• pp.13-19
• /
• 2001

The conventional fractal decoding was required a vast amount computational complexity, since every range blocks was implemented to IFS(iterated function system). In order to improve this, it has been suggested that each range block was classified to iterated and non-iterated regions. Non-iterated regions is called data dependency region, and if data dependency region extended, IFS regions are contractive. In this paper, a searched region of the domain is limited to the range regions that is similar with the domain blocks, and the domain region is more overlapped. As a result, data dependency region has maximum region, that is IFS regions can be minimum region. The minimizing method of domain region is defined to minimum domain(MD) which is minimum IFS region. Using the minimizing method of domain region, there is not influence PSNR(peak signal-to-noise ratio). And it can be performed a fast decoding by reducing the computational complexity for IFS in fractal image decoding.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.11a
• /
• pp.209-212
• /
• 2013

본 논문에서 적응적 탐색 영역(Adaptive Search Range)을 이용하여 개선한 제한된 1비트 변환 알고리즘을 제안하였다. 이 변환은 전역 검색 알고리즘 (Full Search Algorithm)을 사용한다. 그러나 이것은 매우 많은 연산량과 복잡도를 가진다. 제안된 알고리즘에서는 각 블록의 탐색범위를 결정하기 위한 움직임 벡터 (Motion Vector)와 함께 제한된 1비트 변환 알고리즘의 제한된 마스크 (Constrained Mask)를 사용한다. 실험결과를 통해 제안된 알고리즘은 움직임 예측의 정확도에 대한 성능을 비슷하게 유지하면서 평균적으로 Search Point의 수를 84% 줄일 수 있음을 보여준다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.457-459
• /
• 2004

본 논문은 움직임 벡터 재 산출 방법에 있어서 제한된 영역 내의 움직임 벡터 재 탐색 과정을 보다 효율적으로 운용함으로써 기존의 방법보다 빠르게 동작하는 크기조절 트랜스코딩 방법을 제안한다 기존의 크기조절 비디오 트랜스코딩은 크기 조절된 비디오의 정형화된 재 산출 과정을 통해 움직임 벡터를 구하고, 화질 열화의 최소화를 위해 재 산출된 움직임 벡터를 제한된 탐색 영역 내재 탐색을 통해 좀더 정확한 움직임 벡터를 구하는 방법을 사용한다 그러나 움직임 벡터 재 탐색과정은 않은 계산이 요구되어 속도 저하의 원인이 되며, 비디오의 특성에 따라 움직임 벡터 재 탐색 과정이 불필요한 경우가 발생한다. 따라서, 움직임이 없는 비디오에 대해서는 움직임 벡터 재탐색 과정을 수행하지 않음으로써 트랜스코딩 과정의 수행 속도를 개선하고, 움직임이 많은 프레임에 대해서는 움직임 벡터 재 탐색을 수행하여 화질 열화를 최소화하는 방법을 제안한다. 제안된 방법을 적용하였을 때. 움직임이 적은 비디오일수록 화질 열화 없이 트랜스코딩 속도가 약 15%의 향상된 성능을 얻었다.

• Journal of Korea Multimedia Society
• /
• v.13 no.2
• /
• pp.185-195
• /
• 2010

In this paper, we propose an efficient inter and intra prediction algorithms for fast encoding of H.264/AVC. First, inter prediction mode decision method decides early using temporal/spatial correlation information and pixel direction information. Second, intra prediction mode decision method selects block size judging smoothness degree with inner/outer pixel value variation and decides prediction mode using representative pixel and reference pixel. Lastly, adaptive motion search region restriction sets search region using mode information of neighboring block and predicted motion vector. The experimental results show that proposed method can achieve about 18~53% reduction compared with the existing JM 14.1 in the encoding time. In RD performance, the proposed method does not cause significant PSNR value losses while increasing bitrates slightly.

• Journal of the Korean Society of Industry Convergence
• /
• v.3 no.4
• /
• pp.299-306
• /
• 2000

이 논문은 파이프라인 함성을 위한 상위수준 데이터 경로 하성과 콘트롤 합성의 통합에 관한 연구이다. 현재 대부분의 상위수준 합성 방법은 콘트롤 영역의 영향을 무시하는데 보다 나은 설계를 위하여 데이터 경로디자인 영역과 콘트롤 디자인 영역을 통합하여 탐색하는 파이프라인 상위수준함성 도구를 구현했다. 이 도구는 비용 제한 하에서 최고 성능의 파이프라인을 합성하는 비용재한합성과 성능 제한 하에서 최서 비용의 파이프라인을 합성하는 성능 제한합성의 두 가지 방식을 제공한다.

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

The conventional fractal decoding was required a vast amount computational complexity. Since every range blocks was implemented to IFS(iterated function system). In order to improve this, it has been suggested to that each range block was classified to iterated and non-iterated regions. If IFS region is contractive, then it can be performed a fast decoding. In this paper, a searched region of the domain in the encoding is limited to the range region that is similar with the domain block, and IFS region is a minimum. So, it can be performed a fast decoding by reducing the computational complexity for IFS in fractal image decoding.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.3D
• /
• pp.361-366
• /
• 2006

It is widely known that the dynamic optimal path algorithm, adopting real-time path finding, can be supporting an optimal route with which users are satisfied economically and accurately. However, this system has to search optimal routes frequently for updating them. The proposed concept of optimizing search area lets it reach heuristic optimal path rapidly and efficiently. Since optimal path should be increased in proportion to an distance between origin and destination, tremendous calculating time and highly efficient computers are required for searching long distance journey. In this paper, as a result of which the concepts of partial solution and representative path are suggested. It was possible to find an optimal route by decreasing a half area in comparison with the previous method. Furthermore, as the size of the searching area is uniform, comparatively low efficient computer is required for long distance trip.

• Proceedings of the Korean Statistical Society Conference
• /
• 2003.10a
• /
• pp.167-172
• /
• 2003

혼합물실험에서 성분의 개수가 많고 성분에 대하여 제한조건이 있는 경우 흥미영역을 도시하는 작업은 성분의 개수가 4개 이상일 때 힘든 작업이 된다. 또한 반응변수가 여러 개인 경우 최적화문제도 까다롭게 된다. 이때, 탐색적 자료분석의 한 도구로서 평행좌표그림을 이용하면 통계자료분석시 많은 도움을 받을 수 있다.