• Communications for Statistical Applications and Methods
• /
• 제4권1호
• /
• pp.281-292
• /
• 1997

In this paper we are concered with the counting processes with intersity function $g_n(t)$, where $g_n(t)$ not only depends on t but n. It is shown that under certain conditions the number of events in [0, t] follows a generalizes Poisson distribution. A counting process is also provided such that $g_i(t)$$\neq$$g_i(t)$ for i$\neq$j and the number of events in [0, t] has a transformed geometric distribution.

• Journal of applied mathematics & informatics
• /
• 제33권1_2호
• /
• pp.145-155
• /
• 2015

In this paper, we study the bounds of the coefficients of the characteristic polynomial of the Frobenius endomorphism of the Jacobian of dimension three over a finite field. We provide explicitly computable bounds for the coefficients of the characteristic polynomial. In addition, we present the counting points algorithm for computing a group of the Jacobian of genus 3 hyperelliptic curves over a finite field with large characteristic. Based on these bounds, we found an efficient search space that was used in the counting points algorithm on genus 3 curves. The algorithm was explained and verified through simple examples.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제27권1호
• /
• pp.37-55
• /
• 2023

In this paper we propose a new algorithm for detecting and counting flowers in a complex background based on digital images. The algorithm mainly includes the following parts: edge contour extraction of flowers, edge contour determination of overlapped flowers and flower counting. We use a contour detection technique in Computer Vision (CV) to extract the edge contours of flowers and propose an improved algorithm with a concave point detection technique to find accurate segmentation for overlapped flowers. In this process, we first use the polygon approximation to smooth edge contours and then adopt the second-order central moments to fit ellipse contours to determine whether edge contours overlap. To obtain accurate segmentation points, we calculate the curvature of each pixel point on the edge contours with an improved Curvature Scale Space (CSS) corner detector. Finally, we successively give three adaptive judgment criteria to detect and count flowers accurately and automatically. Both experimental results and the proposed evaluation indicators reveal that the proposed algorithm is more efficient for flower counting.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제12권3호
• /
• pp.250-255
• /
• 2012

Face recognition has wide applications in security and surveillance systems as well as in robot vision and machine interfaces. Conventional challenges in face recognition include pose, illumination, and expression, and face recognition at a distance involves additional challenges because long-distance images are often degraded due to poor focusing and motion blurring. This study investigates the effectiveness of applying photon-counting linear discriminant analysis (Pc-LDA) to face recognition in harsh environments. A related technique, Fisher linear discriminant analysis, has been found to be optimal, but it often suffers from the singularity problem because the number of available training images is generally much smaller than the number of pixels. Pc-LDA, on the other hand, realizes the Fisher criterion in high-dimensional space without any dimensionality reduction. Therefore, it provides more invariant solutions to image recognition under distortion and degradation. Two decision rules are employed: one is based on Euclidean distance; the other, on normalized correlation. In the experiments, the asymptotic equivalence of the photon-counting method to the Fisher method is verified with simulated data. Degraded facial images are employed to demonstrate the robustness of the photon-counting classifier in harsh environments. Four types of blurring point spread functions are applied to the test images in order to simulate long-distance acquisition. The results are compared with those of conventional Eigen face and Fisher face methods. The results indicate that Pc-LDA is better than conventional facial recognition techniques.

• 방송공학회논문지
• /
• 제21권4호
• /
• pp.493-505
• /
• 2016

컴퓨터 비전이나 감시영상 시스템에서 유동인구 수 측정은 안전, 스케줄링, 광고효과 측면에서 중요한 과제 중 하나이다. 유동인구 수 측정은 조명변화, 부분적인 폐색, 중첩, 사람검출과 같은 다양한 어려움을 겪고 있다. 가장 큰 문제점은 혼잡한 상황에서 추적되는 객체에 대한 폐색과 중첩이다. 정확한 유동인구 수 측정을 위해 폐색과 중첩은 반드시 해결해야 할 과제이다. 본 논문에서는 기존의 보행자 추적 방법을 개선한 효율적인 유동인구 수 측정 시스템을 제안한다. 기존의 보행자 추적과 달리, 제안된 방법은 평균 필터 추적방법을 적용하여 성능을 향상시킬 수 있음을 보인다. 또한 객체 추적의 성능향상을 위한 프레임 보상, 아웃라이어 제거를 통해서 추적을 개선한다. 그와 동시에 제안된 시스템은 추적된 객체의 다양한 정보를 저장한다. 데이터 셋 S6와 데이터 셋 S7에 대하여 유동인구 수 측정 정확도를 향상시키고 에러율을 줄인다. 또한 제안된 방법은 실시간으로 평균 80fps의 검출을 제공한다.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2011년도 춘계학술대회 논문집
• /
• pp.1161-1166
• /
• 2011

A camera is mounted vertically downwards viewing the people heads from the top. This configuration is successful in people counting technique especially when only a few isolated people pass through a counting region in a non-crowded situation. Thus, this paper describes object counting which detects and count moving people using mixture of gaussian and motion vector. This method is intended to estimates the number of people in outdoor environment. This method use single gaussian background modeling which is more robust an noise and has adaptiveness. The experimental results that is based on mixture of gaussian and motion vector is also helpful to design intelligent surveillance.

• 대한전자공학회논문지
• /
• 제12권1호
• /
• pp.12-17
• /
• 1975

광대역의 계수율을 선택 스윗치 없이 계측하기 위한 대수계수율회로에 관한 해석을 하였고 그에 의한 다데케이드 계수율회로의 구성방법과 실험결과를 지시하였다. 이 대수계수율회로는 주기적인 입력 펄스 뿐만 아니라, Poisson분포를 갖는 random한 펄스에 대하여도 대수적인 응답특성을 가지며 계수율 1pps로 부터 $10^5$pps까지 데케이드의 영역에 걸쳐 좋은 대수특성을 가지며 또한 낮은 영역과 높은 영역에서의 특성저하의 원인을 규명하여 양단에서의 특성을 효과적으로 보상하였다.

• 대한기계학회논문집
• /
• 제18권6호
• /
• pp.1465-1473
• /
• 1994

This paper describes the development strategy and contents of a fatigue life evaluation system, FLEVA. The system is composed of 4 parts; material properties, load histories, cycle counting and life prediction. The cycle counting is based on the rain-flow counting method and peak counting method, and the life prediction is performed based on the linear damage rule. Material properties(static, fatigue) are also provided as a database obtained by a computer aided test system. Case study is performed to verify the developed program.

• Journal of Power Electronics
• /
• 제18권3호
• /
• pp.910-922
• /
• 2018

Conventional battery state-of-charge (SoC) estimation methods either involve sophisticated models or consume considerable computational resource. This study constructs an enhanced coulomb counting method (Ah method) for the SoC estimation of lithium-ion batteries (LiBs) by expanding the Peukert equation for the discharging process and incorporating the Coulombic efficiency for the charging process. Both the rate- and temperature-dependence of battery capacity are encompassed. An SoC mapping approach is also devised for initial SoC determination and Ah method correction. The charge counting performance at different sampling frequencies is analyzed experimentally and theoretically. To achieve a favorable compromise between sampling frequency and accumulation accuracy, a frequency-adjustable current sampling solution is developed. Experiments under the augmented urban dynamometer driving schedule cycles at different temperatures are conducted on two LiBs of different chemistries. Results verify the effectiveness and generalization ability of the proposed SoC estimation method.

• 산업기술연구
• /
• 제29권A호
• /
• pp.61-65
• /
• 2009

A colony counting on a petri-dish is a laborious task in microbiology fields that automated counting systems are needed. But lots of such systems are high price that majorities of labs rely on the manual counting and it is a time consuming and laborious job. In this study, an attempt was made to select the relative atmospheric correction method for the water quality factors extraction from the satellite image data. And also, the time-series analysis of the water quality factors was performed by using the multi-temporal image data. The result shows that the proposed method can be commercialized with low prices.