Abstract Drought, an acute abiotic stress, limits growth and yields of crops including tomato. Sa... more Abstract Drought, an acute abiotic stress, limits growth and yields of crops including tomato. Salicylic acid (SA) has been widely used as an abiotic stress mitigating agent in various crops. Two experiments were conducted to assess the effects of SA applied as a foliar spray and as a seed priming material on growth, yield, and fruit quality of grape tomato under drought stress. In the first experiment, SA was applied as a foliar spray in five doses (0, 50, 100, 150, and 200 mg L–1) under three soil moisture regimes (50 %, 75 %, and 100 % field capacity [FC]). In the second experiment, doses of SA and soil moisture regimes were the same as first experiment, except that SA was applied as a seed priming material. Data on growth, fruit yield, and quality of grape tomato were collected. The results revealed that severe moisture deficit of 50 % FC adversely affected growth and fruit yield of grape tomato by 94 % in experiment 1 (foliar application of SA) and by 95 % in experiment 2 (seed priming of SA) compared with 100 % FC, while fruit quality parameters (fruit pH, total soluble solids, and color index) improved with reducing soil moisture regime. Exogenous application of SA at 150 mg L–1 as a foliar spray enhanced fruit yield by 41 % and at 100 mg L–1 as a seed priming material resulted in 33 % increase in fruit yield compared with the control. However, there was no effect of SA supplementation at severe moisture deficit of 50 % FC regardless of experiments and doses. Foliar application of SA at 150 mg L–1 resulted in statistically similar yields between moderate soil moisture level of 75 % FC and sufficient soil moisture level of 100 % FC, whereas in case of seed priming treatment, maximum fruit yield was obtained at 100 mg L–1 SA dose in combination with 100 % FC. Grape tomato yielded more with foliar application of SA (113.1 g plant–1 fruit yield at 150 mg L–1) than did with SA seed priming (87.8 g plant–1 fruit yield at 100 mg L–1). Exogenous application of SA at 150 mg L–1 as a foliar spray and at 100 mg L–1 as a seed priming material could be recommended when grape tomato is grown under moderate to sufficient soil moisture availability.
The study was conducted to investigate the genetic diversity of some maize inbreds under salinity... more The study was conducted to investigate the genetic diversity of some maize inbreds under salinity stress condition using MahalanobisÂ’s statistic (D2) and principal component analysis. Analysis of variance showed significant difference for all the characters. Results of multivariate analysis revealed that seventeen inbred lines formed five clusters at 12 dS level of salinity. The highest intra-cluster distance was recorded in cluster IV containing three genotypes and the lowest was in cluster V having one genotype. The inter cluster D2 values revealed maximum distance among the clusters. The highest inter cluster distance was observed between clusters IV & III and lowest was between V & I. Cluster IV had the highest cluster means for cob height, tassel length, cob length, SPAD value, number of seeds/cob, 100 seed weight, cob diameter and grain yield per plant. Considering cluster distance, inter-genotypic distance, cluster mean and other agronomic performances the genotypes CZ29, CZ3...
ABSTRACT Disclosed is a method and apparatus to provide for fingerprint minutiae matching using s... more ABSTRACT Disclosed is a method and apparatus to provide for fingerprint minutiae matching using scoring techniques. A plurality of minutiae in a fingerprint image is defined. A score associated with each minutia corresponding to the validity of each minutia is estimated. The fingerprint image is then matched against one or more sample fingerprint images utilizing a partial point set pattern matching (PSPM) algorithm.
The problem of constructing a tight isothetic outer (or inner) polygon covering an arbitrarily sh... more The problem of constructing a tight isothetic outer (or inner) polygon covering an arbitrarily shaped 2D object on a background grid, is addressed in this paper, and a novel algorithm is proposed. Such covers have many applications to image mining, rough sets, computational geometry, and robotics. Designing efficient algorithms for these cover problems was an open problem in the literature.
Computer Methods and Programs in Biomedicine, 2015
Automated fracture detection is an essential part of a computer-aided tele-medicine system. In th... more Automated fracture detection is an essential part of a computer-aided tele-medicine system. In this paper, we have proposed a unified technique for the detection and evaluation of orthopaedic fractures in long-bone digital X-ray image. We have also developed a software tool that can be conveniently used by paramedics or specialist doctors. The proposed tool first segments the bone region of an input digital X-ray image from its surrounding flesh region and then generates the bone-contour using an adaptive thresholding approach. Next, it performs unsupervised correction of bone-contour discontinuities that might have been generated because of segmentation errors, and finally detects the presence of fracture in the bone. Moreover, the method can also localize the line-of-break for easy visualization of the fracture, identify its orientation, and assess the extent of damage in the bone. Several concepts from digital geometry such as relaxed straightness and concavity index are utilized to correct contour imperfections, and to detect fracture locations and type. Experiments on a database of several long-bone digital X-ray images show satisfactory results.
IEEE International Conference on Image Processing 2005, 2005
Efficient and successful joining of torn pieces of pa-pers to reconstruct the original documents ... more Efficient and successful joining of torn pieces of pa-pers to reconstruct the original documents is an impor-tant and challenging issue in many disciplines, especially in forensics and investigation sciences. Automation of the process by means of appropriate techniques can speed up ...
A greedy algorithm for constructing a variable length, spatial feature vector of a binary image, ... more A greedy algorithm for constructing a variable length, spatial feature vector of a binary image, depending on the size and diversity of the image database, is proposed. The novelty of the algorithm lies in iterative construction of the elements of the feature vector for some resultant images obtained by xor-ing the given image with a few pseudorandom synthetic masks. The classical Euler number and the two basic connectivity features from which it is derived, namely, the number of connected components and the number of holes, are used to finally generate a unique index (feature vector) for each image in the database. The computation process, being purely in the integer and Boolean domain, is very fast and easily implementable. It is found to converge within 3 iterations for a logo image benchmark database consisting of 1034 images. A ¢ ¤ £ -tree data structure has been used for efficient storage and retrieval of the images based on the proposed feature vector. The method is particularly suitable for object type of images.
A novel technique on shape coding of an object in a binary digital image, based on the tight isot... more A novel technique on shape coding of an object in a binary digital image, based on the tight isothetic polygonal covers of the object in a multiresolution background, is proposed. This technique would be useful in various analyses and applications related with digital images. To demonstrate the power and usefulness of such shape codes, we have also proposed an image retrieval scheme based on shape codes. The elegance of the scheme on shape codes lies in capturing the shape of the object(s) present in an image from its gross appearance to its finer details by a set of isothetic polygons, in a hierarchical manner. The inherent tolerance present in such a cast of isothetic polygonal shape enables the shape codes of two objects resemble closely as the grid resolution becomes finer and finer, provided the objects are of similar shapes. The method is very fast because it does not involve any complex computations, and requires only integer-based comparisons and additions. Experimental results demonstrate the strength and efficiency of the proposed scheme.
Since the inception of successful rasterization of curves and objects in the digital space, sever... more Since the inception of successful rasterization of curves and objects in the digital space, several algorithms have been proposed for approximating a given digital curve. All these algorithms, however, resort to thinning as preprocessing before approximating a digital curve with changing thickness. Described in this paper is a novel thinning-free algorithm for polygonal approximation of an arbitrarily thick digital curve, using the concept of "cellular envelope", which is newly introduced in this paper. The cellular envelope, defined as the smallest set of cells containing the given curve, and hence bounded by two tightest (inner and outer) isothetic polygons, is constructed using a combinatorial technique. This envelope, in turn, is analyzed to determine a polygonal approximation of the curve as a sequence of cells using certain attributes of digital straightness. Since a real-world curve/curve-shaped object with varying thickness, unexpected disconnectedness, noisy information, etc., is unsuitable for the existing algorithms on polygonal approximation, the curve is encapsulated by the cellular envelope to enable the polygonal approximation. Owing to the implicit Euclidean-free metrics and combinatorial properties prevailing in the cellular plane, implementation of the proposed algorithm involves primitive integer operations only, leading to fast execution of the algorithm. Experimental results that include output polygons for different values of the approximation parameter corresponding to several real-world digital curves, a couple of measures on the quality of approximation, comparative results related with two other well-referred algorithms, and CPU times, have been presented to demonstrate the elegance and efficacy of the proposed algorithm.
Hall mobility of the two dimensional electron gas in GaN quantum wells are calculated in the temp... more Hall mobility of the two dimensional electron gas in GaN quantum wells are calculated in the temperature range 1K-14K incorporating deformation potential acoustic, piezoelectric, background and remote ionized impurity scatterings. The Boltzmann transport equation is solved by a numerical iterative technique using Fermi-Dirac statistics. The variations of longitudinal magnetoresistivity with magnetic field and temperature agree with the available expe-rimental results at temperature T=1.38 K. The Hall mobility is found to decrease sharply at low magnetic fields and the variation becomes less sensitive to higher field values. Hall mobility at such low temperatures has agreed with the re-sults obtained by other researcher.
Abstract Drought, an acute abiotic stress, limits growth and yields of crops including tomato. Sa... more Abstract Drought, an acute abiotic stress, limits growth and yields of crops including tomato. Salicylic acid (SA) has been widely used as an abiotic stress mitigating agent in various crops. Two experiments were conducted to assess the effects of SA applied as a foliar spray and as a seed priming material on growth, yield, and fruit quality of grape tomato under drought stress. In the first experiment, SA was applied as a foliar spray in five doses (0, 50, 100, 150, and 200 mg L–1) under three soil moisture regimes (50 %, 75 %, and 100 % field capacity [FC]). In the second experiment, doses of SA and soil moisture regimes were the same as first experiment, except that SA was applied as a seed priming material. Data on growth, fruit yield, and quality of grape tomato were collected. The results revealed that severe moisture deficit of 50 % FC adversely affected growth and fruit yield of grape tomato by 94 % in experiment 1 (foliar application of SA) and by 95 % in experiment 2 (seed priming of SA) compared with 100 % FC, while fruit quality parameters (fruit pH, total soluble solids, and color index) improved with reducing soil moisture regime. Exogenous application of SA at 150 mg L–1 as a foliar spray enhanced fruit yield by 41 % and at 100 mg L–1 as a seed priming material resulted in 33 % increase in fruit yield compared with the control. However, there was no effect of SA supplementation at severe moisture deficit of 50 % FC regardless of experiments and doses. Foliar application of SA at 150 mg L–1 resulted in statistically similar yields between moderate soil moisture level of 75 % FC and sufficient soil moisture level of 100 % FC, whereas in case of seed priming treatment, maximum fruit yield was obtained at 100 mg L–1 SA dose in combination with 100 % FC. Grape tomato yielded more with foliar application of SA (113.1 g plant–1 fruit yield at 150 mg L–1) than did with SA seed priming (87.8 g plant–1 fruit yield at 100 mg L–1). Exogenous application of SA at 150 mg L–1 as a foliar spray and at 100 mg L–1 as a seed priming material could be recommended when grape tomato is grown under moderate to sufficient soil moisture availability.
The study was conducted to investigate the genetic diversity of some maize inbreds under salinity... more The study was conducted to investigate the genetic diversity of some maize inbreds under salinity stress condition using MahalanobisÂ’s statistic (D2) and principal component analysis. Analysis of variance showed significant difference for all the characters. Results of multivariate analysis revealed that seventeen inbred lines formed five clusters at 12 dS level of salinity. The highest intra-cluster distance was recorded in cluster IV containing three genotypes and the lowest was in cluster V having one genotype. The inter cluster D2 values revealed maximum distance among the clusters. The highest inter cluster distance was observed between clusters IV & III and lowest was between V & I. Cluster IV had the highest cluster means for cob height, tassel length, cob length, SPAD value, number of seeds/cob, 100 seed weight, cob diameter and grain yield per plant. Considering cluster distance, inter-genotypic distance, cluster mean and other agronomic performances the genotypes CZ29, CZ3...
ABSTRACT Disclosed is a method and apparatus to provide for fingerprint minutiae matching using s... more ABSTRACT Disclosed is a method and apparatus to provide for fingerprint minutiae matching using scoring techniques. A plurality of minutiae in a fingerprint image is defined. A score associated with each minutia corresponding to the validity of each minutia is estimated. The fingerprint image is then matched against one or more sample fingerprint images utilizing a partial point set pattern matching (PSPM) algorithm.
The problem of constructing a tight isothetic outer (or inner) polygon covering an arbitrarily sh... more The problem of constructing a tight isothetic outer (or inner) polygon covering an arbitrarily shaped 2D object on a background grid, is addressed in this paper, and a novel algorithm is proposed. Such covers have many applications to image mining, rough sets, computational geometry, and robotics. Designing efficient algorithms for these cover problems was an open problem in the literature.
Computer Methods and Programs in Biomedicine, 2015
Automated fracture detection is an essential part of a computer-aided tele-medicine system. In th... more Automated fracture detection is an essential part of a computer-aided tele-medicine system. In this paper, we have proposed a unified technique for the detection and evaluation of orthopaedic fractures in long-bone digital X-ray image. We have also developed a software tool that can be conveniently used by paramedics or specialist doctors. The proposed tool first segments the bone region of an input digital X-ray image from its surrounding flesh region and then generates the bone-contour using an adaptive thresholding approach. Next, it performs unsupervised correction of bone-contour discontinuities that might have been generated because of segmentation errors, and finally detects the presence of fracture in the bone. Moreover, the method can also localize the line-of-break for easy visualization of the fracture, identify its orientation, and assess the extent of damage in the bone. Several concepts from digital geometry such as relaxed straightness and concavity index are utilized to correct contour imperfections, and to detect fracture locations and type. Experiments on a database of several long-bone digital X-ray images show satisfactory results.
IEEE International Conference on Image Processing 2005, 2005
Efficient and successful joining of torn pieces of pa-pers to reconstruct the original documents ... more Efficient and successful joining of torn pieces of pa-pers to reconstruct the original documents is an impor-tant and challenging issue in many disciplines, especially in forensics and investigation sciences. Automation of the process by means of appropriate techniques can speed up ...
A greedy algorithm for constructing a variable length, spatial feature vector of a binary image, ... more A greedy algorithm for constructing a variable length, spatial feature vector of a binary image, depending on the size and diversity of the image database, is proposed. The novelty of the algorithm lies in iterative construction of the elements of the feature vector for some resultant images obtained by xor-ing the given image with a few pseudorandom synthetic masks. The classical Euler number and the two basic connectivity features from which it is derived, namely, the number of connected components and the number of holes, are used to finally generate a unique index (feature vector) for each image in the database. The computation process, being purely in the integer and Boolean domain, is very fast and easily implementable. It is found to converge within 3 iterations for a logo image benchmark database consisting of 1034 images. A ¢ ¤ £ -tree data structure has been used for efficient storage and retrieval of the images based on the proposed feature vector. The method is particularly suitable for object type of images.
A novel technique on shape coding of an object in a binary digital image, based on the tight isot... more A novel technique on shape coding of an object in a binary digital image, based on the tight isothetic polygonal covers of the object in a multiresolution background, is proposed. This technique would be useful in various analyses and applications related with digital images. To demonstrate the power and usefulness of such shape codes, we have also proposed an image retrieval scheme based on shape codes. The elegance of the scheme on shape codes lies in capturing the shape of the object(s) present in an image from its gross appearance to its finer details by a set of isothetic polygons, in a hierarchical manner. The inherent tolerance present in such a cast of isothetic polygonal shape enables the shape codes of two objects resemble closely as the grid resolution becomes finer and finer, provided the objects are of similar shapes. The method is very fast because it does not involve any complex computations, and requires only integer-based comparisons and additions. Experimental results demonstrate the strength and efficiency of the proposed scheme.
Since the inception of successful rasterization of curves and objects in the digital space, sever... more Since the inception of successful rasterization of curves and objects in the digital space, several algorithms have been proposed for approximating a given digital curve. All these algorithms, however, resort to thinning as preprocessing before approximating a digital curve with changing thickness. Described in this paper is a novel thinning-free algorithm for polygonal approximation of an arbitrarily thick digital curve, using the concept of "cellular envelope", which is newly introduced in this paper. The cellular envelope, defined as the smallest set of cells containing the given curve, and hence bounded by two tightest (inner and outer) isothetic polygons, is constructed using a combinatorial technique. This envelope, in turn, is analyzed to determine a polygonal approximation of the curve as a sequence of cells using certain attributes of digital straightness. Since a real-world curve/curve-shaped object with varying thickness, unexpected disconnectedness, noisy information, etc., is unsuitable for the existing algorithms on polygonal approximation, the curve is encapsulated by the cellular envelope to enable the polygonal approximation. Owing to the implicit Euclidean-free metrics and combinatorial properties prevailing in the cellular plane, implementation of the proposed algorithm involves primitive integer operations only, leading to fast execution of the algorithm. Experimental results that include output polygons for different values of the approximation parameter corresponding to several real-world digital curves, a couple of measures on the quality of approximation, comparative results related with two other well-referred algorithms, and CPU times, have been presented to demonstrate the elegance and efficacy of the proposed algorithm.
Hall mobility of the two dimensional electron gas in GaN quantum wells are calculated in the temp... more Hall mobility of the two dimensional electron gas in GaN quantum wells are calculated in the temperature range 1K-14K incorporating deformation potential acoustic, piezoelectric, background and remote ionized impurity scatterings. The Boltzmann transport equation is solved by a numerical iterative technique using Fermi-Dirac statistics. The variations of longitudinal magnetoresistivity with magnetic field and temperature agree with the available expe-rimental results at temperature T=1.38 K. The Hall mobility is found to decrease sharply at low magnetic fields and the variation becomes less sensitive to higher field values. Hall mobility at such low temperatures has agreed with the re-sults obtained by other researcher.
Uploads
Papers by Arindam Biswas