• Title/Summary/Keyword: Adjacent Object

Search Result 152, Processing Time 0.022 seconds

LSG;(Local Surface Group); A Generalized Local Feature Structure for Model-Based 3D Object Recognition (LSG:모델 기반 3차원 물체 인식을 위한 정형화된 국부적인 특징 구조)

  • Lee, Jun-Ho
    • The KIPS Transactions:PartB
    • /
    • v.8B no.5
    • /
    • pp.573-578
    • /
    • 2001
  • This research proposes a generalized local feature structure named "LSG(Local Surface Group) for model-based 3D object recognition". An LSG consists of a surface and its immediately adjacent surface that are simultaneously visible for a given viewpoint. That is, LSG is not a simple feature but a viewpoint-dependent feature structure that contains several attributes such as surface type. color, area, radius, and simultaneously adjacent surface. In addition, we have developed a new method based on Bayesian theory that computes a measure of how distinct an LSG is compared to other LSGs for the purpose of object recognition. We have experimented the proposed methods on an object databaed composed of twenty 3d object. The experimental results show that LSG and the Bayesian computing method can be successfully employed to achieve rapid 3D object recognition.

  • PDF

MRF Particle filter-based Multi-Touch Tracking and Gesture Likelihood Estimation (MRF 입자필터 멀티터치 추적 및 제스처 우도 측정)

  • Oh, Chi-Min;Shin, Bok-Suk;Klette, Reinhard;Lee, Chil-Woo
    • Smart Media Journal
    • /
    • v.4 no.1
    • /
    • pp.16-24
    • /
    • 2015
  • In this paper, we propose a method for multi-touch tracking using MRF-based particle filters and gesture likelihood estimation Each touch (of one finger) is considered to be one object. One of frequently occurring issues is the hijacking problem which means that an object tracker can be hijacked by neighboring object. If a predicted particle is close to an adjacent object then the particle's weight should be lowered by analysing the influence of neighboring objects for avoiding hijacking problem. We define a penalty function to lower the weights of those particles. MRF is a graph representation where a node is the location of a target object and an edge describes the adjacent relation of target object. It is easy to utilize MRF as data structure of adjacent objects. Moreover, since MRF graph representation is helpful to analyze multi-touch gestures, we describe how to define gesture likelihoods based on MRF. The experimental results show that the proposed method can avoid the occurrence of hijacking problems and is able to estimate gesture likelihoods with high accuracy.

Salient Object Detection via Adaptive Region Merging

  • Zhou, Jingbo;Zhai, Jiyou;Ren, Yongfeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4386-4404
    • /
    • 2016
  • Most existing salient object detection algorithms commonly employed segmentation techniques to eliminate background noise and reduce computation by treating each segment as a processing unit. However, individual small segments provide little information about global contents. Such schemes have limited capability on modeling global perceptual phenomena. In this paper, a novel salient object detection algorithm is proposed based on region merging. An adaptive-based merging scheme is developed to reassemble regions based on their color dissimilarities. The merging strategy can be described as that a region R is merged with its adjacent region Q if Q has the lowest dissimilarity with Q among all Q's adjacent regions. To guide the merging process, superpixels that located at the boundary of the image are treated as the seeds. However, it is possible for a boundary in the input image to be occupied by the foreground object. To avoid this case, we optimize the boundary influences by locating and eliminating erroneous boundaries before the region merging. We show that even though three simple region saliency measurements are adopted for each region, encouraging performance can be obtained. Experiments on four benchmark datasets including MSRA-B, SOD, SED and iCoSeg show the proposed method results in uniform object enhancement and achieve state-of-the-art performance by comparing with nine existing methods.

An Improved Snake Algorithm Using Neighbouring Edges (근접 에지를 이용한 개선된 스네이크 알고리즘)

  • Jang, Seok-Woo;On, Jin-Wook;Kim, Gye-Young
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.11
    • /
    • pp.866-870
    • /
    • 2010
  • This paper presents an improved Snake algorithm that contains additional energy term related to adjacent edges. The suggested algorithm represents the distance between an adjacent edge and the current cell as energy, and extracts object contours more effectively by including the energy tenn to the whole energy function. The adjacent edge-based snake algorithm not only make it possible to detect object boundaries which are concave, but also can detect the boundaries of complex objects without weight adjustment. Experimental results show that the proposed method extracts object boundaries more accurately than other existing methods without loss of speed.

Moving Object Tracking Using Co-occurrence Features of Objects (이동 물체의 상호 발생 특징정보를 이용한 동영상에서의 이동물체 추적)

  • Kim, Seongdong;Seongah Chin;Moonwon Choo
    • Journal of Intelligence and Information Systems
    • /
    • v.8 no.2
    • /
    • pp.1-13
    • /
    • 2002
  • In this paper, we propose an object tracking system which can be convinced of moving area shaped on objects through color sequential images, decided moving directions of foot messengers or vehicles of image sequences. In static camera, we suggests a new evaluating method extracting co-occurrence matrix with feature vectors of RGB after analyzing and blocking difference images, which is accessed to field of camera view for motion. They are energy, entropy, contrast, maximum probability, inverse difference moment, and correlation of RGB color vectors. we describe how to analyze and compute corresponding relations of objects between adjacent frames. In the clustering, we apply an algorithm of FCM(fuzzy c means) to analyze matching and clustering problems of adjacent frames of the featured vectors, energy and entropy, gotten from previous phase. In the matching phase, we also propose a method to know correspondence relation that can track motion each objects by clustering with similar area, compute object centers and cluster around them in case of same objects based on membership function of motion area of adjacent frames.

  • PDF

A Study on Object Detection in Region-of-Interest Algorithm using Adjacent Frames based Image Correction Algorithm for Interactive Building Signage

  • Lee, Jonghyeok;Choi, Jinyeong;Cha, Jaesang
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.10 no.2
    • /
    • pp.74-78
    • /
    • 2018
  • Recently, due to decrease hardware prices and the development of technology, analog signage has been changing to digital signage for providing content such as advertisements, videos. Furthermore, in order to provide advertisements and contents to users more effectively, technical researches are being conducted in various industries. In addition, including digital signage that uses displays, it can be seen that it provides advertisements and contents using diverse devices such as LED signage, smart pads, and smart phones. However, most digital signage is installed in one place to provide contents and provides interactivity through simple events such as manual content provision or touch. So, in this paper, we suggest a new object detection algorithm based on an adjacent frames based image correction algorithm for interactive building signage.

Segmentation and Classification of 3-D Object from Range Information (Range 정보로부터 3차원 물체 분할 및 식별)

  • 황병곤;조석제;하영호;김수중
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.1
    • /
    • pp.120-129
    • /
    • 1990
  • In this paper, 3-dimensional object segmentation and classification are proposed. Planar object is segmented surface using jump boundary and internal boundary. Curved object is segmented surfaces by maximin clustering method. Segmented surfaces are classified by depth trends and angle measurement of normal vectors. Classified surfaces are merged according to adjacent surfaces and compared to Guassian curvature and mean curvature method. The proposed methods have been successfully applied to the synthetic range images and shows good classification.

  • PDF

A New Snakes Algorithm Combined with Disparity Information in the Stereo Images (스테레오 영상에서 변이 정보를 결합한 새로운 스네이크 알고리즘)

  • 김신형;전병태;장종환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.11C
    • /
    • pp.1088-1097
    • /
    • 2003
  • In this paper, we propose a method that improves the snakes algorithm well known as previously active contour model. Generally, the previous snakes algorithm applied to the 2-D images doesn't get the good results due to the influences about other objects adjacent to contour of object to be extracted. Users directly set the initial snakes points near to the contour of the object to get better results. In this paper, using the disparity information of the stereo images, a new algorithm of the object segmentation is proposed to reduce the influences adjacent to the contour of object. Users can establish initial snakes points automatically from the setting of the interested regions.

AANet: Adjacency auxiliary network for salient object detection

  • Li, Xialu;Cui, Ziguan;Gan, Zongliang;Tang, Guijin;Liu, Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.10
    • /
    • pp.3729-3749
    • /
    • 2021
  • At present, deep convolution network-based salient object detection (SOD) has achieved impressive performance. However, it is still a challenging problem to make full use of the multi-scale information of the extracted features and which appropriate feature fusion method is adopted to process feature mapping. In this paper, we propose a new adjacency auxiliary network (AANet) based on multi-scale feature fusion for SOD. Firstly, we design the parallel connection feature enhancement module (PFEM) for each layer of feature extraction, which improves the feature density by connecting different dilated convolution branches in parallel, and add channel attention flow to fully extract the context information of features. Then the adjacent layer features with close degree of abstraction but different characteristic properties are fused through the adjacent auxiliary module (AAM) to eliminate the ambiguity and noise of the features. Besides, in order to refine the features effectively to get more accurate object boundaries, we design adjacency decoder (AAM_D) based on adjacency auxiliary module (AAM), which concatenates the features of adjacent layers, extracts their spatial attention, and then combines them with the output of AAM. The outputs of AAM_D features with semantic information and spatial detail obtained from each feature are used as salient prediction maps for multi-level feature joint supervising. Experiment results on six benchmark SOD datasets demonstrate that the proposed method outperforms similar previous methods.

Adaptive Thinning Algorithm for External Boundary Extraction

  • Yoo, Suk Won
    • International Journal of Advanced Culture Technology
    • /
    • v.4 no.4
    • /
    • pp.75-80
    • /
    • 2016
  • The process of extracting external boundary of an object is a very important process for recognizing an object in the image. The proposed extraction method consists of two processes: External Boundary Extraction and Thinning. In the first step, external boundary extraction process separates the region representing the object in the input image. Then, only the pixels adjacent to the background are selected among the pixels constituting the object to construct an outline of the object. The second step, thinning process, simplifies the outline of an object by eliminating unnecessary pixels by examining positions and interconnection relations between the pixels constituting the outline of the object obtained in the previous extraction process. As a result, the simplified external boundary of object results in a higher recognition rate in the next step, the object recognition process.