• Proceedings of the Optical Society of Korea Conference
• /
• 2009.10a
• /
• pp.165-166
• /
• 2009

A hologram was recorded with two-dimensional scanning of an optical fiber connected to a single-photon counting detector under ultra-weak illumination. The object image was clearly reconstructed in a computer from the hologram. The dependence of hologram quality on the illumination light intensity was estimated.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.61-68
• /
• 2015

Among comparison sorts, no algorithm excels a current set lower bound of O(nlogn) in operation. Quicksort, the fastest of its kind, has a complexity of O(nlogn) at its best and on average and $O(n^2)$ at worst. This paper thus presents two methods: first is an O(n+k) simple counting sort which operates much more speedily than an O(n+k), (k=maximum value) counting sort, and second is an O(ln) radix counting sort which counts the frequency of numbers in the digit l of a data and saves it in a corresponding virtual bucket in an array, only to virtually divide the array into radix digit numbers. For the 6 experimental data, the proposed algorithm makes O(nlogn) or $O(n^2)$ of Quicksort simple into O(n+k) or O(ln). After all, the proposed sorting algorithm has proved to be much faster than the counting sort and Quicksort.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.10
• /
• pp.1361-1368
• /
• 2020

The system for counting the number of people has traditionally been implemented in various ways. Existing systems include infrared sensors, lasers, cameras, etc. In the case of such an existing system, there are restrictions on space such as ceilings and sides of walls. In this paper, we propose a method of detecting the footsteps of pedestrians using a piezoelectric mat containing a number of piezoelectric sensors and counting the number of pedestrians passing simultaneously by using the data collected from the piezoelectric mat. When pedestrians pass over piezoelectric mats, the collected sensor data was aggregated using SPI communication and transmitted to PC server using TCP/IP communication. Performance analysis shows that approximately 600 step data can be recognized with 99% accuracy. This is to overcome the shortcomings of other counting systems.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.8 no.6
• /
• pp.8-16
• /
• 1971

This paper describes the transistorized linear counting ratemeter which can be uses to indicate on the meter or record the counting rates of the nuclear radiations produced from the atomic reactor or from the radio isotopes. Tte feature of this ratemeter is the use of the transistor chopper for good stabilization. At the input stage of the a. c. amplifier a composite emitter follower buffer stage has been used to give the high input impedance. A hybrid parameter equivalent circuit was modeled for the analysis of this buffer stage. The counting rates can be linearly measured from few CPS up to 100KCPS in 4 ranges. The resolution is less than 0.5$\mu$sec and the output drift at the room temperature with 7-hour continuous operation is in the order of $\pm$0.5$\mu$A.

• Nuclear Engineering and Technology
• /
• v.10 no.3
• /
• pp.137-144
• /
• 1978

A method is presented here in order to determine a nonlinearity correction of observed counter rates in a GM counter. An expression, which is developed under the assumption of dead time dependence on counting rates, gives good agreement with the results obtained from the experimental work. The variation of pulse voltages from a GM counter with counting rates was measured with the aid of pulse height analyzer. This method gives accurate values for the dead time over a wide range of counting. The technique as outlined allows tile exact correction of the nonlinearity caused by dead time loss. It was observed that the dead time decreases as the counting rate increases.

• The KIPS Transactions:PartB
• /
• v.12B no.2 s.98
• /
• pp.209-214
• /
• 2005

The use of protein interaction data is highly reliable for predicting functions to proteins without function in proteomics study. The computational studies on protein function prediction are mostly based on the concept of guilt-by-association and utilize large-scale interaction map from revealed protein-protein interaction data. This study compares graph-based approaches such as neighbor-counting and $\chi^2-statistics$ methods using protein-protein interaction data and proposes an approach that is effective in analyzing large-scale protein interaction data. The proposed approach is also based protein interaction map but sequence similarity and heuristic knowledge to make prediction results more reliable. The test result of the proposed approach is given for KDD Cup 2001 competition data along with those of neighbor-counting and $\chi^2-statistics$ methods.

• Journal of Korean Society of Occupational and Environmental Hygiene
• /
• v.24 no.4
• /
• pp.484-491
• /
• 2014

Objectives: An image processing program for asbestos fibers analyzing the gradient components and partial linearity was developed in order to accurately segment fibers. The objectives were to increase the accuracy of counting through the formulation of the size and shape of fibers and to guarantee robust fiber detection in noisy backgrounds. Methods: We utilized samples mixed with sand and sepiolite, which has a similar structure to asbestos. Sample concentrations of 0.01%, 0.05%, 0.1%, 0.5%, 1%, 2%, and 3%(w/w) were prepared. The sand used was homogenized after being sieved to less than $180{\mu}m$. Airborne samples were collected on MCE filters by utilizing a personal pump with 2 L/min flow rate for 30 minutes. We used the NIOSH 7400 method for pre-treating and counting the fibers on the filters. The results of the NIOSH 7400 method were compared with those of the image processing program. Results: The performance of the developed algorithm, when compared with the target images acquired by PCM, showed that the detection rate was on average 88.67%. The main causes of non-detection were missing fibers with a low degree of contrast and overlapping of faint and thin fibers. Also, some duplicate countings occurred for fibers with breaks in the middle due to overlapping particles. Conclusions: An image detection algorithm that could increase the accuracy of fiber counting was developed by considering the direction of the edge to extract images of fibers. It showed comparable results to PCM analysis and could be used to count fibers through real-time tracking by modeling a branch point to graph. This algorithm can be utilized to measure the concentrations of asbestos in real-time if a suitable optical design is developed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.10
• /
• pp.1892-1897
• /
• 2017

This paper proposes a finger counting algorithm for a hand with stuck fingers. The proposed algorithm is based on the fact that straight line type shadows are inevitably generated between fingers. It divides the hand region into the thumb region and the four fingers region for effective shadow detection, and generates an edge image in each region. Projection curves are generated by appling a line detection and a projection technique to each edge image, and the peaks of the curves are detected as candidates for finger shadows. And then peaks due to finger shadows are extracted from them and counted. In the finger counting experiment on hand images expressing various shapes with stuck fingers, the counting success rate is from 83.3% to 100% according to the number of fingers, and 93.1% on the whole. It also shows that if hand images are generated under controlled conditions, the failure cases can be sufficiently improved.

• The Journal of Korean Medicine
• /
• v.37 no.2
• /
• pp.36-44
• /
• 2016

Objectives: This study aimed to evaluate the effects of breath-counting meditation (BCM) and deep breathing (DB) on heart rate variability (HRV). These breathing techniques have the characteristics of non-paced and self-controlled breathings, resulting in less increase of HRV. We also compared BCM and DB with usual breathing (UB) or relaxing breathing (RB) which can reveal the characteristics of those. Methods: 83 healthy volunteers sitting in chairs performed non-paced breathing; UB, RB, BCM, and DB each for 5 minutes. One minute of relaxation was permitted between breathings. Participants surfed the internet sitting in front of a computer during UB, while for RB, they remained steady with eyes closed. For BCM, they breathed inwardly counting from 1 to 10 repetitively, while they took a deep breath during DB. Physiological indices were simultaneously recorded with a biofeedback system. Results: Respiration rate, thoracic amplitude, and mean heart rate decreased in RB compared with UB, but there was no change in HRV. Respiration rate in BCM and DB was lower than that in UB or RB, and the amplitude of thorax or abdomen, and HRV all increased (p<0.05). However, mean heart rate and skin conductance decreased in BCM compared with UB (p<0.05), whereas those were no different between DB and UB. Conclusion: BCM, just concentrating mentally on breathing with counting each breath, can increase HRV with less sympathetic activation, while DB, actively moving thorax and abdomen for achieving the deepest respiration rate, can greatly raise HRV with the maintenance of mean vagal or sympathetic tone.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.27 no.2
• /
• pp.146-159
• /
• 2023

This paper proposes a hybrid algorithm combining K-means clustering and watershed algorithms for flower segmentation and counting. We use the K-means clustering algorithm to obtain the main colors in a complex background according to the cluster centers and then take a color space transformation to extract pixel values for the hue, saturation, and value of flower color. Next, we apply the threshold segmentation technique to segment flowers precisely and obtain the binary image of flowers. Based on this, we take the Euclidean distance transformation to obtain the distance map and apply it to find the local maxima of the connected components. Afterward, the proposed algorithm adaptively determines a minimum distance between each peak and apply it to label connected components using the watershed segmentation with eight-connectivity. On a dataset of 30 images, the test results reveal that the proposed method is more efficient and precise for the counting of overlapped flowers ignoring the degree of overlap, number of overlap, and relatively irregular shape.