• The Korean Journal of Ecology
• /
• 제10권2호
• /
• pp.91-107
• /
• 1987

This study is concerned with some methods and applications, used as a basis on information and entropy analysis of vegetation data. These methods are adopted for the evaluating the effect of sampling intensity on information, which repersnets the departure of observed variable from standard component. Classes on the data matrix are caluculated by using marginal dispersion array for rank and weighting information program. Finally the information and entropy are computed by applying seven options. On the application of vegetation studies, two models for cluster analysis and analysis of concentration are explained in detail. Cluster analysis is based on use of equivocation information and Rajski's metrics. The analysis of concentration utilizes coherence coefficience being transformed values, which has been adjusted from blocks and entropy values. The relationship btween three begetation clusters and four stands of Naejangsan data is highly significant in 79% of total variance. Cluster A relatively tends to prefer north side, and cluster C south side.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2002년도 ICCAS
• /
• pp.41.3-41
• /
• 2002

Motion estimation using Full-Search(FS) and Block-Matching Algorithm(BMA) is often used in the case of moving object tracking by vision sensors. However these methods often miss the real-time vision data because these schemes suffer the heavy computational load. When the image size of moving object is changed in an image frame according to the distance between the camera of mobile robot and the moving object, the tracking performance of a moving object may decline with these methods because of the shortage of active handling. In this paper, the variable-representative block that can reduce a lot of data computations, is defined and optimized by changing the size of representative block accor...

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(3)
• /
• pp.89-92
• /
• 2000

The wireless network has bursty and high error rates. Due to the quite limited bandwidth in wireless networks, images are usually transmitted as a compressed version with VLC(variable length coding). Loss of coded data can affect a decoded image to a large extent, making concealment of errors caused by data loss an important issue. This paper presents a error concealment technique for DCT(Discrete Cosine Transform) based image coding. First, a method to estimate the missing DC coefficients of a JPEG coded image which is required for decoding the compressed image, is suggested and evaluated. Second, the missing data is interpolated by exploiting the probability of being nonzero and the correlation between adjacent blocks. In addition, since the these technique is computational efficient, it conserves system resources and power consumption, which are restrictive in mobile computers.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2016년도 추계학술발표대회
• /
• pp.16-17
• /
• 2016

일반적인 에디터 프로그램과 운영체제를 사용하여 데이터를 편집할 경우, 일부 수정에도 모든 데이터를 다시 저장하고 있다. 본 논문에서는 이러한 기존 파일시스템의 문제점을 개선하기 위해 가변 길이 블록의 개념을 커널 레벨에 적용하여 효율적으로 수정된 데이터를 다시 쓸 수 있도록 하였다. 가변 블록은 데이터 삭제가 발생 했을 경우 나머지 블록은 그대로 유지하고 수정된 블록만 다시 저장하며, 삭제된 데이터로 인해 생기는 빈 공간의 그대로 유지하는 방법을 말한다. 이 개념을 기존 리눅스에서 사용하는 ext4파일 시스템에 적용하여 시스템을 구축, 실험하였으며 결과적으로 쓰기 연산을 비롯해 CPU사용량에서 크게 성능을 향상시켰다.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1998년도 학술대회
• /
• pp.81-85
• /
• 1998

점확산 함수(point spread function; PSF)의 정확한 추정은 복원결과가 원 영상에 얼마나 근접할 수 있는가를 결정한다는 점에서 영상처리의 중요한 연구 주제중의 하나가 된다. 본 논문에서는 PSF를 추정하기 위한 알고리즘을 제안하고, 이를 영상복원에 적용한 후 이를 기반으로 디지털 자동초점시스템을 제안한다. 초점불안전 열화시스템을 구현하기 위한 과정은 두 단계로 구성되어 있는데, 즉 입력 영상에서 에지분류를 통한 PSF 추정과, 이를 이용한 영상복원이다. 보다 구체적으로, 입력 영상에 특정 에지가 있는 임의의 크기의 블록을 선정해부면, 그 블록으로부터 자동으로 에지방향이 기저영상을 이용해서 구해지며 확산원의 크기를 추정하여 1차원 단위 계단응답과 영역을 구하여 평균한 후, 2차원 등방성 PSF를 추정한다. 마지막으로 추정된 PSF를 사용하여 복원을 수행함으로써 초점이 맞는 영상을 구한다.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1998년도 학술대회
• /
• pp.181-184
• /
• 1998

본 논문에서는 웨이블릿 변환[1]을 기반으로 하여 가변블록을 이용하는 영상압축방식을 제안하였다. 영상을 웨이블릿 변환한 후의 계수들은 각 부밴드별로 그 통계적, 특성, 에너지 특성 그리고 방향 특성 등이 각각 다르기 때문에 이를 이용하여 각 부밴드별로 가변블록을 이용하여 비트할당을 통한 영상압축을 수행한다. 제안 알고리듬에는 손실 압축방식으로서 양자화기를 거친 후에 부가적인 무손실 압축방식으로서 엔트로피를 이용하는 arithmetic 부호화기[2]를 거쳐 최종적으로 압축된 데이터를 얻어낸다. 시뮬레이션 결과 제안알고리듬은 기존 압축알고리즘에 비해 객관적인 향상된 압축률과 PSNR면에서 향상된 성능을 보여주고, 주관적으로는 낮은 BPP를 갖는 압축에서 나타나는 블록화 현상이 나타나지 않음을 확인하였다.

• 동력기계공학회지
• /
• 제4권1호
• /
• pp.68-73
• /
• 2000

A mixed degree finite element solutions using hierarchical elements are investigated for convergences on a 2-D simple cases. Elements are generated block by block and each block is assigned an arbitrary solution degree. The numerical study showed that a well constructed blocks can increase the convergence and accuracy of finite element solutions. Also, it has been found that for higher order elements, the convergence trends can be deteriorated for smaller mesh sizes. A procedure for a variable fixed boundary condition has been included.

• Journal of the Optical Society of Korea
• /
• 제12권3호
• /
• pp.136-146
• /
• 2008

We proposed an adaptive steganography of an optical image using bit-planes and multichannel characteristics. The experiment's purpose was to compare the most popular methods used in optical steganography and to examine their advantages and disadvantages. In this paper we describe two digital methods: the first uses less significant bits(LSB) to encode hidden data, and in the other all blocks of $n{\times}n$ pixels are coded by using DCT(Digital Cosine Transformation), and two optical methods: double phase encoding and digital hologram watermarking with double binary phase encoding by using IFTA(Iterative Fourier Transform Algorithm) with phase quantization. Therefore, we investigated the complexity on bit plane and data, similarity insert information into bit planes. As a result, the proposed method increased the insertion capacity and improved the optical image quality as compared to fixing threshold and variable length method.

• 한국디지털정책학회:학술대회논문집
• /
• 한국디지털정책학회 2005년도 추계학술대회
• /
• pp.291-298
• /
• 2005

This paper is an analysis of the Category Individual Residence urban spatial structure along the National Route 20 (Koushu-Kaido), one of the major roads in Japan, and the degree of differences between locations and its changes between the points of time. The analysis was based on the GIS technique. Whilst, previous studies were based on municipal boundaries or mesh units as sources of data, GIS allowed the use of variable geographical units, Roadside zone, Inner zone, North zone, South zone, Blocks. As an example to apply the technology of GIS, 1986's sand 1991's building polygon data of the Urban Planning Bureau of Tokyo Metropolitan Government are used. The layers referred to the analyses is the building polygons with the amount of stories, building area, floor area and the material of the building. Two statistical analysis are executed; one is the test of the regional equality about the number of story of building, building area, floor area and fireproof building ratio.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.7-10
• /
• 2000

Fast block motion estimation technique is proposed to reduce the computational complexity in video coding. In the conventional methods the size of search region is fixed. For small motion regions like background the small size of sea of search region is enough to find a block motion. But for active motion regions the large size of search region is preferred to figure out the accurate motion vector. Therefore, it is reasonable that a block motion is estimated in the variable search region (both the size and the position of it). That is to say, the search region varies according to the predicted motion characteristics of a block. The block motion in video frames has temporal continuity and then the search region of a current block is predicted using the block motion of previous blocks. The computational complexity of the proposed technique is significantly reduced with a good picture quality compared to the conventional methods.