• Title/Summary/Keyword: Boundary Matching Algorithm

Search Result 94, Processing Time 0.021 seconds

Implementation of the Color Matching Between Mobile Camera and Mobile LCD Based on RGB LUT (모바일 폰의 카메라와 LCD 모듈간의 RGB 참조표에 기반한 색 정합의 구현)

  • Son Chang-Hwan;Park Kee-Hyon;Lee Cheol-Hee;Ha Yeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.3 s.309
    • /
    • pp.25-33
    • /
    • 2006
  • This paper proposed device-independent color matching algorithm based on the 3D RGB lookup table (LUT) between mobile camera and mobile LCD (Liquid Crystal Display) to improve the color-fidelity. Proposed algorithm is composed of thee steps, which is device characterization, gamut mapping, 3D RGB-LUT design. First, the characterization of mobile LCD is executed using the sigmoidal function, different from conventional method such as GOG (Gain Offset Gamma) and S-curve modeling, based on the observation of electro-optical transfer function of mobile LCD. Next, mobile camera characterization is conducted by fitting the digital value of GretagColor chart captured under the daylight environment (D65) and tristimulus values (CIELAB) using the polynomial regression. However, the CIELAB values estimated by polynomial regression exceed the maximum boundary of the CIELAB color space. Therefore, these values are corrected by linear compression of the lightness and chroma. Finally, gamut mapping is used to overcome the gamut difference between mobile camera and moible LCD. To implement the real-time processing, 3D RGB-LUT is designed based on the 3D RGB-LUT and its performance is evaluated and compared with conventional method.

A Structural Approach to On-line Signature Verification (구조적 접근방식의 온라인 자동 서명 겁증 기법)

  • Kim, Seong-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.4 s.36
    • /
    • pp.385-396
    • /
    • 2005
  • In this paper, a new structural approach to on-line signature verification is presented. A primitive pattern is defined as a part segmented by a local minimal position of speed. And a structural description of signature is composed of subpatterns which are defined as such forms as rotation shape, cusp shape and bell shape, acquired by composition of the primitives regarding the directional changes. As the matching method to find identical parts between two signatures, a modified DP(dynamic programming) matching algorithm is presented. And also, variation and complexity of local parts are computed from the training samples, and reference model and decision boundary are derived from these. Error rate, execution time and memory usage are compared among the functional approach, the parametric approach and the proposed structural approach. It is found that the average error rate can be reduced from 14.2% to 4.05% when the local parts of a signature are weighted and the complexity is used as a factor of decision threshold. Though the error rate is similar to that of functional approaches. time consumption and memory usage of the proposed structural approach are shown to be very effective.

  • PDF

Depth map temporal consistency compensation using motion estimation (움직임 추정을 통한 깊이 지도의 시간적 일관성 보상 기법)

  • Hyun, Jeeho;Yoo, Jisang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.2
    • /
    • pp.438-446
    • /
    • 2013
  • Generally, a camera isn't located at the center of display in a tele-presence system and it causes an incorrect eye contact between speakers which reduce the realistic feeling during the conversation. To solve this incorrect eye contact problem, we newly propose an intermediate view reconstruction algorithm using both a color camera and a depth camera and applying for the depth image based rendering (DIBR) algorithm. In the proposed algorithm, an efficient hole filling method using the arithmetic mean value of neighbor pixels and an efficient boundary noise removal method by expanding the edge region of depth image are included. We show that the generated eye-contacted image has good quality through experiments.

Sequential Motion Vector Error Concealment Algorithm for H.264 Video Coding (H.264 표준 동영상 부호화 방식을 위한 순차적 움직임 벡터 오류 은닉 기법)

  • Jeong Jong-woo;Hong Min-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.10C
    • /
    • pp.1036-1043
    • /
    • 2005
  • In this paper, we propose a sequential motion vector recovery algorithm for H.264 video coding standard. Motion vectors of H.264 video coding standard cover relatively smaller areas than other standard, since motion estimation of H.264 takes place in the fashion of variable block size. Therefore, the correlation of motion vectors between neighboring blocks increases as the block size of motion estimation is lowered. Under the framework of sequential recovery, we introduce a motion vector recovery using $\alpha$-trimed mean filter. Experimental results show that proposed algorithm is useful in real time video delivery .with nearly comparable or better visual quality than previous approaches such as macro block boundary matching and Lagrage interpolation.

Past Block Matching Motion Estimation based on Multiple Local Search Using Spatial Temporal Correlation (시공간적 상관성을 이용한 국소 다중 탐색기반 고속 블록정합 움직임 추정)

  • 조영창;남혜영;이태홍
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.4
    • /
    • pp.356-364
    • /
    • 2000
  • Block based fast motion estimation algorithm use the fixed search pattern to reduce the search point, and are based on the assumption that the error in the mean absolute error space monotonically decreases to the global minimum. Therefore, in case of many local minima in a search region we are likely to find local minima instead of the global minimum and highly rely on the initial search points. This situation is evident in the motion boundary. In this paper we define the candidate regions within the search region using the motion information of the neighbor blocks and we propose the multiple local search method (MLSM) which search for the solution throughout the candidate regions to reduce the possibilities of isolation to the local minima. In the MLSM we mark the candidate region in the search point map and we avoid to search the candidate regions already visited to reduce the calculation. In the simulation results the proposed method shows more excellent results than that of other gradient based method especially in the search of motion boundary. Especially, in PSNR the proposed method obtains similar estimate accuracy with the significant reduction of search points to that of full search.

  • PDF

H.264 to MPEG-2 Transcoding considering Distance of Motion Vectors (움직임벡터의 거리를 고려한 H.264 to MPEG-2 Transcoding)

  • Son, Nam-Rye;Jung, Min-A;Lee, Sung-Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5C
    • /
    • pp.454-463
    • /
    • 2010
  • After the efficiency of H.264 video compression has been announced, it replaced MPEG-2 standard in several applications. So transcoding methods of MPEG-2 to H.264 have been studying because there are variety devices and contents followed by MPEG-2. Although H.264 supported various service such as IPTV, DMB, digital broadcasting etc, but users using MPEG-2 devices cannot accessible to them. This paper propose H.264 to MPEG-2 transcoding for users of MPEG-2 devices without displacement H.264. The proposed method predicted a motion vector for MPEG-2 encoder after it extracted from motion vectors of variable blocks in H.264 to improve processing time. Also it predicted a optimal motion vector using modified boundary matching algorithm after grasped a special character for boundary and background of object. The experimental results from proposed method show a considerable reduction in processing time, as much as 68% averagely, with a small objective quality reduction in PSNR.

Development of System for Real-Time Object Recognition and Matching using Deep Learning at Simulated Lunar Surface Environment (딥러닝 기반 달 표면 모사 환경 실시간 객체 인식 및 매칭 시스템 개발)

  • Jong-Ho Na;Jun-Ho Gong;Su-Deuk Lee;Hyu-Soung Shin
    • Tunnel and Underground Space
    • /
    • v.33 no.4
    • /
    • pp.281-298
    • /
    • 2023
  • Continuous research efforts are being devoted to unmanned mobile platforms for lunar exploration. There is an ongoing demand for real-time information processing to accurately determine the positioning and mapping of areas of interest on the lunar surface. To apply deep learning processing and analysis techniques to practical rovers, research on software integration and optimization is imperative. In this study, a foundational investigation has been conducted on real-time analysis of virtual lunar base construction site images, aimed at automatically quantifying spatial information of key objects. This study involved transitioning from an existing region-based object recognition algorithm to a boundary box-based algorithm, thus enhancing object recognition accuracy and inference speed. To facilitate extensive data-based object matching training, the Batch Hard Triplet Mining technique was introduced, and research was conducted to optimize both training and inference processes. Furthermore, an improved software system for object recognition and identical object matching was integrated, accompanied by the development of visualization software for the automatic matching of identical objects within input images. Leveraging satellite simulative captured video data for training objects and moving object-captured video data for inference, training and inference for identical object matching were successfully executed. The outcomes of this research suggest the feasibility of implementing 3D spatial information based on continuous-capture video data of mobile platforms and utilizing it for positioning objects within regions of interest. As a result, these findings are expected to contribute to the integration of an automated on-site system for video-based construction monitoring and control of significant target objects within future lunar base construction sites.

Separation of the Occluding Object from the Stack of 3D Objects Using a 2D Image (겹쳐진 3차원 물체의 2차원 영상에서 가리는 물체의 구분기법)

  • 송필재;홍민철;한헌수
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.2
    • /
    • pp.11-22
    • /
    • 2004
  • Conventional algorithms of separating overlapped objects are mostly based on template matching methods and thus their application domain is restricted to 2D objects and the processing time increases when the number of templates (object models) does. To solve these problems, this paper proposes a new approach of separating the occluding object from the stack of 3D objects using the relationship between surfaces without any information on the objects. The proposed algorithm considers an object as a combination of surfaces which are consisted with a set of boundary edges. Overlap of 3D objects appears as overlap of surfaces and thus as crossings of edges in 2D image. Based on this observation, the types of edge crossings are classified from which the types of overlap of 3D objects can be identified. The relationships between surfaces are represented by an attributed graph where the types of overlaps are represented by relation values. Using the relation values, the surfaces pertained to the same object are discerned and the overlapping object on the top of the stack can be separated. The performance of the proposed algorithm has been proved by the experiments using the overlapped images of 3D objects selected among the standard industrial parts.

Automatic Moving Object Segmentation using Robust Edge Linking for Content-based Coding (내용 기반 코딩을 위한 강력한 에지 연결에 의한 움직임 객체 자동 분할)

  • 김준기;이호석
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.5_6
    • /
    • pp.305-320
    • /
    • 2004
  • Moving object segmentation is a fundamental function for content-based application. Moving object edges are produced by matching the detected moving edges with the current frame edges. But we can often experience the object edge disconnectedness due to coincidence of similarity between the object and background colors or the decrease of movement of moving object. The edge disconnectedness is a serious problem because it degrades the object visual quality so conspicuously That it sometimes makes it inadequate to perform content-based coding. We have solved this problem by developing a robust and comprehensive edge linking algorithm. And we also developed an automatic moving object segmentation algorithm. These algorithms can produce the completely linked moving object edge boundary and the accurate moving object segmentation. These algorithms can process CIF 30 frames/sec in a PC. These algorithms can be used for the MPEG-4 content-based coding.

A Depth-map Coding Method using the Adaptive XOR Operation (적응적 배타적 논리합을 이용한 깊이정보 맵 코딩 방법)

  • Kim, Kyung-Yong;Park, Gwang-Hoon
    • Journal of Broadcast Engineering
    • /
    • v.16 no.2
    • /
    • pp.274-292
    • /
    • 2011
  • This paper proposes an efficient coding method of the depth-map which is different from the natural images. The depth-map are so smooth in both inner parts of the objects and background, but it has sharp edges on the object-boundaries like a cliff. In addition, when a depth-map block is decomposed into bit planes, the characteristic of perfect matching or inverted matching between bit planes often occurs on the object-boundaries. Therefore, the proposed depth-map coding scheme is designed to have the bit-plane unit coding method using the adaptive XOR method for efficiently coding the depth-map images on the object-boundary areas, as well as the conventional DCT-based coding scheme (for example, H.264/AVC) for efficiently coding the inside area images of the objects or the background depth-map images. The experimental results show that the proposed algorithm improves the average bit-rate savings as 11.8 % ~ 20.8% and the average PSNR (Peak Signal-to-Noise Ratio) gains as 0.9 dB ~ 1.5 dB in comparison with the H.264/AVC coding scheme. And the proposed algorithm improves the average bit-rate savings as 7.7 % ~ 12.2 % and the average PSNR gains as 0.5 dB ~ 0.8 dB in comparison with the adaptive block-based depth-map coding scheme. It can be confirmed that the proposed method improves the subjective quality of synthesized image using the decoded depth-map in comparison with the H.264/AVC coding scheme. And the subjective quality of the proposed method was similar to the subjective quality of the adaptive block-based depth-map coding scheme.