• Title/Summary/Keyword: interest point

Search Result 1,254, Processing Time 0.025 seconds

FIXED POINT THEOREMS FOR GENERALIZED NONEXPANSIVE SET-VALUED MAPPINGS IN CONE METRIC SPACES

  • Kim, Seung-Hyun;Lee, Byung-Soo
    • East Asian mathematical journal
    • /
    • v.27 no.5
    • /
    • pp.557-564
    • /
    • 2011
  • In 2007, Huang and Zhang [1] introduced a cone metric space with a cone metric generalizing the usual metric space by replacing the real numbers with Banach space ordered by the cone. They considered some fixed point theorems for contractive mappings in cone metric spaces. Since then, the fixed point theory for mappings in cone metric spaces has become a subject of interest in [1-6] and references therein. In this paper, we consider some fixed point theorems for generalized nonexpansive setvalued mappings under suitable conditions in sequentially compact cone metric spaces and complete cone metric spaces.

Change-Point Problems in a Sequence of Binomial Variables

  • Jeong, Kwang-Mo
    • Communications for Statistical Applications and Methods
    • /
    • v.3 no.2
    • /
    • pp.175-185
    • /
    • 1996
  • For the Change-point problem in a sequence of binomial variables we consider the maximum likelihood estimator (MLE) of unknown change-point. Its asymptotic distribution is quite limited in the case of binomial variables with different numver of trials at each time point. Hinkley and Hinkley (1970) gives an asymptotic distribution of the MLE for a sequence of Bernoulli random variables. To find the asymptotic distribution a numerical method such as bootstrap can be used. Another concern of our interest in the inference on the change-point and we derive confidence sets based on the liklihood ratio test(LRT). We find approximate confidence sets from the bootstrap distribution and compare the two results through an example.

  • PDF

Optimal bandwidth in nonparametric classification between two univariate densities

  • Hall, Peter;Kang, Kee-Hoon
    • Proceedings of the Korean Statistical Society Conference
    • /
    • 2002.05a
    • /
    • pp.1-5
    • /
    • 2002
  • We consider the problem of optimal bandwidth choice for nonparametric classification, based on kernel density estimators, where the problem of interest is distinguishing between two univariate distributions. When the densities intersect at a single point, optimal bandwidth choice depends on curvatures of the densities at that point. The problem of empirical bandwidth selection and classifying data in the tails of a distribution are also addressed.

  • PDF

A NEW UDB-MRL TEST FOR WITH UNKNOWN

  • Na, Myung-Hwan
    • Journal of Korean Society for Quality Management
    • /
    • v.30 no.4
    • /
    • pp.78-85
    • /
    • 2002
  • The problem of trend change in the mean residual life is great interest in the reliability and survival analysis. In this paper, a new test statistic for testing whether or not the mean residual life changes its trend is developed. It is assumed that neither the change point nor the proportion at which the trend change occurs is known. The asymptotic null distribution of test statistic is established and asymptotic critical values of the asymptotic null distribution is obtained. Monte Carlo simulation is used to compare the proposed test with previously known tests.

Recognizing Static Target in Video Frames Taken from Moving Platform

  • Wang, Xin;Sugisaka, Masanori;Xu, Wenli
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.673-676
    • /
    • 2003
  • This paper deals with the problem of moving object detection and location in computer vision. We describe a new object-dependent motion analysis method for tracking target in an image sequence taken from a moving platform. We tackle these tasks with three steps. First, we make an active contour model of a target in order to build some of low-energy points, which are called kernels. Then we detect interest points in two windows called tracking windows around a kernel respectively. At the third step, we decide the correspondence of those detected interest points between tracking windows by the probabilistic relaxation method In this algorithm, the detecting process is iterative and begins with the detection of all potential correspondence pair in consecutive image. Each pair of corresponding points is then iteratively recomputed to get a globally optimum set of pairwise correspondences.

  • PDF

Synthesis of nanometric tungsten powders by solid state combustion method (고상연소반응법에 의한 나노텅스텐분말의 합성)

  • H.H. Nersisyan
    • Proceedings of the Materials Research Society of Korea Conference
    • /
    • 2003.11a
    • /
    • pp.93-93
    • /
    • 2003
  • Tungsten and tungsten heavy alloys have widespread application as radiation shielding devices and heavy duty electrical contacts. High density and good room temperature mechanical properties have generated interest in evaluating tungsten and tungsten alloys as kinetic energy penetrators against armor. Nowdays ultra fine-grained tungsten powders are in great interest because higly dense structures can be obtained at low temperature, pressure and lower sintering time. Several physical md chemical methods are available for the synthesis of nanometric metal Powders: ball milling, laser abalation, vapor condensation, chemical precipitation, metallic wire explosion i.e. However production rates of the above mentioned methods are low and further efforts are needed to find out large-scale synthesis methods. From this point of view solid state combustion method ( known as SHS) represents undoubted interest.

  • PDF

An Adaptive Priority-based Sequenced Route Query Processing Method in Road Networks (도로 네트워크 환경에서 적응적 우선순위 기반의 순차적 경로 처리 기법)

  • Ryu, Hyeongcheol;Jung, Sungwon
    • KIISE Transactions on Computing Practices
    • /
    • v.20 no.12
    • /
    • pp.652-657
    • /
    • 2014
  • Given a starting point, destination point and various Points Of Interest (POIs), which contain a full or partial order, for a user to visit we wish to create, a sequenced route from the starting point to the destination point that includes one member of each POI type in a particular order. This paper proposes a method for finding the approximate shortest route between the start point, destination point and one member of each POI type. There are currently two algorithms that perform this task but they both have weaknesses. One of the algorithms only considers the distance between the visited POI (or starting point) and POI to visit next. The other algorithm chooses candidate points near the straight-line distance between the start point and destination but does not consider the order of visits on the corresponding network path. This paper outlines an algorithm that chooses the candidate points that are nearer to the network path between the start point and destination using network search. The algorithm looks for routes using the candidate points and finds the approximate shortest route by assigning an adaptive priority to the route that visits more POIs in a short amount of time.

Detection of a Point Target Movement with SAR Interferometry

  • Jun, Jung-Hee;Ka, Min-ho
    • Korean Journal of Remote Sensing
    • /
    • v.16 no.4
    • /
    • pp.355-365
    • /
    • 2000
  • The interferometric correlation, or coherence, is calculated to measure the variance of the interferometric phase and amplitude within the neighbourhood of any location within the image at a result of SAR (Synthetic Aperture Radar) interferometric process which utilizes the phase information of the images. The coherence contains additional information that is useful for detecting point targets which change their location in an area of interest (AOI). In this research, a RGB colour composite image was generated with a intensity image (master image), a intensity change image as a difference between master image and slave image, and a coherence image generated as a part of SAR interferometric processing. We developed a technique performing detection of a point target movement using SAR interferometry and applied it to suitable tandem pair images of ERS-1 and ERS-2 as test data. The possibility of change detection of a point target in the AOI could be identified with the technique proposed in this research.

Change point analysis in Bitcoin return series : a robust approach

  • Song, Junmo;Kang, Jiwon
    • Communications for Statistical Applications and Methods
    • /
    • v.28 no.5
    • /
    • pp.511-520
    • /
    • 2021
  • Over the last decade, Bitcoin has attracted a great deal of public interest and Bitcoin market has grown rapidly. One of the main characteristics of the market is that it often undergoes some events or incidents that cause outlying observations. To obtain reliable results in the statistical analysis of Bitcoin data, these outlying observations need to be carefully treated. In this study, we are interested in change point analysis for Bitcoin return series having such outlying observations. Since these outlying observations can affect change point analysis undesirably, we use a robust test for parameter change to locate change points. We report some significant change points that are not detected by the existing tests and demonstrate that the model allowing for parameter changes is better fitted to the data. Finally, we show that the model with parameter change can improve the forecasting performance of Value-at-Risk.

Autonomous Battle Tank Detection and Aiming Point Search Using Imagery (영상정보에 기초한 전차 자율탐지 및 조준점탐색 연구)

  • Kim, Jong-Hwan;Jung, Chi-Jung;Heo, Mira
    • Journal of the Korea Society for Simulation
    • /
    • v.27 no.2
    • /
    • pp.1-10
    • /
    • 2018
  • This paper presents an autonomous detection and aiming point computation of a battle tank by using RGB images. Maximally stable extremal regions algorithm was implemented to find features of the tank, which are matched with images extracted from streaming video to figure out the region of interest where the tank is present. The median filter was applied to remove noises in the region of interest and decrease camouflage effects of the tank. For the tank segmentation, k-mean clustering was used to autonomously distinguish the tank from its background. Also, both erosion and dilation algorithms of morphology techniques were applied to extract the tank shape without noises and generate the binary image with 1 for the tank and 0 for the background. After that, Sobel's edge detection was used to measure the outline of the tank by which the aiming point at the center of the tank was calculated. For performance measurement, accuracy, precision, recall, and F-measure were analyzed by confusion matrix, resulting in 91.6%, 90.4%, 85.8%, and 88.1%, respectively.