• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.10-18
• /
• 2004

Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The operations of unaligned linear quadtrees, which are operations among the linear quadtrees with different origin, are able to perform the translated or rotated images efficiently. And this operations requires alignment of the linear quadtrees. In this paper, we present an efficient algorithm to perform alignment of unaligned linear quadtrees, using three-dimensional $n{\pm}n{\pm}n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of $n{\pm}n{\pm}n$ RMESH.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.658-660
• /
• 1998

계층적 자료구조인 사진트리는 이진 영상을 표현하는데 매우 중요한 자료구조이다. 선형 사진트리는 사진트리를 메모리에 저장하는데 매우 효율적이므로 사진트리와 관련된 연산의 수행을 위해 많은 연구가 진행되어 왔다. 본 논문에서는 RMESH(Reconfigurable MESH) 구조에서 3-차원 n$\times$n$\times$n 프로세서를 사용하여 선형 사진트리로 표현된 이진 영상의 둘레 길이를 계산하는 상수 시간 알고리즘을 제안한다.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.7
• /
• pp.1746-1758
• /
• 1998

계층적 자료구조인 사진트리는 이진 영상을 표현하는데 매우 중요한 자료구조이다. 사진트리를 메모리에 저장하는 방법중 선형 사진트리 표현 방법은 다른 표현 방법과 비교할 때 저장 공간을 매우 효율적으로 절약할 수 있는 이점이 있기 때문에 사진트리와 관련된 연산의 수행을 위해 선형 사진트리를 사용하는 효율적인 알고리즘 개발에 많은 연구가 진행되어 왔다. 본 논문에서는 REMSH(Reconfigurable MESH) 구조에서 3-차원 n$\times$n$\times$n 프로세서를 사용하여 선형 사진트리로 표현된 이진 영상의 면적과 둘레 길이를 계산하는 알고리즘을 제안한다. 이 알고리즘은 0(1) 시간 복잡도를 갖는다.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.66-74
• /
• 1999

A linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. It , therefore, has been widely studied to develop efficient algorithms to execute operations related with quadtrees. In this paper, we present algorithm to find neighbor blocks of binary images represented by linear quadtrees, using three-dimensional n${\times}$n${\times}$n processors on RMESH(Reconfigurable MESH). Pur algorithm have O(1) time complexity.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.3
• /
• pp.134-142
• /
• 2002

Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The window operation is one of important geometry operations in image processing, which extracts a sub-image indicated by a window in the image. In this paper, we present an algorithm to perform the window operation of binary images represented by quadtrees, using three-dimensional $n{\times}n{\times}n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of $n{\times}n{\times}n$ RMESH.

• The KIPS Transactions:PartA
• /
• v.11A no.3
• /
• pp.173-180
• /
• 2004

Quadtree, which 11 a hierarchical data structure, is a very important data structure to represent images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related to quadtrees. The region expansion is an operation to expand images by a given distance and the scaling If an operation to scale images by a given scale factor. In this paper, we present algorithms to perform the region expansion and scaling of images represented by quadtrees, using three-dimensional n${\times}$n${\times}$n processors on RMESH(Reconfigurable MESH). These algorithms have constant time complexities by using efficient basic operations to route the locational codes of quadtree on the hierarchical structure of n${\times}$n${\times}$n RMESH.

• The KIPS Transactions:PartA
• /
• v.14A no.3 s.107
• /
• pp.151-158
• /
• 2007

Quadtree, which is a hierarchical data structure, is a very important data structure to represent images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The computation of block location is one of important geometry operations in image processing, which extracts a component completely including a given block. In this paper, we present a constant time algorithm to compute the block location of images represented by quadtrees, using three-dimensional $n\times n\times n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to deal with the locational codes of quardtree on the hierarchical structure of $n\times n\times n$ RMESH.

• The KIPS Transactions:PartA
• /
• v.10A no.3
• /
• pp.207-214
• /
• 2003

Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The linear translation is one of important operations in image processing, which moves the image by a given distance. In this paper, we present an algorithm to perform the linear translation of binary images represented by quadtrees, using three-dimensional $n{\times}n{\times}n$ processors on RMESH (Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of n${\times}$n${\times}$n RMESH.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.378-380
• /
• 2012

디지털 카메라 및 카메라가 부착된 스마트폰의 보급으로 인해 개인 및 사업장에서 관리해야할 사진의 양이 증가 하였다. 본 논문에서는 이미지 어휘 트리를 이용하여 다량의 사진에 주석을 자동으로 추천 하는 알고리즘을 제안하여 대량의 사진 관리를 효과적으로 하도록 한다. 제안한 방법에서는 어휘트리 생성 시 학습 데이터 모음에 포함된 사진들의 주석에 대한 정보도 함께 갖도록 한다. 그래서 입력으로 들어온 사진과 가장 가까운 사진을 어휘 트리를 통해 찾고 찾은 사진이 가지고 있는 주석을 최종 출력으로 낸다. 제안한 알고리즘은 자동으로 다량의 사진의 주석을 빠르게 추천 할 수 있다.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2247-2258
• /
• 1997

Quadtree, which is hierarchical data structure, is a very important data structure to represent binary images. Since a linear quadtree representation as is a way to store a quadtree is efficient to save space compared with other representations. It is, however, complicated and takes a large amount of time to build the linear quadtree. In this paper, we present O(1) time a linear quadtree building algorithm for a $n{\times}n$ binary image using three-dimensional $n{\times}n{\times}n$ processors on RMESH structure. Our algorithm, by use of O(1) time collapsing algorithm and reported O(1) time sorting algorithm, is simpler and easier to understand than resently presented algorithm on PARBUS structure.