• Title/Summary/Keyword: Voting scheme

Search Result 84, Processing Time 0.019 seconds

Hierarchical Graph Based Segmentation and Consensus based Human Tracking Technique

  • Ramachandra, Sunitha Madasi;Jayanna, Haradagere Siddaramaiah;Ramegowda, Ramegowda
    • Journal of Information Processing Systems
    • /
    • v.15 no.1
    • /
    • pp.67-90
    • /
    • 2019
  • Accurate detection, tracking and analysis of human movement using robots and other visual surveillance systems is still a challenge. Efforts are on to make the system robust against constraints such as variation in shape, size, pose and occlusion. Traditional methods of detection used the sliding window approach which involved scanning of various sizes of windows across an image. This paper concentrates on employing a state-of-the-art, hierarchical graph based method for segmentation. It has two stages: part level segmentation for color-consistent segments and object level segmentation for category-consistent regions. The tracking phase is achieved by employing SIFT keypoint descriptor based technique in a combined matching and tracking scheme with validation phase. Localization of human region in each frame is performed by keypoints by casting votes for the center of the human detected region. As it is difficult to avoid incorrect keypoints, a consensus-based framework is used to detect voting behavior. The designed methodology is tested on the video sequences having 3 to 4 persons.

Voting-based Intra Mode Bit Skip Using Pixel Information in Neighbor Blocks (이웃한 블록 내 화소 정보를 이용한 투표 결정 기반의 인트라 예측 모드 부호화 생략 방법)

  • Kim, Ji-Eon;Cho, Hye-Jeong;Jeong, Se-Yoon;Lee, Jin-Ho;Oh, Seoung-Jun
    • Journal of Broadcast Engineering
    • /
    • v.15 no.4
    • /
    • pp.498-512
    • /
    • 2010
  • Intra coding is an indispensable coding tool since it can provide random accessibility as well as error resiliency. However, it is the problem that intra coding has relatively low coding efficiency compared with inter coding in the area of video coding. Even though H.264/AVC has significantly improved the intra coding performance compared with previous video standards, H.264/AVC encoder complexity is significantly increased, which is not suitable for low bit rate interactive services. In this paper, a Voting-based Intra Mode Bit Skip (V-IMBS) scheme is proposed to improve coding efficiency as well as to reduce encoding time complexity using decoder-side prediction. In case that the decoder can determine the same prediction mode as what is chosen by the encoder, the encoder does not send that intra prediction mode; otherwise, the conventional H.264/AVC intra coding is performed. Simulation results reveal a performance increase up to 4.44% overall rate savings and 0.24 dB in peak signal-to-noise ratio while the frame encoding speed of proposed method is about 42.8% better than that of H.264/AVC.

Fuzzy Inference-based Replication Scheme for Result Verification in Desktop Grids (데스크톱 그리드에서 결과 검증을 위한 퍼지 추론 기반 복제 기법)

  • Gil, Joon-Min;Kim, Hong-Soo;Jung, Soon Young
    • The Journal of Korean Association of Computer Education
    • /
    • v.12 no.4
    • /
    • pp.65-75
    • /
    • 2009
  • The result verification is necessary to support a guarantee for the correctness of the task results be executed by any unspecified resources in desktop grid environments. Typically, voting-based and trust-based result verification schemes have been used in the environments. However, these suffer from two potential problems: waste of resources due to redundant replicas of each task and increase in turnaround time due to the inability to deal with a dynamic changeable execution environment. To overcome these problems, we propose a fuzzy inference-based replication scheme which can adaptively determine the number of replicas per task by using both trusty degree and result return probability of resources. Therefore our proposal can reduce waste of resources by determining the number of replicas meeting with a dynamic execution environment of desktop grids, not to mention an enhancement of turnaround time for entire asks. Simulation results show that our scheme is superior to other ones in terms of turnaround time, the waste of resources, and the number of re-replications per task.

  • PDF

The Mobile ID based Digital Signature Scheme Suitable for Mobile Contents Distribution (모바일 콘텐츠 유통에 적합한 ID 기반 디지털 서명 기법)

  • Yun, Sung-Hyun
    • Journal of the Korea Convergence Society
    • /
    • v.2 no.1
    • /
    • pp.1-6
    • /
    • 2011
  • The wide use of mobile devices such as smart phones makes the mobile commerce industry be growing-up rapidly. In mobile commerce security, how to secure a copyright of mobile contents and how to distribute it are of major concerns. The user can carry the smart phone regardless of the places. Thus the utilization of it is very high than that of personal computers. The USIM(Universal Subscriber Information Module) inserted in the smart phone binds the user with the device. This means that the smart phone can be used to represent the owner's identity. In this paper, we develop the mobile ID based digital signature scheme. We create the mobile ID by combining USIM with the user's random secret value. In addition, undeniable property of our signature scheme can make ID based applications such as mobile voting and mobile content distribution be possible with the smart phone.

Extreme Learning Machine Ensemble Using Bagging for Facial Expression Recognition

  • Ghimire, Deepak;Lee, Joonwhoan
    • Journal of Information Processing Systems
    • /
    • v.10 no.3
    • /
    • pp.443-458
    • /
    • 2014
  • An extreme learning machine (ELM) is a recently proposed learning algorithm for a single-layer feed forward neural network. In this paper we studied the ensemble of ELM by using a bagging algorithm for facial expression recognition (FER). Facial expression analysis is widely used in the behavior interpretation of emotions, for cognitive science, and social interactions. This paper presents a method for FER based on the histogram of orientation gradient (HOG) features using an ELM ensemble. First, the HOG features were extracted from the face image by dividing it into a number of small cells. A bagging algorithm was then used to construct many different bags of training data and each of them was trained by using separate ELMs. To recognize the expression of the input face image, HOG features were fed to each trained ELM and the results were combined by using a majority voting scheme. The ELM ensemble using bagging improves the generalized capability of the network significantly. The two available datasets (JAFFE and CK+) of facial expressions were used to evaluate the performance of the proposed classification system. Even the performance of individual ELM was smaller and the ELM ensemble using a bagging algorithm improved the recognition performance significantly.

Suppressio of mutual interference among vehicular radars by ON-OFF control of pulses (다중차량의 자동 주행 시의 레이터 상호간섭 억제)

  • 최병철;김용철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1B
    • /
    • pp.62-70
    • /
    • 2000
  • Intelligent vehicles are equipped with radar sensors for collision avoidance. We present a method of suppressing mutual interference among pulse-type radars, where all the radars are standardized. We developed a method of separating the true self-reflection from the false one by controlling the pulse emission of a radar in anorhogonal ON, OFF pattern. Interference signal identified in OFF-intervals is recorded to indicate the positions of the expected ghosts in ON-intervals. PFA and PM are derived for a radar system with I-Q demodulation scheme, where Gaussian noise alone is Rayleigh-distributed and Gaussian noise plus reflected radar pulse are Rician-distributed. The value of the threshold adaptively updated in order to prevent the deterioration of PM. In the experimental result, PFA decreases by an order of 10,000, when compared with the conventional M of N majority voting method.

  • PDF

Multi-Frame Face Classification with Decision-Level Fusion based on Photon-Counting Linear Discriminant Analysis

  • Yeom, Seokwon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.14 no.4
    • /
    • pp.332-339
    • /
    • 2014
  • Face classification has wide applications in security and surveillance. However, this technique presents various challenges caused by pose, illumination, and expression changes. Face recognition with long-distance images involves additional challenges, owing to focusing problems and motion blurring. Multiple frames under varying spatial or temporal settings can acquire additional information, which can be used to achieve improved classification performance. This study investigates the effectiveness of multi-frame decision-level fusion with photon-counting linear discriminant analysis. Multiple frames generate multiple scores for each class. The fusion process comprises three stages: score normalization, score validation, and score combination. Candidate scores are selected during the score validation process, after the scores are normalized. The score validation process removes bad scores that can degrade the final output. The selected candidate scores are combined using one of the following fusion rules: maximum, averaging, and majority voting. Degraded facial images are employed to demonstrate the robustness of multi-frame decision-level fusion in harsh environments. Out-of-focus and motion blurring point-spread functions are applied to the test images, to simulate long-distance acquisition. Experimental results with three facial data sets indicate the efficiency of the proposed decision-level fusion scheme.

Vote Decision-based Deinterlacing Scheme For Directional Error Correction (방향성 오류 교정을 위한 투표 결정 기반의 디인터레이싱 방법)

  • Oh, Sye-Hoon;Lee, Yeo-Song;Ahn, Chang-Beom;Oh, Seoung-Jun
    • Journal of Broadcast Engineering
    • /
    • v.14 no.3
    • /
    • pp.342-356
    • /
    • 2009
  • This paper presents a vote decision-based deinterlacing scheme for false directional error correction(VDD) to convert interlaced signal into non-interlaced signal using only one fields. The VDD using the vote decision goes through four steps process. The first step extracts regions having doubt of false edge using MM-ELA method. In these regions, the edge direction is decided by the majority vote using upper adjacent pixels's information through the second step. But, we still have undecided directions, which will be decided by the majority vote and the directional average decision at the third step. This step preserves the edge directions and minimizes visual degradation. Finally, the last step interpolates undecided pixels using DOI method which can consider the fine edge direction. Although the VDD with hierarchical structure has a high complexity, it can extract delicate edge compared to other pixel-by-pixel or window-by-window deinterlacing algorithms. Simulation results show that it has significantly improved both the subjective and objective qualities of the reconstructed images.

Fault Tolerant Encryption and Data Compression under Ubiquitous Environment (Ubiquitous 환경 하에서 고장 극복 암호 및 데이터 압축)

  • You, Young-Gap;Kim, Han-Byeo-Ri;Park, Kyung-Chang;Lee, Sang-Jin;Kim, Seung-Youl;Hong, Yoon-Ki
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.8
    • /
    • pp.91-98
    • /
    • 2009
  • This paper presents a solution to error avalanche of deciphering where radio noise brings random bit errors in encrypted image data under ubiquitous environment. The image capturing module is to be made comprising data compression and encryption features to reduce data traffic volume and to protect privacy. Block cipher algorithms may experience error avalanche: multiple pixel defects due to single bit error in an encrypted message. The new fault tolerant scheme addresses error avalanche effect exploiting a three-dimensional data shuffling process, which disperses error bits on many frames resulting in sparsely isolated errors. Averaging or majority voting with neighboring pixels can tolerate prominent pixel defects without increase in data volume due to error correction. This scheme has 33% lower data traffic load with respect to the conventional Hamming code based approach.

A Fuzzy Logic-Based False Report Detection Method in Wireless Sensor Networks (무선 센서 네트워크에서 퍼지 로직 기반의 허위 보고서 탐지 기법)

  • Kim, Mun-Su;Lee, Hae-Young;Cho, Tae-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.3
    • /
    • pp.27-34
    • /
    • 2008
  • Wireless sensor networks are comprised of sensor nodes with resource-constrained hardware. Nodes in the sensor network without adequate protection may be compromised by adversaries. Such compromised nodes are vulnerable to the attacks like false reports injection attacks and false data injection attacks on legitimate reports. In false report injection attacks, an adversary injects false report into the network with the goal of deceiving the sink or the depletion of the finite amount of energy in a battery powered network. In false data injection attacks on legitimate reports, the attacker may inject a false data for every legitimate report. To address such attacks, the probabilistic voting-based filtering scheme (PVFS) has been proposed by Li and Wu. However, each cluster head in PVFS needs additional transmission device. Therefore, this paper proposes a fuzzy logic-based false report detection method (FRD) to mitigate the threat of these attacks. FRD employs the statistical en-route filtering scheme as a basis and improves upon it. We demonstrate that FRD is efficient with respect to the security it provides, and allows a tradeoff between security and energy consumption, as shown in the simulation.

  • PDF