• Title/Summary/Keyword: Reference Object

Search Result 613, Processing Time 0.03 seconds

A Shadow Region Suppression Method using Intensity Projection and Converting Energy to Improve the Performance of Probabilistic Background Subtraction (확률기반 배경제거 기법의 향상을 위한 밝기 사영 및 변환에너지 기반 그림자 영역 제거 방법)

  • Hwang, Soon-Min;Kang, Dong-Joong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.1
    • /
    • pp.69-76
    • /
    • 2010
  • The segmentation of moving object in video sequence is a core technique of intelligent image processing system such as video surveillance, traffic monitoring and human tracking. A typical method to segment a moving region from the background is the background subtraction. The steps of background subtraction involve calculating a reference image, subtracting new frame from reference image and then thresholding the subtracted result. One of famous background modeling is Gaussian mixture model (GMM). Even though the method is known efficient and exact, GMM suffers from a problem that includes false pixels in ROI (region of interest), specifically shadow pixels. These false pixels cause fail of the post-processing tasks such as tracking and object recognition. This paper presents a method for removing false pixels included in ROT. First, we subdivide a ROI by using shape characteristics of detected objects. Then, a method is proposed to classify pixels from using histogram characteristic and comparing difference of energy that converts the color value of pixel into grayscale value, in order to estimate whether the pixels belong to moving object area or shadow area. The method is applied to real video sequence and the performance is verified.

A Design and Performance Analysis of Web Cache Replacement Policy Based on the Size Heterogeneity of the Web Object (웹 객체 크기 이질성 기반의 웹 캐시 대체 기법의 설계와 성능 평가)

  • Na Yun Ji;Ko Il Seok;Cho Dong Uk
    • The KIPS Transactions:PartC
    • /
    • v.12C no.3 s.99
    • /
    • pp.443-448
    • /
    • 2005
  • Efficient using of the web cache is becoming important factors that decide system management efficiency in the web base system. The cache performance depends heavily on the replacement algorithm which dynamically selects a suitable subset of objects for caching in a finite cache space. In this paper, the web caching algorithm is proposed for the efficient operation of the web base system. The algorithm is designed based on a divided scope that considered size reference characteristic and heterogeneity on web object. With the experiment environment, the algorithm is compared with conservative replacement algorithms, we have confirmed more than $15\%$ of an performance improvement.

Region-based scalable self-recovery for salient-object images

  • Daneshmandpour, Navid;Danyali, Habibollah;Helfroush, Mohammad Sadegh
    • ETRI Journal
    • /
    • v.43 no.1
    • /
    • pp.109-119
    • /
    • 2021
  • Self-recovery is a tamper-detection and image recovery methods based on data hiding. It generates two types of data and embeds them into the original image: authentication data for tamper detection and reference data for image recovery. In this paper, a region-based scalable self-recovery (RSS) method is proposed for salient-object images. As the images consist of two main regions, the region of interest (ROI) and the region of non-interest (RONI), the proposed method is aimed at achieving higher reconstruction quality for the ROI. Moreover, tamper tolerability is improved by using scalable recovery. In the RSS method, separate reference data are generated for the ROI and RONI. Initially, two compressed bitstreams at different rates are generated using the embedded zero-block coding source encoder. Subsequently, each bitstream is divided into several parts, which are protected through various redundancy rates, using the Reed-Solomon channel encoder. The proposed method is tested on 10 000 salient-object images from the MSRA database. The results show that the RSS method, compared to related methods, improves reconstruction quality and tamper tolerability by approximately 30% and 15%, respectively.

Location reference technique of ITS Space Database supporting interoperability (상호운용성을 지원하는 ITS 공간 데이터베이스의 위치참조 기법)

  • Kim, Suk-Hee;Choi, Kee-Choo;Jang, Jeong-Ah
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.12 no.1 s.28
    • /
    • pp.45-53
    • /
    • 2004
  • The purpose of this paper is to study a scheme to ITS service which enables the data (spatial, non-spatial and image) sharing among heterogeneous system (various environment) with employing the concept of object orientedness and to show Location Reference Technique of ITS Space DB for interoperability. Data warehouse service, query object service, interface object service, and naming object service have been identified for this. In addition, a metadata management object service and persistent object service based system framework has been devised. The proposed skeletal framework would be expected to be functioning well for ITS data sharing environment and for the interoperability support.

  • PDF

Unification of neural network with a hierarchical pattern recognition

  • Park, Chang-Mock;Wang, Gi-Nam
    • Proceedings of the ESK Conference
    • /
    • 1996.10a
    • /
    • pp.197-205
    • /
    • 1996
  • Unification of neural network with a hierarchical pattern recognition is presented for recognizing large set of objects. A two-step identification procedure is developed for pattern recognition: coarse and fine identification. The coarse identification is designed for finding a class of object while the fine identification procedure is to identify a specific object. During the training phase a course neural network is trained for clustering larger set of reference objects into a number of groups. For training a fine neural network, expert neural network is also trained to identify a specific object within a group. The presented idea can be interpreted as two step identification. Experimental results are given to verify the proposed methodology.

  • PDF

3D Position Analysis and Tracking of an Object using Monocular USB port Camera (한 대의 USB port 카메라를 이용한 물체추적 과 3차원 정보 추출)

  • 이동엽;이동활;배종일;이만형
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.277-277
    • /
    • 2000
  • This paper's purpose obtain information of three dimension using a camera. This system embody to know the height of object using triangle method between reference point of circumstance and object. As I use java program, it is possible to make system regardless of operating system, set up the system. By using comportable USB port camera, we used to everywhere without the capture board. We can use the internet by using the java's JMF and applet everywhere, we regard the camera as fixed.

  • PDF

Optical implementation of 3D image correlator using integral imaging technique (집적영상 기술을 이용한 3D 영상 상관기의 광학적 구현)

  • Piao, Yongri;Kim, Seok-Tae;Kim, Eun-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.8
    • /
    • pp.1659-1665
    • /
    • 2009
  • In this paper, we propose an implementation method of 3D image correlator using integral imaging technique. In the proposed method, elemental images of the reference and signal 3D objects are recorded by lenslet arrays and then reference and signal output plane images with high resolution are optically reconstructed on the output plane by displaying these elemental images into a display panel. Through cross-correlations between the reconstructed reference and the single plane images, 3D object recognition is performed. The proposed method can provide a precise 3D object recognition by using the high-resolution output plane images compared with the previous methods and implement all-optical structure for real-time 3D object recognition system. To show the feasibility of the proposed method, optical experiments are carried out and the results are presented.

Region Segmentation Algorithm of Object Using Self-Extraction of Reference Template (기준 템플릿의 자동 생성 기법을 이용한 물체 영역 분할 알고리즘)

  • Lee, Gyoon-Jung;Lee, Dong-Won;Joo, Jae-Heum;Bae, Jong-Gab;Nam, Ki-Gon
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.12 no.1
    • /
    • pp.7-12
    • /
    • 2011
  • In this paper, we propose the technique detecting interest object region effectively in the images from periscope of submarine based on self-generated template. First, we extract the sea-sky line, and divide it into sky and sea area from background region based on the sea-sky line. In each divided background region, the blocks which can be represented in each background region are set as a reference template. After dividing an image into several same size of blocks, we apply multi template matching to the divided search blocks and histogram template to divide the image into object region and background region. Proposed algorithm is adapted to various images in which objects exist in the background of sea and sky. We verified that proposed algorithm performed properly without given informmed prby prior learning.ropso, regardless of the slope of sea-sky line and the locmed p of object based on sea-sky line, we verified that the objects region was segmented effectively from the input image.

Detection and Recognition of Overlapped Circular Objects based a Signature Representation Scheme (Signature 기반의 겹쳐진 원형 물체 검출 및 인식 기법)

  • Park, Sang-Bum;Hahn, Hern-Soo;Han, Young-Joon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.1
    • /
    • pp.54-61
    • /
    • 2008
  • This paper proposes a new algorithm for detecting and recognizing overlapped objects among a stack of arbitrarily located objects using a signature representation scheme. The proposed algorithm consists of two processes of detecting overlap of objects and of determining the boundary between overlapping objects. To determine overlap of objects, in the first step, the edge image of object region is extracted and those areas in the object region are considered as the object areas if an area is surrounded by a closed edge. For each object, its signature image is constructed by measuring the distances of those edge points from the center of the object, along the angle axis, which are located at every angle with reference to the center of the object. When an object is not overlapped, its features which consist of the positions and angles of outstanding points in the signature are searched in the database to find its corresponding model. When an object is overlapped, its features are partially matched with those object models among which the best matching model is selected as the corresponding model. The boundary among the overlapping objects is determined by projecting the signature to the original image. The performance of the proposed algorithm has been tested with the task of picking the top or non-overlapped object from a stack of arbitrarily located objects. In the experiment, a recognition rate of 98% has been achieved.

Low-Complexity MPEG-4 Shape Encoding towards Realtime Object-Based Applications

  • Jang, Euee-Seon
    • ETRI Journal
    • /
    • v.26 no.2
    • /
    • pp.122-135
    • /
    • 2004
  • Although frame-based MPEG-4 video services have been successfully deployed since 2000, MPEG-4 video coding is now facing great competition in becoming a dominant player in the market. Object-based coding is one of the key functionalities of MPEG-4 video coding. Real-time object-based video encoding is also important for multimedia broadcasting for the near future. Object-based video services using MPEG-4 have not yet made a successful debut due to several reasons. One of the critical problems is the coding complexity of object-based video coding over frame-based video coding. Since a video object is described with an arbitrary shape, the bitstream contains not only motion and texture data but also shape data. This has introduced additional complexity to the decoder side as well as to the encoder side. In this paper, we have analyzed the current MPEG-4 video encoding tools and proposed efficient coding technologies that reduce the complexity of the encoder. Using the proposed coding schemes, we have obtained a 56 percent reduction in shape-coding complexity over the MPEG-4 video reference software (Microsoft version, 2000 edition).

  • PDF