• Title/Summary/Keyword: Centroid shifting

Search Result 10, Processing Time 0.02 seconds

Object Tracking Based on Color Centroids Shifting with Background Color and Temporal filtering (배경 컬러와 시간에 대한 필터링을 접목한 컬러 중심 이동 기반 물체 추적 알고리즘)

  • Lee, Suk-Ho;Choi, Eun-Cheol;Kang, Moon-Gi
    • Journal of Broadcast Engineering
    • /
    • v.16 no.1
    • /
    • pp.178-181
    • /
    • 2011
  • With the development of mobile devices and intelligent surveillance system loaded with pan/tilt cameras, object tracking with non-stationary cameras has become a topic with increasing importancy. Since it is difficult to model a background image in a non-stationary camera environment, colors and texture are the most important features in the tracking algorithm. However, colors in the background similar to those in the target arise instability in the tracking. Recently, we proposed a robust color based tracking algorithm that uses an area weighted centroid shift. In this letter, we update the model such that it becomes more stable against background colors. The proposed algorithm also incorporates time filtering by adding an additional energy term to the energy functional.

Ear Recognition by Major Axis and Complex Vector Manipulation

  • Su, Ching-Liang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1650-1669
    • /
    • 2017
  • In this study, each pixel in an ear is used as a centroid to generate a cake. Subsequently the major axis length of this cake is computed and obtained. This obtained major axis length serves as a feature to recognize an ear. Later, the ear hole is used as a centroid and a 16-circle template is generated to extract the major axis lengths of the ear. The 16-circle template extracted signals are used to recognize an ear. In the next step, a ring-to-line mapping technique is used to map these major axis lengths to several straight-line signals. Next, the complex plane vector computing technique is used to determine the similarity of these major axis lengths, whereby a solution to the image-rotating problem is achieved. The aforementioned extracted signals are also compared to the ones that are extracted from its neighboring pixels, whereby solving the image-shifting problem. The algorithm developed in this study can precisely identify an ear image by solving the image rotation and image shifting problems.

Offline Object Tracking for Private Information Masking in CCTV Data (CCTV 개인영상 정보보호를 위한 오프라인 객체추적)

  • Lee, Suk-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.12
    • /
    • pp.2961-2967
    • /
    • 2014
  • Nowadays, a private protection act has come into effect which demands for the protection of personal image information obtained by the CCTV. According to this act, the object out of interest has to be mosaicked such that it can not be identified before the image is sent to the investigation office. Meanwhile, the demand for digital videos obtained by CCTV is also increasing for digital forensic. Therefore, due to the two conflicting demands, the demand for a solution which can automatically mask an object in the CCTV video is increasing and related IT industry is expected to grow. The core technology in developing a target masking solution is the object tracking technique. In this paper, we propose an object tracking technique which suits for the application of CCTV video object masking as a postprocess. The proposed method simultaneously uses the motion and the color information to produce a stable tracking result. Furthermore, the proposed method is based on the centroid shifting method, which is a fast color based tracking method, and thus the overall tracking becomes fast.

Face Recognitions Using Centroid Shift and Neural Network-based Principal Component Analysis (중심이동과 신경망 기반 주요성분분석을 이용한 얼굴인식)

  • Cho Yong-Hyun
    • The KIPS Transactions:PartB
    • /
    • v.12B no.6 s.102
    • /
    • pp.715-720
    • /
    • 2005
  • This paper presents a hybrid recognition method of first moment of face image and principal component analysis(PCA). First moment is applied to reduce the dimension by shifting to the centroid of image, which is to exclude the needless backgrounds in the face recognitions. PCA is implemented by single layer neural network which has a teaming rule of Foldiak algorithm. It has been used as an alternative method for numerical PCA. PCA is to derive an orthonormal basis which directly leads to dimensionality reduction and possibly to feature extraction of face image. The proposed method has been applied to the problems for recognizing the 48 face images(12 Persons $\ast$ 4 scenes) of 64$\ast$64 pixels. The 3 distances such as city-block, Euclidean, negative angle are used as measures when match the probe images to the nearest gallery images. The experimental results show that the proposed method has a superior recognition performances(speed, rate). The negative angle has been relatively achieved more an accurate similarity than city-block or Euclidean.

An Efficient Face Recognition Using First Moment of Image and Basis Images (영상의 1차 모멘트와 기저영상을 이용한 효율적인 얼굴인식)

  • Cho Yong-Hyun
    • The KIPS Transactions:PartB
    • /
    • v.13B no.1 s.104
    • /
    • pp.7-14
    • /
    • 2006
  • This paper presents an efficient face recognition method using both first moment of image and basis images. First moment which is a method for finding centroid of image, is applied to exclude the needless backgrounds in the face recognitions by shifting to the centroid of face image. Basis images which are the face features, are respectively extracted by principal component analysis(PCA) and fixed-point independent component analysis(FP-ICA). This is to improve the recognition performance by excluding the redundancy considering to second- and higher-order statistics of face image. The proposed methods has been applied to the problem for recognizing the 48 face images(12 persons*4 scenes) of 64*64 pixels. The 3 distances such as city-block, Euclidean, negative angle are used as measures when match the probe images to the nearest gallery images. The experimental results show that the proposed methods has a superior recognition performances(speed, rate) than conventional PCA and FP-ICA without preprocessing, the proposed FP-ICA has also better performance than the proposed PCA. The city-block has been relatively achieved more an accurate similarity than Euclidean or negative angle.

Face Recognitions Using Centroid Shift and Independent Basis Images (중심이동과 독립기저영상을 이용한 얼굴인식)

  • Cho Yong-Hyun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.5
    • /
    • pp.581-587
    • /
    • 2005
  • This paper presents a hybrid face recognition method of both the first moment of image and the independent component analysis(ICA) of fixed point(FP) algorithm based on Newton method. First moment is a method for finding centroid of image, which is applied to exclude the needless backgrounds in the face recognitions by shifting to the centroid of face image. FP-ICA is also applied to find a set of independent basis images for the faces, which is a set of statistically independent facial features. The proposed method has been applied to the problem for recognizing the 48 face images(12 persons o 4 scenes) of 64*64 pixels. The 3 distances such as city-block, Euclidean, negative angle are used as measures when match the probe images to the nearest gallery images. The experimental results show that the proposed method has a superior recognition performances(speed, rate) than conventional FP-ICA without preprocessing. The city-block has been relatively achieved more an accurate similarity than Euclidean or negative angle.

Dynamic Nearest Neighbor Query Processing for Moving Vehicles (이동하는 차량들간 최근접 질의 처리 기법)

  • Lee, Myong-Soo;Shim, Kyu-Sun;Lee, Sang-Keun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.9 no.1
    • /
    • pp.1-8
    • /
    • 2010
  • For three and more rapidly moving vehicles, they want to search the nearest location for meeting. Each vehicle has a different velocity and a efficient method is needed for shifting a short distance. It is observed that the existing group nearest-neighbor query has been investigated for static query points; however these studies do not extend to highly dynamic vehicle environments. In this paper, we propose a novel Dynamic Nearest-Neighbor query processing for Multiple Vehicles (DNN_MV). Our method retrieves the nearest neighbor for a group of moving query points with a given vector and takes the direction of moving query points with a given vector into consideration for DNN_MV. Our method efficiently calculates a group nearest neighbor through a centroid point that represents the group of moving query points. The experimental results show that the proposed method operates efficiently in a dynamic group nearest neighbor search.

Role of accidental torsion in seismic reliability assessment for steel buildings

  • Chang, Heui-Yung;Lin, Chu-Chieh Jay;Lin, Ker-Chun;Chen, Jung-Yu
    • Steel and Composite Structures
    • /
    • v.9 no.5
    • /
    • pp.457-471
    • /
    • 2009
  • This study investigates the role of accidental torsion in seismic reliability assessment. The analyzed structures are regular 6-story and 20-story steel office buildings. The eccentricity in a floor plan was simulated by shifting the mass from the centroid by 5% of the dimension normal to earthquake shaking. The eccentricity along building heights was replicated by Latin hypercube sampling. The fragilities for immediate occupancy and life safety were evaluated using 0.7% and 2.5% inter-story drift limits. Two limit-state probabilities and the corresponding earthquake intensities were compared. The effect of ignoring accidental torsion and the use of code accidental eccentricity were also assessed. The results show that accidental torsion may influence differently the structural reliability and limit-state PGAs. In terms of structural reliability, significant differences in the probability of failure are obtained depending on whether accidental torsion is considered or not. In terms of limit-state PGAs, accidental torsion does not have a significant effect. In detail, ignoring accidental torsion leads to underestimates in low-rise buildings and at small drift limits. On the other hand, the use of code accidental eccentricity gives conservative estimates, especially in high-rise buildings at small drift limits.

Object Tracking Based on Centroids Shifting with Scale Adaptation (중심 이동 기반의 스케일 적응적 물체 추적 알고리즘)

  • Lee, Suk-Ho;Choi, Eun-Cheol;Kang, Moon-Gi
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.4
    • /
    • pp.529-537
    • /
    • 2011
  • In this paper, we propose a stable scale adaptive tracking method that uses centroids of the target colors. Most scale adaptive tracking methods have utilized histograms to determine target window sizes. However, in certain cases, histograms fail to provide good estimates of target sizes, for example, in the case of occlusion or the appearance of colors in the background that are similar to the target colors. This is due to the fact that histograms are related to the numbers of pixels that correspond to the target colors. Therefore, we propose the use of centroids that correspond to the target colors in the scale adaptation algorithm, since centroids are less sensitive to changes in the number of pixels that correspond to the target colors. Due to the spatial information inherent in centroids, a direct relationship can be established between centroids and the scale of target regions. Generally, after the zooming factors that correspond to all the target colors are calculated, the unreliable zooming factors are filtered out to produce a reliable zooming factor that determines the new scale of the target. Combined with the centroid based tracking algorithm, the proposed scale adaptation method results in a stable scale adaptive tracking algorithm. It tracks objects in a stable way, even when the background colors are similar to the colors of the object.

Object Tracking Algorithm Using Weighted Color Centroids Shifting (가중 컬러 중심 이동을 이용한 물체 추적 알고리즘)

  • Choi, Eun-Cheol;Lee, Suk-Ho;Kang, Moon-Gi
    • Journal of Broadcast Engineering
    • /
    • v.15 no.2
    • /
    • pp.236-247
    • /
    • 2010
  • Recently, mean shift tracking algorithms have been proposed which use the information of color histogram together with some spatial information provided by the kernel. In spite of their fast speed, the algorithms are suffer from an inherent instability problem which is due to the use of an isotropic kernel for spatiality and the use of the Bhattacharyya coefficient as a similarity function. In this paper, we analyze how the kernel and the Bhattacharyya coefficient can arouse the instability problem. Based on the analysis, we propose a novel tracking scheme that uses a new representation of the location of the target which is constrained by the color, the area, and the spatiality information of the target in a more stable way than the mean shift algorithm. With this representation, the target localization in the next frame can be achieved by one step computation, which makes the tracking stable, even in difficult situations such as low-rate-frame environment, and partial occlusion.