• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.70-77
• /
• 2017

Among available people counting methods, map-based approaches based on moving interest points have shown good performance. However, the stationary people counting is challenging in such methods since all static points of interest are considered as background. To include stationary people in counting, it is needed to discriminate between the static points of stationary people and the background region. In this paper, we propose a people counting method based on using both moving and static points. The proposed method separates the moving and static points by motion information. Then, the static points of the stationary people are classified using foreground mask processing and point pattern analysis. The experimental results reveal that the proposed method provides more accurate count estimation by including stationary people. Also, the background updating is enabled to solve the static point misclassification problem due to background changes.

• Journal of applied mathematics & informatics
• /
• v.33 no.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 Korean Society of Transportation
• /
• v.21 no.1
• /
• pp.53-63
• /
• 2003

The Origin-Destination(OD) matrix is very important in describing transport movements in a region. The OD matrix can be estimated using traffic counts on links in the transport network and other available information. This information on the travel is often contained in a target OD matrix and traffic counts in links. To estimate an OD matrix from traffic counts, they are the major input data which obviously affects the accuracy of the OD matrix estimated, Generally, the quality of an estimated OD matrix depends much on the reliability of the input data, and the number and locations of traffic counting points in the network. Any Process regarding the traffic counts such as the amount and their location has to be carefully studied. The objective of this study is to select of the optimal location of traffic counting points for the OD matrix estimation. The model was tested in nationwide network. The network consists of 224 zones, 3,125 nodes and 6,725 links except to inner city road links. The OD matrix applied for selection of traffic counting points was estimated to 3-constrained entropy maximizing model. The results of this study follow that : the selected alternative to the best optimal counting points of six alternatives is the alternative using common links of OD matrix and vehicle-km and traffic density(13.0% of 6,725 links), however the worst alternative is alternative of all available traffic counting points(44.9% of 6,725 links) in the network. Finally, it should be concluded that the accuracy of reproduced OD matrix using traffic counts related much to the number of traffic counting points and locations.

• Kyungpook Mathematical Journal
• /
• v.48 no.1
• /
• pp.155-163
• /
• 2008

This is an extended version of the paper [K] of the author. The average formulas on the circles and disks around arbitrary points of Nevanlinna counting functions of holomorphic self-maps of the unit disk, given in terms of the boundary values of the selfmaps, are shown to give another characterization of the whole class or a special subclass of inner functions in terms of Nevanlinna counting function in addition to the previous applications to Rudin's orthogonal functions.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.913-920
• /
• 1996

In this study, the counting method for multi-axial and multi-point load states was proposed. Using this counting method, the load spectrum is generated from the service load history which is measured for boom structure of excavator. Loading state for loading points of boom structure is described as a multi-dimensional state space. From this load spectrum, the stress spectrum was generated by FEM analysis using the superposition of the unit load. The cumulated damage at the severe damage point of In nm structure by the failure example is calculated by Palmgren-Miner's rule. As a result of this study, the fatigue life estimation using the multi-axial and multi-point load counting method is useful.

• East Asian mathematical journal
• /
• v.34 no.2
• /
• pp.85-101
• /
• 2018

The purpose of this paper is to investigate counting-based and collection-based computation of the elementary mathematics textbook in Korea and United States of America. As a results, we will provide some suggestive points through how to use and activity of number line, decomposing number, counting, grouping and so on by analyzing counting and collection-based computation in the elementary mathematics textbook of Korea and United States of America.

• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.101-109
• /
• 2012

In this paper, we present an algorithm for computing the number of points on the Jacobian varieties of one-dimensional family of genus 3 nonhyperelliptic curves over finite fields. We also provide the explicit formula of the characteristic polynomial of the Frobenius endomorphism of the Jacobian of $C:y^3=x^4+{\alpha}$ over a finite field $\mathbb{F}_p$ with $p{\equiv}1$ (mod 3) and $p{\neq}1$ (mod 4). Moreover, we give some implementation results using Gaudry-Schost method. A 162-bit order is computed in 97 s on a Pentium IV 2.13 GHz computer using our algorithm.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.1
• /
• pp.49-55
• /
• 2007

This paper presents a method of score counting for computer Go that includes the consideration of stability, management of dead stones, and an algorithm for score counting. Thus, method for managing dead stones, filling all dames, and making additional moves is presented, along with a score-counting algorithm, where dames are defined as empty points that are not included in the area of a group, while additional moves are required for life when filling all the dames. In experiments using the final positions of 362 games, a mean error of 8.66, 5.96, and 4.15 was recorded for the score counting produced by the CGoban, HandTalk, and proposed methods, respectively. The proposed method was confirmed by experiments where it was success fully applied to the final positions.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.27 no.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.

• Journal of Korean Society of Transportation
• /
• v.19 no.5
• /
• pp.49-59
• /
• 2001

In the transportation planning process, origin and destination(O-D) trip matrix is one of the most important elements. There have been developments and applications of the methodology to adjust old matrices using link traffic counts. Commonly, the accuracy of an adjusted O-D matrix depends very much on the reliability of the input data such as the numbers and locations of traffic counting points in the road network. In the real application of the methodology, decisions on the numbers and locations of traffic counting points are one of the difficult problems, because usually as networks become bigger, the numbers of traffic counting points are required more. Therefore, this paper investigates these issues as an experiment using a nationwide network in Korea. We have compared and contrasted the set of link flows assigned by the old and the adjusted O-D matrices with the set of observed link flows. It has been analyzed by increasing the number of the traffic counting points on the experimental road network. As a result of these analyses, we can see an optimal set of the number of counting links through statistical analysis, which are approximately ten percentages of the total link numbers. In addition, the results show that the discrepancies between the old and the adjusted matrices in terms of the trip length frequency distributions and the assigned and the counted link flows are minimized using the optimal set of the counted links.