• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권1호
• /
• pp.242-259
• /
• 2015

Three-dimensional video coding is one of the main challenges restricting the widespread applications of 3D video and free viewpoint video. In this paper, a novel fractal coding algorithm with motion-vector-field-based motion estimation for depth map sequence is proposed. We firstly add pre-search restriction to rule the improper domain blocks out of the matching search process so that the number of blocks involved in the search process can be restricted to a smaller size. Some improvements for motion estimation including initial search point prediction, threshold transition condition and early termination condition are made based on the feature of fractal coding. The motion-vector-field-based adaptive hexagon search algorithm on the basis of center-biased distribution characteristics of depth motion vector is proposed to accelerate the search. Experimental results show that the proposed algorithm can reach optimum levels of quality and save the coding time. The PSNR of synthesized view is increased by 0.56 dB with 36.97% bit rate decrease on average compared with H.264 Full Search. And the depth encoding time is saved by up to 66.47%. Moreover, the proposed fractal depth map sequence codec outperforms the recent alternative codecs by improving the H.264/AVC, especially in much bitrate saving and encoding time reduction.

• 대한의용생체공학회:의공학회지
• /
• 제18권4호
• /
• pp.339-348
• /
• 1997

본 논문에서는 일반적으로 잡음이 있는 MR 영상의 배경 영역을 영역분활 알고리듬으로 제거하고 이영역분할의 정보를 손실 부호화에 이용함으로써 데이터의 압축 효율을 높이는 방법을 제안한다. 영역분할 알고리듬은 여역의특성 추출을 위해 전해상도 웨이블렛 변화(full-resolution wavelet transform)을 이용하며, 얻은 특성등의 분류를 위해 Kohonen self-organizing map을 사용한다. 웨이블렛 변환을 이용한 부호기에서는 영역분활 결과 진단에 의미없는 부분으로 판단된 영역은 부호화 하지 않음으로써 압축효율을 향상시킨다. 제안한 알고리듬으로 MR영상들을 부호화한 결과, 영역분할 정보를 이용하지 않을 경우보다 평균적으로 약 15%정도의 비트율의 절약을 가져올 수 있었으며, 같은 압축률일 경우에는 복원된 영상이 JPEG에서보다 좋은 화질을 나타내었다.

• 방송공학회논문지
• /
• 제14권5호
• /
• pp.601-615
• /
• 2009

본 논문에서는 3D-Video에서 가상시점 영상을 생성하는데 필요한 깊이정보 맵의 효율적인 부호화 방법을 제안한다. 가상시점 영상은 실사 영상의 깊이정보 맵을 이용한 시점보간(View Interpolation) 방법으로 생성된다. 일반적으로 깊이정보 맵의 부호화에는 H.264 등의 자연영상에 대한 동영상 부호화 방법을 그대로 적용하고 있는데, 이러한 부호화 방법은 깊이정보 맵의 특성을 고려하지 않은 방법이다. 따라서 본 논문에서는 깊이정보 맵의 영상특성을 고려하여, 맵 정보를 그레이 코드로 변환한 후 비트평면 단위로 부호화하는 방법과, H.264 부호화 방법을 블록단위로 적응적으로 선택하여 부호화하는 방법을 제안하였다. 실험결과로서 제안하는 방법의 성능은 H.264 부호화 방법에 비하여, BD-PSNR이 평균 0.5dB 향상되고, BD-rate는 평균 7.43% 감소되어 부호화효율이 우수함을 확인할 수 있었다. 또한 복원된 깊이정보 맵을 이용하여 생성된 가상시점 영상 간의 비교에서 제안하는 방법이 H.264 부호화 방법에 비해 주관적 화질이 크게 향상된 것을 확인할 수 있었다.

• 대한전자공학회논문지SP
• /
• 제44권4호통권316호
• /
• pp.117-122
• /
• 2007

본 논문에서는 maximum a posteriori probability (MAP) 검출기와 minimum-mean-square-error (MMSE) 필터와 같은 선형 검출기의 hybrid 형태를 갖는, 다중안테나 시스템을 위한 iterative 수신기를 고려한다. MAP검출기의 우수한 성능과 선형 검출기의 낮은 복잡도를 얻기 위해 두 검출기를 한 프레임 내에서 동시에 사용하는 수신기 구조를 제안한다. Outer 코더의 extrinsic 정보인 코드 비트에 대한 a priori probability를 이용하여 검출기를 결정할 수 있는 임계치를 계산하고, 복조 심볼 단위로 결정된 검출기를 적용하여 코드 비트의 검출단에서의 extrinsic 정보를 계산한다. 모의실험 결과를 통해서, 제안된 수신기가 MMSE 수신기보다 우수한 성능을 가지며, MAP 수신기보다 낮은 복잡도를 가짐을 확인하였다.

• 한국군사과학기술학회지
• /
• 제23권4호
• /
• pp.407-416
• /
• 2020

Recent complex battle field demands Network Centric Warfare(NCW) ability to control various parts into a cohesive unit. In path planning filed, the NCW ability increases complexity of path planning algorithm, and it has to consider a communication coverage map as well as traditional parameters such as minimum radar exposure and survivability. In this paper, pros and cons of various propagation models are summarized, and we suggest a coverage map generation method using a Longley-Rice propagation model. Previous coverage map based on line of sight has significant discontinuities that limits selection of path planning algorithms such as Dijkstra and fast marching only. If there is method to remove discontinuities in the coverage map, optimization based path planning algorithms such as trajectory optimization and Particle Swarm Optimization(PSO) can also be used. In this paper, the Longley-Rice propagation model is used to calculate continuous RF strengths, and convert the strength data using smoothed leaky BER for the coverage map. In addition, we also suggest other types of rough coverage map generation using a lookup table method with simple inputs such as terrain type and antenna heights only. The implemented communication coverage map can be used various path planning algorithms, especially in the optimization based algorithms.

• 한국정보통신학회논문지
• /
• 제15권5호
• /
• pp.1155-1163
• /
• 2011

본 논문에서는 깊이 맵(depth map)에 대한 효율적인 부호화를 위하여 전처리 기법을 제안한다. 현재 3차원 비디오 부호화(3D video coding : 3DVC)에 대한 표준화가 진행 중에 있지만 아직 깊이 맵의 부호화 방법에 대한 표준은 확정되지 않은 상태이다. 제안하는 기법에서는 먼저 입력된 깊이 맵의 히스토그램 분포를 가우시안 혼합모델(Gaussian mixture model : GMM) 기반의 EM(expectation maximization) 군집화 기법을 이용하여 분리한다. 분리된 히스토그램을 기반으로 깊이 맵을 여러 개의 레이어로 분리하게 된다. 분리된 각각의 레이어에서 배경과 객체의 포함여부에 따라 다른 조건의 민쉬프트 필터(mean shift filter)를 적용한다. 결과적으로 영상내의 각 영역 경계는 최대한 살리면서 영역내의 화소 값에 대해서는 평균 연산을 취하여 부호화시 효율을 극대화 하고자 하였다. 다양한 실험영상에 대하여 제안한 기법을 적용한 깊이 맵을 부호화하여 비트율(bit rate)이 감소하고 부호화 시간도 다소 줄어드는 것을 확인 할 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권9호
• /
• pp.3823-3840
• /
• 2020

Recently, auto-encoder has emerged as the most popular method in convolutional neural network (CNN) based image compression and has achieved impressive performance. In the traditional auto-encoder based image compression model, the encoder simply sends the features of last layer to the decoder, which cannot allocate bits over different spatial regions in an efficient way. Besides, these methods do not fully exploit the contextual information under different receptive fields for better reconstruction performance. In this paper, to solve these issues, a novel auto-encoder model is designed for image compression, which can effectively transmit the hierarchical features of the encoder to the decoder. Specifically, we first propose an adaptive bit-allocation strategy, which can adaptively select an importance channel. Then, we conduct the multiply operation on the generated importance mask and the features of the last layer in our proposed encoder to achieve efficient bit allocation. Moreover, we present an additional novel perceptual loss function for more accurate image details. Extensive experiments demonstrated that the proposed model can achieve significant superiority compared with JPEG and JPEG2000 both in both subjective and objective quality. Besides, our model shows better performance than the state-of-the-art convolutional neural network (CNN)-based image compression methods in terms of PSNR.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.292-298
• /
• 1991

A new 6-axis robot controller with a high-speed 32-bit floating-point DSP TMS32OC30 has been developed in Samsung Electronics. The controller composed of Intel 80386 microprocessor for the main controller, and TKS32OC30 DSP chip for joint position controller. The characteristics of the controller are high sampling rate of 200us and fast reponsibility. The main controller supports MS-DOS, kinematics, trajectory planning, and sensor fusion functions which are vision, PLC, and MAP. The one high speed DSP chip is used for controlling 6 axes of a robot in 200us simultaneously. The control law applied is PID controller including a velocity feedforvard in joint position controller. The performance tests, such as command following, CP, were conducted for the controller integrated with a 6 axes robot developed in Samsung Electronics. The results showed a good performance. This controller can also perform the system control with other controllers, the communication with high priority controllers, and visual information processing.

• 대한전자공학회논문지
• /
• 제24권6호
• /
• pp.1040-1048
• /
• 1987

We propose a hardware architecture called Multiring which is applicable for various geometrical operations on rectilinear objects such as design rule checking in VLSI layout and many image processing operations including noise suppression and coutour extraction. It has both a fast execution speed and extremely high flexibility. The whole architecture is mainly divided into four parts` I/O between host and Multiring, ring memory, linear processor array and instruction decoder. Data transmission between host and Multiring is bit serial thereby reducing the bandwidth requirement for teh channel and the number of external pins, while each row data in the bit map stored in ring memory is processed in the corresponding processor in full parallelism. Each processor is simultaneously configured by the instruction decoder/controller to perform one of the 16 basic instructions such as Boolean (AND, OR, NOT, and Copy), geometrical(Expand and Shrink), and I/O operations each ring cycle, which gives Multiring maximal flexibility in terms of design rule change or the instruction set enhancement. Correct functional behavior of Multiring was confirmed by successfully running a software simulator having one-to-one structural correspondence to the Multiring hardware.

• 대한전자공학회논문지
• /
• 제23권2호
• /
• pp.206-216
• /
• 1986

In this paper, the moving distance and velocity of a single moving object are measured by sampling three frames in a two-dimensional line sequence image. The brightness of each frame is analyzed, and the bit data of their pixel are rearranged so that the difference image may be extracted. The parameters for recognition of the object are the gray level of the object, the number of vertex points and the distance between the vertex points. The moving distance obtained from the coordinate which is constructed by the bit processing of the data in the memory map of a microcomputer, and the moving velocity is obtained from the moving distance and the time interval between the first and second sampled frames.